Communications of the ACM
The Strength of Weak Learnability
Machine Learning
Learning decision trees using the Fourier spectrum
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A Further Comparison of Splitting Rules for Decision-Tree Induction
Machine Learning
C4.5: programs for machine learning
C4.5: programs for machine learning
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Boosting a weak learning algorithm by majority
Information and Computation
A decision-theoretic generalization of on-line learning and an application to boosting
EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
Simple learning algorithms for decision trees and multivariate polynomials
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Improved boosting algorithms using confidence-rated predictions
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
VC-Dimension Analysis of Object Recognition Tasks
Journal of Mathematical Imaging and Vision
Improved Boosting Algorithms Using Confidence-rated Predictions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
Theoretical Computer Science
Remarks on computational learning theory
Annals of Mathematics and Artificial Intelligence
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
Data Mining and Knowledge Discovery
Statistics and Computing
PAC Analogues of Perceptron and Winnow Via Boosting the Margin
Machine Learning
ECML '02 Proceedings of the 13th European Conference on Machine Learning
Contribution of Dataset Reduction Techniques to Tree-Simplification and Knowledge Discovery
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Identifying and Eliminating Irrelevant Instances Using Information Theory
AI '00 Proceedings of the 13th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Sharper Bounds for the Hardness of Prototype and Feature Selection
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
DS '98 Proceedings of the First International Conference on Discovery Science
Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms
DS '99 Proceedings of the Second International Conference on Discovery Science
From Theoretical Learnability to Statistical Measures of the Learnable
IDA '99 Proceedings of the Third International Symposium on Advances in Intelligent Data Analysis
An introduction to boosting and leveraging
Advanced lectures on machine learning
Reducing multiclass to binary: a unifying approach for margin classifiers
The Journal of Machine Learning Research
Is random model better? On its accuracy and efficiency
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Simplifying decision trees: A survey
The Knowledge Engineering Review
Mining evolving data streams for frequent patterns
Pattern Recognition
On agnostic boosting and parity learning
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Ranking Categorical Features Using Generalization Properties
The Journal of Machine Learning Research
How an Ensemble Method Can Compute a Comprehensible Model
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
On the optimality of probability estimation by random decision trees
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The foundations of cost-sensitive learning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Computing a Comprehensible Model for Spam Filtering
DS '09 Proceedings of the 12th International Conference on Discovery Science
Learning multi-label alternating decision trees from texts and data
MLDM'03 Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition
Prediction by categorical features: generalization properties and application to feature ranking
COLT'07 Proceedings of the 20th annual conference on Learning theory
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Combining feature and example pruning by uncertainty minimization
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Predicate selection for structural decision trees
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Modelling Shared Attention Through Relational Reinforcement Learning
Journal of Intelligent and Robotic Systems
Using a boosted tree classifier for text segmentation in hand-annotated documents
Pattern Recognition Letters
Email marketing and scalability using Hadoop
Proceedings of the 5th ACM COMPUTE Conference: Intelligent & scalable system technologies
Computers in Biology and Medicine
Algorithms and hardness results for parallel large margin learning
The Journal of Machine Learning Research
| Hi-index | 0.00 |