Genetic clustering of social networks using random walks

被引:35
作者
Firat, Aykut [1 ]
Chatterjee, Sangit [1 ]
Yilmaz, Mustafa [1 ]
机构
[1] Northeastern Univ, Coll Business Adm, Boston, MA 02115 USA
关键词
genetic algorithms; clustering with medoids; synthetic data generation;
D O I
10.1016/j.csda.2007.01.010
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In the era of globalization, traditional theories and models of social systems are shifting their focus from isolation and independence to networks and connectedness. Analyzing these new complex social models is a growing, and computationally demanding area of research. In this study, we investigate the integration of genetic algorithms (GAs) with a random-walk-based distance measure to find subgroups in social networks. We test our approach by synthetically generating realistic social network data sets. Our clustering experiments using random-walk-based distances reveal exceptionally accurate results compared with the experiments using Euclidean distances. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:6285 / 6294
页数:10
相关论文
共 20 条
[1]  
BARABASI A, 2005, SCIENCE, V308, P29
[2]   Network analysis of 2-mode data [J].
Borgatti, SP ;
Everett, MG .
SOCIAL NETWORKS, 1997, 19 (03) :243-269
[3]   Genetic algorithms and their statistical applications: An introduction [J].
Chatterjee, S ;
Laudato, M ;
Lynch, LA .
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 1996, 22 (06) :633-651
[4]  
Falkenauer E., 1998, GENETIC ALGORITHMS G
[5]  
FOUSS F, 2005, MARKOV CHAIN COMPUTA
[6]   FINDING GROUPS WITH A SIMPLE GENETIC ALGORITHM [J].
FREEMAN, LC .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 1993, 17 (04) :227-241
[7]  
Freeman LC, 2003, DYNAMIC SOCIAL NETWORK MODELING AND ANALYSIS, P39
[8]  
HAGEN L, 1992, P IEEE INT C COMP AI, P422
[9]  
HAREL D, 2001, LECT NOTES COMPU SCI, V2245, P8
[10]   Data clustering: A review [J].
Jain, AK ;
Murty, MN ;
Flynn, PJ .
ACM COMPUTING SURVEYS, 1999, 31 (03) :264-323