Fast approximate minimum spanning tree based clustering algorithm

[1]  Sraban Kumar Mohanty,et al.  Functional grouping of similar genes using eigenanalysis on minimum spanning tree based neighborhood graph , 2016, Comput. Biol. Medicine.

[2]  Burak Eksioglu,et al.  Clustering high throughput biological data with B-MST, a minimum spanning tree based heuristic , 2015, Comput. Biol. Medicine.

[3]  Sraban Kumar Mohanty,et al.  Fast Minimum Spanning Tree Based Clustering Algorithms on Local Neighborhood Graph , 2015, GbRPR.

[4]  Pasi Fränti,et al.  A fast minimum spanning tree algorithm based on K-means , 2015, Inf. Sci..

[5]  David G. Lowe,et al.  Scalable Nearest Neighbor Algorithms for High Dimensional Data , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Xia Li Wang,et al.  Enhancing minimum spanning tree-based clustering by removing density-based outliers , 2013, Digit. Signal Process..

[7]  Xinquan Chen.  Clustering based on a near neighbor graph and a grid cell graph , 2013, Journal of Intelligent Information Systems.

[8]  L. Jiao,et al.  Minimum spanning trees for community detection , 2013 .

[9]  Rabab Kreidieh Ward,et al.  A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Pasi Fränti,et al.  Minimum spanning tree based split-and-merge: A hierarchical clustering method , 2011, Inf. Sci..

[11]  Duoqian Miao,et al.  A graph-theoretical clustering method based on two rounds of minimum spanning trees , 2010, Pattern Recognit..

[12]  D. Mitchell Wilkes,et al.  A Divide-and-Conquer Approach for Minimum Spanning Tree-Based Clustering , 2009, IEEE Transactions on Knowledge and Data Engineering.

[13]  Robert P. W. Duin,et al.  Minimum spanning tree based one-class classifier , 2009, Neurocomputing.

[14]  Yves Lechevallier,et al.  DIVCLUS-T: A monothetic divisive hierarchical clustering method , 2007, Comput. Stat. Data Anal..

[15]  Hanan Samet,et al.  A fast all nearest neighbor algorithm for applications involving large point-clouds , 2007, Comput. Graph..

[16]  Yan Zhou,et al.  Minimum Spanning Tree Based Clustering Algorithms , 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).

[17]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[18]  Y Xu,et al.  Minimum spanning trees for gene expression data clustering. , 2001, Genome informatics. International Conference on Genome Informatics.

[19]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[20]  James C. Bezdek,et al.  Some new indexes of cluster validity , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[21]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[22]  P. Rousseeuw.  Silhouettes: a graphical aid to the interpretation and validation of cluster analysis , 1987 .

[23]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[24]  Robert E. Tarjan,et al.  Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

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