Inferring decision trees using the minimum description length principle
Information and Computation
C4.5: programs for machine learning
C4.5: programs for machine learning
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Polynomial-time solutions to image segmentation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Machine Learning
Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient Construction of Regression Trees with Range and Region Splitting
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A General Measure of Rule Interestingness
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
Interestingness Measures for Fuzzy Association Rules
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
Optimized Substructure Discovery for Semi-structured Data
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Discovering Unordered and Ordered Phrase Association Patterns for Text Mining
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
Mining from Literary Texts: Pattern Discovery and Similarity Computation
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Efficient Data Mining from Large Text Databases
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Efficient Discovery of Proximity Patterns with Suffix Arrays
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Efficient Text Mining with Optimized Pattern Discovery
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Weighted Majority Decision among Region Rules for a Categorical Dataset
DS '99 Proceedings of the Second International Conference on Discovery Science
Parallel Branch-and-Bound Graph Search for Correlated Association Rules
Revised Papers from Large-Scale Parallel Data Mining, Workshop on Large-Scale Parallel KDD Systems, SIGKDD
Computing Optimal Hypotheses Efficiently for Boosting
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Context-sensitive refinements for stochastic optimisation algorithms in inductive logic programming
Artificial Intelligence Review
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
International Journal of Applied Metaheuristic Computing
| Hi-index | 0.00 |
We address the problem of computing various types of expressive tests for decision tress and regression trees. Using expressive tests is promising, because it may improve the prediction accuracy of trees. The drawback is that computing an optimal test could be costly. We present a unified framework to approach this problem, and we revisit the design of efficient algorithms for computing important special cases. We also prove that it is intractable to compute an optimal conjunction or disjunction.