Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach

Neurocomputing

Volumn 73, Issue 7-9, 2010, Pages 1142-1163

  Rossi, Fabrice ^a   Villa Vialaneix, Nathalie ^b,c  

^a INSTITUT TELECOM   (France)

^b UNIVERSITÉ DE TOULOUSE   (France)

^c IUT STID (Carcassonne)   (France)

Author keywords

Clustering; Deterministic annealing; Graph; Modularity; Self organizing maps; Social network

Indexed keywords

CLASSICAL SOLUTIONS; CLUSTERINGS; COMPARATIVE STUDIES; DETERMINISTIC ANNEALING; GRAPH CLUSTERING; GRAPH LAYOUT ALGORITHMS; GRAPH REPRESENTATION; REAL-WORLD GRAPHS; SOCIAL NETWORKS;

CONFORMAL MAPPING; RAPID THERMAL ANNEALING; STANDARDIZATION;

SELF ORGANIZING MAPS;

ALGORITHM; ANALYTIC METHOD; ARTICLE; CLUSTER ANALYSIS; COMPARATIVE STUDY; DATA ANALYSIS; DETERMINISTIC ANNEALING; GRAPH; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; PLOTS AND CURVES; PRIORITY JOURNAL; PROCESS OPTIMIZATION;

EID: 77949262999     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2009.11.023     Document Type: Article

References (55)

