DocumentCode :
710116
Title :
Robust clustering of multi-type relational data via a heterogeneous manifold ensemble
Author :
Jun Hou ; Nayak, Richi
Author_Institution :
Sch. of Electr. Eng. & Comput. Sci., Queensland Univ. of Technol., Brisbane, QLD, Australia
fYear :
2015
fDate :
13-17 April 2015
Firstpage :
615
Lastpage :
626
Abstract :
High-Order Co-Clustering (HOCC) methods have attracted high attention in recent years because of their ability to cluster multiple types of objects simultaneously using all available information. During the clustering process, HOCC methods exploit object co-occurrence information, i.e., inter-type relationships amongst different types of objects as well as object affinity information, i.e., intra-type relationships amongst the same types of objects. However, it is difficult to learn accurate intra-type relationships in the presence of noise and outliers. Existing HOCC methods consider the p nearest neighbours based on Euclidean distance for the intra-type relationships, which leads to incomplete and inaccurate intra-type relationships. In this paper, we propose a novel HOCC method that incorporates multiple subspace learning with a heterogeneous manifold ensemble to learn complete and accurate intra-type relationships. Multiple subspace learning reconstructs the similarity between any pair of objects that belong to the same subspace. The heterogeneous manifold ensemble is created based on two-types of intra-type relationships learnt using p-nearest-neighbour graph and multiple subspaces learning. Moreover, in order to make sure the robustness of clustering process, we introduce a sparse error matrix into matrix decomposition and develop a novel iterative algorithm. Empirical experiments show that the proposed method achieves improved results over the state-of-art HOCC methods for FScore and NMI.
Keywords :
learning (artificial intelligence); matrix decomposition; pattern clustering; Euclidean distance; FScore; HOCC method; NMI; heterogeneous manifold ensemble; high-order co-clustering method; iterative algorithm; multiple subspace learning; multitype relational data; object affinity information; object co-occurrence information; p-nearest-neighbour graph; robust clustering; sparse error matrix decomposition; Clustering algorithms; Manifolds; Matrix decomposition; Noise; Robustness; Sparse matrices; Web pages;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Engineering (ICDE), 2015 IEEE 31st International Conference on
Conference_Location :
Seoul
Type :
conf
DOI :
10.1109/ICDE.2015.7113319
Filename :
7113319
Link To Document :
بازگشت