Beyond blocks: Hyperbolic community detection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8724 LNAI, Issue PART 1, 2014, Pages 50-65

  Araujo, Miguel ^a,b   Günnemann, Stephan ^a   Mateos, Gonzalo ^a   Faloutsos, Christos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84907007746     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-44848-9_4     Document Type: Conference Paper

References (21)

1. Adamcsek, B., Palla, G., Farkas, I.J., Dernyi, I., Vicsek, T.: Cfinder: locating cliques and overlapping modules in biological networks. Bioinformatics 22(8), 1021-1023 (2006)
2. Araujo, M., Papadimitriou, S., Günnemann, S., Faloutsos, C., Basu, P., Swami, A., Papalexakis, E.E., Koutra, D.: Com2: Fast automatic discovery of temporal ('comet') communities. In: Tseng, V.S., Ho, T.B., Zhou, Z.-H., Chen, A.L.P., Kao, H.-Y. (eds.) PAKDD 2014, Part II. LNCS (LNAI), vol. 8444, pp. 271-283. Springer, Heidelberg (2014)
3. Chakrabarti, D., Papadimitriou, S., Modha, D.S., Faloutsos, C.: Fully automatic cross-associations. In: KDD, pp. 79-88 (2004)
4. Clauset, A., Shalizi, C., Newman, M.: Power-law distributions in empirical data. SIAM Review 51(4), 661-703 (2009)
5. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM, pp. 251-262 (1999)
6. Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: KDD, pp. 150-160 (2000)
7. Fortunato, S.: Community detection in graphs. Physics Reports 486(35), 75-174 (2010)
8. Gionis, A., Mannila, H., Seppänen, J.K.: Geometric and combinatorial tiles in 0-1 data. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 173-184. Springer, Heidelberg (2004)
9. Gkantsidis, C., Mihail, M., Zegura, E.W.: Spectral analysis of internet topologies. In: INFOCOM, pp. 364-374 (2003)
10. Grünwald, P.D.: The minimum description length principle. The MIT Press (2007)
11. Günnemann, S., Färber, I., Raubach, S., Seidl, T.: Spectral subspace clustering for graphs with feature vectors. In: ICDM, pp. 231-240 (2013)
12. Johnson, D.S., Krishnan, S., Chhugani, J., Kumar, S., Venkatasubramanian, S.: Compressing large boolean matrices using reordering techniques. In: VLDB, pp. 13-23 (2004)
13. Karypis, G., Kumar, V.: Metis - unstructured graph partitioning and sparse matrix ordering system, version 2.0. Technical report (1995)
14. Newman, M.: Modularity and community structure in networks. PNAS 103(23), 8577-8582 (2006)
15. Rissanen, J.: A universal prior for integers and estimation by minimum description length. The Annals of Statistics, 416-431 (1983)
16. Sen, T., Kloczkowski, A., Jernigan, R.: Functional clustering of yeast proteins from the protein-protein interaction network. BMC Bioinformatics 7, 355-367 (2006)
17. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE PAMI 22(8), 888-905 (2000)
18. Sun, J., Faloutsos, C., Papadimitriou, S., Yu, P.S.: Graphscope: parameter-free mining of large time-evolving graphs. In: KDD, pp. 687-696 (2007)
19. Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press (1994)
20. Yang, J., Leskovec, J.: Community-affiliation graph model for overlapping network community detection. In: ICDM, pp. 1170-1175 (2012)
21. Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: ICDM, pp. 745-754 (2012)