Estimating the Cluster Tree of a Density by Analyzing the Minimal Spanning Tree of a Sample

runt pruning, a new clustering method that attempts to find modes of a density by analyzing the minimal spanning tree of a sample. The method exploits the connection between the minimal spanning tree and nearest neighbor density (e.g. normal mixture) or about the geometric shapes of the clusters, and is computationally feasible for large data sets.

[1]  Vincent Kanade,et al.  Clustering Algorithms , 2021, Wireless RF Energy Transfer in the Massive IoT Era.

[2]  J. Hartigan.  Statistical theory in clustering , 1985 .

[3]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[4]  Hans-Peter Kriegel,et al.  OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.

[5]  J. Hartigan,et al.  The Dip Test of Unimodality , 1985 .

[6]  John W. Tukey,et al.  A Projection Pursuit Algorithm for Exploratory Data Analysis , 1974, IEEE Transactions on Computers.

[7]  Andreas Buja,et al.  XGobi: Interactive Dynamic Data Visualization in the X Window System , 1998 .

[8]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[9]  Adrian E. Raftery,et al.  MCLUST: Software for Model-Based Cluster Analysis , 1999 .

[10]  Sameer A. Nene,et al.  A simple algorithm for nearest neighbor search in high dimensions , 1997 .

[11]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[12]  S. Klinke,et al.  Exploratory Projection Pursuit , 1995 .

[13]  J. Hartigan,et al.  The runt test for multimodality , 1992 .

[14]  G. Schwarz.  Estimating the Dimension of a Model , 1978 .

[15]  M. Chavance.  [Jackknife and bootstrap]. , 1992, Revue d'epidemiologie et de sante publique.

[16]  N. L. Johnson,et al.  Multivariate Analysis , 1958, Nature.

[17]  J. Hartigan.  Consistency of Single Linkage for High-Density Clusters , 1981 .

[18]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[19]  P. J. Green,et al.  Density Estimation for Statistics and Data Analysis , 1987 .

[20]  Azriel Rosenfeld,et al.  Computer Vision , 1988, Adv. Comput..

[21]  David R. Karger,et al.  Constant interaction-time scatter/gather browsing of very large document collections , 1993, SIGIR.

[22]  J. Friedman,et al.  PROJECTION PURSUIT DENSITY ESTIMATION , 1984 .

[23]  J. Gower,et al.  Minimum Spanning Trees and Single Linkage Cluster Analysis , 1969 .

[24]  Adrian E. Raftery,et al.  How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis , 1998, Comput. J..

[25]  Jon Louis Bentley,et al.  Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces , 1978, IEEE Transactions on Computers.

[26]  J. Hartigan,et al.  The MAP test for multimodality , 1994 .

[27]  David R. Karger,et al.  Scatter/Gather: a cluster-based approach to browsing large document collections , 1992, SIGIR '92.

[28]  Kallinapur.  Statistics and Probability: Essays in Honor of C. R. Rao , 1982 .