Adaptive sampling methods for scaling up knowledge discovery algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1721, Issue , 1999, Pages 172-183

  Domingo, Carlos ^a   Gavaldà, Ricard ^b   Watanabe, Osamu ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING;

ADAPTIVE SAMPLING ALGORITHMS; ADAPTIVE SAMPLING METHODS; DATA MINING APPLICATIONS; DISCOVERY ALGORITHM; DISCOVERY SCIENCE; LARGE AMOUNTS OF DATA; RESEARCH CHALLENGES; SEQUENTIAL SAMPLING;

PROBLEM SOLVING;

EID: 84862123499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46846-3_16     Document Type: Conference Paper

References (17)

1. Carlos Domingo, Ricard Gavaldà and Osamu Watanabe. Practical Algorithms for On-line Selection. In Proceedings of the First International Conference on Discovery Science, DS’98. Lecture Notes in Artificial Intelligence 1532:150-161, 1998
2. Carlos Domingo, Ricard Gavaldà and Osamu Watanabe. On-line Sampling Methods for Discovering Association Rules. Tech Rep. C-126, Dept. of Math and Computing Science, Tokyo Institute of Technology, 1999.
3. Carlos Domingo, Ricard Gavaldà and Osamu Watanabe. Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms. Tech Rep. C-131, Dept. of Math and Computing Science, Tokyo Institute of Technology. (www.is.titech.ac.jp/research/research-report/C/index.html), 1999.
4. Y. Freund and R.E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. JCSS, 55(1):119-139, 1997.
5. George H. John and Pat Langley. Static Versus Dynamic Sampling for Data Mining. In Proc. of the Second International Conference on Knowledge Discovery and Data Mining, AAAI/MIT Press, 1996.
6. Michael Kearns and Yishay Mansour. On the boosting ability of top-down decision tree learning algorithms. In Proc. of 28th Annual ACM Symposium on the Theory of Computing, pp. 459-468, 1996.
7. M.J. Kearns and U.V. Vazirani. An Introduction to Computational Learning Theory. Cambridge University Press, 1994.
8. Jyrki Kivinen and Heikki Mannila. The power of sampling in knowledge discovery.In Proceedings of the ACM SIGACT-SIGMOD-SIGACT Symposium on Principles of Database Theory, pp.77-85, 1994.
9. Richard J. Lipton and Jeffrey F. Naughton. Query Size Estimation by Adaptive Sampling. Journal of Computer and System Science, 51:18-25, 1995.
10. Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider and S. Seshadri. Efficient sampling strategies for relational database operations. Theoretical Computer Science, 116:195-226, 1993.
11. Oded Maron and Andrew W. Moore. Hoeffding races: Accelerating model selection search for classification and function approximation. Advances in Neural Information Processing Systems, 6:59-66, 1994.
12. Andrew W. Moore and M.S. Lee. Efficient algorithms for minimizing cross validation error. In Proc. of the 11th Int. Conference on Machine Learning, pp. 190-198, 1994.
13. Ron Musick, Jason Catlett and Stuart Russell. Decision Theoretic Subsampling for Induction on Large Databases. In Proceedings of the 10th International Conference on Machine Learning, pp.212-219, 1993.
14. Hannu Toivonen. Sampling large databases for association rules. In Proceedings of the 22nd International Conference on Very Large Databases, pages 134-145, 1996.
15. Abraham Wald. Sequential Analysis. Wiley Mathematical, Statistics Series, 1947.
16. Min Wang, Bala Iyer and Jeffrey Scott Vitter. Scalable Mining for Classification Rules in Relational Databases. In Proceedings of IDEAS’98, pp. 58-67, 1998.
17. Stefan Wrobel. An algorithm for multi-relational discovery of subgroups. In Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery, pp.78-87, 1997.