Inferring decision trees using the minimum description length principle
Information and Computation
C4.5: programs for machine learning
C4.5: programs for machine learning
Machine Learning
The nature of statistical learning theory
The nature of statistical learning theory
Machine Learning
Fat-shattering and the learnability of real-valued functions
Journal of Computer and System Sciences
Scale-sensitive dimensions, uniform convergence, and learnability
Journal of the ACM (JACM)
Generalization performance of support vector machines and other pattern classifiers
Advances in kernel methods
On Comparing Classifiers: Pitfalls toAvoid and a Recommended Approach
Data Mining and Knowledge Discovery
Growing and Pruning Neural Tree Networks
IEEE Transactions on Computers
Boosting the margin: A new explanation for the effectiveness of voting methods
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Bayesian Classifiers Are Large Margin Hyperplanes in a Hilbert Space
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Function learning from interpolation
EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
Estimation of Dependences Based on Empirical Data: Springer Series in Statistics (Springer Series in Statistics)
A study of cross-validation and bootstrap for accuracy estimation and model selection
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Editorial: Kernel Methods: Current Research and Future Directions
Machine Learning
Generalization Error Bounds for Threshold Decision Lists
The Journal of Machine Learning Research
A hierarchical method for multi-class support vector machines
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Localization Site Prediction for Membrane Proteins by Integrating Rule and SVM Classification
IEEE Transactions on Knowledge and Data Engineering
Configurable Hybrid Architectures for Character Recognition Applications
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
On the generalization error of fixed combinations of classifiers
Journal of Computer and System Sciences
Evolving Lucene search queries for text classification
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Novel Design of Decision-Tree-Based Support Vector Machines Multi-class Classifier
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
A comparative study of decision tree approaches to multi-class Support Vector Machines
AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
A memetic algorithm for global induction of decision trees
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Tree Decomposition for Large-Scale SVM Problems
The Journal of Machine Learning Research
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Evolving rules for document classification
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Fast perceptron decision tree learning from evolving data streams
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Support vector machine tree based on feature selection
ICONIP'06 Proceedings of the 13 international conference on Neural Information Processing - Volume Part I
Hierarchical linear support vector machine
Pattern Recognition
Differential evolution and perceptron decision trees for classification tasks
IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
Review: Supervised classification and mathematical optimization
Computers and Operations Research
Large margin principle in hyperrectangle learning
Neurocomputing
Hi-index | 0.00 |
Capacity control in perceptron decision trees is typically performed by controlling their size. We prove that other quantities can be as relevant to reduce their flexibility and combat overfitting. In particular, we provide an upper bound on the generalization error which depends both on the size of the tree and on the margin of the decision nodes. So enlarging the margin in perceptron decision trees will reduce the upper bound on generalization error. Based on this analysis, we introduce three new algorithms, which can induce large margin perceptron decision trees. To assess the effect of the large margin bias, OC1 (Journal of Artificial Intelligence Research, 1994, 2, 1–32.) of Murthy, Kasif and Salzberg, a well-known system for inducing perceptron decision trees, is used as the baseline algorithm. An extensive experimental study on real world data showed that all three new algorithms perform better or at least not significantly worse than OC1 on almost every dataset with only one exception. OC1 performed worse than the best margin-based method on every dataset.