Cascade-based community detection

  title={Cascade-based community detection},
  author={Nicola Barbieri and Francesco Bonchi and G. Manco},
  journal={Proceedings of the sixth ACM international conference on Web search and data mining},
  • Nicola BarbieriF. BonchiG. Manco
  • Published 4 February 2013
  • Computer Science
  • Proceedings of the sixth ACM international conference on Web search and data mining
Given a directed social graph and a set of past informa- tion cascades observed over the graph, we study the novel problem of detecting modules of the graph (communities of nodes), that also explain the cascades. Our key observation is that both information propagation and social ties forma- tion in a social network can be explained according to the same latent factor, which ultimately guide a user behavior within the network. Based on this observation, we propose the Community-Cascade Network… 

Figures and Tables from this paper

Influence-Based Network-Oblivious Community Detection

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.

Efficient Methods for Influence-Based Network-Oblivious Community Detection

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.

NetCodec: Community Detection from Individual Activities

This paper parametrize the network infectivity in terms of individuals’ participation in communities and the popularity of each individual, and utilizes Bayesian variational inference to design NetCodec, an efficient inference algorithm which is verified with both synthetic and real world data sets.

Community Detection Using Diffusion Information

The proposed method, community diffusion (CoDi), does not require any prior knowledge about the network structure or specific properties of communities, and this method is able to identify the hidden communities.

CSI: Community-Level Social Influence Analysis

The evaluation on various datasets suggests the effectiveness of the proposed approach in modeling information propagation at the level of communities, and enables to detect interesting patterns of influence, such as the communities that play a key role in the overall diffusion process, or that are likely to start information cascades.

Detecting Communities of Authority and Analyzing Their Influence in Dynamic Social Networks

This article addresses the problems of detecting communities of authority and of estimating the influence of such communities in dynamic social networks, and proposes a new model based on the Granger causality method.

Hierarchical Community-Level Information Diffusion Modeling in Social Networks

The notion of users' topic popularity is introduced as to enable theHCID model to depict the information diffusion process which is both topic-aware and source-aware, and uni-directional from the higher levels to the lower ones.

Description-Driven Community Detection

An effective algorithm that alternates between two phases: a hill-climbing phase producing (possibly overlapping) communities, and a description induction phase which uses techniques from supervised pattern set mining, which makes it very flexible and easily applicable in real-world applications.

When Less is More: Systematic Analysis of Cascade-based Community Detection

This article conducts a systematic and extensive analysis of the following problem: Given only the infection times, find communities of highly interconnected nodes and shows that some well-known community detection algorithms can be enhanced by including edge weights based on the cascade data.

Mining communities in social network based on information diffusion

Empirical studies on three real‐world social networks show that the DC_ID algorithm outperforms the benchmark algorithm in runtime, LEW, and CRC, which paves the way for further research on the influence maximization problem based on the detected community structure.



Learning influence probabilities in social networks

This paper proposes models and algorithms for learning the model parameters and for testing the learned models to make predictions, and develops techniques for predicting the time by which a user may be expected to perform an action.

Patterns of Influence in a Recommendation Network

This work investigates a large person-to-person recommendation network, consisting of four million people who made sixteen million recommendations on half a million products, and develops a novel efficient heuristic based on graph isomorphism testing that scales to large datasets.

Affiliation networks

This paper presents the first model that provides a simple, realistic, and mathematically tractable generative model that intrinsically explains all the well-known properties of the social networks, as well as densification and shrinking diameter.

Using content and interactions for discovering communities in social networks

This paper proposes generative models that can discover communities based on the discussed topics, interaction types and the social connections among people and shows that it performs better than existing community discovery models.

Maximizing the spread of influence through a social network

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.

Towards Linear Time Overlapping Community Detection in Social Networks

A fast algorithm, called SLPA, for overlapping community detection in large-scale networks, which can be applied to both unipartite and bipartite networks and is able to uncover overlapping nested hierarchy.

A game-theoretic framework to identify overlapping communities in social networks

The first time the community detection problem is addressed by a game-theoretic framework that considers community formation as the result of individual agents’ rational behaviors, and the algorithm is effective in identifying overlapping communities.

Social influence analysis in large-scale networks

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.

Influence and correlation in social networks

Two simple tests are proposed that can identify influence as a source of social correlation when the time series of user actions is available and are applied to real tagging data on Flickr, exhibiting that while there is significant social correlation in tagging behavior on this system, this correlation cannot be attributed to social influence.

Influence Propagation in Social Networks: A Data Mining Perspective

  • F. Bonchi
  • Computer Science
    2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology
  • 2011
A data mining perspective is taken and what (and how) can be learned from the available traces of past propagations of influence propagation in social networks is discussed.