PathSelClus: Integrating Meta-Path Selection with User-Guided Object Clustering in Heterogeneous Information Networks

被引:132
作者
Sun, Yizhou [1 ]
Norick, Brandon [2 ]
Han, Jiawei [2 ]
Yan, Xifeng [3 ]
Yu, Philip S. [4 ,5 ]
Yu, Xiao [2 ]
机构
[1] Univ Illinois, Urbana, IL USA
[2] Univ Illinois, Dept Comp Sci, Urbana, IL USA
[3] Univ Calif Santa Barbara, Dept Comp Sci, Santa Barbara, CA 93106 USA
[4] Univ Illinois, Dept Comp Sci, Chicago, IL USA
[5] King Abdulaziz Univ, Dept Comp Sci, Jeddah 21413, Saudi Arabia
基金
美国国家科学基金会;
关键词
Algorithms; Heterogeneous information networks; meta-path selection; user-guided clustering;
D O I
10.1145/2500492
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Real-world, multiple-typed objects are often interconnected, forming heterogeneous information networks. A major challenge for link-based clustering in such networks is their potential to generate many different results, carrying rather diverse semantic meanings. In order to generate desired clustering, we propose to use meta-path, a path that connects object types via a sequence of relations, to control clustering with distinct semantics. Nevertheless, it is easier for a user to provide a few examples (seeds) than a weighted combination of sophisticated meta-paths to specify her clustering preference. Thus, we propose to integrate meta-path selection with user-guided clustering to cluster objects in networks, where a user first provides a small set of object seeds for each cluster as guidance. Then the system learns the weight for each meta-path that is consistent with the clustering result implied by the guidance, and generates clusters under the learned weights of meta-paths. A probabilistic approach is proposed to solve the problem, and an effective and efficient iterative algorithm, PathSelClus, is proposed to learn the model, where the clustering quality and the meta-path weights mutually enhance each other. Our experiments with several clustering tasks in two real networks and one synthetic network demonstrate the power of the algorithm in comparison with the baselines.
引用
收藏
页数:23
相关论文
共 31 条
[1]  
Airoldi EM, 2008, J MACH LEARN RES, V9, P1981
[2]  
[Anonymous], 2004, ICML
[3]  
[Anonymous], 2005, Proceedings of the 22nd International Conference on Machine Learning
[4]  
[Anonymous], 2002, School Comput. Sci., Tech. Rep. CMU-CALD02-107
[5]  
[Anonymous], 2004, P 10 ACM SIGKDD INT, DOI DOI 10.1145/1014052.1014062
[6]  
[Anonymous], 2006, P 23 INT C MACHINE L, DOI DOI 10.1145/1143844.1143918
[7]  
[Anonymous], 2012, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, DOI DOI 10.1145/2339530.2339738
[8]  
[Anonymous], 2009, RANKCLUS INTEGRATING, DOI DOI 10.1145/1516360.1516426
[9]  
Banerjee A, 2005, J MACH LEARN RES, V6, P1705
[10]  
Bar-Hillel AB, 2005, J MACH LEARN RES, V6, P937