Description-driven community detection

ACM Transactions on Intelligent Systems and Technology

Volumn 5, Issue 2, 2014, Pages

  Pool, Simon ^a   Bonchi, Francesco ^b   Van Leeuwen, Matthijs ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b YAHOO RESEARCH   (Spain)

^c UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Behavioral and demographic information; Community detection; Description; Domain knowledge; Social networks; Social patterns

Indexed keywords

MINING; POPULATION STATISTICS; SOCIAL NETWORKING (ONLINE);

COMMUNITY DETECTION; DEMOGRAPHIC INFORMATION; DESCRIPTION; DOMAIN KNOWLEDGE; SOCIAL PATTERNS;

POPULATION DYNAMICS;

EID: 84899750161     PISSN: 21576904     EISSN: 21576912     Source Type: Journal    
DOI: 10.1145/2517088     Document Type: Article

References (45)

1. Rakesh Agrawal, T. Imielinksi, and A. Swami. 1993. Mining association rules between sets of items in large databases. In Proceedings of SIGMOD?93. ACM, 207-216
2. Yong-Yeol Ahn, James P. Bagrow, and Sune Lehmann. 2010. Link communities reveal multiscale complexity in networks. Nature 466, 7307, 761-764
3. Edoardo M. Airoldi, DavidM. Blei, Stephen E. Fienberg, and Eric P. Xing. 2008. Mixedmembership stochastic blockmodels. J. Machine Learn. Res. 9, 1981-2014
4. Martin Atzmueller and Folke Mitzlaff. 2011. Efficient descriptive community mining. In Proceedings of the 24th International FLAIRS Conference. AAAI Press
5. Brian Ball, Brian Karrer, and M. E. J. Newman. 2011. An efficient and principled method for detecting communities in networks. Phys. Rev. E 84
6. Nikhil Bansal, Avrim Blum, and Shuchi Chawla. 2004. Correlation clustering. Machine Learn. 56, 1-3, 89-113
7. Nicola Barbieri, Francesco Bonchi, and Giuseppe Manco. 2013. Cascade-based community detection. In Proceedings of the 6th ACM International Conference on Web Search and Data Mining (WSDM?13
8. Jeffrey Baumes, Mark K. Goldberg,Mukkai S. Krishnamoorthy, MalikMagdon-Ismail, and Nathan Preston. 2005. Finding communities by clustering a graph into overlapping subgraphs. In Proceedings of the IADIS International Conference on Applied Computing (IADIS AC?05). 97-104
9. Francesco Bonchi, Aristides Gionis, Francesco Gullo, and Antti Ukkonen. 2012. Chromatic correlation clustering. In Proceedings of the KDD
10. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. 1984. Classification and Regression Trees. Wadsworth
11. Fabricio A. Breve, Liang Zhao, Marcos G. Quiles, Witold Pedrycz, and Jiming Liu. 2011. Particle competition and cooperation for uncovering network overlap community structure. In Proceedings of the 8th International Symposium on Advances in Neural Networks (ISNN
12. B. Bringmann, S. Nijssen, N. Tatti, J. Vreeken, and A. Zimmerman. 2010. Mining sets of patterns. In Proceedings of the Tutorial at ECML PKDD?10. http://www.cs.kuleuven.be/conference/msop/.
13. Wei Chen, Zhenming Liu, Xiaorui Sun, and Yajun Wang. 2010. A game-Theoretic framework to identify overlapping communities in social networks. Data Min. Knowl. Discov. 21, 2, 224-240
14. G. Dong and J. Li. 1999. Efficient mining of emerging patterns: Discovering trends and differences. In Proceedings of the SIGKDD?99. 43-52
15. T. S. Evans and R. Lambiotte. 2009. Line graphs, link partitions, and overlapping communities. Phys. Rev. E 80
16. Santo Fortunato. 2010. Community detection in graphs. Phys. Rep. 486
17. M. Girvan and M. Newman. 2002. Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99, 12, 7821-7826
18. Steve Gregory. 2010. Finding overlapping communities in networks by label propagation. New J. Physics 12, 10
19. Arijit Khan, Xifeng Yan, and Kun-Lung Wu. 2010. Towards proximity pattern mining in large graphs. In Proceedings of the ACMSIGMOD International Conference on Management of Data (SIGMOD?10). ACM, New York, NY, 867-878
20. Youngdo Kim and Hawoong Jeong. 2011. The map equation for link communities. Phys. Rev. E 84
21. Jussi M. Kumpula, Mikko Kivelä, Kimmo Kaski, and Jari Saramäki. 2008. Sequential algorithm for fast clique percolation. Phys. Rev. E 78
22. Andrea Lancichinetti, Santo Fortunato, and Janos Kertesz. 2009. Detecting the overlapping and hierarchical community structure of complex networks. New J. Physics 11
23. Andrea Lancichinetti, Filippo Radicchi, J. J. Ramasco, and Santo Fortunato. 2011. Finding statistically significant communities in networks. PLoS ONE 6, 4, e18961
24. Silvio Lattanzi and D. Sivakumar. 2009. Affiliation networks. In Proceedings of STOC. 427-434
25. D. Leman, A. Feelders, and A. Knobbe. 2008. Exceptional Model Mining. In Proceedings of the ECML/ PKDD?08. Vol. 2. 1-16
26. M. McPherson, L. Smith-Lovin, and J. M. Cook. 2001. Birds of a feather: Homophily in social networks. Ann. Rev. Sociol. 27
27. Flavia Moser, Recep Colak, Arash Rafiey, and Martin Ester. 2009. Mining cohesive patterns from graphs with feature vectors. In Proceedings of the SIAM International Conference on Data Mining (SDM). SIAM, 593-604
28. M. Newman. 2004. Fast algorithm for detecting community structure in networks. Phys. Rev. E 69
29. M. Newman and M. Girvan. 2004. Finding and evaluating community structure in networks. Phys. Rev. E 69
30. Arnau Padrol-Sureda, Guillem Perarnau-Llobet, Julian Pfeifle, and Victor Muntés-Mulero. 2010. Overlapping community search for social networks. In Proceedings of the International Conference on Data Engineering (ICDE). 992-995
31. G. Palla, I. Derenyi, I. Farkas, and T. Vicsek. 2005. Uncovering the overlapping community structure of complex networks in nature and society. Nature
32. G. Palla, I. J. Farkas, P. Pollner, I. Derenyi, and T. Vicsek. 2007. Directed network modules. New J. Phys. 9, 6
33. J. R. Quinlan. 1993. C4.5: Programs for Machine Learning. Morgan-Kaufmann
34. Usha Nandini Raghavan, Réka Albert, and Soundar Kumara. 2007. Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76
35. Ron Shamir, Roded Sharan, and Dekel Tsur. 2004. Cluster graph modification problems. Discrete Appl. Math. 144, 1-2, 173-182
36. Arlei Silva, Wagner Meira, Jr., and Mohammed J. Zaki. 2010. Structural correlation pattern mining for large graphs. In Proceedings of the 8th Workshop on Mining and Learning with Graphs (MLG?10). ACM, New York, NY, 119-126
37. Lei Tang, Xufei Wang, and Huan Liu. 2009. Uncoverning groups via heterogeneous interaction analysis. In Proceedings of the 9th IEEE International Conference on Data Mining (ICDM?09). 503-512
38. M. van Leeuwen. 2010. Maximal exceptions with minimal descriptions. Data Min. Knowl. Discov. 21, 2, 259-276
39. Matthijs van Leeuwen, Francesco Bonchi, Börkur Sigurbjörnsson, and Arno Siebes. 2009. Compressing tags to find interesting media groups. In Proceedings of the 18th ACM Conference on Information and Knowledge Management (CIKM?09). 1147-1156
40. Xufei Wang, Lei Tang, Huiji Gao, and Huan Liu. 2010. Discovering overlapping groups in social media. In Proceedings of the 10th IEEE International Conference on Data Mining (ICDM
41. J. Xie, S. Kelley, and B. Szymanski. 2013. Overlapping community detection in networks: The state of the art and comparative study. ACM Comput. Surv. 45, 4
42. Jierui Xie and Boleslaw K. Szymanski. 2012. Towards linear time overlapping community detection in social networks. In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining( PAKDD
43. Jierui Xie, Boleslaw K. Szymanski, and Xiaoming Liu. 2011. SLPA: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In Proceedings of the ICDM Workshops. 344-349
44. Yang Zhou, Hong Cheng, and Jeffrey Xu Yu. 2009. Graph clustering based on structural/attribute similarities. Proc. Very Large Datab. 2, 1, 718-729
45. Albrecht Zimmermann, Björn Bringmann, andUlrich Rückert. 2010. Fast, effectivemolecular featuremining by local optimization. In Proceedings of the ECML/PKDD?10. 563-578