Social sampling

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

Volumn , Issue , 2012, Pages 235-243

  Dasgupta, Anirban ^a   Kumar, Ravi ^a   Sivakumar, D ^a  

^a YAHOO RESEARCH   (United States)

Author keywords

polling; social networks

Indexed keywords

AVERAGE DEGREE; CLASS OF METHODS; EIGEN-VALUE; NETWORK STRUCTURES; NODE DEGREE; NONUNIFORM SAMPLING; NORMALIZED LAPLACIAN; NUMBER OF SAMPLES; POLLING; PRECISE ANALYSIS; REAL-WORLD NETWORKS; SOCIAL NETWORKS; SYSTEMATIC BIAS; UNBIASED ESTIMATOR;

DATA MINING; EIGENVALUES AND EIGENFUNCTIONS; SURVEYS;

ESTIMATION;

EID: 84866010296     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339572     Document Type: Conference Paper

References (14)

1. L. Backstrom and J. M. Kleinberg. Network bucket testing. In WWW, pages 615-624, 2011.
2. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Sampling algorithms: Lower bounds and applications. In STOC, pages 266-275, 2001.
3. P. Boldi, F. Bonchi, C. Castillo, and S. Vigna. Voting in social networks. In CIKM, pages 777-786, 2009.
4. R. Canetti, G. Even, and O. Goldreich. Lower bounds for sampling algorithms for estimating the average. IPL, 53(1):17-25, 1995.
5. M. Gjoka, M. Kurant, C. Butts, and A. Markopoulou. Walking in Facebook: A case study of unbiased sampling of OSNs. In INFOCOM, pages 1-9, 2010.
6. S. Goel and M. Salganik. Respondent-driven sampling as Markov chain Monte Carlo. Statistics in Medicine, 28(17):2202-2229, 2009.
7. O. Goldreich. A sample of samplers: A computational perspective on sampling. In O. Goldreich, editor, Studies in Complexity and Cryptography, volume 6650, pages 302-332. Springer, 2011.
8. O. Goldreich and A. Wigderson. Tiny families of functions with random properties: A quality-size trade-off for hashing. Random Struct. Algorithms, 11(4):315-343, 1997.
9. D. Heckathorn. Respondent-driven sampling: A new approach to the study of hidden populations. Social Problems, pages 174-199, 1997.
10. L. Katzir, E. Liberty, and O. Somekh. Estimating sizes of social networks via biased sampling. In WWW, pages 597-606, 2011.
11. L. Katzir, E. Liberty, and O. Somekh. Framework and algorithms for network bucket testing. In WWW, pages 1029-1036, 2012.
12. J. Leskovec and C. Faloutsos. Sampling from large graphs. In KDD, pages 631-636, 2006.
13. B. Ribeiro and D. Towsley. Estimating and sampling graphs with multidimensional random walks. In IMC, pages 390-403, 2010.
14. D. Rothschild and J. Wolfers. Forecasting elections: Voter intentions versus expectations, 2011. Manuscript, http://researchdmr.com/ RothschildExpectations.