A parallel clustering method combined information bottleneck theory and centroid-based clustering

作者：Sun Zhanquan^*; Fox Geoffrey; Gu Weidong; Li Zhao

来源：Journal of Supercomputing, 2014, 69(1): 452-467.

DOI：10.1007/s11227-014-1174-1

• Clustering
• Information bottleneck theory
• MapReduce
• Centroid-based clustering

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.

• 出版日期2014-7
• 单位北京交通大学