ID: An Incremental ID3
作者： PAUL E. UTGOFF
DOI: 10.1016/B978-0-934613-64-4.50017-7
关键词: Decision tree 、 ID3 algorithm 、 Tree (data structure) 、 ID3 、 Artificial intelligence 、 Incremental decision tree 、 Data mining 、 Principal (computer security) 、 Computer science 、 C4.5 algorithm 、 Machine learning
摘要: This paper describes ID5, an incremental algorithm that produces decision trees similar to those built by Quinlan's ID3. The principal benefit of ID5 is that new training instances can be …
sci-hub.st 参考文章(5)
Jeffrey C. Schlimmer, Douglas Fisher, A case study of incremental concept induction national conference on artificial intelligence. pp. 496- 501 ,(1986)
PAUL E. UTGOFF, SHARAD SAXENA, Learning a Preference Predicate Proceedings of the Fourth International Workshop on MACHINE LEARNING#R##N#June 22–25, 1987 University of California, Irvine. pp. 115- 121 ,(1987) , 10.1016/B978-0-934613-41-5.50015-5
P. Lewis, The characteristic selection problem in recognition systems IEEE Transactions on Information Theory. ,vol. 8, pp. 171- 178 ,(1962) , 10.1109/TIT.1962.1057691
J.R. Quinlan, Induction of Decision Trees Machine Learning. ,vol. 1, pp. 81- 106 ,(1986) , 10.1023/A:1022643204877
J. Ross Quinlan, Learning Efficient Classification Procedures and Their Application to Chess End Games Machine Learning. pp. 463- 482 ,(1983) , 10.1007/978-3-662-12405-5_15