Abstract
► We propose an algorithm for the subspace clustering of mixed datasets. ► This is a linear algorithm and gives information about the cluster formation. ► The experiments show its effectiveness on categorical datasets and on mixed datasets.
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.