ACM Home Page
Please provide us with feedback. Feedback
Extracting community structure through relational hypergraphs
Full text PdfPdf (576 KB)
Source
International World Wide Web Conference archive
Proceedings of the 18th international conference on World wide web table of contents
Madrid, Spain
POSTER SESSION: Friday, April 24, 2009 table of contents
Pages 1213-1214  
Year of Publication: 2009
ISBN:978-1-60558-487-4
Authors
Yu-Ru Lin  Arizona State University, Tempe, AZ, USA
Jimeng Sun  IBM T.J. Watson Research Center, Hawthorne, NY, USA
Paul Castro  IBM T.J. Watson Research Center, Hawthorne, NY, USA
Ravi Konuru  IBM T.J. Watson Research Center, Hawthorne, NY, USA
Hari Sundaram  Arizona State University, Tempe, AZ, USA
Aisling Kelliher  Arizona State University, Tempe, AZ, USA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 25,   Downloads (12 Months): 122,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1526709.1526934
What is a DOI?

ABSTRACT

Social media websites promote diverse user interaction on media objects as well as user actions with respect to other users. The goal of this work is to discover community structure in rich media social networks, and observe how it evolves over time, through analysis of multi-relational data. The problem is important in the enterprise domain where extracting emergent community structure on enterprise social media, can help in forming new collaborative teams, aid in expertise discovery, and guide long term enterprise reorganization. Our approach consists of three main parts: (1) a relational hypergraph model for modeling various social context and interactions; (2) a novel hypergraph factorization method for community extraction on multi-relational social data; (3) an on-line method to handle temporal evolution through incremental hypergraph factorization. Extensive experiments on real-world enterprise data suggest that our technique is scalable and can extract meaningful communities. To evaluate the quality of our mining results, we use our method to predict users' future interests. Our prediction outperforms baseline methods (frequency counts, pLSA) by 36-250% on the average, indicating the utility of leveraging multi-relational social context by using our method.



Collaborative Colleagues:
Yu-Ru Lin: colleagues
Jimeng Sun: colleagues
Paul Castro: colleagues
Ravi Konuru: colleagues
Hari Sundaram: colleagues
Aisling Kelliher: colleagues