By Topic

MEP — A robust algorithm for detecting communities in large scale social networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hedia Zardi ; MARS Research Group, Faculty of Sciences of Monastir University of Monastir, Tunisia ; Lotfi Ben Romdhane

Social networks can be modeled by graphs whose vertices represent the actors of the social phenomenon and the edges represent the interactions between them. An important element in the automatic analysis of social networks is the discovery of “communities”. A community is simply a group of people strongly connected. The detection of communities in social networks is equivalent to partitioning the graph representing the network. Among the methods to solve this problem, there are those that consist in defining a function that associates a quality index to any partition graph. In this case, the graph partitioning algorithm aims at optimizing this function. In this work, we define a new function that qualifies a partition and we present an algorithm that optimizes this function in order to find, within a reasonable time, the partition with the best measure of quality.

Published in:

Sciences of Electronics, Technologies of Information and Telecommunications (SETIT), 2012 6th International Conference on

Date of Conference:

21-24 March 2012