Sampling from large graphs

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

Volumn 2006, Issue , 2006, Pages 631-636

  Leskovec, Jure ^a   Faloutsos, Christos ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Graph mining; Graph sampling; Scaling laws

Indexed keywords

ALGORITHMS; DATA MINING; INFORMATION THEORY; NUMERICAL METHODS; STRATEGIC PLANNING;

GRAPH MINING; GRAPH SAMPLING; SCALING LAWS;

GRAPH THEORY;

EID: 33749581229     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1150402.1150479     Document Type: Conference Paper

References (16)

1. M. Adler and M. Mitzenmacher. Towards compressing web graphs. In Data Compression Conference, 2001.
2. E. M. Airoldi and K. M. Carley. Sampling algorithms for pure network topologies. SIGKDD Explor., 2005.
3. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In SDM, 2004.
4. X. A. Dimitropoulos and G. F. Riley. Creating realistic BGP models. IEEE/ACM MASCOTS, 2003.
5. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, pages 251-262, 1999.
6. T. Feder and R. Motwani. Clique partitions, graph compression and speeding-up algorithms. In Journal of Computer And System Sciences, volume 51, 1995.
7. A. C. Gilbert and K. Levchenko. Compressing network graphs. In LinkKDD, 2004.
8. V. Krishnamurthy, M. Faloutsos, M. Chrobak, L. Lao, J.-H. Cui, and A. G. Percus. Reducing large internet topologies for faster simulations. In Networking, 2005.
9. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: Densification laws, shrinking diamaters and possible explanations. In ACM SIGKDD, 2005.
10. U. of Oregon. Route views project.
11. C. R. Palmer, P. B. Gibbons, and C. Faloutsos. Anf: A fast and scalable tool for data mining in massive graphs. In SIGKDD, Edmonton, AB, Canada, 2002.
12. D. Rafiei and S. Curial. Effectively visualizing large networks through sampling. In Visualization, 2005.
13. M. Richardson, R. Agrawal, and P. Domingos. Trust management for the semantic web. In Second International Semantic Web Conference, 2003.
14. M. P. H. Stumpf, C. Wiuf, and R. M. May. Subnets of scale-free networks are not scale-free: Sampling properties of networks. In PNAS, volume 102, 2005.
15. D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger. Sampling techniques for large, dynamics graphs. In CIS-TR-06-01, University of Oregon, 2006.
16. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998.