Scalable simple random sampling and stratified sampling

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 2, 2013, Pages 1568-1576

  Meng, Xiangrui ^a  

^a LINKEDIN CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; LEARNING SYSTEMS;

EMPIRICAL EVALUATIONS; HETEROGENEOUS DATA; HIGH PROBABILITY; LARGE-SCALE DATUM; MASSIVE DATA SETS; SAMPLE SIZES; SIMPLE RANDOM SAMPLING; STRATIFIED SAMPLING;

IMPORTANCE SAMPLING;

EID: 84897512709     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Ahrens, J. H. and Dieter, U. Sequential random sampling. ACM Transactions on Mathematical Software (TOMS), 11 (2): 157-169, 1985.
2. Bernstein, S. Theory of Probability. Moscow, 1927.
3. Blum, M., Floyd, R. W., Pratt, V., Rivest, R. L., and Tarjan, R. E. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448-461, 1973.
4. Boyd, S., Parikh, N., Chu, E., Peleato, B., and Eckstein, J. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends® in Machine Learning, 3(1):1-122, 2011.
5. Chaudhuri, S., Motwani, R., and Narasayya, V. On random sampling over joins. ACM SIGMOD Record, 28(2):263-274, 1999.
6. Czajkowski, G. Sorting 1PB with MapReduce, 2008. http://googleblog. blogspot.com/2008/11/sorting-1pb-with-mapreduce.html.
7. p regression. SIAM Journal on Computing, 38 (5):2060-2078, 2009.
8. Dean, J. and Ghemawat, S. MapReduce: simplified data processing on large clusters. Communications of the ACM, 51(1):107-113, 2008.
9. Fan, C. T., Muller, M. E., and Rezucha, I. Development of sampling plans by using sequential (item by item) selection techniques and digital computers. Journal of the American Statistical Association, 57 (298):387-402, 1962.
10. Leskovec, J. and Faloutsos, C. Sampling from large graphs. In Proceedings of the 12th International Conference on Knowledge Discovery and Data Mining, pp. 631-636. ACM, 2006.
11. Manku, G. S., Rajagopalan, S., and Lindsay, B. G. Random sampling techniques for space efficient online computation of order statistics of large datasets. ACM SIGMOD Record, 28(2):251-262, 1999.
12. Maurer, A. A bound on the deviation probability for sums of non-negative random variables. J. Inequalities in Pure and Applied Mathematics, 4, 2003.
13. Owen, S., Anil, R., Dunning, T., and Friedman, E. Mahout in Action. Manning Publications Co., 2011.
14. Sunter, A. B. List sequential sampling with equal or unequal probabilities without replacement. Applied Statistics, pp. 261-268, 1977.
15. Thompson, S. K. Sampling. Wiley, 3 edition, 2012.
16. Tillé, Y. Sampling Algorithms. Springer, 2006.
17. Toivonen, H. Sampling large databases for association rules. In Proceedings of the 22th International Conference on Very Large Data Bases, pp. 134-145. Morgan Kaufmann Publishers Inc., 1996.
18. Vitter, J. S. Random sampling with a reservoir. ACM Transactions on Mathematical Software (TOMS), 11(1):37-57, 1985.
19. Vitter, J. S. An efficient algorithm for sequential random sampling. ACM transactions on mathematical software (TOMS), 13(1):58-67, 1987.
20. White, T. Hadoop: The Definitive Guide. O'Reilly Media, 2012.