Affiliations: [a] School of Computer Science and Technology, Jilin University, Jilin Province, China | [b] School of Computer Science, Iran University of Sci. and Technology, Tehran, Iran | [c] Young Researchers and Elite Club, Yasooj Branch, Islamic Azad University, Yasooj, Iran | [d] Department of Computer Engineering, Nourabad Mamasani Branch, Islamic Azad University, Nourabad Mamasani, Iran | [e] Institute of Research and Development, Duy Tan University, Da Nang 550000, Vietnam. mohammadrezamahmoudi@duytan.edu.vn
Correspondence:
[C]
Address for correspondence: Institute of Research and Development, Duy Tan University, Da Nang 550000, Vietnam.
Note: [*] Also works: Young Researchers and Elite Club, Nourabad Mamasani Branch, Islamic Azad University, Nourabad Mamasani, Iran.
Note: [†] Also works: Department of Statistics, Faculty of Science, Fasa University, Fasa, Iran.
Abstract: This paper studies the cluster ensemble selection problem for unsupervised learning. Given a large ensemble of clustering solutions, our goal is to select a subset of solutions to form a smaller yet better performing cluster ensemble than using all available solutions. The common way of aggregating the chosen solutions is accumulating the information of the selected results to a similarity matrix. This paper suggests transforming the similarity matrix to a modularity matrix and then applying a new consensus function which optimizes modularity measure in it. We represent the modularity maximization problem as a 0-1 quadratic program which can be exactly solved for small datasets. We also established a new greedy algorithm, namely sum linkage, to optimize the objective function specially for large scale datasets in a very short time. We show that the proposed consensus partition gets much closer to the actual cluster structure than the partitions obtained from the direct application of common cluster ensemble methods. The promising results compared with other most cited consensus functions show the excellent efficiency of the proposed method.
