The Activity of a Variable and Its Relation to Decision Trees

Authors:
B. E. Moret;M. Thomason;R. C. Gonzalez
Affiliations:
Department of Computer Science, University of New Mexico, Albuquerque, NM;Department of Computer Science, University of Tennessee, Knoxville, TN and Department of Electrical Engineering, University of Tennessee, Knoxville, TN;University of Tennessee
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1980

Citing 8
Cited 7

Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time

Journal of the ACM (JACM)
Chow Parameters in Threshold Logic

Journal of the ACM (JACM)
Optimizing decision trees through heuristically guided search

Communications of the ACM
Extending the infomation theory approach to converting limited-entry decision tables to computer programs

Communications of the ACM
Information theory applied to the conversion of decision tables to computer programs

Communications of the ACM
Conversion of limited-entry decision tables to computer programs

Communications of the ACM
Decision Table Languages and Systems

Decision Table Languages and Systems
Some aspects of decision table conversion techniques

ACM SIGPLAN Notices - Special issue on decision tables

Prime rule-based methodologies give inadequate control

ISMIS '86 Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems
Criteria for Selecting a Variable in the Construction of Efficient Decision Trees

IEEE Transactions on Computers
Decision tree reduction

Journal of the ACM (JACM)
Decision Trees and Diagrams

ACM Computing Surveys (CSUR)
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey

Data Mining and Knowledge Discovery
Comparison of greedy algorithms for α-decision tree construction

RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Constructing an optimal decision tree for FAST corner point detection

RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The construction of sequential testing procedures from functions of discrete arguments is a common problem in switching theory, software engineering, pattern recognition, and management. The concept of the activity of an argument is introduced, and a theorem is proved which relates it to the expected testing cost of the most general type of decision trees. This result is then extended to trees constructed from relations on finite sets and to decision procedures with cycles. These results are used, in turn, as the basis for a fast heuristic selection rule for constructing testing procedures. Finally, some bounds on the performance of the selection rule are developed.