Automated variable weighting in k-means type clustering

Citations Over TimeTop 1% of 2005 papers

Abstract

This paper proposes a k-means type clustering algorithm that can automatically calculate variable weights. A new step is introduced to the k-means clustering process to iteratively update variable weights based on the current partition of data and a formula for weight calculation is proposed. The convergency theorem of the new clustering process is given. The variable weights produced by the algorithm measure the importance of variables in clustering and can be used in variable selection in data mining applications where large and complex real data are often involved. Experimental results on both synthetic and real data have shown that the new algorithm outperformed the standard k-means type algorithms in recovering clusters in data.

Related Papers

• → The best clustering algorithms in data mining(2016)66 cited
• An Improved Fuzzy C—Means Clustering Algorithm(2008)
• Performance evaluation of hierarchical clustering algorithms(2010)
• → The Research on Clustering Ensembles Selection Algorithm based on Semi-supervised K-means Clustering(2021)1 cited