[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2492517.2492520acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Community detection by popularity based models for authored networked data

Published: 25 August 2013 Publication History

Abstract

Community detection has emerged as an attractive topic due to the increasing need to understand and manage the networked data of tremendous magnitude. Networked data usually consists of links between the entities and the attributes for describing the entities. Various approaches have been proposed for detecting communities by utilizing the link information and/or attribute information. In this work, we study the problem of community detection for networked data with additional authorship information. By authorship, each entity in the network is authored by another type of entities (e.g., wiki pages are edited by users, products are purchased by customers), to which we refer as authors. Communities of entities are affected by their authors, e.g., two entities that are associated with the same author tend to belong to the same community. Therefore leveraging the authorship information would help us better detect the communities in the networked data. However, it also brings new challenges to community detection. The foremost question is how to model the correlation between communities and authorships. In this work, we address this question by proposing probabilistic models based on the popularity link model [1], which is demonstrated to yield encouraging results for community detection. We employ two methods for modeling the authorships: (i) the first one generates the authorships independently from links by community memberships and popularities of authors by analogy of the popularity link model; (ii) the second one models the links between entities based on authorships together with community memberships and popularities of nodes, which is an analog of previous author-topic model. Upon the basic models, we explore several extensions including (i) we model the community memberships of authors by that of their authored entities to reduce the number of redundant parameters; and (ii) we model the communities memberships of entities and/or authors by their attributes using a discriminative approach. We demonstrate the effectiveness of the proposed models by empirical studies.

References

[1]
T. Yang, R. Jin, Y. Chi, and S. Zhu, "Combining link and content for community detection: a discriminative approach," in KDD, 2009, pp. 927--936.
[2]
L. Ford and D. Fulkerson, "Maximal flow through a network," vol. 8, pp. 399--404, 1956.
[3]
B. Bollobs, Modern Graph Theory. Graduate Text in Mathematics. Springer-Verlag, 1998, vol. 184.
[4]
Y.-C. Wei and C.-K. Cheng, "Towards efficient hierarchical designs by ratio cut partitioning," in Computer-Aided Design, 1989. ICCAD-89. Digest of Technical Papers., 1989 IEEE International Conference on, 1989, pp. 298--301.
[5]
B. Hendrickson and R. W. Leland, "A multi-level algorithm for partitioning graphs," in Proceedings of Supercomputing '95, 1995.
[6]
G. Karypis and V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 359--392, 1998.
[7]
Z. Zhang, T. Li, C. Ding, and X. Zhang, "Binary matrix factorization with applications," in Proceedings of the IEEE Int'l Conf on Data Mining, 2007, pp. 391--400.
[8]
M. Newman, "Modularity and community structure in networks," Proceedings of National Academy of Science, vol. 103, pp. 8577--8582, 2006.
[9]
P. K. Chan, M. D. F. Schlag, and J. Y. Zien, "Spectral k-way ratio-cut partitioning and clustering," in Proceedings of the 30th Int'l Design Automation Conf. ACM, 1993, pp. 749--754.
[10]
J. Shi and J. Malik, "Normalized cuts and image segmentation," in Proceedings of CVPR, 1997.
[11]
P. W. Holland and S. Leinhardt, "The statistical analysis of local structure in social networks," Tech. Rep., 1974.
[12]
E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing, "Mixed membership stochastic block models for relational data with application to protein-protein interactions," in In Proceedings of the International Biometrics Society Annual Meeting, 2006.
[13]
J. M. Hofman and C. H. Wiggins, "A Bayesian approach to network modularity," Physiccal Review L, vol. 100, 2008.
[14]
D. Cohn and H. Chang, "Learning to probabilistically identify authoritative documents," in Proceedings of the 17th International Conference on Machine Learning, 2000.
[15]
D. M. Blei, A. Y. Ng, M. I. Jordan, and J. Lafferty, "Latent dirichlet allocation," Journal of Machine Learning Research, vol. 3, 2003.
[16]
T. Hofmann, "Probabilistic latent semantic indexing," in Proceedings of 15th Uncertainty in Artificial Intelligence, 1999.
[17]
M. Rosen-Zvi, T. Griffiths, M. Steyvers, and P. Smyth, "The author-topic model for authors and documents," in Proceedings of the 20th conference on Uncertainty in Artificial Intelligence, 2004.
[18]
E. Erosheva, S. Fienberg, and J. Lafferty, "Mixed membership models of scientific publications," in Proceedings of the National Academy of Sciences, 2004.
[19]
R. M. Nallapati, A. Ahmed, E. P. Xing, and W. W. Cohen, "Joint latent topic models for text and citations," in Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, 2008.
[20]
A. Mccallum, A. Corrada-Emmanuel, and X. Wang, "The author-recipient-topic model for topic and role discovery in social networks: Experiments with enron and academic email," Tech. Rep., 2004.
[21]
J. Chang and D. M. Blei, "Relational topic models for document networks," Journal of Machine Learning Research - Proceedings Track, vol. 5, pp. 81--88, 2009.
[22]
A. Gruber, M. Rosen-Zvi, and Y. Weiss, "Latent topic models for hypertext," in Proceedings of the 24th Annual Conference on Uncertainty in Artificial Intelligence, 2008.
[23]
Y. Liu, A. Niculescu-Mizil, and W. Gryc, "Topic-link lda: joint models of topic and author community," in Proceedings of the 26th Annual International Conference on Machine Learning, 2009, pp. 665--672.
[24]
T. Yang, Y. Chi, S. Zhu, Y. Gong, and R. Jin, "Directed network community detection: A popularity and productivity link model," in SDM, 2010, pp. 742--753.
[25]
Y. Sun, Y. Yu, and J. Han, "Ranking-based clustering of heterogeneous information networks with star network schema," in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, 2009, pp. 797--806.
[26]
Y. Sun, J. Han, P. Zhao, Z. Yin, H. Cheng, and T. Wu, "Rankclus: integrating clustering with ranking for heterogeneous information network analysis," in Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, 2009, pp. 565--576.
[27]
B. Long, P. S. Yu, and Z. Zhang, "A General Model for Multiple View Unsupervised Learning," in Proceedings of the 2008 SIAM International Conference on Data Mining, 2008.
[28]
L. Tang, X. Wang, and H. Liu, "Community detection via heterogeneous interaction analysis," Data Min. Knowl. Discov., pp. 1--33, 2012.
[29]
T. J. Ypma, "Historical development of the newton-raphson method," SIAM Rev., vol. 37, pp. 531--551, 1995.
[30]
D. C. Liu and J. Nocedal, "On the limited memory bfgs method for large scale optimization," Math. Program., pp. 503--528, 1989.
[31]
Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course (Applied Optimization), 2005.
[32]
N. Le Roux, M. Schmidt, and F. Bach, "A stochastic gradient method with an exponential convergence rate for strongly-convex optimization with finite training sets," INRIA, Tech. Rep. arXiv:1202.6258v1, 2012.
[33]
P. Sen, G. M. Namata, M. Bilgic, L. Getoor, B. Gallagher, and T. Eliassi-Rad, "Collective classification in network data," AI Magazine, pp. 93--106, 2008.
[34]
A. McCallum, K. Nigam, J. Rennie, and K. Seymore, "Automating the construction of internet portals with machine learning," Information Retrieval Journal, vol. 3, pp. 127--163, 2000, www.research.whizbang.com/data.

Cited By

View all
  • (2020)Community Topic Usage in Online Social MediaACM Transactions on Social Computing10.1145/33778703:3(1-21)Online publication date: 31-May-2020
  • (2016)Interactive mining of diverse social entitiesInternational Journal of Knowledge-based and Intelligent Engineering Systems10.3233/KES-16033220:2(97-111)Online publication date: 4-May-2016

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ASONAM '13: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
August 2013
1558 pages
ISBN:9781450322409
DOI:10.1145/2492517
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 the author(s) 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: 25 August 2013

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

ASONAM '13
Sponsor:
ASONAM '13: Advances in Social Networks Analysis and Mining 2013
August 25 - 28, 2013
Ontario, Niagara, Canada

Acceptance Rates

Overall Acceptance Rate 116 of 549 submissions, 21%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 10 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2020)Community Topic Usage in Online Social MediaACM Transactions on Social Computing10.1145/33778703:3(1-21)Online publication date: 31-May-2020
  • (2016)Interactive mining of diverse social entitiesInternational Journal of Knowledge-based and Intelligent Engineering Systems10.3233/KES-16033220:2(97-111)Online publication date: 4-May-2016

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