Hierarchical nearest neighbor descent, in-tree, and clustering

This publication has 26 references indexed in Scilit:

• Minimum curvilinearity to enhance topological prediction of protein interactions by network embedding
  Bioinformatics, 2013
• Clustering by Sorting Potential Values (CSPV): A novel potential-based clustering method
  Pattern Recognition, 2012
• Extracting a cellular hierarchy from high-dimensional cytometry data with SPADE
  Nature Biotechnology, 2011
• Single-Cell Mass Cytometry of Differential Immune and Drug Responses Across a Human Hematopoietic Continuum
  Science, 2011
• A graph-theoretical clustering method based on two rounds of minimum spanning trees
  Pattern Recognition, 2010
• Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes
  Proceedings of the National Academy of Sciences, 2007
• Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees
  Bioinformatics, 2002
• Comparing partitions
  Journal of Classification, 1985
• The estimation of the gradient of a density function, with applications in pattern recognition
  IEEE Transactions on Information Theory, 1975
• On the shortest spanning subtree of a graph and the traveling salesman problem
  Proceedings of the American Mathematical Society, 1956