550 citations · 718 across the 45 of their papers we have counts for
5 papers · 1 filter
MONSTOR: An Inductive Approach for Estimating and Maximizing Influence over Unseen Networks
Jihoon Ko, Kyuhan Lee, Kijung Shin +1
Influence maximization (IM) is one of the most important problems in social network analysis. Its objective is to find a given number of seed nodes that maximize the spread of info…
GI-OHMS: Graphical Inference to Detect Overlapping Communities
Nasheen Nur, Wenwen Dou, Xi Niu +2
Discovery of communities in complex networks is a topic of considerable recent interest within the complex systems community. Due to the dynamic and rapidly evolving nature of larg…
Ensemble-based Overlapping Community Detection using Disjoint Community Structures
Tanmoy Chakraborty, Saptarshi Ghosh, Noseong Park
While there has been a plethora of approaches for detecting disjoint communities from real-world complex networks, some methods for detecting overlapping community structures have…
Ensemble-Based Discovery of Disjoint, Overlapping and Fuzzy Community Structures in Networks
Tanmoy Chakraborty, Noseong Park
Though much work has been done on ensemble clustering in data mining, the application of ensemble methods to community detection in networks is in its infancy. In this paper, we pr…
Ensemble-Based Algorithms to Detect Disjoint and Overlapping Communities in Networks
Tanmoy Chakraborty, Noseong Park, V. S. Subrahmanian
Given a set of community detection algorithms and a graph as inputs, we propose two ensemble methods and that (respectively) ide…