Simple Sampling Techniques for Discovery Science
暂无分享,去创建一个
[1] J. Pedoe,et al. Sequential Methods in Statistics , 1966 .
[2] Jeffrey F. Naughton,et al. Query Size Estimation by Adaptive Sampling , 1995, J. Comput. Syst. Sci..
[3] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[4] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[5] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[6] J. Andel. Sequential Analysis , 2022, The SAGE Encyclopedia of Research Design.
[7] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[8] D. Siegmund. Sequential Analysis: Tests and Confidence Intervals , 1985 .
[9] Jeffrey Scott Vitter,et al. Scalable mining for classification rules in relational databases , 1998, Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156).
[10] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.
[11] Jeffrey F. Naughton,et al. Efficient Sampling Strategies for Relational Database Operations , 1993, Theor. Comput. Sci..
[12] Heikki Mannila,et al. The power of sampling in knowledge discovery , 1994, PODS '94.
[13] Pat Langley,et al. Static Versus Dynamic Sampling for Data Mining , 1996, KDD.