Decision Trees and Decisionmaking

IEEE Transactions on Systems, Man and Cybernetics

Volumn 20, Issue 2, 1990, Pages 339-346

  Quinlan, J R ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; PROBABILITY;

CLASSIFICATION TASK; CONTEXT SENSITIVITY; DECISION TREES; DESCRIPTIVE DECISION-MAKING KNOWLEDGE EXTRACTION;

DECISION THEORY AND ANALYSIS;

EID: 0025405266     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.52545     Document Type: Article

References (49)

1. B. Arbab and D. Michie, Generating rules from examples, Proc. 9th Int. Joint Conf. Artificial Intell., (Los Altos: Morgan Kaufmann), 1985.
2. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees. Belmont, CA: Wadsworth, 1984.
3. W. Buntine and D. Stirling, “Interactive induction,” Proc. IEEE Conf. Al Appl., San Diego, CA, 1988.
4. J. G. Carbonell, R. S. Michalski, and T. M. Mitchell, “An overview of machine learning,” in Machine Learning: An AI Approach, R. S. Michalski, J. G. Carbonell and T. M. Mitchell, Eds. Palo Alto, CA: Tioga, 1983.
5. C. Carter and J. Catlett, Assessing credit card applications using machine learning, IEEE Expert, vol. 2, no. 3, pp. 71–79, 1987.
6. B. Cestnik. I. Kononenko, and I. Bratko, “ASSISTANT 86: A knowledge-elicitation tool for sophisticated users,” in Progress in Machine Learning, I. Bratko and N. Lavrac, Eds. Wilmslow, UK: Sigma Press, 1987.
7. P. K. Chan, “Inductive learning with BCT,” in Proc. Sixth Int. Workshop on Machine learning. A. M. Segre. Ed. Los Altos. CA: Morgan Kaufmann, 1989.
8. P. Clark, and T. Niblett, “The CN2 induction algorithm,” Machine Learning, vol. 3, no. 4, pp. 261–284, 1989.
9. E. A. Feigenbaum and H. A. Simon, “Performance of a reading task by an elementary perceiving and memorizing program,” Behavioral Sci., vol. 8, no. 3. 1963.
10. E. A. Feigenbaum, “Expert systems in the 1980s,” in Infotech State of the Art Report on Machine Intelligence. A. Bond, Ed. Maidenhead, UK: Pergamon-Infotech, 1981.
11. A. E. Hart, “Experience in the use of an inductive system in knowledge engineering,” in Research and Development in Expert Systems. M. A. Bramer, Ed. Cambridge: Cambridge Univ. Press, 1985.
12. E. B. Hunt, Concept Learning: An Information Processing Problem. New York: Wiley, 1962.
13. E. B. Hunt, J. Marin, and P. J. Stone, Experiments in Induction. New York: Academic Press, 1966.
14. L. Hyafil, and R. L. Rivest, “Constructing optimal binary decision trees is NP-complete,” Information Processing Letters, vol. 5, no. 1. 1976.
15. E. L. Kinney and D. D. Murphy, Comparison of the ID3 algorithm versus discriminant analysis for performing feature selection, Computers and Biomedical Research, vol. 20, pp. 467–476, 1987.
16. W. J. Leech, “A rule based process control method with feedback,” Proc. Instrument Soc. of Amer. Conf., Houston, TX, pp. 169–175, 1986.
17. M. Manago, “Knowledge intensive induction,” in Proc. Sixth Int. Workshop on Machine Learning, A. M. Segre, Ed. Los Altos, CA: Morgan Kaufmann, 1989.
18. R. S. Michalski, “Pattern recognition as rule-guided inductive inference,” IEEE Trans. Pattern Anal. Machine Intell. vol. 2, no. 4, 1980.
19. R. S. Michalski, I. Mozetic, J. Hong, and N. Lavrac, “The multipurpose incremental learning system AQ15 and its testing application to three medical domains,” in Proc. Fifth Nat. Conf. Artificial Intell., Los Altos, CA: Morgan Kaufmann, 1986.
20. J. Mingers, “Expert systems—rule induction with statistical data,” J. Oper. Res. Soc, vol. 38, no. 1, pp. 39–47, 1987.
21. —, “An empirical comparison of selection methods for decision-tree induction,” Machine Learning, vol. 3, no. 4, pp. 261–284, 1989.
22. S. Muggleton, “Structuring knowledge by asking questions,” in Proc. 10th Int. Joint Conf. Artificial Intell., Los Altos, CA: Morgan Kaufmann, 1987.
23. N. J. Nilsson, Learning Machines. New York: McGraw-Hill, 1965.
24. P. O'Rorke, “A comparative study of inductive learning systems AQ1 IP and ID3 using a chess endgame test problem,” Tech. Rep. UIUCDCS-F-82-899, Dept. Comput. Sci., Univ. Illinois at Urbana-Champaign, 1982.
25. G. Pagallo and D. Haussler, “Two algorithms that learn DNF by discovering relevant features,” in Proc. Sixth Int. Workshop on Machine Learning, A. M. Segre, Ed. Los Altos, CA: Morgan Kaufmann, 1989.
26. J. Pearl, On the connection between the complexity and credibility of inferred models,” Int. J. Gen. Syst., vol. 4, 1978.
27. J. R. Quinlan, “Discovering rules by induction from large collections of examples,” in Expert Systems in the Micro Electronic Age, D. Michie, Ed. Edinburgh Univ. Press, 1979.
28. —, “Learning efficient classification procedures and their application to chess endgames,” in Machine Learning: an AI Approach, R. S. Michalski, J. G. Carbonell and T. M. Mitchell, Eds. Palo Alto, CA: Tioga, 1983.
29. —, “Induction of decision trees,” Machine Learning, vol. 1, no. 1, pp. 81–106, 1986.
30. —, “The effect of noise on concept learning,” in Machine Learning: an Al Approach, vol. 2, R. S. Michalski, J. G. Carbonell and T. M. Mitchell, Eds. Los Altos CA,: Morgan Kaufmann.
31. —, “Probabilistic decision trees,” in Proc. Fourth Int. Workshop on Machine Learning, P. Langley, Ed. Los Altos, CA: Morgan Kaufmann, 1987.
32. —. “Simplifying decision trees,” Int. J. Man- Machine Studies, vol. 27, pp. 221–234. 1987.
33. —. “Induction, knowledge, and expert systems,” in Artificial Intelligence Developments and Applications, J. S. Gero and R. Stanton, Eds. Amsterdam: North Holland, 1987.
34. —, “Decision trees and multi-valued attributes,” in Machine Intelligence vol. 11. J. E. Hayes. D. Michie and J. Richards, Eds. Oxford, UK: Oxford Univ. Press, 1988.
35. —, “An empirical comparison of genetic and decision tree classifiers,” Proc. Fifth Int. Machine Learning Conf., J. Laird, Ed. Los Altos, CA: Morgan Kaufmann. 1988.
36. J. R. Quinlan and R. L. Rivest, “Inferring decision trees using the minimum description length principle,” Information and Computation, vol. 80, no. 3, pp. 227–248, 1989.
37. J. R. Quinlan, “Unknown attribute values in induction,” in Proc. Sixth Int. Workshop on Machine Learning, A. M. Segre, Ed. Los Altos, CA: Morgan Kaufmann, 1989.
38. L. A. Rendell, “A general framework for induction and a study of selective induction,” Machine Learning vol. 1, no. 2, pp. 177–226, 1986.
39. L. A. Rendell. H. H. Cho, and R. Seshu, “Improving the design of similarity-based rule-learning systems,” Int. J. Expert Syst., vol. 2, no. 1, pp. 97–133, 1989.
40. C. A. Sammut, Concept development for expert system knowledge bases. Austral. Comput. J., vol. 17, no. 1, 1985.
41. A. Samuel “Some studies in machine learning using the game of checkers II: Recent progress, IBM J. Res. Development vol. 11, no. 6, 1967.
42. J. C. Schlimmer and R. H. Granger, “Beyond incremental processing: tracking concept drift,” Proc. Fifth Nat. Conf. Artificial Intell. (Los Altos, CA: Morgan Kaufmann), 1986.
43. A. D. Shapiro, Structured Induction in Expert Systems. Reading, MA: Addison-Wesley, 1987.
44. B. Shepherd, J. Piper, and D. Rutovitz, “Comparison of ACLS and classical linear methods in a biological application,” in Machine Intelligence vol. 11, J. E. Hayes, D. Michie and J. Richards, Eds. Oxford, UK: Oxford Univ. Press, 1988.
45. S. Spangler, U. M. Fayyad, and R. Uthurusamy, (1989), “Induction of decision trees from inconclusive data,” in Proc. Sixth Int. Workshop on Machine Learning, A. M. Segre, Ed., (Los Altos, CA: Morgan Kaufmann), 1989.
46. P. E. Utgoff, “Incremental induction of decision trees,” Machine Learning, vol. 4, no. 2, 1989.
47. S. M. Weiss, and I. Kapouleas, “An empirical comparison of pattern recognition, neural nets, and machine learning classification methods,” Proc. 11th Int. Joint Conf. Artificial Intell., (Los Altos, CA: Morgan Kaufmann), 1989.
48. P. H. Winston, “Learning structural descriptions from examples,” in The Psychology of Computer Vision, P. H. Winston, Ed. New York: McGraw-Hill, 1975.
49. —, Artificial Intelligence, (second ed.). Reading, MA: Addi son-Wesley, 1984.