Open AccessProceedings Article
Learning Complexity-Bounded Rule-Based Classifiers by Combining Association Analysis and Genetic Algorithms
Yu Yi,Eyke Hüllermeier +1 more
- 01 Jan 2005
pp 47-52
TL;DR: Apart from learning accurate classifiers, a main motivation of the method is the possibility to control the tradeoff between accuracy and transparency (complexity) of a model in a more explicit way.
read more
Abstract: We propose a method for learning rule-based classifiers that can be seen as a compromise between a complete enumeration of the hypothesis space and heuristic strategies to search this space in a greedy manner. The method consists of two main parts: In a first step, a sufficiently large number of individual, high-quality classification rules is generated. In a second step, a classifier is assembled from the candidate rules thus obtained. This comes down to selecting a proper subset of these rules, a combinatorial problem that we shall approach by means of genetic algorithms. For the candidate generation step, we suggest using association rule mining. Apart from learning accurate classifiers, a main motivation of our method is the possibility to control the tradeoff between accuracy and transparency (complexity) of a model in a more explicit way.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Interpretable classifiers using rules and bayesian analysis: building a better stroke prediction model
TL;DR: In this paper, a generative model called Bayesian rule lists (BRL) is proposed to predict the risk of stroke in patients with atrial fibrillation, which can be used to produce highly accurate and interpretable medical scoring systems.
768
Interpretable classifiers using rules and Bayesian analysis: Building a better stroke prediction model
TL;DR: In this paper, a generative model called Bayesian Rule Lists (BRL) is proposed for predicting the risk of stroke in patients with atrial fibrillation, which can be used to produce highly accurate and interpretable medical scoring systems.
A Fuzzy Association Rule-Based Classification Model for High-Dimensional Problems With Genetic Rule Selection and Lateral Tuning
TL;DR: This method limits the order of the associations in the association rule extraction and considers the use of subgroup discovery, which is based on an improved weighted relative accuracy measure to preselect the most interesting rules before a genetic postprocessing process for rule selection and parameter tuning.
•Proceedings Article
An interpretable stroke prediction model using rules and Bayesian analysis
Benjamin Letham,Cynthia Rudin,Tyler H. McCormick,David Madigan +3 more
- 01 Jan 2013
TL;DR: This work introduces a generative model called the Bayesian List Machine for fitting decision lists, a type of interpretable classifier, to data that is simple enough to be understood by patients yet significantly outperform the medical scoring systems currently in use.
59
Semi-overlap functions and novel fuzzy reasoning algorithms with applications
TL;DR: Wang et al. as mentioned in this paper relax the definition of general overlap functions, more precisely, removing its right-continuous, and introduce a new kind of aggregation function, which called semi-overlap function.
References
Induction of Decision Trees
TL;DR: In this paper, an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such system, ID3, in detail, is described, and a reported shortcoming of the basic algorithm is discussed.
•Book
Genetic Algorithms + Data Structures = Evolution Programs
Zbigniew Michalewicz
- 01 Jan 1992
TL;DR: GAs and Evolution Programs for Various Discrete Problems, a Hierarchy of Evolution Programs and Heuristics, and Conclusions.
13.5K
•Proceedings Article
Fast algorithms for mining association rules
Rakesh Agrawal,Ramakrishnan Srikant +1 more
- 01 Jul 1998
TL;DR: Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems.
Fast effective rule induction
William W. Cohen
- 09 Jul 1995
TL;DR: This paper evaluates the recently-proposed rule learning algorithm IREP on a large and diverse collection of benchmark problems, and proposes a number of modifications resulting in an algorithm RIPPERk that is very competitive with C4.5 and C 4.5rules with respect to error rates, but much more efficient on large samples.
4.5K
•Proceedings Article
Integrating classification and association rule mining
Bing Liu,Wynne Hsu,Yiming Ma +2 more
- 27 Aug 1998
TL;DR: The integration is done by focusing on mining a special subset of association rules, called class association rules (CARs), and shows that the classifier built this way is more accurate than that produced by the state-of-the-art classification system C4.5.