Affiliations: [1] Department of Computer Science, Shantou University, Shantou, China | [2] State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing, China | [3] Department of Computer Science, University of Sherbrooke, Sherbrooke, QC, Canada, E-mails: [email protected], [email protected], [email protected], [email protected]
Correspondence:
[*]
Corresponding author.
Abstract: Clustering high-dimensional data is a challenging task in data mining, and clustering high-dimensional categorical data is even more challenging because it is more difficult to measure the similarity between categorical objects. Most algorithms assume feature independence when computing similarity between data objects, or make use of computationally demanding techniques such as PCA for numerical data. Hierarchical clustering algorithms are often based on similarity measures computed on a common feature space, which is not effective when clustering high-dimensional data. Subspace clustering algorithms discover feature subspaces for clusters, but are mostly partition-based; i.e. they do not produce a hierarchical structure of clusters. In this paper, we propose a hierarchical algorithm for clustering high-dimensional categorical data, based on a recently proposed information-theoretical concept named holo-entropy. The algorithm proposes new ways of exploring entropy, holo-entropy and attribute weighting in order to determine the feature subspace of a cluster and to merge clusters even though their feature subspaces differ. The algorithm is tested on UCI datasets, and compared with several state-of-the-art algorithms. Experimental results show that the proposed algorithm yields higher efficiency and accuracy than the competing algorithms and allows higher reproducibility.
Keywords: hierarchical clustering, holo-entropy, subspace, categorical data
Journal: Informatica, vol. 28, no. 2, pp. 303-328, 2017
