NNB: An efficient nearest neighbor search method for hierarchical clustering on large datasets
暂无分享,去创建一个
Wei Zhang | Tao Li | Yongli Wang | Gongxuan Zhang | Zhaomeng Zhu | Wei Zhang | Gongxuan Zhang | Tao Li | Yongli Wang | Zhaomeng Zhu
[1] Chris H. Q. Ding,et al. Cluster Aggregate Inequality and Multi-level Hierarchical Clustering , 2005, PKDD.
[2] F. Frances Yao,et al. Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[3] Fionn Murtagh,et al. A Survey of Recent Advances in Hierarchical Clustering Algorithms , 1983, Comput. J..
[4] D. Defays,et al. An Efficient Algorithm for a Complete Link Method , 1977, Comput. J..
[5] Boris Mirkin,et al. Mathematical Classification and Clustering , 1996 .
[6] G. N. Lance,et al. A general theory of classificatory sorting strategies: II. Clustering systems , 1967, Comput. J..
[7] Amin A. Shoukry,et al. CMUNE: A clustering using mutual nearest neighbors algorithm , 2012, 2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA).
[8] Feng Li,et al. An Efficient Hierarchical Clustering Method for Large Datasets with Map-Reduce , 2009, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies.
[9] Edward Y. Chang,et al. Parallel Spectral Clustering in Distributed Systems , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[10] Hanan Samet,et al. Storing a collection of polygons using quadtrees , 1985, TOGS.
[11] H. Edelsbrunner,et al. Efficient algorithms for agglomerative hierarchical clustering methods , 1984 .
[12] Boris Mirkin,et al. Mathematical Classification and Clustering: From How to What and Why , 1998 .
[13] Jon Louis Bentley,et al. Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.
[14] Robin Sibson,et al. SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method , 1973, Comput. J..
[15] Andrew McCallum,et al. Efficient clustering of high-dimensional data sets with application to reference matching , 2000, KDD '00.
[16] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[17] Konstantin V. Shvachko,et al. HDFS Scalability: The Limits to Growth , 2010, login Usenix Mag..
[18] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.
[19] Daniel T. Larose,et al. Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .
[20] Sudipto Guha,et al. CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.
[21] I. Wald,et al. On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N) , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.