| Summary: | 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.
|
|---|
