Compression of weighted graphs

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

Volumn , Issue , 2011, Pages 965-973

  Toivonen, Hannu ^a   Zhou, Fang ^a   Hartikainen, Aleksi ^a   Hinkka, Atte ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Compression; Graph mining; Network; Weighted graph

Indexed keywords

COMPLEX NETWORKS; DATA MINING; GRAPH THEORY;

AS GRAPH; COMPRESSION; GRAPH COMPRESSIONS; GRAPH MINING; GRAPH NETWORKS; GRAPH SIMPLIFICATION; LARGER NETWORKS; NETWORK; SUPERNODE; WEIGHTED GRAPH;

GRAPHIC METHODS;

EID: 80052677864     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020566     Document Type: Conference Paper

References (17)

1. M. Adler and M. Mitzenmacher. Towards compressing web graphs. In Data Compression Conference, pages 203-212, 2001. (Pubitemid 32490992)
2. P. Boldi and S. Vigna. The webgraph framework I: compression techniques. In WWW'04: Proceedings of the 13th international conference on World Wide Web, pages 595-602, New York, NY, USA, 2004. ACM. (Pubitemid 40752793)
3. S. P. Borgatti and M. G. Everett. Regular blockmodels of multiway, multimode matrices. Social Networks, 14:91-120, 1992.
4. C. Chen, C. Lin, M. Fredrikson, M. Christodorescu, X. Yan, and J. Han. Mining graph patterns efficiently via randomized summaries. In 2009 Int. Conf. on Very Large Data Bases, pages 742-753, Lyon, France, August 2009. VLDB Endowment.
5. C. Chen, X. Yan, F. Zhu, J. Han, and P. Yu. Graph OLAP: Towards online analytical processing on graphs. In ICDM'08: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, pages 103-112, Washington, DC, USA, 2008. IEEE Computer Society.
6. U. Elsner. Graph partitioning - a survey. Technical Report SFB393/97-27, Technische Universität Chemnitz, 1997.
7. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In KDD'04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 118-127, New York, NY, USA, 2004. ACM. (Pubitemid 40114922)
8. P.-O. Fjällström. Algorithms for graph partitioning: A Survey. In Linköping Electronic Atricles in Computer and Information Science, 3, 1998.
9. S. Hauguel, C. Zhai, and J. Han. Parallel PathFinder Algorithms for Mining Structures from Graphs. In 2009 Ninth IEEE International Conference on Data Mining, pages 812-817. IEEE, 2009.
10. P. Hintsanen and H. Toivonen. Finding reliable subgraphs from large probabilistic graphs. Data Mining and Knowledge Discovery, 17:3-23, 2008.
11. F. Lorrain and H. C. White. Structural equivalence of individuals in social networks. Journal of Mathematical Sociology, 1:49-80, 1971.
12. S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In SIGMOD'08: Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pages 419-432, New York, NY, USA, 2008. ACM.
13. S. Navlakha, M. Schatz, and C. Kingsford. Revealing Biological Modules via Graph Summarization. Presented at the RECOMB Systems Biology Satellite Conference. J. Comp. Bio., 16:253-264, 2009.
14. Y. Tian, R. Hankins, and J. Patel. Efficient aggregation for graph summarization. In SIGMOD'08: Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pages 567-580, New York, NY, USA, 2008. ACM.
15. H. Toivonen, S. Mahler, and F. Zhou. A framework for path-oriented network simplification. In Advances in Intelligent Data Analysis IX, volume 6065/2010, pages 220-231, Berlin/Heidelberg, May 2010. Springer-Verlag.
16. G. T. Toussaint. The relative neighbourhood graph of a finite planar set. Pattern Recognition, 12(4):261-268, 1980.
17. N. Zhang, Y. Tian, and J. Patel. Discovery-driven graph summarization. In Data Engineering (ICDE), 2010 IEEE 26th International Conference on, pages 880-891. IEEE, 2010.