A clustering procedure based on the comparison between the k nearest neighbors graph and the minimal spanning tree

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  B. L. Joiner,et al.  Some Properties of the Range in Samples from Tukey's Symmetric Lambda Distributions , 1971 .

[3]  Charles T. Zahn,et al.  Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[4]  Brian Everitt,et al.  Cluster analysis , 1974 .

[5]  F. James Rohlf,et al.  Generalization of the Gap Test for the Detection of Multivariate Outliers , 1975 .

[6]  J. Friedman,et al.  Multivariate generalizations of the Wald--Wolfowitz and Smirnov two-sample tests , 1979 .

[7]  J. Friedman,et al.  Graphics for the Multivariate Two-Sample Problem , 1981 .

[8]  J. Friedman,et al.  Graph-Theoretic Measures of Multivariate Association and Prediction , 1983 .

[9]  R. Dudley.  A course on empirical processes , 1984 .

[10]  M. Schilling.  Multivariate Two-Sample Tests Based on Nearest Neighbors , 1986 .

[11]  N. Henze.  A MULTIVARIATE TWO-SAMPLE TEST BASED ON THE NUMBER OF NEAREST NEIGHBOR TYPE COINCIDENCES , 1988 .

[12]  Evangelos Tabakis.  Asymptotic and computational problems in single-link clustering , 1992 .

[13]  Ross Ihaka,et al.  Gentleman R: R: A language for data analysis and graphics , 1996 .

[14]  Evangelos Tabakis.  On the Longest Edge of the Minimal Spanning Tree , 1996 .

[15]  M. Penrose.  A Strong Law for the Longest Edge of the Minimal Spanning Tree , 1999 .

[16]  Adolfo J. Quiroz,et al.  Graph-Theoretic Procedures for Dimension Identification , 2002 .

[17]  Laura Maruster,et al.  From data to knowledge: a method for modeling hospital logistic processes , 2005, IEEE Transactions on Information Technology in Biomedicine.