Noise-tolerant windowing

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1997, Pages 852-857

  Fiirnkranz, Johannes ^a  

^a AUSTRIAN RESEARCH INSTITUTE FOR ARTIFICIAL INTELLIGENCE   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREE LEARNING ALGORITHM; MEMORY USE; NOISE-TOLERANCE; NOISE-TOLERANT; RULE LEARNING ALGORITHMS;

ARTIFICIAL INTELLIGENCE; DECISION TREES;

LEARNING ALGORITHMS;

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

References (17)

1. L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Wadsworth & Brooks, Pacific Grove, CA, 1984.
2. Jason Catlett. Megainduction: A test flight. In L.A. Birnbaum and G.C. Collins, editors, Proceedings of the Sth International Workshop on Machine Learning (ML-91), pages 596-599, Evanston, IL, 1991. Morgan Kaufmann.
3. Jason Catlett. Peepholing: Choosing attributes efficiently for megainduction. In Proceedings of the 9th International Conference on Machine Learning (ML-91), pages 49-54. Morgan Kaufmann, 1992.
4. Peter Clark and Tim Niblett. The CN2 induction algorithm. Machine Learning, 3(4):261-283, 1989.
5. William W. Cohen. Fast effective rule induction. In A. Prieditis and S. Russell, editors, Proceedings of the 12th International Conference on Machine Learning (ML-95), pages 115-123, Lake Tahoe, CA, 1995. Morgan Kaufmann.
6. Pedro Domingos. Efficient specific-to-general rule induction. In E. Simoudis and J. Han, editors, Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), pages 319-322. AAAI Press, 1996.
7. Johannes FUrnkranz and Gerhard Widmer. Incremental Reduced Error Pruning. In W. Cohen and H. Hirsh, editors. Proceedings of the 11th International Conference on Machine Learning (ML-94), pages 70-77, New Brunswick, NJ, 1994. Morgan Kaufmann.
8. Johannes FUrnkranz. More efficient windowing. In Proceedings of the 14th National Conference on Artificial Intelligence (AAA1-97), Providence, RI, 1997. AAAI Press.
9. Johannes FUrnkranz. Separate-and-conquer rule learning. Artificial Intelligence Review, 1997. To appear.
10. George H. John and Pat Langley. Static versus dynamic sampling for data mining. In E. Simoudis and J. Han, editors, Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), pages 367-370. AAAI Press, 1996.
11. Jyrki Kivinen and Heikki Mannila. The power of sampling in knowledge discovery. In Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-94), pages 77-85, 1994.
12. David D. Lewis and Jason Catlett. Heterogeneous uncertainty sampling for supervised learning. In Proceedings of the 11th International Conference on Machine Learning (ML-94), pages 148-156, New Brunswick, NJ, 1994. Morgan Kaufmann.
13. John Ross Quinlan. Learning efficient classification procedures and their application to chess end games. In Ryszard S. Michalski, Jaime G. Carbonell, and Tom M. Mitchell, editors, Machine Learning. An Artificial Intelligence Approach, pages 463-482. Tioga, Palo Alto, CA, 1983.
14. John Ross Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA, 1993.
15. Hannu Toivonen. Sampling large databases for association rules. In Proceedings of the 22nd Conference on Very Large Data Bases (VLDB-96), pages 134-145, Mumbai, India, 1996.
16. Jarryl Wirth and Jason Catlett. Experiments on the costs and benefits of windowing in ID3. In J. Laird, editor, Proceedings of the Sth International Conference on Machine Learning (ML-88), pages 87-99, Ann Arbor, MI, 1988. Morgan Kaufmann.
17. Yiming Yang. Sampling strategies and learning efficiency in text categorization. In M. Hearst and H. Hirsh, editors, Proceedings of the AAAI Spring Symposium on Machine Learning in Information Access, pages 88-95. AAAI Press, 1996. Technical Report SS-96-05.