Simple Sampling Techniques for Discovery Science

IEICE Transactions on Information and Systems

Volumn E83-D, Issue 1, 2000, Pages 19-26

  Watanabe, Osamu ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Adaptive sampling; Random sampling; Sequential sampling; The central limit theorem; The chernoff bound; The hoeffding bound

Indexed keywords

ALGORITHMS; DATA MINING; DATA STRUCTURES; RANDOM PROCESSES;

CHERNOFF BOUND; HOEFFDING BOUND;

KNOWLEDGE BASED SYSTEMS;

EID: 0033894340     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and I. Verkamo, "Fast discovery of association rules," Advances in Knowledge Discovery and Data Mining, AAAI Press, pp.307-328, 199G.
2. H. Chernoff, "A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations," Annals of Mathematical Statistics, vol.23, pp.493-509, 1952.
3. C. Domingo, R. Gavaldà, and O. Watanabe, "Practical algorithms for on-line selection," Proc. First International Conference on Discovery Science, Lecture Notes in Artificial Intelligence 1532, pp.150-161, Springer-Verlag, 1998.
4. C. Domingo, R. Gavaldà, and O. Watanabe, "Adaptive sampling methods for scaling up knowledge discovery algorithms," Research Report C-136, Department of Math, and Computing Sciences, Tokyo Institute of Technology, 1999. (Available at wtra.is.titech.ac.jp/research/researchreport/C/)
5. C. Domingo, R. Gavaldà, and O. Watanabe, "Adaptive sampling methods for scaling up knowledge discovery algorithms (the 2nd version)," Proc. Second International Conference on Discovery Science, to appear.
6. W. Feller, An Introduction to Probability Theory and its Applications, Third Edition, John Wiley & Sons, 1968.
7. W. Hoeffding, "Probability inequalities for sums of bounded random variables," Journal of the American Statistical Association, vol.58, pp.13-30, 1963.
8. G.H. John and P. Langley, "Static versus dynamic sampling for data mining," Proc. Second International Conference on Knowledge Discovery and Data Mining, AAAI/MIT Press, 1996.
9. J. Kivinen and II. Mannila, "The power of sampling in knowledge discovery," Proc. ACM SIGACT-SIGMODSIGACT Symposium on Principles of Database Theory, pp.77-85, ACM Press, 1994.
10. R.J. Lipton, J.F. Naughton, D.A. Schneider, and S. Seshadri, "Efficient sampling strategies for relational database operations," Theoretical Computer Science, vol.116, pp. 195-226, 1993.
11. R.J. Lipton and J.F. Naughton, "Query size estimation by adaptive sampling," J. Comput. Syst. Sei., vol.51, pp.1825, 1995.
12. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
13. D. Siegmund, Sequential Analysis: Tests and Confidence Intervals, Springer-Verlag, 1985.
14. A. Wald, Sequential Analysis, John Wiley fc Sons, 1947.
15. M. Wang, B. lyer, and J.S. Vitter, "Scalable mining for classification rules in relational databases," Proc. IDEAS'98, pp.58-67, 1998.
16. G.B. Wetherill, Sequential Methods in Statistics, Second Edition, Chapman and Hall, 1975. Osamu Watanabe recieved in 1982 Master of Science from Tokyo Institute of Technology, Dcpt. Information Sciences, and received Dr. of Engineering in Computer Science from Tokyo Institute of Technology, Dept. Computer Science. He has been a Professor of Dept. Mathematical and Computing Science, Graduate Schools of Information Science and Engineering, Tokyo Institute of Technology. He is interested in problems in computa-tional complexity theory and computational learning.