A parallel clustering method combined information bottleneck theory and centroid-based clustering
- 367 Downloads
Clustering is an important research topic of data mining. Information bottleneck theory-based clustering method is suitable for dealing with complicated clustering problems because that its information loss metric can measure arbitrary statistical relationships between samples. It has been widely applied to many kinds of areas. With the development of information technology, the electronic data scale becomes larger and larger. Classical information bottleneck theory-based clustering method is out of work to deal with large-scale dataset because of expensive computational cost. Parallel clustering method based on MapReduce model is the most efficient method to deal with large-scale data-intensive clustering problems. A parallel clustering method based on MapReduce model is developed in this paper. In the method, parallel information bottleneck theory clustering method based on MapReduce is proposed to determine the initial clustering center. An objective method is proposed to determine the final number of clusters automatically. Parallel centroid-based clustering method is proposed to determine the final clustering result. The clustering results are visualized with interpolation MDS dimension reduction method. The efficiency of the method is illustrated with a practical DNA clustering example.
KeywordsClustering Information bottleneck theory MapReduce Centroid-based clustering
This work is partially supported by national youth science foundation (No. 61004115), national science foundation (No. 61272433) and Provincial Fund for Nature project (No. ZR2010FQ018).
- 1.Khana SS, Ahmad A (2013) Cluster center initialization algorithm for K-modes clustering. Expert Sys Appl 40(18):7444–7456Google Scholar
- 3.Tishby N, Fernando C, Bialek W (1999) The information bottleneck method. In: The 37th annual allerton conference on communication, control and computing, Monticello, pp 1–11Google Scholar
- 6.Swedlow JR, Zanetti G, Best C (2011) Nat. Methods. Channeling the data deluge 8:463–465Google Scholar
- 8.Sun ZQ, Fox GC (2012) Study on parallel SVM based on MapReduce. In: International conference on parallel and distributed processing techniques and applications, CSREA Press, pp 495–501Google Scholar
- 10.Qiu J (2010) Scalable programming and algorithms for data intensive life science. J Integr Biol 15(4):1–3Google Scholar
- 13.Fox GC, Bae SH et al (2008) Parallel data mining from multicore to cloudy grids. High performance computing and grids workshop, IOS Press, pp 311–340Google Scholar
- 14.Li JJ, Cui J, Wang D et al (2011) Survey of MapReduce parallel programming model. Acta Electronica Sinica 39(11):2635–2642Google Scholar
- 15.Ekanayake J, Li H et al (2010) Twister: a runtime for iterative MapReduce. In: The first international workshop on MapReduce and its applications of ACM HPDC, ACM press, pp 810–818Google Scholar
- 17.George KM (2010) Self-organizing maps. INTECHGoogle Scholar
- 18.Borg I, Patrick JF (2005) Modern multidimensional scaling: theory and applications. Springer, New YorkGoogle Scholar
- 19.Bae S-H, Qiu J, Fox G (2012) Adaptive interpolation of multidimensional scaling. In: International conference on computational science, pp 393–402Google Scholar