Selecting the Minkowski Exponent for Intelligent K-Means with Feature Weighting
Recently, a three-stage version of K-Means has been introduced, at which not only clusters and their centers, but also feature weights are adjusted to minimize the summary p-th power of the Minkowski p-distance between entities and centroids of their clusters. The value of the Minkowski exponent p appears to be instrumental in the ability of the method to recover clusters hidden in data. This paper advances into the problem of finding the best p for a Minkowski metric-based version of K-Means, in each of the following two settings: semi-supervised and unsupervised. This paper presents experimental evidence that solutions found with the proposed approaches are sufficiently close to the optimum.
KeywordsClustering Minkowski metric Feature weighting K-Means
- 2.Bache, K., Lichman, M.: UCI machine learning repository. http://archive.ics.uci.edu/ml (2013)
- 5.de Amorim, R.C., Fenner, T.: Weighting features for partition around medoids using the minkowski metric. In: Jaakko, H., Frank, K., Allan, T. (eds.) Advances in Intelligent Data Analysis. Lecture Notes in Computer Science, vol. 7619, pp. 35–44. Springer, Berlin (2012)Google Scholar
- 6.de Amorim, R.C., Komisarczuk, P.: On initializations for the minkowski weighted k-means. In: Jaakko, H., Frank, K., Allan, T. (eds.) Advances in Intelligent Data Analysis. Lecture Notes in Computer Science, vol. 7619, pp. 45–55. Springer, Berlin (2012)Google Scholar
- 10.Huang, J.Z., Xu, J., Ng, M., Ye, Y.: Weighting method for feature selection in k-means. In: Computational Methods of Feature Selection, pp. 193–209. Chapman & Hall, London (2008)Google Scholar