An Enhanced Regularized k-Means Type Clustering Algorithm With Adaptive Weights
Open Access
- 7 February 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 31171-31179
Abstract
K-means clustering algorithm is one of the most popular technique for clustering in machine learning, however, in the existing k-means clustering algorithm, the ability of the different features and the importance of the different data objects are treated equally; the discriminative ability of the different features and the importance of the different data objects cannot be differentiated effectively. In the light of this limitation, this paper put forward an enhanced regularized k-means type clustering algorithm with adaptive weights in which we introduced an adaptive feature weights matrix and an adaptive data weights vector into the objective function of the k-means clustering algorithm and we developed a new objective function with l2-norm regularization to the weights of data objects and features, then we obtained the corresponding scientific updating iterative rules of the weights of the different features, the weights of the different data objects and the cluster centers theoretically. In order to evaluate the performance of the new algorithm put forward, extensive experiments were conducted. Experimental results have indicated that our proposed algorithm can improve the clustering performance significantly and are more effective with respects to three metrics: the successful clustering rate (SCR), normal mutual information (NMI) and RandIndex.Keywords
Funding Information
- Natural Science Foundation of Anhui Province (1908085QF253)
- National Natural Science Foundation of China (61601004, 61602008)
- Anhui University of Technology (QZ201812)
This publication has 26 references indexed in Scilit:
- Phylogenomic clustering for selecting non-redundant genomes for comparative genomicsBioinformatics, 2013
- Regularized k-means clustering of high-dimensional data and its asymptotic consistencyElectronic Journal of Statistics, 2012
- A feature group weighting method for subspace clustering of high-dimensional dataPattern Recognition, 2012
- A k-means type clustering algorithm for subspace clustering of mixed numeric and categorical datasetsPattern Recognition Letters, 2011
- An Efficient Global K-means Clustering AlgorithmJournal of Computers, 2011
- Enhanced soft subspace clustering integrating within-cluster and between-cluster informationPattern Recognition, 2010
- An Efficient Clustering Algorithm Based on Local Optimality of K-MeansJournal of Software, 2008
- Modified global -means algorithm for minimum sum-of-squares clustering problemsPattern Recognition, 2008
- Clustering Algorithms ResearchJournal of Software, 2008
- The global k-means clustering algorithmPattern Recognition, 2003