Related Experiment Video
Updated: May 29, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
Published on: February 15, 2017
Cluster definition by the optimization of simple measures
Abstract:
We adopt the following measures of clustering based on simple edge counts in an undirected loop-free graph. Let S be a subset of the points of the graph. The compactness of S is measured by the number of edges connecting points in S to other points in S. The isolation or separation of S is measured by the negative of the number of edges connecting points in S to points not in S. The subset S is a cluster if it is compact and isolated. We study the cluster search problem: find a subset S which maximizes a linear combination of the compactness and (negative) isolation edge counts. We show that a closely related decision problem is NP-complete. We develop a pruned search tree algorithm which is much faster than complete search, especially for graphs which are derived from points embedded in a space of low dimensionality.
Related Concept Videos
Optimization Problems
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Methods of Medium Optimization
Measures of Central Tendency
Aggregates Classification
Petrographic classification groups aggregates based on common mineralogical characteristics. Some of the common mineral groups found in aggregates are...
Multiple Comparison Tests
It would be easy to compare two samples using a significance alpha level of 0.05. In other words, there is only one sample pair to be compared. However, it would be difficult to identify a significantly different sample if the number...