Compression of weighted graphs
暂无分享,去创建一个
Fang Zhou | Hannu Toivonen | Aleksi Hartikainen | Atte Hinkka | Hannu (TT) Toivonen | Fang Zhou | Aleksi Hartikainen | Atte Hinkka
[1] Micah Adler,et al. Towards compressing Web graphs , 2001, Proceedings DCC 2001. Data Compression Conference.
[2] Jiawei Han,et al. Mining Graph Patterns Efficiently via Randomized Summaries , 2009, Proc. VLDB Endow..
[3] Michael C. Schatz,et al. Revealing Biological Modules via Graph Summarization , 2009, J. Comput. Biol..
[4] Jignesh M. Patel,et al. Discovery-driven graph summarization , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).
[5] H. White,et al. STRUCTURAL EQUIVALENCE OF INDIVIDUALS IN SOCIAL NETWORKS , 1977 .
[6] Christos Faloutsos,et al. Fast discovery of connection subgraphs , 2004, KDD.
[7] Fang Zhou,et al. A Framework for Path-Oriented Network Simplification , 2010, IDA.
[8] Ulrich Elsner,et al. Graph partitioning - a survey , 2005 .
[9] Philip S. Yu,et al. Graph OLAP: Towards Online Analytical Processing on Graphs , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[10] Godfried T. Toussaint,et al. The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..
[11] Nisheeth Shrivastava,et al. Graph summarization with bounded error , 2008, SIGMOD Conference.
[12] Hannu Toivonen,et al. Finding reliable subgraphs from large probabilistic graphs , 2008, Data Mining and Knowledge Discovery.
[13] Sebastiano Vigna,et al. The webgraph framework I: compression techniques , 2004, WWW '04.
[14] S. Borgatti,et al. Regular blockmodels of multiway, multimode matrices☆ , 1992 .
[15] Jignesh M. Patel,et al. Efficient aggregation for graph summarization , 2008, SIGMOD Conference.
[16] Jiawei Han,et al. Parallel PathFinder Algorithms for Mining Structures from Graphs , 2009, 2009 Ninth IEEE International Conference on Data Mining.