Finding the most interesting patterns in a database quickly by using sequential sampling

Journal of Machine Learning Research

Volumn 3, Issue 4-5, 2003, Pages 833-862

  Scheffer, Tobias ^a   Wrobel, Stefan ^b,c  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b FRAUNHOFER IAIS   (Germany)

^c UNIVERSITY OF BONN   (Germany)

Author keywords

Incremental learning; Large databases; Online learning; Sampling

Indexed keywords

DATABASE SYSTEMS; KNOWLEDGE BASED SYSTEMS; LEARNING ALGORITHMS; ONLINE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

DATABASE QUERIES; INCREMENTAL LEARNING; ONLINE LEARNING; SAMPLING ALGORITHM;

LEARNING SYSTEMS;

EID: 0141719772     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (31)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In ACM SIGMOD Conference on Management of Data, pages 207-216, 1993.
2. L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Pacific Grove, 1984.
3. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sums of observations. Annals of Mathematical Statistics, 23:409-507, 1952.
4. H. Dodge and H. Romig. A method of sampling inspection. The Bell System Technical Journal, 8:613-631, 1929.
5. C. Domingo, R. Gavelda, and O. Watanabe. Practical algorithms for on-line selection. In Proc. International Conference on Discovery Science, pages 150-161, 1998.
6. C. Domingo, R. Gavelda, and O. Watanabe. Adaptive sampling methods for scaling up knowledge discovery algorithms. Technical Report TR-C131, Dept. de LSI, Politecnica de Catalunya, 1999.
7. U. Fayyad, G. Piatetski-Shapiro, and P. Smyth. Knowledge discovery and data mining: Towards a unifying framework. In KDD-96, 1996.
8. Y. Freund. Self-bounding learning algorithms. In Proceedings of the International Workshop on Computational Learning Theory (COLT-98), 1998.
9. K. Ghosh, M. Mukhopadhyay, and P. Sen. Sequential Estimation. Wiley, 1997.
10. R. Greiner and R. Isukapalli. Learning to select useful landmarks. IEEE Transactions on Systems, Man, and Cybernetics, Part B:473-449, 1996.
11. Russell Greiner. PALO: A probabilistic hill-climbing algorithm. Artificial Intelligence, 83(1-2), July 1996.
12. P. Haas and A. Swami. Sequential sampling procedures for quesy size estimation. Research Report RJ 9101 (80915), IBM, 1992.
13. D. Haussler, M. Kearns, S. Seung, and N. Tishby. Rigorous learning curve bounds from statistical mechanics. Machine Learning, 25, 1996.
14. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
15. G. Hulten and P. Domingos. Mining high-speed data streams. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, 2000.
16. M. Kearns and U. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
17. W. Klösgen. Problems in knowledge discovery in databases and their treatment in the statistics interpreter explora. Journal of Intelligent Systems, 7:649-673, 1992.
18. W. Klösgen. Assistant for knowledge discovery in data. In P. Hoschka, editor, Assisting Computer: A New Generation of Support Systems, 1995.
19. W. Klösgen. Explora: A multipattern and multistrategy discovery assistant. In Advances in Knowledge Discovery and Data Mining, pages 249-271. AAAI, 1996.
20. J. Langford and D. McAllester. Computable shell decomposition bounds. In Proceedings of the International Conference on Computational Learning Theory, 2000.
21. O. Maron and A. Moore. Hoeffding races: Accelerating model selection search for classification and function approximating. In Advances in Neural Information Processing Systems, pages 59-66, 1994.
22. A. Moore and M. Lee. Efficient algorithms for minimizing cross validation error. In Proceedings of the Eleventh International Conference on Machine Learning, pages 190-198, 1994.
23. G. Piatetski-Shapiro. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, pages 229-248, 1991.
24. T. Scheffer and S. Wrobel. A sequential sampling algorithm for a general class of utility functions. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, 2000.
25. T. Scheffer and S. Wrobel. Hidden markov models for text classification and information extraction. Technical report, University of Magdeburg, 2002.
26. H. Toivonen. Sampling large databases for association rules. In Proc. VLDB Conference, 1996.
27. R. Uthurusamy, U. Fayyad, and S. Spangler. Learning useful rules from inconclusive data. In Knowledge Discovery in Databases, pages 141-158, 1991.
28. V. Vapnik. The Nature of Statistical Learning Theory. Springer, 1996.
29. A. Wald. Sequential Analysis. Wiley, 1947.
30. D. H. Wolpert. The relationship between PAC, the statistical physics framework, the Bayesian framework, and the VC framework. In D. H. Wolpert, editor, The Mathematics of Generalization, The SFI Studies in the Sciences of Complexity, pages 117-214. Addison-Wesley, 1995.
31. Stefan Wrobel. An algorithm for multi-relational discovery of subgroups. In Proc. First European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD-97), pages 78-87, Berlin, 1997.