CoChat

Evolving decision trees using oracle guides

Open access
Johansson, Ulf, Niklasson, Lars · 2009 · 2009 IEEE Symposium on Computational Intelligence and Data Mining
Cited by 63

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

Some data mining problems require predictive models to be not only accurate but also comprehensible. Comprehensibility enables human inspection and understanding of the model, making it possible to trace why individual predictions are made. Since most high-accuracy techniques produce opaque models, accuracy is, in practice, regularly sacrificed for comprehensibility. One frequently studied technique, often able to reduce this accuracy vs. comprehensibility tradeoff, is rule extraction, i.e., the activity where another, transparent, model is generated from the opaque. In this paper, it is argued that techniques producing transparent models, either directly from the dataset, or from an opaque model, could benefit from using an oracle guide. In the experiments, genetic programming is used to evolve decision trees, and a neural network ensemble is used as the oracle guide. More specifically, the datasets used by the genetic programming when evolving the decision trees, consist of several different combinations of the original training data and ldquooracle datardquo, i.e., training or test data instances, together with corresponding predictions from the oracle. In total, seven different ways of combining regular training data with oracle data were evaluated, and the results, obtained on 26 UCI datasets, clearly show that the use of an oracle guide improved the performance. As a matter of fact, trees evolved using training data only had the worst test set accuracy of all setups evaluated. Furthermore, statistical tests show that two setups, both using the oracle guide, produced significantly more accurate trees, compared to the setup using training data only.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/cidm.2009.4938655

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 15

  1. witten, 2005, Data Mining Practical Machine Learning Tools and Techniques
  2. 10.2307/2279372 · doi:10.2307/2279372 · Paper page
  3. nemenyi, 1963, Distribution-free multiple comparisons
  4. asuncion, 2007, UCI Machine Learning Repository
  5. demsar, 2006, statistical comparisons of classifiers over multiple data sets, Journal of Machine Learning Research, 7, 1
  6. 10.1016/j.ins.2005.03.012 · DOI
  7. bojarczuk, 2001, data mining with constrained-syntax genetic programming: applications in medical data sets, Intelligent Data Analysis in Medicine and Pharmacology - a workshop at MedInfo-2001
  8. breiman, 1984, classification and regression trees, Wadsworth Intl
  9. quinlan, 1993, C4 5 Programs for Machine Learning
  10. johansson, 2007, Obtaining accurate and comprehensible data mining models An evolutionary approach
  11. craven, 1999, Rule Extraction Where Do We Go from Here?
  12. craven, 1996, extracting tree-structured representations of trained networks, Advances in neural information processing systems, 8, 24
  13. lu, 1995, neurorule: a connectionist approach to data mining, International Very Large Databases Conference, 478
  14. 10.1109/ICDMW.2008.117 · DOI · Paper page
  15. johansson, 2003, rule extraction from trained neural networks using genetic programming, International Conference on Artificial Neural Networks, 13

Cited by

See all 63

Metadata

Authors
Johansson, U., & Niklasson, L.
Venue
2009 IEEE Symposium on Computational Intelligence and Data Mining
Publisher
IEEE
Published
2009-03
Pages
238-244
OpenAlex
W2107222792
Cited by
63
References
1
FWCI
1.88
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.