Simultaneous Heterogeneous Data Clustering Based on Higher Order Relationships
Authors:
- Shouchun ChenSCShouchun Chen
- Fei WangFWFei Wang
- Changshui ZhangCZChangshui Zhang
- 1 October 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23759232,p. 387-392
Abstract
Co-clustering on heterogeneous data has attracted more and more attention in web mining and information retrieval. The clustering approaches for two type heterogeneous data (bi-type co-clustering) have been well studied in the lit- erature. However, the work on data with more than two types (high-order co-clustering or multi-type co-clustering) is still limited. In this paper, we present a multi-type co- clustering algorithm, which clusters the data from differ- ent types simultaneously. We use a higher-order tensor to model the high-order relationships, each element of which describes the relation (similarity) among a given set com- posed by data objects from every types. Based on the high- order relationships, we embed the multi-type data objects into the low dimensional spaces by the algorithm based on Clique Expansion which can be viewed as a high-order extension of the normalized cut approach. At last, the k- means method is used to cluster the lower dimensional data. Experiment results show the effectiveness of the proposed method on both toy problem and real data.Keywords
This publication has 11 references indexed in Scilit:
- Spectral clustering for multi-type relational data2006
- Higher order learning with graphs2006
- SimFusion2005
- CubeSVD2005
- Reply networks on a bulletin board systemPhysical Review E, 2003
- Co-clustering documents and words using bipartite spectral graph partitioning2001
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- A Multilinear Singular Value DecompositionSIAM Journal on Matrix Analysis and Applications, 2000
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order TensorsSIAM Journal on Matrix Analysis and Applications, 2000
- Approximation techniques for hypergraph partitioning problemsDiscrete Applied Mathematics, 1995