J.R. Quinlan, Induction of decision trees, Machine Learning, 1(1), 81-106 (1986). 194 M.Moshkov/Unimprovable Upper Bounds on Time Complexity of Decision Trees Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Unimprovable Upper Bounds on Time Complexity of Decision Trees - Moshkov (1998) Self-citation (Decision Moshkov) (Correct)
....Several lines of investigation of decision trees over finite information systems are known. These are test theory [5, 14, 16, 17, 31, 37, 38] theory of information systems and rough set theory [23, 24, 30] theory of questionnaires [25, 26] theory of decision tables [9] machine learning [27, 28, 29], search theory [1, 35] The terminology and methods of test theory, the groundwork for which was laid by [5, 37] will be used in the present paper for study of decision tree complexity as well as methods of rough set theory created in [23, 24, 30] 160 M.Moshkov Unimprovable Upper Bounds on ....
J.R. Quinlan, Induction of decision trees, Machine Learning, 1(1), 81-106 (1986). 194 M.Moshkov/Unimprovable Upper Bounds on Time Complexity of Decision Trees
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC