Graph sample and hold: A framework for big-graph analytics

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

Volumn , Issue , 2014, Pages 1446-1455

  Ahmed, Nesreen K ^a   Duffield, Nick ^b,c   Neville, Jennifer ^a   Kompella, Ramana ^a  

^a PURDUE UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c Texas AandM University   (United States)

Author keywords

graph streams; network sampling; statistical estimation

Indexed keywords

EID: 84907031416     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2623330.2623757     Document Type: Conference Paper

References (35)

1. AGGARWAL, C., ZHAO, Y., AND YU , P. On clustering graph streams. In SDM (2010), pp. 478-489.
2. AGGARWAL, C., ZHAO, Y., AND YU , P. Outlier detection in graph streams. In ICDE (2011), pp. 399-409.
3. AHMED, N. K., NEVILLE, J., AND KOMPELLA, R. Network sampling designs for relational classification. In ICWSM (2012).
4. AHMED, N. K., NEVILLE, J., AND KOMPELLA, R. Network sampling: from static to streaming graphs. (to appear) TKDD (2013).
5. AL HASAN, M., AND ZAKI, M. Output space sampling for graph patterns. Proceedings of the VLDB Endowment 2, 1 (2009), 730-741.
6. BABCOCK, B., DATAR, M., AND MOTWANI, R. Sampling from a moving window over streaming data. In SODA (2002), pp. 633-634.
7. BAR-YOSSEF, Z., KUMAR, R., AND SIVAKUMAR, D. Reductions in streaming algorithms with an application to counting triangles in graphs. In SODA (2002), pp. 623-632.
8. BECCHETTI, L., BOLDI, P., CASTILLO, C., AND GIONIS, A. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In KDD (2008), pp. 16-24.
9. BUCHSBAUM, A., GIANCARLO, R., AND WESTBROOK, J. On finding common neighborhoods in massive graphs. Theoretical Computer Science 299, 1 (2003), 707-718.
10. BURIOL, L., FRAHLING, G., LEONARDI, S., MARCHETTI-SPACCAMELA, A., AND SOHLER, C. Counting triangles in data streams. In PODS (2006), pp. 253-262.
11. COHEN, E., CORMODE, G., AND DUFFIELD, N. Don't let the negatives bring you down: sampling from streams of signed updates. In SIGMETRICS 40, 1 (2012), 343-354.
12. COHEN, E., DUFFIELD, N., KAPLAN, H., LUND, C., AND THORUP, M. Algorithms and estimators for accurate summarization of internet traffic. In SIGCOMM (2007), pp. 265-278.
13. CORMODE, G., AND MUTHUKRISHNAN, S. Space efficient mining of multigraph streams. In PODS (2005), pp. 271-282.
14. DASGUPTA, A., KUMAR, R., AND SIVAKUMAR, D. Social sampling. In KDD (2012), pp. 235-243.
15. ESTAN, C., AND VARGHESE, G. New directions in traffic measurement and accounting. In SIGCOMM (2002), pp. 323-336.
16. FAN, W. Streamminer: a classifier ensemble-based engine to mine concept-drifting data streams. In VLDB (2004), pp. 1257-1260.
17. FRANK, O. Sampling and estimation in large social networks. Social Networks 1, 1 (1978), 91-101.
18. GIBBONS, P., AND MATIAS, Y. New sampling-based summary statistics for improving approximate query answers. In SIGMOD (1998).
19. HORVITZ, D. G., AND THOMPSON, D. J. A generalization of sampling without replacement from a finite universe. Journal of the American Statistical Association 47, 260 (1952), 663-685.
20. JHA, M., SESHADHRI, C., AND PINAR, A. A space efficient streaming algorithm for triangle counting using the birthday paradox. In KDD (2013), pp. 589-597.
21. JOWHARI, H., AND GHODSI, M. New streaming algorithms for counting triangles in graphs. In COCOON. 2005, pp. 710-716.
22. LESKOVEC, J., AND FALOUTSOS, C. Sampling from large graphs. In KDD (2006), pp. 631-636.
23. MAIYA, A. S., AND BERGER-WOLF, T. Y. Sampling Community Structure. In WWW (2010), pp. 701-710.
24. MANKU, G. S., AND MOTWANI, R. Approximate Frequency Counts over Data Streams. In VLDB (2002), pp. 346-357.
25. PAVAN, A., TANGWONGSAN, K., TIRTHAPURA, S., AND WU, K.-L. Counting and sampling triangles from a graph stream. VLDB 6, 14 (2013), 1870-1881.
26. ROSSI, R. A., GLEICH, D. F., GEBREMEDHIN, A. H., AND PATWARY, M. A. Fast maximum clique algorithms for large graphs. In WWW (2014).
27. SARMA, A. D., GOLLAPUDI, S., AND PANIGRAHY, R. Estimating PageRank on Graph Streams. In PODS (2008), pp. 69-78.
28. SCHANK, T. Algorithmic aspects of triangle-based network analysis.
29. SCHERVISH, M. J. Theory of Statistics. Springer, 1995.
30. SESHADHRI, C., PINAR, A., AND KOLDA, T. G. Triadic measures on graphs: The power of wedge sampling. In SDM (2013).
31. SMITHA, KIM, I., AND REDDY, A. Identifying long term high rate flows at a router. In High Performance Computing (2001).
32. TRAUD, A. L., MUCHA, P. J., AND PORTER, M. A. Social structure of facebook networks. Physica A: Statistical Mechanics and its Applications 391, 16 (2012), 4165-4180.
33. TSOURAKAKIS, C. E., KANG, U., MILLER, G. L., AND FALOUTSOS, C. Doulion: counting triangles in massive graphs with a coin. In KDD (2009), pp. 837-846.
34. VITTER, J. Random sampling with a reservoir. TOMS 11 (1985).
35. WILLIAMS, D. Probability with Martingales. Cambridge University Press, 1991.