skip to main content
10.1145/1557019.1557080acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

MetaFac: community discovery via relational hypergraph factorization

Published: 28 June 2009 Publication History

Abstract

This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the latent social context of user actions. It has important applications in information tasks such as search and recommendation. Social media has several unique challenges. (a) In social media, the context of user actions is constantly changing and co-evolving; hence the social context contains time-evolving multi-dimensional relations. (b) The social context is determined by the available system features and is unique in each social media website. In this paper we propose MetaFac (MetaGraph Factorization), a framework that extracts community structures from various social contexts and interactions. Our work has three key contributions: (1) metagraph, a novel relational hypergraph representation for modeling multi-relational and multi-dimensional social data; (2) an efficient factorization method for community extraction on a given metagraph; (3) an on-line method to handle time-varying relations through incremental metagraph factorization. Extensive experiments on real-world social data collected from the Digg social media website suggest that our technique is scalable and is able to extract meaningful communities based on the social media contexts. We illustrate the usefulness of our framework through prediction tasks. We outperform baseline methods (including aspect model and tensor analysis) by an order of magnitude.

Supplementary Material

JPG File (p527-lin.jpg)
MP4 File (p527-lin.mp4)

References

[1]
B. BADER and T. KOLDA (2006). Algorithm 862: MATLAB tensor classes for fast algorithm prototyping. TOMS 32(4): 635--653.
[2]
A. BANERJEE, S. BASU and S. MERUGU (2007). Multi-way Clustering on Relation Graphs, SDM, 2007.
[3]
R. BEKKERMAN, R. EL-YANIV and A. MCCALLUM (2005). Multi-way distributional clustering via pairwise interactions, ACM Intl. Conf. Proc. Series, 41--48,
[4]
D. CHAKRABARTI, R. KUMAR and A. TOMKINS (2006). Evolutionary clustering, SIGKDD, 554--560,
[5]
Y. CHI, S. ZHU, Y. GONG and Y. ZHANG (2008). Probabilistic Polyadic Factorization and Its Application to Personalized Recommendation, CIKM, 2008.
[6]
N. FRIEDMAN, L. GETOOR, D. KOLLER and A. PFEFFER (1999). Learning probabilistic relational models, IJCAI, 1300--1309, 1999.
[7]
K. J-RVELIN and J. KEK-L-INEN (2000). IR evaluation methods for retrieving highly relevant documents, SIGIR, 41--48, 2000.
[8]
C. KEMP, J. TENENBAUM, T. GRIFFITHS, T. YAMADA and N. UEDA (2006). Learning Systems of Concepts with an Infinite Relational Model, Proc. of the Natl. Conf. on AI, 381,
[9]
R. KUMAR, J. NOVAK and A. TOMKINS (2006). Structure and evolution of online social networks, SIGKDD, 611--617, 2006.
[10]
D. LEE and H. SEUNG (2001). Algorithms for non-negative matrix factorization, NIPS, 556--562, 2001.
[11]
Y. LIN, Y. CHI, S. ZHU, H. SUNDARAM and B. TSENG (2008). Facetnet: a framework for analyzing communities and their evolutions in dynamic networks, WWW, 2008.
[12]
B. LONG, Z. ZHANG and P. YU (2007). A probabilistic framework for relational clustering, SIGKDD, 470--479,
[13]
A. POPESCUL, L. H. UNGAR, D. M. PENNOCK and S. LAWRENCE (2001). Probabilistic Models for Unified Collaborative and Content-Based Recommendation in Sparse-Data Environments, UAI 2001, 437--444,
[14]
J. SUN, C. FALOUTSOS, S. PAPADIMITRIOU and P. YU (2007). GraphScope: parameter-free mining of large time-evolving graphs, SIGKDD, 687--696, 2007.
[15]
S. ZHU, K. YU, Y. CHI and Y. GONG (2007). Combining content and link for classification using matrix factorization, SIGIR, 487--494, 2007.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
June 2009
1426 pages
ISBN:9781605584959
DOI:10.1145/1557019
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 June 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. MetaFac
  2. community discovery
  3. dynamic social network analysis
  4. metagraph factorization
  5. non-negative tensor factorization
  6. relational hypergraph

Qualifiers

  • Research-article

Conference

KDD09

Acceptance Rates

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Upcoming Conference

KDD '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)47
  • Downloads (Last 6 weeks)8
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media