Journal
COMMUNICATIONS IN STATISTICS-SIMULATION AND COMPUTATION
Volume 48, Issue 5, Pages 1346-1365Publisher
TAYLOR & FRANCIS INC
DOI: 10.1080/03610918.2017.1414244
Keywords
KKT conditions; K-means clustering; Lagrange multiplier; Optimization; Variable weights
Categories
Ask authors/readers for more resources
The K-means clustering method is a widely adopted clustering algorithm in data mining and pattern recognition, where the partitions are made by minimizing the total within group sum of squares based on a given set of variables. Weighted K-means clustering is an extension of the K-means method by assigning nonnegative weights to the set of variables. In this paper, we aim to obtain more meaningful and interpretable clusters by deriving the optimal variable weights for weighted K-means clustering. Specifically, we improve the weighted k-means clustering method by introducing a new algorithm to obtain the globally optimal variable weights based on the Karush-Kuhn-Tucker conditions. We present the mathematical formulation for the clustering problem, derive the structural properties of the optimal weights, and implement an recursive algorithm to calculate the optimal weights. Numerical examples on simulated and real data indicate that our method is superior in both clustering accuracy and computational efficiency.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available