Mining complex models from arbitrarily large databases in constant time

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2002, Pages 525-531

  Hulten, Geoff ^a   Domingos, Pedro ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA MINING; ELECTRONIC COMMERCE; LEARNING ALGORITHMS; PATTERN RECOGNITION;

DISCRETE SEARCH; INDUCTION ALGORITHM; KNOWLEDGE DISCOVERY IN DATABASES; SCALING UP METHOD;

DATABASE SYSTEMS;

EID: 0242540431     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775107.775124     Document Type: Conference Paper

References (17)

1. D. Cohn, L. Atlas, and R. Ladner. Improving generalization with active learning. Machine Learning, 15:201-221, 1994.
2. C. Domingo, R. Gavalda, and O. Watanabe. Adaptive sampling methods for scaling up knowledge discovery algorithms. Data Mining and Knowledge Discovery, 6:131-152, 2002.
3. P. Domingos and G. Hulten. Mining high-speed data streams. In Proc. 6th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining, pp. 71-80, Boston, MA, 2000.
4. P. Domingos and G. Hulten. Learning from infinite data in finite time. In Advances in Neural Information Processing Systems 14. MIT Press, Cambridge, MA, 2002.
5. N. Friedman, I. Nachman, and D. Peér. Learning Bayesian network structure from massive datasets: The "sparse candidate" algorithm. In Proc. 15th Conf. on Uncertainty in Artificial Intelligence, pp. 206-215, Stockholm, Sweden, 1999.
6. N. Friedman and Z. Yakhini. On the sample complexity of learning Bayesian networks. In Proc. 12th Conf. on Uncertainty in Artificial Intelligence, pp. 274-282, Portland, OR, 1996.
7. R. Greiner. PALO: A probabilistic hill-climbing algorithm. Artificial Intelligence, 84:177-208, 1996.
8. D. Heckerman, D. Geiger, and D. M. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20:197-243, 1995.
9. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13-30, 1963.
10. G. Hulten and P. Domingos. A general method for scaling up learning algorithms and its application to Bayesian networks. Technical report, Department of Computer Science and Engineering, University of Washington, Seattle, WA, 2002.
11. G. Hulten, L. Spencer, and P. Domingos. Mining time-changing data streams. In Proc. 7th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining, pp. 97-106, San Francisco, CA, 2001.
12. R. Kohavi, C. Brodley, B. Frasca, L. Mason, and Z. Zheng. KDD-Cup 2000 organizers' report: Peeling the onion. SIGKDD Explorations, 2(2):86-98, 2000.
13. O. Maron and A. Moore. Hoeffding races: Accelerating model selection search for classification and function approximation. In Advances in Neural Information Processing Systems 6. Morgan Kaufmann, San Mateo, CA, 1994.
14. C. Meek, B. Thiesson, and D. Heckerman. The learning-curve method applied to model-based clustering. Journal of Machine Learning Research, 2:397-418, 2002.
15. F. Provost, D. Jensen, and T. Oates. Efficient progressive sampling. In Proc. 5th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining, pp. 23-32, San Diego, CA, 1999.
16. T. Scheffer and S. Wrobel. Incremental maximization of non-instance-averaging utility functions with applications to knowledge discovery problems. In Proc. 18th International Conf. on Machine Learning, pp. 481-488, Williamstown, MA, 2001.
17. A. Wald. Sequential analysis. Wiley, New York, 1947.