FRINGE: a new approach to the detection of overlapping communities in graphs

Authors:
Camilo Palazuelos;Marta Zorrilla
Affiliations:
Mathematics, Statistics and Computation Department, University of Cantabria, Santander, Spain;Mathematics, Statistics and Computation Department, University of Cantabria, Santander, Spain
Venue:
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Year:
2011

Citing 9
Cited 4

Mining knowledge-sharing sites for viral marketing

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
CFinder: locating cliques and overlapping modules in biological networks

Bioinformatics
Detecting functional modules in the yeast protein--protein interaction network

Bioinformatics
An Algorithm to Find Overlapping Community Structure in Networks

PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
A Fast Algorithm to Find Overlapping Communities in Networks

ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Discovering leaders from community actions

Proceedings of the 17th ACM conference on Information and knowledge management
Overlapped community detection in complex networks

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Overlapping Communities Generation for Online Support Forums

ICAIS '09 Proceedings of the 2009 International Conference on Adaptive and Intelligent Systems
Overlapping Community Detection by Collective Friendship Group Inference

ASONAM '10 Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining

Moving towards a socially-driven internet architectural design

ACM SIGCOMM Computer Communication Review
Analysis of social metrics in dynamic networks: measuring the influence with FRINGE

Proceedings of the 2012 Joint EDBT/ICDT Workshops
A Method for Local Community Detection by Finding Core Nodes

ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
W-entropy method to measure the influence of the members from social networks

International Journal of Web Engineering and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Currently, there is a growing interest in identifying communities in social networks. Although there are many algorithms that suitably resolve this problem, they do not properly find overlaps among communities. This paper describes a new approach to the detection of overlapping communities based on the ideas of friendship and leadership, using a new centrality measure, called extended degree. We describe the algorithm in detail and discuss its results in comparison to CFinder, a well-known algorithm for finding overlapping communities. These results show that our proposal behaves well in networks with a clear leadership relationship, in addition it not only returns the overlapping communities detected but specifies their leaders as well.