Proceedings Article10.1109/ICDM.2013.164
Influence-Based Network-Oblivious Community Detection
Nicola Barbieri,Francesco Bonchi,Giuseppe Manco +2 more
- 01 Dec 2013
- pp 955-960
53
TL;DR: Two models are defined: the extension to the community level of the classic (discrete time) Independent Cascade model, and a model that focuses on the time delay between adoptions that is the first work studying community detection without the network.
read more
Abstract: How can we detect communities when the social graphs is not available? We tackle this problem by modeling social contagion from a log of user activity, that is a dataset of tuples (u, i, t) recording the fact that user u "adopted" item i at time t. This is the only input to our problem. We propose a stochastic framework which assumes that item adoptions are governed by un underlying diffusion process over the unobserved social network, and that such diffusion model is based on community-level influence. By fitting the model parameters to the user activity log, we learn the community membership and the level of influence of each user in each community. This allows to identify for each community the "key" users, i.e., the leaders which are most likely to influence the rest of the community to adopt a certain item. The general framework can be instantiated with different diffusion models. In this paper we define two models: the extension to the community level of the classic (discrete time) Independent Cascade model, and a model that focuses on the time delay between adoptions. To the best of our knowledge, this is the first work studying community detection without the network.
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
Community Detection on Large Complex Attribute Network
Chen Zhe,Aixin Sun,Xiaokui Xiao +2 more
- 25 Jul 2019
TL;DR: A framework named AGGMMR is proposed to effectively address the challenges come from scalability, mixed attributes, and incomplete value and is evaluated on four benchmark datasets against five strong baselines to demonstrate its effectiveness and practicability.
59
Detecting Changes in Dynamic Events Over Networks
Shuang Li,Yao Xie,Mehrdad Farajtabar,Apurv Verma,Le Song +4 more
- 21 Apr 2017
TL;DR: This paper derives the likelihood ratios for point processes, which are computed efficiently via an expectation-maximization (EM) like algorithm that is parameter free and can be computed in a distributed manner, and derives a highly accurate theoretical characterization of the false-alarm rate.
51
Measuring Influence on Instagram: A Network-Oblivious Approach
Noam Segev,Noam Avigdor,Eytan Avigdor +2 more
- 27 Jun 2018
TL;DR: In this paper, the authors focus on the problem of scoring and ranking influential users of Instagram, a visual content sharing online social network (OSN), focusing on a network oblivious approach and show that the graph-based approach used in other OSNs is a poor fit for Instagram.
35
Inf-VAE: A Variational Autoencoder Framework to Integrate Homophily and Influence in Diffusion Prediction
TL;DR: A novel variational autoencoder framework (Inf-VAE) to jointly embed homophily and influence through proximity-preserving social and position-encoded temporal latent variables and achieves massive gains for users with sparse activities, and users who lack direct social neighbors in seed sets.
31
Efficient Methods for Influence-Based Network-Oblivious Community Detection
TL;DR: A stochastic framework that assumes that the adoption of items is governed by an underlying diffusion process over the unobserved social network and that such a diffusion model is based on community-level influence, which aims at modeling communities through the lenses of social contagion.
23
References
Community detection in graphs
TL;DR: A thorough exposition of community structure, or clustering, is attempted, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists.
Community detection in graphs
TL;DR: A thorough exposition of the main elements of the clustering problem can be found in this paper, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.
8.4K
Related Papers (5)
David Kempe,Jon Kleinberg,Éva Tardos +2 more
- 24 Aug 2003
Manuel Gomez Rodriguez,Jure Leskovec,Andreas Krause +2 more
- 25 Jul 2010
Amit Goyal,Francesco Bonchi,Laks V. S. Lakshmanan +2 more
- 04 Feb 2010
David Easley,Jon Kleinberg +1 more
- 01 Jan 2010