Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Context-aware hypergraph construction for robust spectral clustering|
|Citation:||IEEE Transactions on Knowledge & Data Engineering, 2013; 26(10):1-9|
|Xi Li, Weiming Hu, Chunhua Shen, Anthony Dick, Zhongfei Zhang|
|Abstract:||Spectral clustering is a powerful tool for unsupervised data analysis. In this paper, we propose a context-aware hypergraph simi- larity measure (CAHSM), which leads to robust spectral clustering in the case of noisy data. We construct three types of hypergraph—the pairwise hypergraph, the k-nearest-neighbor (kNN) hypergraph, and the high-order over-clustering hypergraph. The pairwise hypergraph captures the pairwise similarity of data points; the kNN hypergraph captures the neighborhood of each point; and the clustering hyper- graph encodes high-order contexts within the dataset. By combining the affinity information from these three hypergraphs, the CAHSM algorithm is able to explore the intrinsic topological information of the dataset. Therefore, data clustering using CAHSM tends to be more robust. Considering the intra-cluster compactness and the inter-cluster separability of vertices, we further design a discriminative hypergraph partitioning criterion (DHPC). Using both CAHSM and DHPC, a robust spectral clustering algorithm is developed. Theoretical analysis and experimental evaluation demonstrate the effectiveness and robustness of the proposed algorithm.|
|Keywords:||Hypergraph construction; spectral clustering; graph partitioning; similarity measure|
|Rights:||Copyright © 2014 IEEE. All rights reserved.|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.