Journal of the ACM (JACM)
Translation of Decision Tables
ACM Computing Surveys (CSUR)
Information theory applied to the conversion of decision tables to computer programs
Communications of the ACM
On the conversion of decision tables to computer programs
Communications of the ACM
Use of decision tables in computer programming
Communications of the ACM
Conversion of limited-entry decision tables to computer programs
Communications of the ACM
Conversion of decision tables to computer programs by rule mask techniques
Communications of the ACM
Conversion of decision tables into decision trees
Conversion of decision tables into decision trees
An analysis of programming via decision table compilers
ACM SIGPLAN Notices - Special issue on decision tables
Conversion of limited-entry decision tables into optimal decision trees: fundamental concepts
ACM SIGPLAN Notices - Special issue on decision tables
Optimized code generation from extended-entry decision tables
ACM SIGPLAN Notices - Special issue on decision tables
Criteria for Selecting a Variable in the Construction of Efficient Decision Trees
IEEE Transactions on Computers
IEEE Transactions on Computers
Optimal Partitioning for Classification and Regression Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Dynamic Programming as Graph Searching: An Algebraic Approach
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Conversion of decision tables to efficient sequential testing procedures
Communications of the ACM
Optimal conversion of extended-entry decision tables with general cost criteria
Communications of the ACM
Optimizing decision trees through heuristically guided search
Communications of the ACM
Communications of the ACM
Sequential Decision Models for Expert System Optimization
IEEE Transactions on Knowledge and Data Engineering
LOGE: a highly effective system for logic design automation
ACM SIGDA Newsletter
Mining optimal decision trees from itemset lattices
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Sequential Fault Diagnosis of Modular Systems
IEEE Transactions on Computers
Optimal Decision Tree Synthesis for Efficient Neighborhood Computation
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Optimized block-based connected components labeling with decision trees
IEEE Transactions on Image Processing
Optimal constraint-based decision tree induction from itemset lattices
Data Mining and Knowledge Discovery
WSEAS Transactions on Information Science and Applications
Optimal decision trees generation from OR-decision tables
ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing: Part I
Constructing an optimal decision tree for FAST corner point detection
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Optimal decision trees for local image processing algorithms
Pattern Recognition Letters
| Hi-index | 48.29 |
Previous approaches to the problem of automatically converting decision tables to computer programs have been based on decomposition. At any stage, one condition is selected for testing, and two smaller problems (decision tables with one less condition) are created. An optimal program (with respect to average execution time or storage space, for example) is located only through implicit enumeration of all possible decision trees using a technique such as branch-and-bound. The new approach described in this paper uses dynamic programming to synthesize an optimal decision tree from which a program can be created. Using this approach, the efficiency of creating an optimal program is increased substantially, permitting generation of optimal programs for decision tables with as many as ten to twelve conditions.