Community Discovery via Metagraph Factorization

被引:34
作者
Lin, Yu-Ru [1 ]
Sun, Jimeng
Sundaram, Hari [1 ]
Kelliher, Aisling [1 ]
Castro, Paul
Konuru, Ravi
机构
[1] Arizona State Univ, Tempe, AZ 85287 USA
关键词
MetaFac; metagraph factorization; relational hypergraph; nonnegative tensor factorization; community discovery; dynamic social network analysis;
D O I
10.1145/1993077.1993081
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This work aims at discovering community structure in rich media social networks through analysis of time-varying, multirelational data. Community structure represents the latent social context of user actions. It has important applications such as search and recommendation. The problem is particularly useful in the enterprise domain, where extracting emergent community structure on enterprise social media can help in forming new collaborative teams, in expertise discovery, and in the long term reorganization of enterprises based on collaboration patterns. There are several unique challenges: (a) In social media, the context of user actions is constantly changing and coevolving; hence the social context contains time-evolving multidimensional relations. (b) The social context is determined by the available system features and is unique in each social media platform; hence the analysis of such data needs to flexibly incorporate various system features. In this article we propose MetaFac (MetaGraph Factorization), a framework that extracts community structures from dynamic, multidimensional social contexts and interactions. Our work has three key contributions: (1) metagraph, a novel relational hypergraph representation for modeling multirelational and multidimensional social data; (2) an efficient multirelational factorization method for community extraction on a given metagraph; (3) an online method to handle time-varying relations through incremental metagraph factorization. Extensive experiments on real-world social data collected from an enterprise and the public Digg social media Web site suggest that our technique is scalable and is able to extract meaningful communities from social media contexts. We illustrate the usefulness of our framework through two prediction tasks: (1) in the enterprise dataset, the task is to predict users' future interests on tag usage, and (2) in the Digg dataset, the task is to predict users' future interests in voting and commenting on Digg stories. Our prediction significantly outperforms baseline methods (including aspect model and tensor analysis), indicating the promising direction of using metagraphs for handling time-varying social relational contexts.
引用
收藏
页数:44
相关论文
共 77 条
[11]  
[Anonymous], 2006, Proceedings of 12th International Conference on Knowledge Discovery in Data Mining
[12]  
[Anonymous], 2008, Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining-KDD 08, page
[13]  
ASUR S., 2007, P ACM SIGKDD INT C K
[14]  
Backstrom L., 2006, Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P44, DOI DOI 10.1145/1150402.1150412
[15]  
BADER B, 2006, SAND20062161 SAND NA
[16]   Algorithm 862: MATLAB tensor classes for fast algorithm prototyping [J].
Bader, Brett W. ;
Kolda, Tamara G. .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2006, 32 (04) :635-653
[17]  
BANERJEE A., 2007, P SIAM C DAT MIN SDM
[18]  
BARBER M., 2008, ARTE MANUAL ICONOGRA, P171
[19]  
Basu A, 2007, INTEGR SER INFORM SY, V15, P1, DOI 10.1007/978-0-387-37234-1
[20]  
Bekkerman R., 2005, ICML, P41