A Divide-and-Link algorithm for hierarchical clustering in networks

Information Sciences

Volumn 316, Issue , 2015, Pages 308-328

  Gómez, Daniel ^a   Zarrazola, Edwin ^b   Yáñez, Javier ^a   Montero, Javier ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b UNIVERSIDAD DE ANTIOQUIA   (Colombia)

Author keywords

Clustering; Hierarchical clustering; Network; Social network analysis

Indexed keywords

EVOLUTIONARY ALGORITHMS; GRAPH ALGORITHMS; HIERARCHICAL CLUSTERING; NETWORKS (CIRCUITS); SOCIAL NETWORKING (ONLINE);

BETWEENNESS; CLUSTERING; COMMUNITY DETECTION; IN NETWORKS; SIMILARITY MEASURE; SPECIFIC PROBLEMS; STATE-OF-THE-ART ALGORITHMS;

CLUSTERING ALGORITHMS;

EID: 84930074929     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2015.04.011     Document Type: Article

References (45)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows: Theory, Algorithms, and Applications 1993 Prentice Hall Englewood Cliffs, USA
2. A. Amo, J. Montero, G. Biging, and V. Cutello Fuzzy classification systems Eur. J. Oper. Res. 156 2 2004 495 507
3. V.D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre Fast unfolding of communities in large networks J. Stat. Mech.: Theory Exp. 2008 10008
4. A. Clauset, C. Moore, and M.E.J. Newman Hierarchical structure and the prediction of missing links in networks Nature 453 2008 98 101
5. Aaron Clauset, M.E.J. Newman, and Cristopher Moore Finding community structure in very large networks Phys. Rev. E 70 2004 066111
6. L. Doneti, M.A. Muñoz, Improved spectral algorithm for the detection of network communities, in: Aip Conference Proceedings, vol. 779, 2005, pp. 104-107.
7. M. Espinilla, J. Montero, and J.T. Rodriguez Computational intelligence in decision making Int. J. Comput. Intell. Syst. 6 2013 1 5
8. E. Estrada, and N. Hatano Communicability in complex networks Phys. Rev. E 77 2008 036111
9. E. Estrada, and N. Hatano Communicability graph and community structures in complex networks Appl. Math. Comput. 214 2009 500 511
10. S. Fortunato Community detection in graphs Phys. Rep. 486 2010 75 174
11. F. Fouss, and J.M. Renders Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation IEEE Trans. Knowl. Data Eng. 19 2007 35 369
12. P. Gang Suna, L. Gaoa, and Y. Yanga Maximizing modularity intensity for community partition and evolution Inf. Sci. 236 2013 83 92
13. M. Girvan, and M.E.J. Newman Community structure in social and biological networks Proc. Nat. Acad. Sci. USA 99 12 2002 7821 7826
14. D. Gomez, J. Figueira, and A. Eusebio Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems Eur. J. Oper. Res. 226 2013 354 365
15. D. Gomez, and J. Montero Fuzzy sets in remote sensing classification Soft Comput. 12 2008 243 249
16. D. Gomez, J. Montero, and G. Biging Accuracy statistics for judging soft classification Int. J. Rem. Sens. 29 2008 693 709
17. D. Gomez, J. Montero, and G. Biging Improvements to remote sensing using fuzzy classification, graphs and accuracy statistics Pure Appl. Geophys. 165 2008 1555 1575
18. D. Gomez, J. Montero, and J. Yáñez A coloring algorithm for image classification Inf. Sci. 176 2006 3645 3657
19. D. Gómez, J. Montero, and J. Yáñez A divide-link algorithm based on fuzzy similarity for clustering networks Intell. Syst. Des. Appl. (ISDA) 2011 1247 1252
20. D. Gomez, J. Montero, J. Yáñez, and C. Poidomani A graph coloring algorithm approach for image segmentation Omega 35 2007 173 183
21. S. Gregory Fuzzy overlapping communities in networks J. Stat. Mech.: Theory Exp. 2 2011 02017
22. W. Groissboeck, E. Lughofer, and S. Thumfart Associating visual textures with human perceptions using genetic algorithms Inf. Sci. 180 2010 2065 2084
23. T. Hastie, R. Tibshirani, and J. Friedman The Elements of Statistical Learning 2009 Springer New York
24. M.-H. Hsieh, and C.L. Magee A new method for finding hierarchical subgroups from networks Soc. Networks 32 2010 234 244
25. A. Lancichinetti, and S. Fortunato Community detection algorithms: a comparative analysis Phys. Rev. E 80 2009 056117
26. W. Li Revealing network communities with a nonlinear programming method Inf. Sci. 229 2013 18 28
27. D. Lusseau, K. Schneider, O. Boisseau, P. Haase, E. Slooten, and S.M. Dawson The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Can geographic isolation explain this unique trait? Behav. Ecol. Sociobiol. 54 2003 396 405
28. J. Montero, D. Gomez, and H. Bustince On the relevance of some families of fuzzy sets Fuzzy Sets Syst. 158 2007 2429 2442
29. J. Montero, and L. Martinez Upgrading ideas about the concept of soft computing Int. J. Comput. Intell. Syst. 3 2010 144 147
30. M.E.J. Newman Communities, modules and large-scale structure in networks Nat. Phys. 8 2012 25 31
31. M.E.J. Newman Fast algorithm for detecting community structure in networks Phys. Rev. E 69 2004 066133
32. M.E.J. Newman A measure of betweenness centrality based on random walks Soc. Networks 27 1 2005 39 54
33. M.E.J. Newman, and M. Girvan Finding and evaluating community structure in networks Phys. Rev. E 69 2004 026113
34. P. Pons, and M. Lapaty Computing communities in large networks using random walks Lect. Notes Comput. Sci. 3733 2005 284 293
35. F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi Defining and identifying communities in networks Proc. Nat. Acad. Sci. USA 101 2004 2658 2663
36. M. Saerens, F. Fouss, L. Yen, and P. Dupont The principal components analysis of a graph, and its relationships to spectral clustering Lect. Notes Comput. Sci. 3210 2004 371 383
37. S.A. Tabrizi, A. Shakery, M. Asadpour, M. Abbasi, and M. Ali Tavallaie Personalized pagerank clustering: a graph clustering algorithm based on random walks Phys. A: Stat. Mech. Appl. 392 2013 5772 5785
38. F. Tavares-Pereira, J.R. Figueira, V. Mousseau, and B. Roy Multiple criteria redistricting problems: the public transportation network pricing system of the paris region Ann. Oper. Res. 154 2007 69 92
39. J.R. Tyler, D.M. Wilkinson, and B.A. Huberman Communities and Technologies 2003 Kluwer, B.V. Deventer The Netherlands pp. 81-96
40. S. van Dongen, A Cluster Algorithm for Graphs, Technical report INS-R0010, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam, 2000.
41. S. Wasserman, and K. Faust Social Network Analysis: Methods and Applications (Structural Analysis in the Social Sciences) 1999 Cambridge University Press Cambridge, UK
42. D.M. Wilkinson, and B.A. Huberman A method for finding communities of related genes Proc. Natl. Acad. Sci. USA 101 2004 5241 5248
43. L. Yen, F. Fouss, C. Decaestecker, and M. Saerens Graph nodes clustering based on the commute-time kernel Lect. Notes Comput. Sci. 4426 2007 1037 1045
44. N. Yuruk, M. Mete, X. Xu, T.A.J. Schweiger, A divisive hierarchical structural clustering algorithm for networks, in: Proceedings of the 7th IEEE International Conference on Data Mining Workshops, 2007, pp. 441-448.
45. W.W. Zachary An information flow model for conflict and fission in small groups J. Anthropol. Res. 33 1977 452 473