A k-means type clustering algorithm for subspace clustering of mixed numeric and categorical datasets

作者：Ahmad Amir^*; Dey Lipika

来源：Pattern Recognition Letters, 2011, 32(7): 1062-1069.

DOI：10.1016/j.patrec.2011.02.017

• Clustering
• Subspace clustering
• Mixed data
• Categorical data

Almost all subspace clustering algorithms proposed so far are designed for numeric datasets. In this paper, we present a k-means type clustering algorithm that finds clusters in data subspaces in mixed numeric and categorical datasets. In this method, we compute attributes contribution to different clusters. We propose a new cost function for a k-means type algorithm. One of the advantages of this algorithm is its complexity which is linear with respect to the number of the data points. This algorithm is also useful in describing the cluster formation in terms of attributes contribution to different clusters. The algorithm is tested on various synthetic and real datasets to show its effectiveness. The clustering results are explained by using attributes weights in the clusters. The clustering results are also compared with published results.

• 出版日期2011-5-1