Multi-type clustering in heterogeneous information networks. Issue 1 (July 2016)

• Record Type: Journal Article
• Authors: Lin, Wangqun; Yu, Philip; Zhao, Yuchen; Deng, Bo
• Is Part Of: Knowledge and information systems. Volume 48:Issue 1(2016:Jul.)
• Page Start: 143
• Page End: 178
• Publication Date: 2016-07
• Subjects: Heterogeneous information network -- Multi-type clustering -- Overlapping -- Cluster; Expert systems (Computer science) -- Periodicals; Information storage and retrieval systems -- Periodicals; 006.33
• DOI: 10.1007/s10115-015-0869-9
• Languages: English
• ISSNs: 0219-1377

Abstract

Abstract Heterogeneous information networks have drawn much attention in recent years due to their significant applications, such as text mining, e-commerce, social networks, and bioinformatics. Clustering different types of objects simultaneously based upon not only their relations of the same type, but also the relations between different types of objects can improve the clustering quality mutually. In this paper, we propose a general model, in which both the homogeneous and heterogeneous relations are considered simultaneously, to describe the structure of the heterogeneous information networks and devise a novel parametric free multi-type overlapped clustering approach. In this model, different types of relations between different types of objects are represented by a group of matrices. In this way, we transfer the multi-type clustering problem into the information compression problem. Subsequently, greedy search approaches, which aim at describing the group of relational matrices with least bits, are proposed. Moreover, by discovering the discriminative clusters among different types of objects, we devise effective parameter-free strategies to discover either overlapping or non-overlapping structure among different types of clusters. Extensive experiments on real-world and synthetic data sets demonstrate our methods are effective and efficient.