1. Becker A., and Cleveland S. Brushing scatterplots. Technometrics 29 2 (1987) 127-142
2. Bishop C.M., Svensén M., and Williams C.K.I. GTM: the generative topographic mapping. Neural Computation 10 1 (1998) 215-234
3. Blondel V.D., Guillaume J.-L., Lambiotte R., and Lefebvre E. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008 10 (2008) P10008 (12pp)
4. Boulet R., Jouve B., Rossi F., and Villa N. Batch kernel som and related Laplacian methods for social network analysis. Neurocomputing 71 7-9 (2008) 1257-1273
5. R. Bourqui, D. Auber, P. Mary, How to draw clusteredweighted graphs using a multilevel force-directed graph drawing algorithm, in: Proceedings of the 11th International Conference Information Visualization, 2007, IV'07, July 2007, pp. 757-764, doi: 10.1109/IV.2007.65.
6. Butts C.T. Network: a package for managing relational data in r. Journal of Statistical Software 24 2 (2008). http://www.jstatsoft.org/v24/i02/ 〈http://www.jstatsoft.org/v24/i02/〉
7. Cerny V. A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications 45 1 (1985) 41-51
8. G. Csardi, T. Nepusz, The igraph software package for complex network research, InterJournal, Complex Systems 1695 (2006) 〈http://igraph.sf.net〉.
9. Di Battista G., Eades P., Tamassia R., and Tollis I.G. Graph Drawing: Algorithms for the Visualization of Graphs (1999), Prentice-Hall, Englewood Cliffs, NJ
10. Duch J., and Arenas A. Community identification using extremal optimization. Physical Review E 72 027104 (2005)
11. Eades P., Feng Q.-W., Lin X., and Nagamochi H. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica 44 1 (2006) 1-32
12. Fabrikant S., Montello D., Ruocco M., and Middleton R. The distance-similarity metaphor in network-display spatializations. Cartography and Geographic Information Science 31 4 (2004) 237-252
13. Fortunato S., and Barthélemy M. Resolution limit in community detection. Proceedings of the National Academy of Sciences 104 1 (2007) 36-41. http://www.pnas.org/content/104/1/36.abstract 10.1073/pnas.0605965104 URL: 〈http://www.pnas.org/content/104/1/36.abstract〉
14. F. Fouss, A. Pirotte, J.-M. Renders, M. Saerens, Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation, IEEE Transactions on Knowledge and Data Engineering, March 2007, pp. 355-369.
15. Fruchterman T.M., and Reingold E.M. Graph drawing by force-directed placement. Software-Practice and Experience 21 11 (1991) 1129-1164
16. Golub G.H., and van Loan C.F. Matrix Computations. third ed. (1996), Johns Hopkins University Press, Baltimore, MD
17. Graepel T., Burger M., and Obermayer K. Phase transitions in stochastic self-organizing maps. Physical Review E 56 4 (1997) 3876-3890
18. Graepel T., Burger M., and Obermayer K. Self-organizing maps: generalizations and new optimization techniques. Neurocomputing 21 (1998) 173-190
19. Guimera R., Danon L., Diaz-Guilera A., Giralt F., and Arenas A. Self-similar community structure in a network of human interactions. Physical Review E 68 065103(R) (2003)
20. B. Hammer, A. Hasenfuss, F. Rossi, M. Strickert, Topographic processing of relational data, in: Proceedings of the 6th International Workshop on Self-Organizing Maps (WSOM 07), Bielefeld (Germany), September 2007, ISBN: 978-3-00-022473-7.
21. Herman I., Melançon G., and Scott Marshall M. Graph visualization and navigation in information visualisation. IEEE Transactions on Visualization and Computer Graphics 6 1 (2000) 24-43
22. Hofmann T., and Buhmann J.M. Pairwise data clustering by deterministic annealing. IEEE Transactions on Pattern Analysis and Machine Intelligence 19 1 (1997) 1-14
23. Jaakkola T. Tutorial on variational approximation methods. In: Opper M., and Saad D. (Eds). Advanced Mean Field Methods: Theory and Practice (2000), MIT Press, Cambridge 129-159
24. S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi, Optimization by simulated annealing, Science 220(4598) (1983) 671-680.
25. Knuth D. The Stanford GraphBase: A Platform for Combinatorial Computing (1993), Addison-Wesley, Reading, MA
26. T. Kohonen, Self-organizing maps, in: Springer Series in Information Sciences, vol. 30, third ed., Springer, 1995 (Last edition published in 2001).
27. R. Kondor, J. Lafferty, Diffusion kernels on graphs and other discrete structures, in: Proceedings of the 19th International Conference on Machine Learning, 2002, pp. 315-322.
28. Lee J.A., and Verleysen M. Quality assessment of dimensionality reduction: rank-based criteria. Neurocomputing 72 7-9 (2009) 1431-1443. http://www.sciencedirect.com/science/article/B6V10-4VBMNF8-2/2/a5ee2fcb9 2d2ba610f38860935732ee0 10.1016/j.neucom.2008.12.017 ISSN 0925-2312, URL: 〈http://www.sciencedirect.com/science/article/B6V10-4VBMNF8-2/2/a5e e2fcb92d2ba610f38860935732ee0〉
29. Lehmann S., and Hansen L.K. Deterministic modularity optimization. European Physical Journal B 60 1 (2007) 83-88 10.1140/epjb/e2007-00313-2
30. Newman M.E.J. The structure and function of complex networks. SIAM Review 45 (2003) 167-256
31. Newman M.E.J. Finding community structure in networks using the eigenvectors of matrices. Physical Review E 74 3 (2006) 10.1103/PhysRevE.74.036104
32. Newman M.E.J. Detecting community structure in networks. European Physics Journal B 38 2 (2004) 321-330. http://dx.doi.org/10.1140/epjb/e2004-00124-y 10.1140/epjb/e2004-00124-y URL: 〈http://dx.doi.org/10.1140/epjb/e2004-00124-y〉
33. Newman M.E.J. Modularity and community structure in networks. Proceedings of the National Academy of Sciences 103 23 (2006) 8577-8582. http://www.pnas.org/content/103/23/8577.abstract 10.1073/pnas.0601602103 URL: 〈http://www.pnas.org/content/103/23/8577.abstract〉
34. Newman M.E.J., and Girvan M. Finding and evaluating community structure in networks. Physical Review E 69 2 (2004) 10.1103/PhysRevE.69.026113
35. Noack A. Energy models for graph clustering. Journal of Graph Algorithms and Applications 11 2 (2007) 453-480
36. Noack A. Modularity clustering is force-directed layout. Physical Review E 79 026102 (2009)
37. A. Noack, R. Rotta, Multi-level algorithms for modularity clustering, Preprint, Brandenburg University of Technology at Cottbus, 2008 〈http://arxiv.org/abs/0812.4073〉.
38. Purchase H. Metrics for graph drawing aesthetics. Journal of Visual Languages and Computing 13 5 (2002) 501-516
39. R Development Core Team, R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing, Vienna, Austria, 2009, URL: 〈http://www.R-project.org〉, ISBN 3-900051-07-0.
40. Reichardt J., and Bornholdt S. Statistical mechanics of community detection. Physical Review E 74 016110 (2006)
41. Rose K. Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. Proceedings of the IEEE 86 11 (1998) 2210-2239 10.1109/5.726788
42. Schaeffer S.E. Graph clustering. Computer Science Review 1 1 (2007) 27-64
43. Schölkopf B., Smola A., and Müller K. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation 10 (1998) 1299-1319
44. A. Smola, R. Kondor, Kernels and regularization on graphs, in: M. Warmuth, B. Schölkopf (Eds.), Proceedings of the Conference on Learning Theory (COLT) and Kernel Workshop, 2003.
45. Vesanto J. Som-based data visualization methods. Intelligent Data Analysis 3 2 (1999) 111-126
46. J. Vesanto, Data exploration process based on the self-organizing Map, PhD thesis, Helsinki University of Technology, Espoo (Finland), May 2002. Acta Polytechnica Scandinavica, Mathematics and Computing Series No. 115.
47. N. Villa, F. Rossi, A comparison between dissimilarity som and kernel som for clustering the vertices of a graph, in: Proceedings of the 6th International Workshop on Self-Organizing Maps (WSOM 07), Bielefeld, Germany, September 2007.
48. N. Villa, F. Rossi, Q.-D. Truong, Mining a medieval social network by kernel som and related methods, in: Proceedings of MASHS 2008 (Modéles et Apprentissage en Sciences Humaines et Sociales), Créteil, France, June 2008.
49. von Luxburg U. A tutorial on spectral clustering. Statistics and Computing 17 4 (2007) 395-416. http://www.kyb.mpg.de/publications/attachments/luxburg06_TR_v2_4139%5B1% 5D.pdf URL: 〈http://www.kyb.mpg.de/publications/attachments/luxburg06_TR_v2_413 9%5B1%5D.pdf〉
50. Ware C., Purchase H., Colpoys L., and McGill M. Cognitive measurements of graph aesthetics. Information Visualization 1 2 (2002) 103-110
51. Wasserman S., and Faust K. Social Network Analysis: Methods and Applications (1994), Cambridge University Press, Cambridge
52. Watts D., and Strogatz S. Collective dynamics of "small-world" networks. Nature 393 (1998) 440-442
53. Yen L., Fouss F., Decaestecker C., Francq P., and Saerens M. Graph nodes clustering with the sigmoid commute-time kernel: a comparative study. Data & Knowledge Engineering 68 3 (2009) 338-361. http://www.sciencedirect.com/science/article/B6TYX-4TXF7RW-1/2/6fb37d67e e3a42425d4b305351476384 10.1016/j.datak.2008.10.006 ISSN 0169-023X, URL: 〈http://www.sciencedirect.com/science/article/B6TYX-4TXF7RW-1/2/6fb 37d67ee3a42425d4b305351476384〉
54. Zachary W.W. An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33 4 (1977) 452-473
55. D. Zhang, R. Mao, A new kernel for classification of networked entities, in: Proceedings of 6th International Workshop on Mining and Learning with Graphs, Helsinki, Finland, 2008, URL: 〈http://www.cis.hut.fi/MLG08/papers/session2/paper2.pdf〉.