Maximum likelihood rule ensembles

Authors:
Krzysztof Dembczyński;Wojciech Kotłowski;Roman Słowiński
Affiliations:
Poznań University of Technology, Poznań, Poland;Poznań University of Technology, Poznań, Poland;Poznań University of Technology, Poznań, Polish Academy of Sciences, Warsaw, Poland
Venue:
Proceedings of the 25th international conference on Machine learning
Year:
2008

Citing 6
Cited 7

A decision-theoretic generalization of on-line learning and an application to boosting

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Separate-and-Conquer Rule Learning

Artificial Intelligence Review
A simple, fast, and effective rule learner

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization

Machine Learning
Lightweight Rule Induction

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Statistical Comparisons of Classifiers over Multiple Data Sets

The Journal of Machine Learning Research

Learning Rule Ensembles for Ordinal Classification with Monotonicity Constraints

Fundamenta Informaticae - Fundamentals of Knowledge Technology
Mining Rules for the Automatic Selection Process of Clustering Methods Applied to Cancer Gene Expression Data

ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part II
ENDER: a statistical framework for boosting decision rules

Data Mining and Knowledge Discovery
Ensembles of jittered association rule classifiers

Data Mining and Knowledge Discovery
Regret analysis for performance metrics in multi-label classification: the case of hamming and subset zero-one loss

ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
Learning Rule Ensembles for Ordinal Classification with Monotonicity Constraints

Fundamenta Informaticae - Fundamentals of Knowledge Technology
Multi-target regression with rule ensembles

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new rule induction algorithm for solving classification problems via probability estimation. The main advantage of decision rules is their simplicity and good interpretability. While the early approaches to rule induction were based on sequential covering, we follow an approach in which a single decision rule is treated as a base classifier in an ensemble. The ensemble is built by greedily minimizing the negative loglikelihood which results in estimating the class conditional probability distribution. The introduced approach is compared with other decision rule induction algorithms such as SLIPPER, LRI and RuleFit.