Detecting overlapping communities in social networks by game theory and structural equivalence concept

Authors:
Hamidreza Alvari;Sattar Hashemi;Ali Hamzeh
Affiliations:
Department of Electrical and Computer Engineering, Shiraz University, Shiraz, Iran;Department of Electrical and Computer Engineering, Shiraz University, Shiraz, Iran;Department of Electrical and Computer Engineering, Shiraz University, Shiraz, Iran
Venue:
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II
Year:
2011

Citing 9
Cited 1

On network-aware clustering of Web clients

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Self-Organization and Identification of Web Communities

Computer
A Graph Based Approach to Extract a Neighborhood Customer Community for Collaborative Filtering

DNIS '02 Proceedings of the Second International Workshop on Databases in Networked Information Systems
Mining scale-free networks using geodesic clustering

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)

Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)
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
Dynamical Processes on Complex Networks

Dynamical Processes on Complex Networks
A game-theoretic framework to identify overlapping communities in social networks

Data Mining and Knowledge Discovery

Community Detection in Social Networks Using Information Diffusion

ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most complex networks demonstrate a significant property 'community structure', meaning that the network nodes are often joined together in tightly knit groups or communities, while there are only looser connections between them. Detecting these groups is of great importance and has immediate applications, especially in the popular online social networks like Facebook and Twitter. Many of these networks are divided into overlapping communities, i.e. communities with nodes belonging to more than one community simultaneously. Unfortunately most of the works cannot detect such communities. In this paper, we consider the formation of communities in social networks as an iterative game in a multiagent environment, in which, each node is regarded as an agent trying to be in the communities with members structurally equivalent to her. Remarkable results on the real world and benchmark graphs show efficiency of our approach in detecting overlapping communities compared to the other similar methods.