Journal of the ACM (JACM)
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Conversion of decision tables to computer programs
Communications of the ACM
Conversion of limited-entry decision tables to computer programs
Communications of the ACM
Entropy and information measures in combinatorial optimization
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
Data Mining and Knowledge Discovery
RainForest—A Framework for Fast Decision Tree Construction of Large Datasets
Data Mining and Knowledge Discovery
Lookahead-based algorithms for anytime induction of decision trees
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Interruptible anytime algorithms for iterative improvement of decision trees
UBDM '05 Proceedings of the 1st international workshop on Utility-based data mining
Anytime Learning of Decision Trees
The Journal of Machine Learning Research
When a decision tree learner has plenty of time
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Any time induction of decision trees: an iterative improvement approach
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Lookahead and pathology in decision tree induction
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Ensemble missing data techniques for software effort prediction
Intelligent Data Analysis
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume PartI
Decisions: algebra and implementation
MLDM'11 Proceedings of the 7th international conference on Machine learning and data mining in pattern recognition
Enhancing directed binary trees for multi-class classification
Information Sciences: an International Journal
Ant colony decision forest meta-ensemble
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
ABC: adaptive binary cuttings for multidimensional packet classification
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 14.98 |
The problem of designing storage-efficient decision trees from decision tables is examined. It is shown that for most cases, the construction of the storage optimal decision tree is an NP-complete problem, and therefore a heuristic approach to the problem is necessary. A systematic procedure analogous to the information-theoretic heuristic is developed. The algorithm has low computational complexity and performs well experimentally.