Proceedings Article10.1109/ICDM.2012.122
Topic-Aware Social Influence Propagation Models
Nicola Barbieri,Francesco Bonchi,Giuseppe Manco +2 more
- 10 Dec 2012
- pp 81-90
TL;DR: Novel topic-aware influence-driven propagation models that experimentally result to be more accurate in describing real-world cascades than the standard propagation models studied in the literature are introduced.
read more
Abstract: We study social influence from a topic modeling perspective. We introduce novel topic-aware influence-driven propagation models that experimentally result to be more accurate in describing real-world cascades than the standard propagation models studied in the literature. In particular, we first propose simple topic-aware extensions of the well-known Independent Cascade and Linear Threshold models. Next, we propose a different approach explicitly modeling authoritativeness, influence and relevance under a topic-aware perspective. We devise methods to learn the parameters of the models from a dataset of past propagations. Our experimentation confirms the high accuracy of the proposed models and learning schemes.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Influence Maximization on Social Graphs: A Survey
TL;DR: This paper surveys and synthesizes a wide spectrum of existing studies on IM from an algorithmic perspective, with a special focus on a review of well-accepted diffusion models that capture the information diffusion process and build the foundation of the IM problem.
642
Topic-aware social influence propagation models
TL;DR: Novel topic-aware influence-driven propagation models that are more accurate in describing real-world cascades than the standard (i.e., topic-blind) propagation models studied in the literature are introduced.
388
Online topic-aware influence maximization
Shuo Chen,Ju Fan,Guoliang Li,Jianhua Feng,Kian-Lee Tan,Jinhui Tang +5 more
- 01 Feb 2015
TL;DR: This work proposes a faster topic-sample-based algorithm with e · (1 − 1/e) approximation ratio for any e ∈ (0, 1], which materializes the influence spread of some topic-distribution samples and utilizes the materialized information to avoid computing the actual influence of users with small influences.
A Survey on Information Diffusion in Online Social Networks: Models and Methods
TL;DR: This paper divides the diffusion models into two categories—explanatory models and predictive models—in which the former includes epidemics and influence models and the latter includes independent cascade, linear threshold, and game theory models.
236
Community-diversified influence maximization in social networks
TL;DR: This work proposes a metric to measure the community-diversified influence and addresses a series of computational challenges that have been verified through extensive experimental studies on five real-world social network datasets.
208
References
Latent dirichlet allocation
TL;DR: This work proposes a generative model for text and other collections of discrete data that generalizes or improves on several previous models including naive Bayes/unigram, mixture of unigrams, and Hofmann's aspect model.
•Proceedings Article
Latent Dirichlet Allocation
David M. Blei,Andrew Y. Ng,Michael I. Jordan +2 more
- 03 Jan 2001
TL;DR: This paper proposed a generative model for text and other collections of discrete data that generalizes or improves on several previous models including naive Bayes/unigram, mixture of unigrams, and Hof-mann's aspect model, also known as probabilistic latent semantic indexing (pLSI).
Maximizing the spread of influence through a social network
David Kempe,Jon Kleinberg,Éva Tardos +2 more
- 24 Aug 2003
TL;DR: 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.
An analysis of approximations for maximizing submodular set functions--I
TL;DR: It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.
5.2K
Related Papers (5)
David Kempe,Jon Kleinberg,Éva Tardos +2 more
- 24 Aug 2003
Pedro Domingos,Matthew Richardson +1 more
- 26 Aug 2001
Wei Chen,Yajun Wang,Siyu Yang +2 more
- 28 Jun 2009