Space-efficient sampling from social activity streams

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

Volumn , Issue , 2012, Pages 53-60

  Ahmed, Nesreen K ^a   Neville, Jennifer ^a   Kompella, Ramana ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; DATA SETS; LARGE GRAPHS; LARGE-SCALE NETWORK; MAIN MEMORY; MEMORY-RESIDENT; NETWORK DOMAINS; NETWORK SYSTEMS; REAL WORLD DATA; REPRESENTATIVE SAMPLE; SAMPLING ALGORITHM; SAMPLING METHOD; SOCIAL ACTIVITIES; SUBGRAPHS;

LEARNING ALGORITHMS; VIRTUAL REALITY;

COMPUTER SYSTEMS PROGRAMMING;

EID: 84866602350     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2351316.2351324     Document Type: Conference Paper

References (42)

1. Stanford large network dataset collection. http://snap.stanford.edu/data/ index.html.
2. C. Aggarwal, Y. Zhao, and P. Yu. Outlier detection in graph streams. In Data Engineering (ICDE), 2011 IEEE 27th International Conference on, pages 399-409. IEEE, 2011.
3. C. C. Aggarwal. On Biased Reservoir Sampling in the Presence of Stream Evolution. In Proceedings of the 32nd International Conference on Very Large Data Bases., VLDB '06, pages 607-618, 2006.
4. C. C. Aggarwal and H. Wang, editors. Managing and Mining Graph Data, volume 40 of Advances in Database Systems. Springer, 2010.
5. N. K. Ahmed, J. Neville, and R. Kompella. Reconsidering the foundations of network sampling. WIN'10, 2010.
6. N. K. Ahmed, J. Neville, and R. Kompella. Network sampling designs for relational classification. In Sixth International AAAI Conference on Weblogs and Social Media, 2012.
7. Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong. Analysis of topological characteristics of huge online social networking services. In WWW, pages 835-844, 2007.
8. K. Avrachenkov, B. Ribeiro, and D. Towsley. Improving random walk estimation accuracy with uniform restarts. Algorithms and Models for the Web-Graph, pages 98-109, 2010.
9. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms with an application to counting triangles in graphs. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA '02, pages 623-632, 2002.
10. E. Baykan, M. Henzinger, S. Keller, S. De Castelberg, and M. Kinzler. A comparison of techniques for sampling web pages. Arxiv preprint arXiv:0902.1604, 2009.
11. H. Chun, H. Kwak, Y. Eom, Y. Ahn, S. Moon, and H. Jeong. Comparison of online social relations in volume vs interaction: a case study of cyworld. In ACM/USENIX IMC, pages 57-70, 2008.
12. M. De Choudhury, Y. Lin, H. Sundaram, K. Candan, L. Xie, and A. Kelliher. How does the data sampling strategy impact the discovery of information diffusion in social media. In Proceedings of the 4th International AAAI Conference on Weblogs and Social Media, pages 34-41, 2010.
13. M. Gjoka, M. Kurant, C. Butts, and A. Markopoulou. Walking in facebook: A case study of unbiased sampling of osns. In INFOCOM, 2010 Proceedings IEEE, pages 1-9. Ieee, 2010.
14. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In IEEE INFOCOM, 2004.
15. D. F. Gleich. Graph of flickr photo-sharing social network crawled in may 2006, Feb 2012.
16. S. Guha, A. McGregor, and S. Venkatasubramanian. Streaming and sublinear approximation of entropy and information distances. In ACM-SIAM Symposium on Discrete Algorithms, SODA '06, pages 733-742, 2006.
17. C. Hubler, H.-P. Kriegel, K. M. Borgwardt, and Z. Ghahramani. Metropolis algorithms for representative subgraph sampling. In ICDM, 2008.
18. J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
19. E. Kolaczyk. Statistical analysis of network data, volume 69 of springer series in statistics, 2009.
20. V. Krishnamurthy, M. Faloutsos, M. Chrobak, J. Cui, L. Lao, and A. Percus. Sampling large Internet topologies for simulation purposes. Computer Networks, 51(15):4284-4302, 2007.
21. R. Kumar, J. Novak, and A. Tomkins. Structure and evolution of online social networks. In SIGKDD, pages 611-617, 2006.
22. M. Kurant, A. Markopoulou, and P. Thiran. Towards unbiased bfs sampling. Selected Areas in Communications, IEEE Journal on, 29(9):1799-1809, 2011.
23. L. Lee. On the effectiveness of the skew divergence for statistical language analysis. In Artificial Intelligence and Statistics, 2001.
24. S. Lee, P. Kim, and H. Jeong. Statistical properties of sampled networks. Physical Review E, 73:016102, 2006.
25. J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins. Microscopic evolution of social networks. In SIGKDD, 2008.
26. J. Leskovec and C. Faloutsos. Sampling from large graphs. In SIGKDD, pages 631-636, 2006.
27. J. Leskovec and E. Horvitz. Worldwide Buzz: Planetary-Scale Views on an Instant-Messaging Network. In WWW, 2008.
28. A. S. Maiya and T. Y. Berger-Wolf. Sampling Community Structure. In WWW, 2010.
29. A. S. Maiya and T. Y. Berger-Wolf. Benefits of bias: Towards better characterization of network sampling. In SIGKDD, 2011.
30. G. S. Manku and R. Motwani. Approximate Frequency Counts over Data Streams. In Proceedings of the 28th International Conference on Very Large Data Bases., VLDB '02, pages 346-357, 2002.
31. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In ACM/USENIX IMC, 2007.
32. S. Muthukrishnan. Data streams: algorithms and applications. Foundations and Trends in Theoretical Computer Science, 1(2), Aug. 2005.
33. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. 1998.
34. B. Ribeiro and D. Towsley. Estimating and sampling graphs with multidimensional random walks. In ACM SIGCOMM Internet Measurement Conference, Nov. 2010.
35. F. P. Room. Facebook statistics. http://www.facebook.com/press/info.php? statistics.
36. A. D. Sarma, S. Gollapudi, and R. Panigrahy. Estimating PageRank on Graph Streams. In PODS, 2008.
37. M. Stumpf, C. Wiuf, and R. May. Subnets of scale-free networks are not scale-free: Sampling properties of networks. Proceedings of the National Academy of Sciences, 102(12):4221-4224, 2005.
38. D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger. On unbiased sampling for unstructured peer-to-peer networks. In IMC, pages 27-40, 2006.
39. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi. On the evolution of user interaction in facebook. In Proceedings of the 2nd ACM SIGCOMM Workshop on Social Networks (WOSN'09), August 2009.
40. J. Vitter. Random sampling with a reservoir. ACM Trans. Math. Softw., 11, 1985.
41. C. Wilson, B. Boe, A. Sala, K. P. Puttaswamy, and B. Y. Zhao. User interactions in social networks and their implications. In EuroSys, pages 205-218, 2009.
42. S. Yoon, S. Lee, S.-H. Yook, and Y. Kim. Statistical properties of sampled networks by random walks. Phys. Rev. E, 75(4):046114, Apr 2007.