Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Detection of Overlapping Communities in Dynamical Social Networks
SOCIALCOM '10 Proceedings of the 2010 IEEE Second International Conference on Social Computing
Automated community detection on social networks: useful? efficient? asking the users
Proceedings of the 4th International Workshop on Web Intelligence & Communities
| Hi-index | 0.00 |
Community detection in social networks is a well-known problem encountered in many fields. Many traditional algorithms have been proposed to solve it, with recurrent problems: impossibility to deal with dynamic networks, sensitivity to noise, no detection of overlapping communities, exponential running time. This paper proposes a multi-agent system that replays the evolution of a network and, in the same time, reproduces the rise and fall of communities. After presenting the strengths and weaknesses of existing community detection algorithms, we describe the multi-agent system we propose. Then, we compare our solution with existing works, and show some advantages of our method, in particular the possibility to dynamically detect the communities.