Communities and balance in signed networks: A spectral approach

Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2012

Volumn , Issue , 2012, Pages 235-242

  Anchuri, Pranay ^a   Magdon Ismail, Malik ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

Community detection; Signed networks; Structural balance

Indexed keywords

COMMUNITY DETECTION; COMMUNITY DETECTION ALGORITHMS; ITERATIVE OPTIMIZATION; MINING COMMUNITIES; POTENTIAL VALUES; SIGNED NETWORKS; SOCIAL NETWORKS; STRUCTURAL BALANCE;

POPULATION DYNAMICS; SOCIAL NETWORKING (ONLINE);

ITERATIVE METHODS;

EID: 84874252842     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASONAM.2012.48     Document Type: Conference Paper

References (25)

1. H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A.-L. Barabasi, "The large-scale organization of metabolic networks, " 2000.
2. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over time: Densification laws, shrinking diameters and possible explanations, " in In KDD. ACM Press, 2005, pp. 177-187.
3. P. Ferragina and A. Gulli, "A personalized search engine based on web-snippet hierarchical clustering, " in Special interest tracks and posters of the 14th international conference on World Wide Web, ser. WWW '05, 2005, pp. 801-810.
4. M. E. J. Newman, "Modularity and community structure in networks, " Proceedings of the National Academy of Sciences of the United States of America, vol. 103, no. 23, pp. 8577- 8582, 2006.
5. B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs, " Bell System Technical Journal, vol. 49, no. 2, pp. 291-307, 1970.
6. S. Dongen, "A cluster algorithm for graphs, " Amsterdam, The Netherlands, The Netherlands, Tech. Rep., 2000.
7. J. R. Tyler, D. M. Wilkinson, and B. A. Huberman, Email as spectroscopy: automated discovery of community structure within organizations. Kluwer, B.V., 2003, pp. 81-96.
8. M. Girvan and M. E. J. Newman, "Community structure in social and biological networks, " Proceedings of the National Academy of Sciences, vol. 99, no. 12, pp. 7821-7826, 2002.
9. V. D. Blondel, J. loup Guillaume, R. Lambiotte, and E. Lefebvre, "Fast unfolding of communities in large networks, " 2008.
10. G. Palla, I. Derényi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society." Nature, vol. 435, no. 7043, pp. 814-818, 2005.
11. J. Baumes, M. Goldberg, and M. Magdon-ismail, "Efficient identification of overlapping communities, " in In IEEE International Conference on Intelligence and Security Informatics (ISI, 2005, pp. 27-36.
12. P. Doreian and A. Mrvar, "A partitioning approach to structural balance, " Social Networks, vol. 18, no. 2, pp. 149-168, 1996.
13. J. Kunegis, A. Lommatzsch, and C. Bauckhage, "The slashdot zoo: mining a social network with negative edges, " in Proceedings of the 18th international conference on World wide web, ser. WWW '09, New York, NY, USA, 2009, pp. 741-750.
14. J. Kunegis, S. Schmidt, A. Lommatzsch, J. Lerner, E. W. De, and L. S. Albayrak, "Spectral analysis of signed graphs for clustering, prediction and visualization.".
15. V. A. Traag and J. Bruggeman, "Community detection in networks with positive and negative links, " Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), vol. 80, no. 3, pp. 036 115+, 2009.
16. B. Yang, W. K. Cheung, and J. Liu, "Community mining from signed social networks." IEEE Trans. Knowl. Data Eng., vol. 19, no. 10, pp. 1333-1348, 2007.
17. G. Facchetti, G. Iacono, and C. Altafini, "Computing global structural balance in large-scale signed social networks, " PNAS, vol. 108, no. 52 20953-20958, 2011.
18. F. Harary, "On the notion of balance of a signed graph, " The Michigan Mathematical Journal, vol. 2, no. 4, pp. 143-146, 1953.
19. J. A. Davis, "Clustering and Structural Balance in Graphs, " Human Relations, vol. 20, pp. 181-187, 1967.
20. J. Shi and J. Malik, "Normalized cuts and image segmentation, " IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, pp. 888-905, 1997.
21. I. S. Dhillon, Y. Guan, and B. Kulis, "Weighted graph cuts without eigenvectors: A multilevel approach, " IEEE Trans. Pattern Anal. Mach. Intell, vol. 29, p. 2007, 2007.
22. I. Dhillon, "A fast kernel-based multilevel algorithm for graph clustering, " in In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005, pp. 629-634.
23. P. K. Chan, M. D. F. Schlag, and J. Y. Zien, "Spectral k-way ratio-cut partitioning and clustering, " in Proceedings of the 30th international Design Automation Conference, ser. DAC '93, 1993, pp. 749-754.
24. I. Dhillon, Y. Guan, and B. Kulis, "A unified view of kernel kmeans, spectral clustering and graph cuts, " Tech. Rep., 2004.
25. M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks, " Phys. Rev. E, vol. 69, p. 026113, 2004.