Mining topics on participations for community discovery
Published 24 July 2011
Guo‐qing Zheng, Jinwen Guo, Lichun Yang, Shengliang Xu, Shenghua Bao, Zhong Su
Citations15
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper proposes a general approach of community discovery for u2u-link data, i.e., multiple user data, by placing topical variables on multiple authors' participations in documents by way of a model based on the explicit or implicit assumptions about the users and the textual content.
Abstract
Community discovery on large-scale linked document corpora has been a hot research topic for decades. There are two types of links. The first one, which we call d2d-link, indicates connectiveness among different documents, such as blog references and research paper citations. The other one, which we call u2u-link, represents co-occurrences or simultaneous participations of different users in one document and typically each document from u2u-link corpus has more than one user/author. Examples of u2u-link data covers email archives and research paper co-authorship networks. Community discovery in d2d-link data has achieved much success, while methods for that in u2u-link data either make no use of the textual content of the documents or make oversimplified assumptions about the users and the textual content. In this paper we propose a general approach of community discovery for u2u-link data, i.e., multiple user data, by placing topical variables on multiple authors' participations in documents. Experiments on a research proceeding co-authorship corpus and a New York Times news corpus show the effectiveness of our model.
Keywords
Computer SciencePhysics and Astronomy
Journal of Machine Learning ResearchLatent dirichlet allocation
27,049 Citations2003David M. Blei, Andrew Y. Ng +1 more
IEEE Transactions on Pattern Analysis and Machine IntelligenceNormalized cuts and image segmentation
15,696 Citations2000Jianbo Shi, Jitendra Malik
Proceedings of the National Academy of SciencesCommunity structure in social and biological networks
15,656 Citations2002Michelle Girvan, M. E. J. Newman
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Physical Review EFinding and evaluating community structure in networks
13,892 Citations2004Michelle G. Newman, Michelle Girvan
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
NatureUncovering the overlapping community structure of complex networks in nature and society
5,435 Citations2005Gergely Palla, Imre Derényi +2 more
After defining a set of new characteristic quantities for the statistics of communities, this work applies an efficient technique for exploring overlapping communities on a large scale and finds that overlaps are significant, and the distributions introduced reveal universal features of networks.
Journal of the American Statistical AssociationHierarchical Dirichlet Processes
3,567 Citations2006Yee Whye Teh, Michael I. Jordan +2 more
This work considers problems involving groups of data where each observation within a group is a draw from a mixture model and where it is desirable to share mixture components between groups, and considers a hierarchical model, specifically one in which the base measure for the childDirichlet processes is itself distributed according to a Dirichlet process.
Machine LearningAn Introduction to MCMC for Machine Learning
2,418 Citations2003Christophe Andrieu, Nando de Freitas +2 more
This purpose of this introductory paper is to introduce the Monte Carlo method with emphasis on probabilistic machine learning and review the main building blocks of modern Markov chain Monte Carlo simulation.
Proceedings of the National Academy of SciencesCoauthorship networks and patterns of scientific collaboration
1,948 Citations2004M. E. J. Newman
This work uses data from three bibliographic databases in biology, physics, and mathematics to answer a broad variety of questions about collaboration patterns, such as the numbers of papers authors write, how many people they write them with, and what the typical distance between scientists is through the network.
Journal of the American Statistical AssociationEstimation and Prediction for Stochastic Blockstructures
1,182 Citations2001Krzysztof Nowicki, Tom A. B. Snijders
A statistical approach to a posteriori blockmodeling for digraphs and valueddigraphs is proposed and models are considered where class labels are identified by prior distributions for the class membership of some of the vertices.
Empirical comparison of algorithms for network community detection
933 Citations2010Jure Leskovec, Kevin Lang +1 more
Considering community quality as a function of its size provides a much finer lens with which to examine community detection algorithms, since objective functions and approximation algorithms often have non-obvious size-dependent behavior.
Efficient identification of Web communities
809 Citations2000Gary William Flake, Steve Lawrence +1 more
A focused crawler that crawls to a depth can approximate community membership by augmenting the graph induced by the cra wl with links to a virtual sink node.
Probabilistic author-topic models for information discovery
581 Citations2004Mark Steyvers, Padhraic Smyth +2 more
The methodology is applied to a large corpus of 160,000 abstracts and 85,000 authors from the well-known CiteSeer digital library, and a model with 300 topics is learned using a Markov chain Monte Carlo algorithm.
Journal of Artificial Intelligence ResearchTopic and Role Discovery in Social Networks with Experiments on Enron and Academic Email
447 Citations2007Andrew McCallum, Xingyu Wang +1 more
The Author-Recipient-Topic model for social network analysis, which learns topic distributions based on the direction-sensitive messages sent between entities, is presented and results are given, providing evidence not only that clearly relevant topics are discovered, but that the ART model better predicts people's roles and gives lower perplexity on previously unseen messages.
Proceedings of the National Academy of SciencesMixed-membership models of scientific publications
445 Citations2004Elena A. Erosheva, Stephen E. Fienberg +1 more
This work explores an internal soft-classification structure of articles based only on semantic decompositions of abstracts and bibliographies of PNAS articles, and compares it with the formal discipline classifications.
The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity
439 Citations2000David Cohn, Thomas Hofmann
A joint probabilistic model for modeling the contents and inter-connectivity of document collections such as sets of web pages or research paper archives is described, based on a Probabilistic factor decomposition.
Facetnet
404 Citations2008Yu‐Ru Lin, Yün Chi +3 more
This paper proposes FacetNet, a novel framework for analyzing communities and their evolutions through a robust unified process, where communities not only generate evolutions, they also are regularized by the temporal smoothness of evolutions.
Topic modeling with network regularization
396 Citations2008Qiaozhu Mei, Deng Cai +2 more
A novel solution to the problem of topic modeling with network structure (TMN) is proposed, which regularizes a statistical topic model with a harmonic regularizer based on a graph structure in the data.
Topic-link LDA
286 Citations2009Yan Liu, Alexandru Niculescu-Mizil +1 more
A Bayesian hierarchical approach is developed that performs topic modeling and author community discovery in one unified framework and is demonstrated on two blog data sets in different domains and one research paper citation data from CiteSeer.
Proceedings of the National Academy of SciencesA method for finding communities of related genes
244 Citations2004Dennis M. Wilkinson, Bernardo A. Huberman
The details of the method for creating a network of gene co-occurrences from the literature and partitioning it into communities of related genes are explained and the results are useful.
Probabilistic models for discovering e-communities
239 Citations2006Ding Zhou, Eren Manavoglu +3 more
Experimental studies on Enron email corpus show that the proposed generative Bayesian models for semantic community discovery in SNs successfully detects the communities of individuals and in addition provides semantic topic descriptions of these communities.
Communities from seed sets
207 Citations2006Reid Andersen, Kevin Lang
This work shows how to adapt recent results from theoretical computer science to expand a seed set into a community with small conductance and a strong relationship to the seed, while examining only a small neighborhood of the entire graph.
An Efficient Spectral Algorithm for Network Community Discovery and Its Applications to Biological and Social Networks
137 Citations2007Jianhua Ruan, Weixiong Zhang
This paper presents an efficient spectral algorithm for modularity optimization and successfully applied this algorithm to detect interesting and meaningful community structures from real-world networks in different domains, including biology, medicine and social science.
Discovering Latent Classes in Relational Data
82 Citations2004Charles Kemp, Thomas L. Griffiths +1 more
A domain-general framework for learning abstract relational knowledge, which goes beyond previous category-learning models in psychology and applies in two specific domains: learning the structure of kinship systems and learning causal theories.
Scalable community discovery on textual data with relations
67 Citations2008Huajing Li, Zaiqing Nie +3 more
A hierarchical community model is proposed in the paper which distinguishes community cores from affiliated members and has high scalability to corpus size and feature dimensionality, with more than 15 topical precision improvement compared with popular clustering techniques.
A new Mallows distance based metric for comparing clusterings
57 Citations2005Ding Zhou, Jia Li +1 more
This paper proposes a measure for comparing clustering results to tackle two issues insufficiently addressed or even overlooked by existing methods: taking into account the distance between cluster representatives when assessing the similarity of clusters results and constructing a unified framework for defining a distance based on either hard or soft clustering.
Topic and role discovery in social networks with experiments on enron and academic email
46 Citations2007McCallumAndrew, WangXuerui +1 more
Lecture notes in computer scienceJoint Group and Topic Discovery from Relations and Text
30 Citations2008Andrew McCallum, Xuerui Wang +1 more
The Group-Topic model's joint inference improves both the groups and topics discovered, and a non-Markov continouous-time group model to capture shifting group structure over time is presented.