Rule-Mining based classification: a benchmark study
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).
Code (1)
Tasks
ClassificationGeneral ClassificationregressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Cambrian Explosion Algorithm for Multi-Objective Association Rules Mining
Association rule mining is one of the most studied research fields of data mining, with applications ranging from grocery basket problems to highly explainable classification systems. Classical association rule mining al…
DiversityRule Mining for Correcting Classification Models
Machine learning models need to be continually updated or corrected to ensure that the prediction accuracy remains consistently high. In this study, we consider scenarios where developers should be careful to change the …
ClassificationAssociation Rules Mining with Auto-Encoders
Association rule mining is one of the most studied research fields of data mining, with applications ranging from grocery basket problems to explainable classification systems. Classical association rule mining algorithm…
NeuroRule: A Connectionist Approach to Data Mining
Classification, which involves finding rules that partition a given data set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining classification rules for large databases are …
General ClassificationDRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs
In this paper, we study the problem of learning probabilistic logical rules for inductive and interpretable link prediction. Despite the importance of inductive link prediction, most previous works focused on transductiv…
Inductive knowledge graph completionInductive Link PredictionKnowledge GraphsLink Prediction+1