A Nested Genetic Algorithm for Explaining Classification Data Sets with Decision Rules

08/23/2022
by   Paul-Amaury Matt, et al.
0

Our goal in this paper is to automatically extract a set of decision rules (rule set) that best explains a classification data set. First, a large set of decision rules is extracted from a set of decision trees trained on the data set. The rule set should be concise, accurate, have a maximum coverage and minimum number of inconsistencies. This problem can be formalized as a modified version of the weighted budgeted maximum coverage problem, known to be NP-hard. To solve the combinatorial optimization problem efficiently, we introduce a nested genetic algorithm which we then use to derive explanations for ten public data sets.

READ FULL TEXT
research
12/15/2014

Generating Graphical Chain by Mutual Matching of Bayesian Network and Extracted Rules of Bayesian Network Using Genetic Algorithm

With the technology development, the need of analyze and extraction of u...
research
05/15/2020

GCLIQUE: An Open Source Genetic Algorithm for the Maximum Clique Problem

A clique in a graph is a set of vertices that are all connected to each ...
research
11/28/2018

Computing Vertex-Weighted Multi-Level Steiner Trees

In the classical vertex-weighted Steiner tree problem (VST), one is give...
research
12/10/2015

Enhanced image feature coverage: Key-point selection using genetic algorithms

Coverage of image features play an important role in many vision algorit...
research
01/29/2019

Knowledge Refinement via Rule Selection

In several different applications, including data transformation and ent...
research
02/03/2021

A Scalable Two Stage Approach to Computing Optimal Decision Sets

Machine learning (ML) is ubiquitous in modern life. Since it is being de...

Please sign up or login with your details

Forgot password? Click here to reset