Community Level Diffusion Extraction
Published 27 May 2015
Zhiting Hu, Junjie Yao, Bin Cui, Eric P. Xing
Citations55
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
A new approach, i.e., COmmunity Level Diffusion (COLD), to uncover and explore temporal diffusion, model topics and communities in a unified latent framework, and extract inter-community influence dynamics.
Abstract
How does online content propagate on social networks? Billions of users generate, consume, and spread tons of information every day. This unprecedented scale of dynamics becomes invaluable to reflect our zeitgeist. However, most present diffusion extraction works have only touched individual user level and cannot obtain comprehensive clues.
Keywords
Computer SciencePhysics and Astronomy
Journal of Machine Learning ResearchLatent dirichlet allocation
27,049 Citations2003David M. Blei, Andrew Y. Ng +1 more
Sociological TheoryThe Strength of Weak Ties: A Network Theory Revisited
8,177 Citations1983Mark Granovetter
Maximizing the spread of influence through a social network
7,314 Citations2003David Kempe, Jon Kleinberg +1 more
An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Proceedings of the National Academy of SciencesFinding scientific topics
6,017 Citations2004Thomas L. Griffiths, Mark Steyvers
A generative model for documents is described, introduced by Blei, Ng, and Jordan, and a Markov chain Monte Carlo algorithm is presented for inference in this model, which is used to analyze abstracts from PNAS by using Bayesian model selection to establish the number of topics.
The structure and function of communication in society
2,266 Citations2007Harold D. Lasswell
Marketing LettersTalk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth
1,995 Citations2001Jacob Goldenberg, Barak Libai +1 more
The results clearly indicate that information dissemination is dominated by both weak and strong w-o-m, rather than by advertising, which means that strong and weak ties become the main forces propelling growth.
Proceedings of the VLDB EndowmentDistributed GraphLab
1,673 Citations2012Yucheng Low, Danny Bickson +4 more
This paper develops graph based extensions to pipelined locking and data versioning to reduce network congestion and mitigate the effect of network latency, and introduces fault tolerance to the GraphLab abstraction using the classic Chandy-Lamport snapshot algorithm.
The link prediction problem for social networks
1,608 Citations2003David Liben‐Nowell, Jon Kleinberg
Experiments on large co-authorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures.
Meme-tracking and the dynamics of the news cycle
1,547 Citations2009Jure Leskovec, Lars Bäckström +1 more
This work develops a framework for tracking short, distinctive phrases that travel relatively intact through on-line text; developing scalable algorithms for clustering textual variants of such phrases, and identifies a broad class of memes that exhibit wide spread and rich variation on a daily basis.
PubMedMixed Membership Stochastic Blockmodels.
1,526 Citations2008Edoardo M. Airoldi, David M. Blei +2 more
This paper describes a latent variable model of such data called the mixed membership stochastic blockmodel, which extends blockmodels for relational data to ones which capture mixed membership latent relational structure, thus providing an object-specific low-dimensional representation.
Topics over time
1,132 Citations2006Xuerui Wang, Andrew McCallum
An LDA-style topic model is presented that captures not only the low-dimensional structure of data, but also how the structure changes over time, showing improved topics, better timestamp prediction, and interpretable trends.
Patterns of temporal variation in online media
994 Citations2011Jaewon Yang, Jure Leskovec
This work develops the K-Spectral Centroid (K-SC) clustering algorithm that effectively finds cluster centroids with the authors' similarity measure and presents a simple model that reliably predicts the shape of attention by using information about only a small number of participants.
Who says what to whom on twitter
952 Citations2011Shaomei Wu, Jake M. Hofman +2 more
A striking concentration of attention is found on Twitter, in that roughly 50% of URLs consumed are generated by just 20K elite users, where the media produces the most information, but celebrities are the most followed.
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.
ACM Computing SurveysOverlapping community detection in networks
917 Citations2013Jierui Xie, Stephen Kelley +1 more
A framework is proposed for evaluating algorithms' ability to detect overlapping nodes, which helps to assess overdetection and underdetection, and for low overlapping density networks, SLPA, OSLOM, Game, and COPRA offer better performance than the other tested algorithms.
Social influence analysis in large-scale networks
909 Citations2009Jie Tang, Jimeng Sun +2 more
Topical Affinity Propagation (TAP) is designed with efficient distributed learning algorithms that is implemented and tested under the Map-Reduce framework and can take results of any topic modeling and the existing network structure to perform topic-level influence propagation.
arXiv (Cornell University)Overlapping Community Detection in Networks: the State of the Art and Comparative Study
885 Citations2011Jierui Xie, Stephen Kelley +1 more
ACM SIGMOD RecordInformation diffusion in online social networks
848 Citations2013Adrien Guille, Hakim Hacid +2 more
A survey of representative methods dealing with information diffusion in social networks and a taxonomy that summarizes the state-of-the-art is proposed, intended to help researchers in quickly understanding existing works and possible improvements to bring.
Influence maximization
739 Citations2014Youze Tang, Xiaokui Xiao +1 more
TIM is presented, an algorithm that aims to bridge the theory and practice in influence maximization and outperforms the state-of-the-art solutions (with approximation guarantees) by up to four orders of magnitude in terms of running time.
Relational Topic Models for Document Networks
485 Citations2009Jonathan Chang, David M. Blei
The relational topic model (RTM) is developed, a model of documents and the links between them that derives efficient inference and learning algorithms based on variational methods and evaluates the predictive performance of the RTM for large networks of scientific abstracts and web documents.
Joint latent topic models for text and citations
413 Citations2008Ramesh Nallapati, Amr Ahmed +2 more
This work addresses the problem of joint modeling of text and citations in the topic modeling framework with two different models called the Pairwise-Link-LDA and the Link-PLSA-Lda models, which combine the LDA and PLSA models into a single graphical model.
Combining link and content for community detection
377 Citations2009Tianbao Yang, Rong Jin +2 more
A discriminative model for combining the link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web is proposed and introduced and hidden variables are introduced to explicitly model the popularity of nodes.
LCARS
330 Citations2013Hongzhi Yin, Yizhou Sun +3 more
LCARS is proposed, a location-content-aware recommender system that offers a particular user a set of venues or events by giving consideration to both personal interest and local preference, and a scalable query processing technique is developed by extending the classic Threshold Algorithm.
Rise and fall patterns of information diffusion
313 Citations2012Yasuko Matsubara, Yasushi Sakurai +3 more
The SpikeM model accurately and succinctly describes all the patterns of the rise-and-fall spikes in these real datasets and enables further analytics tasks such as fore- casting, spotting anomalies, and interpretation by reverse- engineering the system parameters of interest.
Efficient community detection in large networks using content and links
306 Citations2013Yiye Ruan, David Fuhry +1 more
A measure of signal strength between two nodes in the network is introduced by fusing their link strength with content similarity, and a biased edge sampling procedure which retains edges that are locally relevant for each graph node is presented.
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.
Synthesis lectures on data mining and knowledge discoveryCommunity Detection and Mining in Social Media
282 Citations2010Lei Tang, Huan Liu
This book discusses graph-based community detection techniques and many important extensions that handle dynamic, heterogeneous networks in social media, and demonstrates how discovered patterns of communities can be used for social media mining.
Mining topic-level influence in heterogeneous networks
249 Citations2010Lu Liu, Jie Tang +3 more
A generative graphical model is proposed which utilizes the heterogeneous link information and the textual content associated with each node in the network to mine topic-level direct influence and a topic- level influence propagation and aggregation algorithm is proposed to derive the indirect influence between nodes.
Unsupervised prediction of citation influences
240 Citations2007Laura Dietz, Steffen Bickel +1 more
A probabilistic topic model is devised that explains the generation of documents and incorporates the aspects of topical innovation and topical inheritance via citations, and its ability to predict the strength of influence of citations against manually rated citations is evaluated.
Institutional Knowledge (InK) - Institutional Knowledge at Singapore Management University (Singapore Management University)Finding Bursty Topics from Microblogs
231 Citations2012Qiming Diao, Jing Jiang +2 more
A topic model that simultaneously captures two observations is proposed that helps find event-driven posts on microblogs and helps identify and filter out "personal" posts.
Mining structural hole spanners through information diffusion in social networks
166 Citations2013Tiancheng Lou, Jie Tang
This work precisely defines the problem of mining top-k structural hole spanners in large-scale social networks and provides an objective (quality) function to formalize the problem and proposes an efficient algorithm with provable approximation guarantees to solve the problem.
Facebook Marketing: An Hour a Day
113 Citations2010Chris Treadaway, Mari Smith
This book discusses how Facebook Works in Different Organizations, how to develop a Facebook Strategy and Measure Success, and some Final Tips on Facebook for B2B Marketing.
Lecture notes in computer scienceModeling Documents by Combining Semantic Concepts with Unsupervised Statistical Learning
85 Citations2008Chaitanya Chemudugunta, America Holloway +2 more
A probabilistic modeling framework that combines both human-defined concepts and data-driven topics in a principled manner is proposed that leads to better language models than can be obtained with either alone.
Whom to mention
82 Citations2013Beidou Wang, Can Wang +5 more
An in-depth study of mention mechanism and a recommendation scheme to solve the essential question of whom to mention in a tweet are presented and the advantage of the proposed algorithm compared with the traditional recommendation methods is demonstrated.
A unified model for stable and temporal topic detection from social media data
71 Citations2013Hongzhi Yin, Bin Cui +3 more
The proposed unified user-temporal mixture model enhanced with the spatial regularization and the burst-weighted smoothing scheme significantly outperforms competitor approaches, in terms of topic detection accuracy and discrimination in stable and temporal topics.
Scalable text and link analysis with mixed-topic link models
56 Citations2013Yaojia Zhu, Xiaoran Yan +2 more
This paper combines classic ideas in topic modeling with a variant of the mixed-membership block model recently developed in the statistical physics community, and has the advantage that its parameters, including the mixture of topics of each document and the resulting overlapping communities, can be inferred with a simple and scalable expectation-maximization algorithm.
Information cascade at group scale
41 Citations2013Milad Eftekhar, Yashar Ganjali +1 more
This paper proposes a fine-grained model of information diffusion for the group-based problem, shows that the process is submodular and presents an algorithm to determine the influential groups under this model (with a precise approximation bound), and demonstrates that seeding members of selected groups to be the first adopters can broaden diffusion.
Extracting social events for learning better information diffusion models
30 Citations2013Shuyang Lin, Fengjiao Wang +2 more
A LADP (Latent Action Diffusion Path) model is proposed to incorporate the information diffusion model with the model of external trends, and an EM-based algorithm is designed to infer the diffusion probabilities, the external trends and the sources of events efficiently.
arXiv (Cornell University)Understanding the Interaction between Interests, Conversations and Friendships in Facebook
8 Citations2018Qirong Ho, Rong Yan +2 more
This paper explores salient questions about user interests, conversations and friendships in the Facebook social network, using a novel latent space model that integrates several data types, allowing for the interplay between user friendships, interests, and higher-order network-wide social trends on Facebook.