The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
The Activity of a Variable and Its Relation to Decision Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal evaluation of Boolean expressions in an online query system
Communications of the ACM
The synthetic approach to decision table conversion
Communications of the ACM
Information theory applied to the conversion of decision tables to computer programs
Communications of the ACM
On storage space of decision tables
Communications of the ACM
A Statistical-Heuristic Feature Selection Criterion for Decision Tree Induction
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Active Testing Model for Tracking Roads in Satellite Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
Data Mining and Knowledge Discovery
Theoretical Comparison between the Gini Index and Information Gain Criteria
Annals of Mathematics and Artificial Intelligence
| Hi-index | 14.98 |
Two variable selection criteria are proposed for converting a decision table to a near-optimum decision tree in the sense of minimal average cost of testing. A criterion, Q, is introduced that is based on the potential of a decision table. The previously known criterion 'loss' and Q are combined into a third criterion O. The performance of the three criteria is examined both theoretically and experimentally. Of most importance is that Q and O do not select a nonessential variable, while 'loss' may do so. It is also shown that the performance of the three criteria is not worse than that of any other known heuristics, at least for a particular example. The algorithm requires at most O(L/sup 2/2/sup L/) operations, where L is the arity of an input table.