On the separability of structural classes of communities

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 624-632

  Abrahao, Bruno ^a   Soundarajan, Sucheta ^a   Hopcroft, John ^a   Kleinberg, Robert ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

class separability; community structure; detection algorithms; networks

Indexed keywords

APPLICATION DOMAINS; CLASS SEPARABILITY; COMMUNITY DETECTION; COMMUNITY DETECTION ALGORITHMS; COMMUNITY STRUCTURES; COMPREHENSIVE ANALYSIS; DATA SETS; DETECTION ALGORITHM; DIFFERENT STRUCTURE; LARGE-SCALE NETWORK; MAJOR FACTORS; STRUCTURAL CLASS;

ALGORITHMS; DATA MINING; NETWORKS (CIRCUITS); POPULATION DYNAMICS;

SIGNAL DETECTION;

EID: 84866020651     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339631     Document Type: Conference Paper

References (31)

1. D.W. Aha, D. Kibler, and M. K. Albert. Instance-based learning algorithms. Machine Learning, 6:37-66, January 1991.
2. Y. Ahn, J. P. Bagrow, and S. Lehmann. Link communities reveal multiscale complexity in networks. Nature, 466(7307):761-764, 2010.
3. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group formation in large social networks: Membership, growth, and evolution. In Proceedings of the 12th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2006.
4. V. D. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. Mar. 2008. Journal of Statistical Mechanics.
5. F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, Dec. 1996.
6. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70(6):066111+, Dec. 2004.
7. S. V. Dongen. Graph clustering via a discrete uncoupling process. SIAM Journal on Matrix Analysis and Applications, 30(1):121-141, 2008.
8. N. Fatemi-Ghomi, P. Palmer, and M. Petrou. The two-point correlation function: A measure of interclass separability. Journal of Mathematical Imaging and Vision, 10:7-25, 1999. 10.1023/A:1008362414568.
9. S. Fortunato. Community detection in graphs. 0906.0612, June 2010. Phys. Reports 486, 75-174.
10. M. Girvan and M. Newman. Community structure in social and biological networks. Proc. of the National Academy of Sciences, 99(12):7821-7826, June 2002.
11. M. A. Hall. Correlation-based Feature Subset Selection for Machine Learning. PhD thesis, Department of Computer Science, University of Waikato, 1999.
12. S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bulletin of the American Mathematical Society, 43(4):439, 2006.
13. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20:359-392, December 1998.
14. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(1):291-307, 1970.
15. A. Lancichinetti and S. Fortunato. Community detection algorithms: A comparative analysis. Physical Review E, 80:056117, Nov 2009.
16. J. Leskovec, L. Adamic, and B. Huberman. The dynamics of viral marketing. In Proceedings of the 7th ACM Conference on Electronic Commerce, 2006.
17. J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney. Statistical properties of community structure in large social and information networks. In Proc. of the 17th Intl. Conf. on World Wide Web, 2008.
18. J. Leskovec, K. Lang, and M. Mahoney. Empirical comparison of algorithms for network community detection. In Proceedings of the 19th Intl. Conference on World Wide Web, 2010.
19. R. Lyons and Y. Peres. Probability on Trees and Networks. Cambridge University Press, 2012.
20. N. Mishra, R. Schreiber, I. Stanton, and R. Tarjan. Finding strongly knit clusters in social networks. Internet Mathematics, 5(1):155-174, Jan. 2008.
21. A. Mislove, B. Viswanath, K. Gummadi, and P. Druschel. You are who you know: Inferring user profiles in online social networks. In Proc. 3rd ACM Intl. Conf. on Web Search and Data Mining, 2010.
22. M. Newman. Detecting community structure in networks. The European Phys. Journal B, 38(2):321-330-330, Mar. 2004.
23. M. Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23):8577-8582, June 2006.
24. G. Palla, I. Derenyi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435(7043):814-818, June 2005.
25. D. Park, R. Singh, M. Baym, C.-S. Liao, and B. Berger. IsoBase: a database of functionally related proteins across PPI networks. Nucleic Acids Research, (suppl 1):D295-D300.
26. P. Pons and M. Latapy. Computing communities in large networks using random walks. J. of Graph Algorithms and Applications, 10(2):191-218, 2006.
27. M. Rosvall and C. Bergstrom. Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems. PLoS ONE, 6(4):e18209, 04 2011.
28. K. Stephenson and M. Zelen. Rethinking centrality: Methods and examples. Social Networks, 11(1):1-37, Mar. 1989.
29. S. Theodoridis and K. Koutroumbas. Pattern Recognition. Academic Press, 4th edition, Nov. 2008.
30. V. N. Vapnik. Statistical Learning Theory. Wiley-Interscience, 1st edition, Sept. 1998.
31. E. Weinan, T. Li, and E. Vanden-Eijnden. Optimal partition and effective dynamics of complex networks. Proceedings of the National Academy of Sciences, 105(23):7907-7912, June 2008.