Adaptive k-means algorithm for overlapped graph clustering.
The graph clustering problem has become highly relevant due to the growing interest of several research communities in social networks and their possible applications. Overlapped graph clustering algorithms try to find subsets of nodes that can belong to different clusters. In social network-based applications it is quite usual for a node of the network to belong to different groups, or communities, in the graph. Therefore, algorithms trying to discover, or analyze, the behavior of these networks needed to handle this feature, detecting and identifying the overlapped nodes. This paper shows a soft clustering approach based on a genetic algorithm where a new encoding is designed to achieve two main goals: first, the automatic adaptation of the number of communities that can be detected and second, the definition of several fitness functions that guide the searching process using some measures extracted from graph theory. Finally, our approach has been experimentally tested using the Eurovision contest dataset, a well-known social-based data network, to show how overlapped communities can be found using our method.
Computer Science Department, Escuela Politecnica Superior, Universidad Autónoma de Madrid, 28049, Madrid, Spain. gema.bello@uam.es
Gema
G
Bello-Orgaz
Héctor D
HD
Menéndez
David
D
Camacho
D000465:Algorithms; D000483:Alleles; D002875:Chromosomes / Q000235:genetics; D016000:Cluster Analysis; D003627:Data Interpretation, Statistical; D016208:Databases, Factual; D005823:Genetics / Q000706:statistics & numerical data; D008957:Models, Genetic; D009154:Mutation; D012944:Social Support