An Improved Algorithm of Rough K-Means Clustering Based on Variable Weighted Distance Measure
Tengfei Zhang, Long Chen, Fumin Ma · International Journal of Database Theory and Application · 2014
Rough K-means algorithm has shown that it can provides a reasonable set of lower and upper bounds for a given dataset.With the conceptions of the lower and upper approximate sets, rough k-means clustering and its emerging derivatives become valid algorithms in vague information clustering.However, the most available algorithms ignore the difference of the distances between data objects and cluster centers when computing new mean for each cluster.To solve this issue, an improved algorithm of rough k-means clustering based on variable weighted distance measure is presented in this article.Comparative experimental results of real world data from UCI demonstrate the validity of the proposed algorithm.