Simplifying decision trees: A survey

Knowledge Engineering Review

Volumn 12, Issue 1, 1997, Pages 1-40

  Breslow, Leonard A ^a   Aha, David W ^a  

^a NAVAL RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DECISION THEORY; INFORMATION RETRIEVAL; KNOWLEDGE BASED SYSTEMS; LEARNING SYSTEMS; SURVEYS;

INDUCED DECISION TREES; TREE INDUCTION ALGORITHMS;

TREES (MATHEMATICS);

EID: 0031101089     PISSN: 02698889     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269888997000015     Document Type: Review

References (143)

1. Almuallim, H and Dietterich, TG, 1991. "Learning with many irrelevant features" Proc. Ninth National Conference on Artificial Intelligence 547-552, AAAI Press.
2. Auer, P, Holte, RC and Maass, W, 1995. "Theory and applications of agnostic PAC-learning with small decision trees" Proc. Twelfth International Conference on Machine Learning 21-29, Morgan Kaufmann.
3. Auriol, E, Wess, S, Manago, M, Althoff, K-D and Traphöner, R, 1995. "INRECA: a seamlessly integrated system based on inductive inference and case-based reasoning" Proc. First International Conference on CaseBased Reasoning, Sesimbra, Portugal.
4. Barletta, R, 1994. "A hybrid indexing and retrieval strategy for advisory CBR systems built with REMIND" Proc. Second European Workshop on Case-Based Reasoning 49-58, Chantilly, France.
5. Bohanec, M and Bratko, I, 1994. "Trading accuracy for simplicity in decision trees" Machine Learning 15 223-250.
6. Breiman, L, Friedman, JH, Olshen, RA and Stone, CJ, 1984. Classification and Regression Trees, Wadsworth International.
7. Breslow, L and Aha, DW, 1997 "Comparing tree-simplification procedures" Proc. Sixth International Workshop on Artificial Intelligence and Statistics, Ft. Lauderdale, FL.
8. Brodley, CE, 1993. "Addressing the selective superiority problem: automatic algorithm/model class section" Proc. Tenth International Conference on Machine Learning 17-24, Morgan Kaufmann.
9. Brodley, CE, 1995a. "Recursive automatic bias selection for classifier construction" Machine Learning 20 63-94.
10. Brodley, CE, 1995b. "Automatic selection of split criterion during tree growing based on node location" Proc. Twelfth International Conference on Machine Learning 73-80, Morgan Kaufmann.
11. Brodley, CE and Utgoff, PE, 1995. "Multivariate decision trees" Machine Learning 19 45-77.
12. Buntine, W, 1992. "Learning classification trees" Statistics and Computing 2, 63-73.
13. Buntine, W and Niblett, T, 1992. "A further comparison of splitting rules for decision-tree induction" Machine Learning 8 75-86.
14. Catlett, J, 1991. "On changing continuous attributes into ordered discrete attributes" Proc. European Working Session on Learning 164-178, Springer-Verlag.
15. Cendrowska, J, 1987. "PRISM: An algorithm for inducing modular rules" International Journal of ManMachine Studies 27 349-370.
16. Cestnik, B and Bratko, I, 1991. "On estimating probabilities in tree pruning" Proc. Fifth European Working Session on Learning 138-150, Springer-Verlag.
17. Cheng, J, Fayyad, UM, Irani, KB and Qian, Z, 1988. "Improved decision trees: a generalized version of ID3" Proc. Fifth International Conference on Machine Learning 100-106, Morgan Kaufmann.
18. Cherkauer, KJ and Shavlik, JW, 1996. "Growing simpler decision trees to facilitate knowledge discovery" Proc. Knowledge Discovery and Data Mining Conference AAAI Press.
19. Cockett, JRB and Herrera, JA, 1990. "Decision tree reduction" Journal of the ACM 37 (4) 815-842.
20. Cohen, PR and Jensen, D, 1997. "Overfitting explained" Proc. Sixth International Workshop on Artificial Intelligence and Statistics, Ft. Lauderdale, FL.
21. Cohen, WW, 1995. "Fast effective rule induction" Proc. Twelfth International Conference on Machine Learning 115-123, Morgan Kaufmann.
22. Crawford, SL, 1989. "Extensions to the CART algorithm" International Journal of Man-Machine Studies 31 (2) 197-217.
23. Daelemans, W, van den Bosch, A and Weijters, G, 1997. "IGTree: using trees for compression and classification in lazy learning algorithms" Artificial Intelligence Review (to appear).
24. Danyluk, AP and Provost, FJ, 1993. "Small disjuncts in action: learning to diagnose errors in the local loop of the telephone network" Proc. Tenth International Conference on Machine Learning 81-88, Morgan Kaufmann.
25. Devijver, PA and Kittler, J, 1982. Pattern Recognition: a statistical approach, Prentice-Hall.
26. Dietterich, T, Kearns, M and Mansour, Y, 1996. "Applying the weak learning framework to understand and improve C4.5" Proc. Thirteenth International Conference on Machine Learning Morgan Kaufmann (to appear).
27. Doak, J, 1992. An evaluation of feature selection methods and their application to computer security Technical Report CSE-92-18, University of California, Department of Computer Science.
28. Dougherty, J, Kohavi, R and Sahami, M, 1995. "Supervised and unsupervised discretization of continuous features" Proc. Twelfth International Conference On Machine Learning 194-202, Morgan Kaufmann.
29. Elomaa, T, 1994. "In defense of C4.5: notes on learning one-level decision trees" Proc. Eleventh International Conference on Machine Learning 62-69, Morgan Kaufmann.
30. Esposito, F, Malerba, D and Semeraro, G, 1993. "Decision tree pruning as a search in the state space" Proc. European Conference on Machine Learning 165-184, Springer-Verlag.
31. Esposito, F, Malerba, D and Semeraro, G, 1995a. "A further study of pruning methods in decision tree induction" Proc. Fifth International Workshop on Artificial Intelligence and Statistics 211-218, Ft. Lauderdale, FL.
32. Esposito, F, Malerba, D and Semeraro, G, 1995b. "Simplifying decision trees by pruning and grafting: new results" Proc. European Conference on Machine Learning 287-290, Springer-Verlag.
33. Fayyad, UM and Irani, KB, 1992. "The attribute selection problem in decision tree generation" Proc. Tenth National Conference on Artificial Intelligence 104-110, AAAI Press.
34. Fayyad, UM and Irani, KB, 1993. "Multi-interval dicretization of continuous-valued attributes for classification learning" Proc. Thirteenth International Joint Conference on Artificial Intelligence 1022-1029, Morgan Kaufmann.
35. Feelders, A and Verkooijen, W, 1995. "Which method learns most from the data? Methodological issues in the analysis of comparative studies" Proc. Fifth International Workshop on Artificial Intelligence and Statistics 219-225, Ft. Lauderdale, FL.
36. Fisher, DH, 1989. "Knowledge acquisition via incremental conceptual clustering" Machine Learning 2 139-172.
37. Fisher, DH and Schlimmer, JC, 1988. "Concept simplification and prediction accuracy" Proc. Fifth International Conference on Machine Learning 22-28, Morgan Kaufmann.
38. Forsyth, RS, Clarke, DD and Wright, RL, 1994. "Overfitting revisited: an information-theorelic approach to simplifying discrimination trees" Journal of Experimental Artificial Intelligence 6 289-302.
39. Friedman, JH, 1977. "A recursive partitioning decision rule for nonparametric classification" IEEE Transactions on Computers 26 404-408.
40. Furnkranz, J and Widmer, G, 1994. "Incremental reduced error pruning" Proc. Eleventh Conference on Machine Learning 70-77, Morgan Kaufmann.
41. Gaines, BR, 1989. "An ounce of knowledge is worth a ton of data: quantitative studies of the trade-off between expertise and data based on statistically well-founded empirical induction" Proc. Sixth International Workshop on Machine Learning 156-159, Morgan Kaufmann.
42. Gaines, BR, 1995. "Structured and unstructured induction with EDAGs" Proc. First International Conference on Knowledge Discovery and Data Mining AAAI Press.
43. Gaines, BR, 1996. "Transforming rules and trees into comprehensible knowledge structures" In: UM Fayyad, G Piatetsky-Shapiro, P Smyth and R Uthurusamy (eds.), Advances in Knowledge Discovery and Data Mining, MIT Press.
44. Gallant, SI, 1986. "Optimal linear discriminants" Proc. International Conference on Pattern Recognition 849-852, IEEE Press.
45. Gelfand, SB, Ravishankar, CS and Delp, EJ, 1991. "An iterative growing and pruning algorithm for classification tree design" IEEE Transactions on Pattern Analysis and Machine Intelligence 13 (2) 163-174.
46. Gleser, MA and Collen, MF, 1972. "Towards automated medical decisions" Computers and Biomedical Research 5 (2) 180-189.
47. Hart, PE, 1968. "The condensed nearest neighbour rule" IEEE Transactions on Information Theory 14 515-516.
48. Heath, D, Kasif, S and Salzberg, S, 1993. "Induction of oblique decision trees" Proc. Thirteenth International Joint Conference on Artificial Intelligence 1002-1007, Morgan Kaufmann.
49. Holder, LB, 1995. "Intermediate decision trees" Proc. Fourteenth International Joint Conference on Artificial Intelligence 1056-1063, Morgan Kaufmann.
50. Holte, RC, 1993. "Very simple classification rules perform well on most commonly used datasets" Machine Learning 11 63-91.
51. Holte, RC, Acker, LE and Porter, BW, 1989. "Concept learning and the problem of small disjuncts" Proc. Eleventh International Joint Conference on Artificial Intelligence 813-818, Morgan Kaufmann.
52. Hunt, EB, Marin, J and Stone, PJ, 1996. Experiments in Induction, Academic Press.
53. Hyafil, L and Rivest, R, 1976. "Constructing optimal binary decision trees is NP-complete" Information Processing Letters 5 (1) 15-17.
54. John, G, 1995. "Robust decision trees: removing outliers in databases" Proc. First International Conference on Knowledge Discovery and Data Mining AAAI Press.
55. John, G, Kohavi, R, and Pfleger, K, 1994. "Irrelevant features and the subset selection problem" Proc. Eleventh International Machine Learning Conference 121-129, Morgan Kaufmann.
56. Jordan, MI, 1994. "A statistical approach to decision tree modelling" Proc. Eleventh Conference on Machine Learning 363-370, Morgan Kaufmann.
57. Kalkanis, G, 1993. "The application of confidence interval error analysis to the design of decision tree classifiers" Pattern Recognition Letters 14 355-361.
58. Kearns, M and Mansour, Y, 1996. "On the boosting ability of top-down decision tree learning algorithms" Proc. 28th ACM Symposium on the Theory of Computing ACM Press.
59. Kim, H and Koehler, GJ, 1994. "An investigation on the conditions of pruning an induced decision tree" European Journal of Operational Research 77 (1) 82-95.
60. Kira, K and Rendell, LA, 1992a. "The feature selection problem: traditional methods and a new algorithm" Proc. Tenth National Conference on Artificial Intelligence 129-134, AAAI Press.
61. Kira, K and Rendell, LA, 1992b. "A practical approach to feature selection" Proc. Ninth International Conference on Machine Learning 249-256, Morgan Kaufmann.
62. Kohavi, R, 1994a. "Bottom-up induction of oblivious, read-once decision graphs" Proc. European Conference on Machine Learning 154-169, Springer-Verlag.
63. Kohavi, R, 1994b. "Bottom-up induction of oblivious, read-once decision graphs: strengths and limitations" Proc. Twelfth National Conference on Artificial Intelligence 613-618, AAAI Press.
64. Kohavi, R and Li, C-H, 1995. "Oblivious decision trees, graphs, and top-down pruning" Proc. Fourteenth International Joint Conference on Artificial Intelligence 1071-1077, Morgan Kaufmann.
65. Kononenko, I, 1995. "A counter example of the stronger version of the binary tree hypothesis" ECML-95 Workshop on Statistics and Machine Learning in KDD, Crete.
66. Kubat, M and Flotzinger, D, 1995. "Pruning multivariate decision trees by hyperplane merging" Proc. European Conference on Machine Learning 190-199, Springer-Verlag.
67. Langley, P, 1996. Elements of Machine Learning, Morgan Kaufmann.
68. Langley, P and Sage, S, 1994. "Oblivious decision trees and abstract cases" In: DW Aha (ed.), Case-Based Reasoning: Papers from the 1994 Workshop Technical Report WS-94-01, AAAI Press.
69. Li, X and Dubes, RC, 1986. "Tree classifier design with a permutation statistic" Pattern Recognition 19 229-235.
70. Lubinsky, D, 1995. "Increasing the performance and consistency of classification trees by using the accuracy criterion at the leaves" Proc. Twelfth International Conference on Machine Learning 371-377, Morgan Kaufmann.
71. Matheus, CJ, 1990. "Adding domain knowledge to SBL through feature construction" Proc. Eighth National Conference on Artificial Intelligence 803-808, AAAI Press.
72. Matheus, CJ and Rendell, LA, 1989. "Constructive induction on decision trees" Proc. Eleventh International Joint Conference on Artificial Intelligence 645-650, Morgan Kaufmann.
73. Michalski, RS, 1983. "A theory and methodology of inductive learning" In: RS Michalski, JG Carbonell and TM Mitchell (eds.), Machine learning: an artificial intelligence approach, Morgan Kaufmann.
74. Michie, D, 1990. "Inducing knowledge from data: first principles". Unpublished manuscript for a talk given at the Seventh International Conference on Machine Learning, Austin, Texas.
75. Mingers, J, 1987. "Expert systems-rule induction with statistical data" Journal of the Operational Research Society 38 39-47.
76. Mingers, J, 1989a. "An empirical comparison of pruning methods for decision tree induction" Machine Learning 4 227-243.
77. Mingers, J, 1989b. "An empirical comparison of selection measures for decision-tree induction" Machine Learning 3 319-342.
78. Minsky, M and Papert, S, 1969. Perceptrons: an introduction to computational geometry, MIT Press.
79. Moore, AW and Lee, MS, 1994. "Efficient algorithms for minimizing cross validation error" Proc. Eleventh International Conference on Machine Learning 190-198, Morgan Kaufmann.
80. Morgan, J and Sonquist, JA, 1963. "Problems in the analysis of survey data, and a proposal" Journal of the American Statistical Association 58 415-435.
81. Murphy, PM and Pazzani, MJ, 1991. "Constructive induction of M-of-N terms" Proc. Eighth International Workshop on Machine Learning 183-187, Morgan Kaufmann.
82. Murphy, PM and Pazzani, MJ, 1994. "Exploring the decision forest: an empirical investigation of Occam's razor in decision tree induction" Journal of Artificial Intelligence Research 1 257-275.
83. Murthy, S, Kasif, S and Salzberg, S, 1994. "A system for induction of oblique decision trees" Journal of Artificial Intelligence Research 2 1-32.
84. Murthy, S, Kasif, S, Salzberg, S and Beigel, R, 1993. "OC1: randomized induction of oblique decision trees" Proc. Eleventh National Conference on Artificial Intelligence 322-327, AAAI Press.
85. Murthy, SK and Salzberg, S, 1995. "Lookahead and pathology in decision tree induction" Proc. Fourteenth International Joint Conference on Artificial Intelligence 1025-1031, Morgan Kaufmann.
86. Nakamura, Y, Abe, S, Ohsawa, Y and Sakauchi, M, 1993. "A balanced hierarchical data structure for multidimensional data with highly efficient dynamic characteristics" IEEE Transactions on Knowledge and Data Engineering 5 (4) 682-694.
87. Niblett, T and Bratko, I, 1986. "Learning decision rules in noisy domains" Proc. Expert Systems 1986 25-34, Cambridge University Press.
88. Norton, SW, 1989. "Generating better decision trees" Proc. Eleventh International Joint Conference on Artificial Intelligence 800-805, Morgan Kaufmann.
89. Oliveira, AL and Sangiovanni-Vincentelli, A, 1995. "Inferring reduced ordered decision graphs of minimum description length" Twelfth International Conference on Machine Learning 421-429.
90. Oliveira, AL and Vincentelli, AS, 1993. "Learning complex boolean functions: algorithms and applications" In: SJ Hanson et al. (eds.), Advances in Neural Information Processing Systems 5, Morgan Kaufmann.
91. Oliver, JJ, 1993. "Decision graphs-an extension of decision trees" Fourth International Workshop on Artificial Intelligence and Statistics 343-350, Ft. Lauderdale, FL. Unpublished.
92. Oliver, JJ and Hand, DJ, 1995. "On pruning and averaging decision trees" Proc. Twelfth International Machine Learning Conference 430-437, Morgan Kaufmann.
93. Pagallo, G, 1989. "Learning DNF by decision trees" Proc. Eleventh International Joint Conference on Artificial Intelligence 639-644, Morgan Kaufmann.
94. Pagallo, G, 1990. Adaptive decision tree algorithms for learning from examples. Doctoral dissertation, Department of Computer Science, University of California at Santa Cruz, CA.
95. Pagallo, G and Haussler, D, 1990. "Boolean feature discovery in empirical learning" Machine Learning 571-100.
96. Pazzani, M, Merz, C, Murphy, P, Ali, K, Hume, T and Brunk, C, 1994. "Reducing misclassification costs: knowledge-intensive approaches to learning from noisy data" Proc. Eleventh International Conference on Machine Learning 217-225, Morgan Kaufmann.
97. Pérez, E and Rendell, LA, 1995. "Using multidimensional projection to find relations" Proc. Twelfth International Conference on Machine Learning 447-455, Morgan Kaufmann.
98. Pitt, L and Valiant, LG, 1988. "Computational limitations on learning from examples" Journal of the ACM 35 965-984.
99. Quinlan, JR, 1986. "Induction of decision trees" Machine Learning 1 81-106.
100. Quinlan, JR, 1987a. "Simplifying decision trees" International Journal of Man-Machine Studies 27 221-234.
101. Quinlan, JR, 1987b. "Generating production rules from decision trees" Proc. Tenth International Joint Conference on Artificial Intelligence 304-307, Morgan Kaufmann.
102. Quinlan, JR, 1991. "Improved estimates for the accuracy of small disjuncts" Machine Learning 6 (1) 93-98.
103. Quinlan, JR, 1993a. C4.5: programs for machine learning, Morgan Kaufmann.
104. Quinlan, JR, 1993b. "Combining instance-based learning and model-based learning" Proc. Tenth International Conference on Machine Learning 236-243, Morgan Kaufmann.
105. Quinlan, JR, 1996. "Improved use of continuous attributes in C4.5" Journal of Artificial Intelligence Research 4 77-90.
106. Quinlan, JR and Cameron-Jones, RM, 1995. "Oversearching and layered search in empirical learning" Proc. Fourteenth International Joint Conference on Artificial Intelligence 1019-1024, Morgan Kaufmann.
107. Quinlan, JR and Rivest, RL, 1989. "Inferring decision trees using the minimum description length principle" Information and Computation 80 227-248.
108. Ragavan, H and Rendell, L, 1993. "Lookahead feature construction for learning hard concepts" Proc. Tenth International Conference on Machine Learning 252-259, Morgan Kaufmann.
109. Ragavan, H, Rendell, L, Shaw, M and Tessmer, A, 1993. "Complex concept acquisition through directed search and feature caching" Proc. Thirteenth International Joint Conference on Artificial Intelligence 946-951, Morgan Kaufmann.
110. Rendell, L, 1985. "Substantial constructive induction using layered information compression: tractable feature formation in search" Proc. Ninth International Joint Conference on Artificial Intelligence 650-658, Morgan Kaufmann.
111. Rendell, L and Ragavan, H, 1993. "Improving the design of induction methods by analyzing algorithm functionality and data-based concept complexity" Proc. Thirteenth International Joint Conference on Artificial Intelligence 952-958, Morgan Kaufmann.
112. Rissanen, J, 1983. "A universal prior for integers and estimation by minimum description length" Annals of Statistics 11 416-431.
113. Rounds (1980). "A combined non-parametric approach to feature selection and binary decision tree design" Pattern Recognition 12 313-317.
114. Schaffer, C, 1992a. "Deconstructing the digit recognition problem" Proc. Ninth International Conference on Machine Learning 394-399, Morgan Kaufmann.
115. Schaffer, C, 1992b. "Sparse data and the effect of overfitting avoidance in decision tree induction" Proc. Tenth National Conference on Artificial Intelligence 147-152, AAAI Press.
116. Schaffer, C, 1993. "Overfitting avoidance as bias" Machine Learning 10 113-152.
117. Schlimmer, JC and Fisher, D, 1986. "A case study of incremental concept induction" Proc. Fifth National Conference on Artificial Intelligence 496-501, Morgan Kaufmann.
118. Seshu, R, 1989. "Solving the parity problem" Proc. Fourth European Working Session on Learning 263-271, Morgan Kaufmann.
119. Sethi, IK and Sarvarayudu, GPR, 1982. "Hierarchical classifier design using mutual information" IEEE Transactions on Pattern Analysis and Machine Intelligence 4 441-445.
120. Smyth, P, Gray, A and Fayyad, UM, 1995. "Retrofitting decision tree classifiers using kernel density estimation" Proc. Twelfth International Conference on Machine Learning 506-514, Morgan Kaufmann.
121. Thornton, CJ, 1990. The complexity of constructive induction, Technical Report 463. Edinburgh, Scotland: University of Edinburgh, Department of Artificial Intelligence.
122. Ting, KM, 1994. "The problem of small disjuncts: its remedy in decision trees" Proc. Tenth Canadian Conference on Artificial Intelligence 91-97.
123. Utgoff, PE, 1988a. "ID5: an incremental ID3" Proc. Fifth International Conference on Machine Learning 107-120, Morgan Kaufmann.
124. Utgoff, PE, 1988b. "Perceptron trees: a case study in hybrid concept representations" Proc. Seventh National Conference on Artificial Intelligence 601-606, Morgan Kaufmann.
125. Utgoff, PE, 1989a. "Improved training via incremental learning" Proc. Sixth International Workshop on Machine Learning 362-365, Morgan Kaufmann.
126. Utgoff, PE, 1989b. "Perceptron trees: a case study in hybrid concept representations" Connection Science 1 377-391.
127. Utgoff, PE, 1994. "An improved algorithm for incremental induction of decision trees" Proc. Eleventh International Conference on Machine Learning 318-325, Morgan Kaufmann.
128. Utgoff, PE and Brodley, CE, 1990. "An incremental method for finding multivariate splits for decision trees" Proc. Seventh International Conference on Machine Learning 58-65, Morgan Kaufmann.
129. Utgoff, PE and Brodley, CE, 1991. Linear machine decision trees, Technical Report 10. Amherst, MA: University of Massachusetts, Department of Computer Science.
130. Utgoff, PE and Clouse, JA, 1996. A Kolmogorov-Smirnoff metric for decision tree induction, Technical Report 96-3. Amherst, Massachusetts: University of Massachusett, Department of Computer Science.
131. Vadera, S and Nechab, S, 1994. "ID3, its children and their safety" BCS Specialist Group on Expert Systems Newsletter 31 11-21.
132. Wallace, CS and Patrick, JD, 1993. "Coding decision trees" Machine Learning 11 7-22.
133. Webb, GI, 1996. "Further experimental evidence against the utility of Occam's razor" JAIR 4 397-417.
134. Weiss, S and Indurkhya, N, 1994a. "Small sample decision tree pruning" Proc. Eleventh International Machine Learning Conference 335-342, Morgan Kaufmann.
135. Weiss, SH and Indurkhya, N, 1994b. "Decision tree pruning: biased or optimal?" Proc. Twelfth National Conference on Artificial Intelligence 626-632, AAAI Press.
136. Weiss, SM and Indurkhya, N, 1991. "Reduced complexity rule induction" Proc. Twelfth International Joint Conference on Artificial Intelligence 678-684, Morgan Kaufmann.
137. Wilson, D, 1972. "Asymptotic properties of nearest neighbour rules using edited data" IEEE Transactions on Systems, Man and Cybernetics 2 408-421.
138. Wirth, J and Catlett, J, 1988. "Experiments on the costs and benefits of windowing in ID3" Proc. Fifth International Conference on Machine Learning 87-99, Morgan Kaufmann.
139. Yang, D, Blix, G and Rendell, LA, 1991a. "The replication problem: A constructive induction approach" Proc. European Working Session on Learning 44-61, Springer-Verlag.
140. Yang, D, Blix, G and Rendell, LA, 1991b. "A scheme for feature construction and a comparison of empirical methods" Proc. Twelfth International Joint Conference on Artificial Intelligence 699-704, Morgan Kaufmann.
141. Zheng, Z, 1992. "Constructing conjunctive tests for decision trees" Proc. Fifth Australian Joint Conference on Artificial Intelligence 355-360, World Scientific.
142. Zheng, Z, 1995. "Constructing nominal X-of-N attributes" Proc. Fourteenth International Joint Conference on Artificial Intelligence 1064-1070, Morgan Kaufmann.
143. Zhou, XJ and Dillon, TS, 1991. "A statistical-heuristic feature selection criterion for decision tree induction" IEEE Transactions on Pattern Analysis and Machine Intelligence 13 834-841.