NNB: An efficient nearest neighbor search method for hierarchical clustering on large datasets

Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing, IEEE ICSC 2015

Volumn , Issue , 2015, Pages 405-412

  Zhang, Wei ^a,b   Zhang, Gongxuan ^a   Wang, Yongli ^a   Zhu, Zhaomeng ^a   Li, Tao ^a  

^a NANJING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b HUAIYIN NORMAL UNIVERSITY   (China)

Author keywords

Hierarchical clustering; MapReduce; nearest neighbor boundary; parallel and distributed computing

Indexed keywords

HIERARCHICAL CLUSTERING; LARGE DATASET; NEAREST NEIGHBOR SEARCH; SEMANTICS;

AGGLOMERATIVE HIERARCHICAL CLUSTERING; LARGE DATASETS; MAP-REDUCE; NEAREST NEIGHBORS; PARALLEL AND DISTRIBUTED COMPUTING; PROPOSAL ALGORITHM; TIME COMPLEXITY;

CLUSTERING ALGORITHMS;

EID: 84925587906     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICOSC.2015.7050840     Document Type: Conference Paper

References (21)

1. P. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining, pp. 516-518. Addison-Wesley Longman, Inc., May 2005.
2. F. Murtagh, "A survey of recent advances in hierarchical clustering algorithms," The Computer Journal, vol. 26, no. 4, pp. 354-359, 1983.
3. R. Sibson, "Slink: an optimally efficient algorithm for the single-link cluster method," The Computer Journal, vol. 16, no. I, pp. 30-34, 1973.
4. D. Defays, "An efficient algorithm for a complete link method," The Computer Journal, vol. 20, no. 4, pp. 364-366, 1977.
5. A. McCaUum, K. Nigam, and L. H. Ungar, "Efficient clustering of high-dimensional data sets with application to reference matching," in Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '00, (New York, NY, USA), pp. 169-178, ACM, 2000.
6. S. Guha, R. Rastogi, and K. Shim, "Cure: An efficient clustering algorithm for large databases," in P roceedings of the i998 ACM SIGMOD International Conference on Management of Data, SIGMOD '98, (New York, NY, USA), pp. 73-84, ACM, 1998.
7. M. Abbas and A. Shoukry, "Cmune: A clustering using mutual nearest neighbors algorithm," in iriformation Science, Signal Processing and their Applications (ISSPA), 2012 11th International Conference on, pp. 1192-1197, July 2012.
8. W-Y. Chen, Y. Song, H. Bai, c.-J. Lin, and E. Chang, "Parallel spectral clustering in distributed systems," Pattern Analysis and Machine intelligence, iEEE Transactions on, vol. 33, pp. 568-586, March 2011.
9. T. Sun, C. Shu, F. Li, H. Yu, L. Ma, and Y. Fang, "An efficient hierarchical clustering method for large datasets with map-reduce," in Parallel and Distributed Computing, Applications and Technologies, 2009 International Coriference on, pp. 494-499, Dec 2009.
10. R. A. Finkel and J. L. Bentley, "Quad trees a data structure for retrieval on composite keys," Acta iriformatica, vol. 4, no. I, pp. 1-9, 1974.
11. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, "Computational geometry," in Computational Geometry, pp. 291-306, Springer Berlin Heidelberg, 2000.
12. H. Samet and R. E. Webber, "Storing a coUection of polygons using quadtrees," ACM Transactions on Graphics (TOG), vol. 4, no. 3, pp. 182-222, 1985.
13. J. Dean and S. Ghemawat, "Mapreduce: simplified data processing on large clusters," Communications of the ACM, vol. 51, no. 1, pp. 107-113, 2008.
14. B. Mirkin, Mathematical classification and clustering: From how to what and why, pp. 139-158. Springer, 1998.
15. C. Ding and X. He, "Cluster aggregate inequality and multi-level hierarchical clustering," in Knowledge Discovery in Databases: PKDD 2005, vol. 3721 of Lecture Notes in Computer Science, pp. 71-83, Springer Berlin Heidelberg, 2005.
16. G. N. Lance and W T. Williams, "A general theory of classificatory sorting strategies ii. clustering systems," The computer journal, vol. 10, no. 3, pp. 271-277, 1967.
17. J. L. Bentley, "Multidimensional binary search trees used for associative searching," Communications of the ACM, vol. 18, no. 9, pp. 509-517, 1975.
18. I. Wald and V. Havran, "On building fast kd-trees for ray tracing, and on doing that in 0 (n log n)," in Interactive Ray Tracing 2006, IEEE Symposium on, pp. 61-69, IEEE, 2006.
19. A. Vance, "Hadoop, a free software program, finds uses beyond search," New York, Times Archived from the original on, 2010.
20. K. V. Shvachko, "Hdfs scalability: The limits to growth," login, vol. 35, no. 2, pp. 6-16, 2010.
21. W H. Day and H. Edelsbrunner, "Efficient algorithms for agglomerative hierarchical clustering methods," Journal of classification, vol. 1, no. 1, pp. 7-24, 1984.