TL;DR
RIPE is a transparent, rule-based prediction algorithm that constructs interpretable models using hyperrectangles, suitable for both continuous and discrete data, demonstrated through simulations and efficiency comparisons.
Contribution
It introduces a new deterministic rule induction method that creates sparse, interpretable partitions for predicting and explaining a target variable.
Findings
Effective on simulated datasets
Produces sparse, interpretable rule sets
Compared favorably with existing algorithms
Abstract
RIPE is a novel deterministic and easily understandable prediction algorithm developed for continuous and discrete ordered data. It infers a model, from a sample, to predict and to explain a real variable given an input variable (features). The algorithm extracts a sparse set of hyperrectangles , which can be thought of as rules of the form If-Then. This set is then turned into a partition of the features space of which each cell is explained as a list of rules with satisfied their If conditions. The process of RIPE is illustrated on simulated datasets and its efficiency compared with that of other usual algorithms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
