Genetic clustering of social networks using random walks

Computational Statistics and Data Analysis

Volumn 51, Issue 12, 2007, Pages 6285-6294

  Firat, Aykut ^a   Chatterjee, Sangit ^a   Yilmaz, Mustafa ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Clustering with medoids; Genetic algorithms; Synthetic data generation

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; GENETIC ALGORITHMS; INTEGRATION; SOCIAL ASPECTS;

CLUSTERING WITH MEDOIDS; SOCIAL NETWORK; SYNTHETIC DATA GENERATION;

RANDOM PROCESSES;

EID: 34547235161     PISSN: 01679473     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.csda.2007.01.010     Document Type: Article

References (20)

1. Barabási A. Network Theory-the emergence of the creative enterprise. Science 308 (2005) 29
2. Borgatti S.P., and Everett M.G. Network analysis of 2-mode data. Social Networks 19 (1997) 243-269
3. Chatterjee S., Laudato M., and Lynch L.A. Genetic algorithms and their statistical applications: an introduction. Comput. Statist. Data Anal. 22 (1996) 633-651
4. Falkenauer E. Genetic Algorithms and Grouping Problems (1998), Wiley, Indianapolis, IN
5. Freeman L.C. Finding groups with a simple genetic algorithm. J. Math. Sociol. 17 3 (1993) 227-241
6. Freeman L.C. Finding social groups: a meta-analysis of the southern women data. In: Ronald B., Kathleen C., and Philippa P. (Eds). Dynamic Social Network Modeling and Analysis (2003), National Academy Press, Washington, DC
7. Fouss, F., Pirotte, A., Renders, J-M., Saerens, M., 2005. Markov-chain computation of similarities between nodes of a graph, with application to collaborative filtering. 〈http://www.isys.ucl.ac.be/staff/marco/Publications/Saerens2005a.pdf〉.
8. Hagen, L., Kahng, A., 1992. A new approach to effective circuit clustering. In: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 422-427.
9. Harel D., and Koren Y. On clustering using random walks. Lecture Notes in Compu. Sci. 2245 (2001) 8-41
10. Jain A.K., Murty M.N., and Flynn P.J. Data clustering: a review. ACM Computing Surveys 31 3 (1999) 264-323
11. Milgram S. The small world problem. Psychol. Today (1967) 60-67
12. Norris J. Markov chains (1997), Cambridge University Press, Cambridge
13. Nv2D, 2005. Graph Visualization and Layout Software, 〈http://web.mit.edu/bshi/Public/nv2d/〉.
14. Pattarin F., Paterlini S., and Minerva T. Clustering financial time series: an application to mutual funds style analysis. Comput. Statist. Data Anal. 47 (2004) 353-372
15. Saerens, M., Fouss, F., 2004. Computing Similarities Between Nodes of a Graph: Application to Collaborative Filtering, Submitted for publication.
16. Saerens, M., Fouss, F., Yen, L., Dupont, P., 2004. The principal components analysis of a graph, and its relationships to spectral clustering. In: Proceeding of the 15th European Conference on Machine Learning (ECML), pp. 371-383.
17. Tsvetovat, M., Carley, K.M., 2005. Generation of realistic social network datasets for testing of analysis and simulation tools. In: Carnegie Mellon University ISRI Technical Reports Series, CMU-ISRI-05-130.
18. Van Dongen, S.M., 2002. Graph clustering by flow simulation, Ph.D. Thesis, University of Utrecht, May.
19. Watts D.J., and Strogatz S.H. Collective dynamics of 'small-world' networks. Nature 393 (1998) 440-442
20. Yen, L., Vanvyve, D., Wouters, F., Fouss, F., Verleysen, M., Saerens, M., 2005. Clustering using a random walk based distance measure. In: Proceedings of the 13th Symposium on Artificial Neural Networks (ESANN 2005), pp. 317-324.