arXiv Analytics

Sign in

arXiv:1706.10199 [cs.LG]AbstractReferencesReviewsResources

Rule-Mining based classification: a benchmark study

Margaux Luck, Nicolas Pallet, Cecilia Damon

Published 2017-06-30Version 1

This study proposed an exhaustive stable/reproducible rule-mining algorithm combined to a classifier to generate both accurate and interpretable models. Our method first extracts rules (i.e., a conjunction of conditions about the values of a small number of input features) with our exhaustive rule-mining algorithm, then constructs a new feature space based on the most relevant rules called "local features" and finally, builds a local predictive model by training a standard classifier on the new local feature space. This local feature space is easy interpretable by providing a human-understandable explanation under the explicit form of rules. Furthermore, our local predictive approach is as powerful as global classical ones like logistic regression (LR), support vector machine (SVM) and rules based methods like random forest (RF) and gradient boosted tree (GBT).

Related articles: Most relevant | Search more
arXiv:2004.09546 [cs.LG] (Published 2020-04-20)
A Benchmark Study on Time Series Clustering
arXiv:2308.11838 [cs.LG] (Published 2023-08-23)
A Benchmark Study on Calibration
arXiv:1703.08816 [cs.LG] (Published 2017-03-26)
Uncertainty Quantification in the Classification of High Dimensional Data