Minimum spanning tree based classification model for massive data with MapReduce implementation

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2010, Pages 129-137

  Chang, Jin ^a   Luo, Jun ^a   Huang, Joshua Zhexue ^a   Feng, Shengzhong ^a   Fan, Jianping ^a  

^a SHENZHEN INSTITUTES OF ADVANCED TECHNOLOGY   (China)

Author keywords

Classification; Cloud computing; Graph based mining; MapReduce; Minimum spanning tree

Indexed keywords

CLASSIFICATION; CLASSIFICATION METHODS; CLASSIFICATION MODELS; CLUSTER-BASED; DATA SETS; GRAPH-BASED MINING; INTERMEDIATE MODEL; K-NEAREST NEIGHBOR METHOD; MAP-REDUCE; MASSIVE DATA; MINIMUM SPANNING TREE; MINIMUM SPANNING TREES; PROGRAMMING FRAMEWORK; RAPID GROWTH; REAL WORLD DATA; SYNTHETIC DATA; UCI REPOSITORY;

CLOUD COMPUTING; COMPUTER SYSTEMS; DATA MINING; METADATA; PARALLEL ARCHITECTURES; TREES (MATHEMATICS);

CLASSIFICATION (OF INFORMATION);

EID: 79951729670     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDMW.2010.14     Document Type: Conference Paper

References (16)

1. th Annual Symposiumon Computational Geometry, pp.252-257, 1988.
2. T. H. Cormen, C. E. Leiserson and R. L. Rivest. Introduction to Algorithms, The MIT Press, Massachusetts, 1990.
3. F. Dehne and S. Götz. Practical parallel algorithms for minimum spanning trees. Workshop on Advances in Parallel and Distributed Systems West Lafayette, pp.366-371, October 1998.
4. H. Gabow, T. Spencer and R. Rarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, vol.6(2), pp.109-122, 1986.
5. J. C. Gower and G. J. S. Ross. Minimum Spanning Trees and Single-Linkage Cluster Analysis. Applied Statistics 18, pp.54- 64, 1969.
6. Z. Huang, M. Ng, T. Lin, D. Cheung. An interactive approach to building classification models by clustering and cluster validation. In : IDEAL 2000. LNCS, vol. 1983, pp. 23- 28. Springer, Heidelberg, 2000. (Pubitemid 33211294)
7. P. Juszczak, D. M. J. Tax, E. Pekalska and R. P. W. Duin. Minimum spanning tree based one-class classifier. Neurocomputing, vol.72, pp.1859-69, 2009.
8. U. Kang, C. Tsourakakis, A. Appel, C. Faloutsos and J. Leskovec. Hadi: Fast diameter estimation and mining in massive graphs with hadoop. CMU-ML-08-117, 2008.
9. H. Karloff, S. Suri and S. Vassilvitskii. A model of computation for mapreduce. Symposium on Discrete Algorithms( SODA), 2010.
10. S.S. Liang, Y. Liu, C. Wang, L. Jian. A CUDA-based parallel implementation of K-nearest neighbor algorithm. Cyber- Enabled Distributed Computing and Knowledge Discovery, CyberC'09. International Conference, pp.291-296, 2009.
11. B. Y. Wu and K. M. Chao, Spanning Trees and Optimization Problems, Chapman & Hall/CRC Press, USA, 2004.
12. E. P. Xing, A.Y.Ng, M.I. Jordan and S. Russell. Distance metric learning, with application to clustering with sideinformation. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, pp.521-528, Cambridge, MA, 2002.
13. B. Zhang, Srihari, S.N. Fast k-nearest neighbor classification using cluster-based trees. emphPattern Analysis and Machine Intelligence, vol.26(4), pp.525-528, 2004.
14. L. Zhou, L. Wang, X. Ge, Q. Shi. A clustering-Based KNN improved algorithm CLKNN for text classification. Informatics in Control, Automation and Robotics (CAR), 2010 2nd International Asia Conference, pp.212-215, 2010.
15. http://www.cs.waikato.ac.nz/ml/weka/.
16. S. Hettich, C.L. Blake, C.J. Merz, UCI repository of machine learning databases, 1998.