Rule Extraction from Random Forest: the RF+HC Methods View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2015-04-29

AUTHORS

Morteza Mashayekhi , Robin Gras

ABSTRACT

Random forest (RF) is a tree-based learning method, which exhibits a high ability to generalize on real data sets. Nevertheless, a possible limitation of RF is that it generates a forest consisting of many trees and rules, thus it is viewed as a black box model. In this paper, the RF+HC methods for rule extraction from RF are proposed. Once the RF is built, a hill climbing algorithm is used to search for a rule set such that it reduces the number of rules dramatically, which significantly improves comprehensibility of the underlying model built by RF. The proposed methods are evaluated on eighteen UCI and four microarray data sets. Our experimental results show that the proposed methods outperform one of the state-of-the-art methods in terms of scalability and comprehensibility while preserving the same level of accuracy. More... »

PAGES

223-237

Book

TITLE

Advances in Artificial Intelligence

ISBN

978-3-319-18355-8
978-3-319-18356-5

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-319-18356-5_20

DOI

http://dx.doi.org/10.1007/978-3-319-18356-5_20

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1039448237


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "School of Computer Science, University of Windsor, Windsor, ON, Canada", 
          "id": "http://www.grid.ac/institutes/grid.267455.7", 
          "name": [
            "School of Computer Science, University of Windsor, Windsor, ON, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mashayekhi", 
        "givenName": "Morteza", 
        "id": "sg:person.07552175653.46", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07552175653.46"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "School of Computer Science, University of Windsor, Windsor, ON, Canada", 
          "id": "http://www.grid.ac/institutes/grid.267455.7", 
          "name": [
            "School of Computer Science, University of Windsor, Windsor, ON, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gras", 
        "givenName": "Robin", 
        "id": "sg:person.0712313416.43", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0712313416.43"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2015-04-29", 
    "datePublishedReg": "2015-04-29", 
    "description": "Random forest (RF) is a tree-based learning method, which exhibits a high ability to generalize on real data sets. Nevertheless, a possible limitation of RF is that it generates a forest consisting of many trees and rules, thus it is viewed as a black box model. In this paper, the RF+HC methods for rule extraction from RF are proposed. Once the RF is built, a hill climbing algorithm is used to search for a rule set such that it reduces the number of rules dramatically, which significantly improves comprehensibility of the underlying model built by RF. The proposed methods are evaluated on eighteen UCI and four microarray data sets. Our experimental results show that the proposed methods outperform one of the state-of-the-art methods in terms of scalability and comprehensibility while preserving the same level of accuracy.", 
    "editor": [
      {
        "familyName": "Barbosa", 
        "givenName": "Denilson", 
        "type": "Person"
      }, 
      {
        "familyName": "Milios", 
        "givenName": "Evangelos", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-18356-5_20", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-319-18355-8", 
        "978-3-319-18356-5"
      ], 
      "name": "Advances in Artificial Intelligence", 
      "type": "Book"
    }, 
    "keywords": [
      "random forest", 
      "terms of scalability", 
      "number of rules", 
      "data sets", 
      "real data sets", 
      "rule extraction", 
      "art methods", 
      "learning method", 
      "tree-based learning method", 
      "black box model", 
      "microarray data sets", 
      "experimental results", 
      "comprehensibility", 
      "rules", 
      "scalability", 
      "UCI", 
      "set", 
      "algorithm", 
      "extraction", 
      "method", 
      "accuracy", 
      "model", 
      "trees", 
      "possible limitations", 
      "same level", 
      "limitations", 
      "box model", 
      "terms", 
      "number", 
      "results", 
      "high ability", 
      "ability", 
      "state", 
      "forest", 
      "levels", 
      "Hill", 
      "paper"
    ], 
    "name": "Rule Extraction from Random Forest: the RF+HC Methods", 
    "pagination": "223-237", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1039448237"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-18356-5_20"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-18356-5_20", 
      "https://app.dimensions.ai/details/publication/pub.1039448237"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:09", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_158.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-18356-5_20"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-18356-5_20'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-18356-5_20'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-18356-5_20'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-18356-5_20'


 

This table displays all metadata directly associated to this object as RDF triples.

109 TRIPLES      23 PREDICATES      62 URIs      55 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-319-18356-5_20 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author N4d75a083a860458697fe4ad5d08e807f
4 schema:datePublished 2015-04-29
5 schema:datePublishedReg 2015-04-29
6 schema:description Random forest (RF) is a tree-based learning method, which exhibits a high ability to generalize on real data sets. Nevertheless, a possible limitation of RF is that it generates a forest consisting of many trees and rules, thus it is viewed as a black box model. In this paper, the RF+HC methods for rule extraction from RF are proposed. Once the RF is built, a hill climbing algorithm is used to search for a rule set such that it reduces the number of rules dramatically, which significantly improves comprehensibility of the underlying model built by RF. The proposed methods are evaluated on eighteen UCI and four microarray data sets. Our experimental results show that the proposed methods outperform one of the state-of-the-art methods in terms of scalability and comprehensibility while preserving the same level of accuracy.
7 schema:editor N61ee330749b049929981b654e877ff61
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N5db1c5972ce64672b045f7eb9828d928
12 schema:keywords Hill
13 UCI
14 ability
15 accuracy
16 algorithm
17 art methods
18 black box model
19 box model
20 comprehensibility
21 data sets
22 experimental results
23 extraction
24 forest
25 high ability
26 learning method
27 levels
28 limitations
29 method
30 microarray data sets
31 model
32 number
33 number of rules
34 paper
35 possible limitations
36 random forest
37 real data sets
38 results
39 rule extraction
40 rules
41 same level
42 scalability
43 set
44 state
45 terms
46 terms of scalability
47 tree-based learning method
48 trees
49 schema:name Rule Extraction from Random Forest: the RF+HC Methods
50 schema:pagination 223-237
51 schema:productId N569fc01feb974fb78680ceccc6f96765
52 N701ada13d9c54010b345b3fa6ddfaf83
53 schema:publisher N631b1a9cadd344da87868ba725c417f1
54 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039448237
55 https://doi.org/10.1007/978-3-319-18356-5_20
56 schema:sdDatePublished 2022-01-01T19:09
57 schema:sdLicense https://scigraph.springernature.com/explorer/license/
58 schema:sdPublisher N677a6d03d97640e2968ce949624595af
59 schema:url https://doi.org/10.1007/978-3-319-18356-5_20
60 sgo:license sg:explorer/license/
61 sgo:sdDataset chapters
62 rdf:type schema:Chapter
63 N441edfdf044743d182aff39ffdb6f089 schema:familyName Milios
64 schema:givenName Evangelos
65 rdf:type schema:Person
66 N4d75a083a860458697fe4ad5d08e807f rdf:first sg:person.07552175653.46
67 rdf:rest N8abd63fa493b41a39339ac0cdbe91a4c
68 N569fc01feb974fb78680ceccc6f96765 schema:name doi
69 schema:value 10.1007/978-3-319-18356-5_20
70 rdf:type schema:PropertyValue
71 N5db1c5972ce64672b045f7eb9828d928 schema:isbn 978-3-319-18355-8
72 978-3-319-18356-5
73 schema:name Advances in Artificial Intelligence
74 rdf:type schema:Book
75 N61ee330749b049929981b654e877ff61 rdf:first N72446649c6e74262a19775002c3e9c39
76 rdf:rest Nd44bb3702ba1463abf86b3beff3664fc
77 N631b1a9cadd344da87868ba725c417f1 schema:name Springer Nature
78 rdf:type schema:Organisation
79 N677a6d03d97640e2968ce949624595af schema:name Springer Nature - SN SciGraph project
80 rdf:type schema:Organization
81 N701ada13d9c54010b345b3fa6ddfaf83 schema:name dimensions_id
82 schema:value pub.1039448237
83 rdf:type schema:PropertyValue
84 N72446649c6e74262a19775002c3e9c39 schema:familyName Barbosa
85 schema:givenName Denilson
86 rdf:type schema:Person
87 N8abd63fa493b41a39339ac0cdbe91a4c rdf:first sg:person.0712313416.43
88 rdf:rest rdf:nil
89 Nd44bb3702ba1463abf86b3beff3664fc rdf:first N441edfdf044743d182aff39ffdb6f089
90 rdf:rest rdf:nil
91 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
92 schema:name Information and Computing Sciences
93 rdf:type schema:DefinedTerm
94 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
95 schema:name Artificial Intelligence and Image Processing
96 rdf:type schema:DefinedTerm
97 sg:person.0712313416.43 schema:affiliation grid-institutes:grid.267455.7
98 schema:familyName Gras
99 schema:givenName Robin
100 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0712313416.43
101 rdf:type schema:Person
102 sg:person.07552175653.46 schema:affiliation grid-institutes:grid.267455.7
103 schema:familyName Mashayekhi
104 schema:givenName Morteza
105 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07552175653.46
106 rdf:type schema:Person
107 grid-institutes:grid.267455.7 schema:alternateName School of Computer Science, University of Windsor, Windsor, ON, Canada
108 schema:name School of Computer Science, University of Windsor, Windsor, ON, Canada
109 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...