Community preserving lossy compression of social networks

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2012, Pages 509-518

  Maserrat, Hossein ^a   Pei, Jian ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Communities; Compression; Social networks

Indexed keywords

GRAPH COMPRESSIONS; GREEDY ALGORITHMS; LOSSLESS; LOSSY COMPRESSIONS; OBJECTIVE FUNCTIONS; REAL DATA SETS; SOCIAL NETWORK ANALYSIS; SOCIAL NETWORKS; SYNTHETIC DATASETS; THEORETICAL POINTS;

COMPACTION; DATA MINING; ECOSYSTEMS;

SOCIAL NETWORKING (ONLINE);

EID: 84874063857     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2012.14     Document Type: Conference Paper

References (25)

1. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks, 2008.
2. P. Boldi, M. Rosa, M. Santini, and S. Vigna. Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In WWW, pages 587-596, New York, NY, USA, 2011. ACM.
3. P. Boldi and S. Vigna. The webgraph framework I: compression techniques. In WWW, pages 595-602, 2004.
4. F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi, and P. Raghavan. On compressing social networks. In KDD, pages 219-228, 2009.
5. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, pages 1- 6, 2004.
6. L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas. Comparing community structure identification, Oct. 2005.
7. J. Díaz, J. Petit, and M. J. Serna. A survey of graph layout problems. ACM Comput. Surv., 34(3):313-356, 2002.
8. W. Fan, J. Li, X. Wang, and Y. Wu. Query preserving graph compression. In SIGMOD, pages 157-168, New York, NY, USA, 2012. ACM.
9. S. Fortunato. Community detection in graphs. Physics Reports, 486(3-5):75-174, 2010.
10. J. Gao, W. Yuan, X. Li, K. Deng, and J.-Y. Nie. Smoothing clickthrough data for web search ranking. In SIGIR, pages 355-362. ACM, 2009.
11. M. Girvan and M. E. Newman. Community structure in social and biological networks. Proc Natl Acad Sci U S A, 99(12):7821-7826, June 2002.
12. B. H. Good, Y.-A. de Montjoye, and A. Clauset. The performance of modularity maximization in practical contexts. PHYS.REV.E, 81:046106, 2010.
13. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. J. ACM, 51(3):497-515, 2004.
14. A. Lancichinetti, S. Fortunato, and F. Radicchi. Benchmark graphs for testing community detection algorithms. Phys. Rev. E, 78(4):046110, Oct. 2008.
15. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In WWW, pages 695-704, New York, NY, USA, 2008. ACM.
16. J. Leskovec, K. J. Lang, and M. W. Mahoney. Empirical comparison of algorithms for network community detection. In WWW, 2010.
17. H. Maserrat and J. Pei. Neighbor query friendly compression of social networks. In KDD, pages 533-542, New York, NY, USA, 2010. ACM.
18. S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In SIGMOD Conference, pages 419-432, 2008.
19. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review, E 69(026113), 2004.
20. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab, November 1999. Previous number = SIDL-WP-1999-0120.
21. C. H. Papadimitriou. The NP-completeness of the bandwidth minimization problem. Computing, 16(3):263-270, 1976.
22. U. N. Raghavan, R. Albert, and S. Kumara. Near linear time algorithm to detect community structures in large-scale networks. PHYSICAL REVIEW E, 76:036106, 2007.
23. P. Ronhovde and Z. Nussinov. Local resolution-limit-free potts model for community detection. PHYSICAL REVIEW E, 81:046114, 2010.
24. M. Rosvall and C. T. Bergstrom. Maps of random walks on complex networks reveal community structure. PNAS, 105:1118, 2008.
25. V. V. Vazirani. Approximation algorithms. Springer-Verlag New York, Inc., New York, NY, USA, 2001.