Linear-Time Rule Induction

Proceedings - 2nd International Conference on Knowledge Discovery and Data Mining, KDD 1996

Volumn , Issue , 1996, Pages 96-101

  Domingos, Pedro ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS; NASA; SPACE SHUTTLES;

ASYMPTOTIC TIME COMPLEXITY; INTERLEAVINGS; LARGE DATASETS; LINEAR TIME; MACHINE-LEARNING; NASA SPACE SHUTTLE; RULE INDUCTION; RULE INDUCTION ALGORITHMS; RULE LEARNERS; RUNNING TIME;

DATA MINING;

EID: 0343580747     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Brunk, C., and Pazzani, M. J. 1991. An investigation of noise-tolerant relational concept learning algorithms. In Proceedings of the Eighth International Workshop on Machine Learning, 389-393. Evanston, IL: Morgan Kaufmann.
2. Catlett, J. 1991. Megamductton: Machine Learning on Very Large Databases. Ph.D. Dissertation, Basser Department of Computer Science, University of Sydney, Sydney, Australia.
3. Clark, P., and Boswell, R. 1991. Rule induction with CN2: Some recent improvements. In Proceedings of the Sixth European Working Session on Learning, 151-163. Porto, Portugal: Springer-Verlag.
4. Cohen, W. W. 1993. Efficient pruning methods for separate-and-conquer rule learning systems. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, 988-994. Chambery, France: Morgan Kaufmann.
5. Cohen, W. W. 1995. Fast effective rule induction. In Proceedings of the Twelfth International Conference on Machine Learning, 115-123. Tahoe City, CA: Morgan Kaufmann.
6. Dougherty, J.; Kohavi, R.; and Sahami, M. 1995. Supervised and unsupervised discretization of continuous features. In Proceedings of the Twelfth International Conference on Machine Learning, 194-202. Tahoe City, CA: Morgan Kaufmann.
7. Fayyad, U. M., and Uthurusamy, R., eds. 1995. Proceedings of the First International Conference on Knowledge Discovery and Data Mining. Montreal, Canada: AAAI Press.
8. Fiirnkranz, J., and Widmer, G. 1994. Incremental reduced error pruning. In Proceedings of the Eleventh International Conference on Machine Learning, 7077. New Brunswick, NJ: Morgan Kaufmann.
9. Holte, R. C.; Acker, L. E.; and Porter, B. W. 1989. Concept learning and the problem of small disjuncts. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 813-818. Detroit, MI: Morgan Kaufmann.
10. Holte, R. C. 1993. Very simple classification rules perform well on most commonly used datasets. Machine Learning 11:63-91.
11. Michie, D.; Spiegelhalter, D. J.; and Taylor, C. C., eds. 1994. Machine Learning, Neural and Statistical Classification. New York: Ellis Horwood.
12. Murphy, P. M., and Aha, D. W. 1995. UCI repository of machine learning databases. Machine-readable data repository, Department of Information and Computer Science, University of California at Irvine, Irvine, CA.
13. Quinlan, J. R. 1993. C4-5: Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann.
14. Segal, R., and Etzioni, O. 1994. Learning decision lists using homogeneous rules. In Proceedings of the Twelfth National Conference on Artificial Intelligence, 619-625. Seattle, WA: AAAI Press.
15. Smyth, P.; Goodman, R. M.; and Higgins, C. 1990. A hybrid rule-based/Bayesian classifier. In Proceedings of the Ninth European Conference on Artificial Intelligence, 610-615. Stockholm, Sweden: Pitman.
16. Utgoff, P. E. 1989. Incremental induction of decision trees. Machine Learning 4:161-186.
17. Weiss, S. M.; Galen, R. M.; and Tadepalli, P. V. 1987. Optimizing the predictive value of diagnostic decision rules. In Proceedings of the Sixth National Conference on Artificial Intelligence, 521-526. Seattle, WA: AAAI Press.