Unsupervised learning on k-partite graphs

Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the research on mining the hidden structures from a k-partite graph is still limited and preliminary. In this paper, we propose a general model, the relation summary network, to find the hidden structures (the local cluster structures and the global community structures) from a k-partite graph. The model provides a principal framework for unsupervised learning on k-partite graphs of various structures. Under this model, we derive a novel algorithm to identify the hidden structures of a k-partite graph by constructing a relation summary network to approximate the original k-partite graph under a broad range of distortion measures. Experiments on both synthetic and real data sets demonstrate the promise and effectiveness of the proposed model and algorithm. We also establish the connections between existing clustering ap...

• Type: Conference
• Year: 2006
• Where: KDD
• Authors: Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip S. Yu
• Keywords: Data Mining, Hidden Structures, K-partite Graph, KDD 2006, Relation Summary Network