Comment-based Multi-View Clustering of Web 2.0 Items

被引:74
作者
He, Xiangnan [1 ]
Kan, Min-Yen [1 ]
Xie, Peichu [2 ]
Chen, Xiao [3 ]
机构
[1] Natl Univ Singapore, Sch Comp, Singapore, Singapore
[2] Natl Univ Singapore, Dept Math, Singapore, Singapore
[3] Chinese Acad Sci, Inst Comp Technol, Beijing, Peoples R China
来源
WWW'14: PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON WORLD WIDE WEB | 2014年
基金
新加坡国家研究基金会;
关键词
Comment-based clustering; Multi-view clustering; Co-regularized NMF; CoNMF; MATRIX FACTORIZATION;
D O I
10.1145/2566486.2567975
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Clustering Web 2.0 items (i.e., web resources like videos, images) into semantic groups benefits many applications, such as organizing items, generating meaningful tags and improving web search. In this paper, we systematically investigate how user-generated comments can be used to improve the clustering of Web 2.0 items. In our preliminary study of Last. fm, we find that the two data sources extracted from user comments - the textual comments and the commenting users - provide complementary evidence to the items' intrinsic features. These sources have varying levels of quality, but we importantly we find that incorporating all three sources improves clustering. To accommodate such quality imbalance, we invoke multi-view clustering, in which each data source represents a view, aiming to best leverage the utility of different views. To combine multiple views under a principled framework, we propose CoNMF (Co-regularized Non-negative Matrix Factorization), which extends NMF for multi-view clustering by jointly factorizing the multiple matrices through co-regularization. Under our CoNMF framework, we devise two paradigms - pair-wise CoNMF and cluster-wise CoNMF - and propose iterative algorithms for their joint factorization. Experimental results on Last. fm and Yelp datasets demonstrate the effectiveness of our solution. In Last. fm, CoNMF betters k-means with a statistically significant F-1 increase of 14%, while achieving comparable performance with the state-of-the-art multi-view clustering method CoSC [24]. On a Yelp dataset, CoNMF outperforms the best baseline CoSC with a statistically significant performance gain of 7%.
引用
收藏
页码:771 / 781
页数:11
相关论文
共 42 条
[1]  
Akata Z., 2011, P 16 COMP VIS WINT W
[2]  
[Anonymous], 2008, P 31 ANN INT ACM SIG, DOI DOI 10.1145/1390334.1390385
[3]  
[Anonymous], 2008, P 2008 SIAM INT C DA
[4]  
[Anonymous], 2008, Introduction to information retrieval
[5]  
[Anonymous], 2003, P 26 ANN INT ACM SIG, DOI DOI 10.1145/860435.860485
[6]  
[Anonymous], 2013, P 2013 SIAM INT C DA
[7]  
[Anonymous], 2009, NATURAL LANGUAGE PRO, DOI DOI 10.1007/S10579-010-9124-X
[8]  
Baeza-Yates R, 1999, MODERN INFORM RETRIE, V463
[9]  
Beibei Li, 2007, Proceedings of the 45th ACM Southeast Conference. ACMSE 07, P94
[10]  
Blaschko M. B., 2008, PROC CVPR 08, P1