Modular community detection in networks

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 1366-1371

  Li, Wenye ^a   Schuurmans, Dale ^b  

^a MACAO POLYTECHNIC INSTITUTE   (Macao)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; COMMUNITY DETECTION; COMMUNITY STRUCTURES; DIVERSE FIELDS; ITERATIVE ROUNDING; NETWORK COMMUNITIES; QUANTITATIVE MEASURES; SPECTRAL RELAXATIONS;

ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

POPULATION DYNAMICS;

EID: 84866622944     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-231     Document Type: Conference Paper

References (18)

1. L.A. Adamic and N. Glance. The political blogosphere and the 2004 U.S. election: divided they blog. In Proceedings of the 3rd international workshop on Link discovery, pages 36-43. ACM, 2005.
2. G. Agarwal and D. Kempe. Modularity-maxmizing graph communities via mathematical programming. European Physical Journal B, 66, 2008.
3. U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, and D. Wagner. On modularity - NP-completeness and beyond, 2006.
4. D. Easley and J. Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010.
5. L. Fleischer, K. Jain, and D.P. Williamson. Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. J. Comput. Syst. Sci., 72(5):838-867, 2006. (Pubitemid 44262261)
6. M. Girvan and M. Newman. Community structure in social and biological networks. Proceedings of National Academy of Sciences, 99:7821-7826, 2002. (Pubitemid 34650963)
7. A.K. Jain, M.N. Murty, and P.J. Flynn. Data clustering: A review. ACM Computing Surveys, 31(3):264-323, September 1999.
8. D. Knuth. The Stanford graphbase: a platform for combinatorial algorithms. ACM Press, 1993.
9. J. Leskovec, K.J. Lang, and M.W. Mahoney. Empirical comparison of algorithms for network community detection. In Proceedings of the 19th International Conference on World Wide Web . ACM, 2010.
10. S. Lin and B.W. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21:498-516, 1973.
11. D. Lusseau, K. Schneider, O.J. 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? Behavioral Ecology and Sociobiology, 54(4):396-405, 2003. (Pubitemid 37144024)
12. M. Newman. The structure of scientific collaboration networks. Proceedings of National Academy of Sciences, 98:404-409, 2001. (Pubitemid 32105053)
13. M. Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23):8577-8582, 2006. (Pubitemid 43878062)
14. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14, Cambridge, MA, 2002. MIT Press.
15. J.B. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence, 22(8):888-905, August 2000.
16. D.J. Watts and S.H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(6684):397-498, June 1998.
17. L. Xu,W. Li, and D. Schuurmans. Fast normalized cut with linear constraints. In 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pages 2866-2873, 2009.
18. W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33:452-473, 1977.