A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction
Using decision trees as a concept description language, we examine the time complexity for learning Boolean functions with polynomial-sized disjunctive normal form expressions when feature construction is performed on an initial decision tree containing only primitive attributes. A shortcoming of se...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Major, Raymond L. [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|
| Erschienen: |
Oxford, UK and Boston, USA: Blackwell Publishers Ltd ; 2000 |
|---|
| Schlagwörter: |
|---|
| Umfang: |
Online-Ressource |
|---|
| Reproduktion: |
2002 ; Blackwell Publishing Journal Backfiles 1879-2005 |
|---|---|
| Übergeordnetes Werk: |
In: Computational intelligence - Oxford [u.a.] : Wiley-Blackwell, 1985, 16(2000), 1, Seite 0 |
| Übergeordnetes Werk: |
volume:16 ; year:2000 ; number:1 ; pages:0 |
| Links: |
|---|
| DOI / URN: |
10.1111/0824-7935.00105 |
|---|
| Katalog-ID: |
NLEJ242523277 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ242523277 | ||
| 003 | DE-627 | ||
| 005 | 20210707160347.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 120427s2000 xx |||||o 00| ||und c | ||
| 024 | 7 | |a 10.1111/0824-7935.00105 |2 doi | |
| 035 | |a (DE-627)NLEJ242523277 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 100 | 1 | |a Major, Raymond L. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction |
| 264 | 1 | |a Oxford, UK and Boston, USA |b Blackwell Publishers Ltd |c 2000 | |
| 300 | |a Online-Ressource | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a Using decision trees as a concept description language, we examine the time complexity for learning Boolean functions with polynomial-sized disjunctive normal form expressions when feature construction is performed on an initial decision tree containing only primitive attributes. A shortcoming of several feature-construction algorithms found in the literature is that it is difficult to develop time complexity results for them. We illustrate a way to determine a limit on the number of features to use for building more concise trees within a standard amount of time. We introduce a practical algorithm that forms a finite number of features using a decision tree in a polynomial amount of time. We show empirically that our procedure forms many features that subsequently appear in a tree and the new features aid in producing simpler trees when concepts are being learned from certain problem domains. Expert systems developers can use a method such as this to create a knowledge base of information that contains specific knowledge in the form of If-Then rules. | ||
| 533 | |d 2002 |f Blackwell Publishing Journal Backfiles 1879-2005 |7 |2002|||||||||| | ||
| 650 | 4 | |a computational complexity | |
| 773 | 0 | 8 | |i In |t Computational intelligence |d Oxford [u.a.] : Wiley-Blackwell, 1985 |g 16(2000), 1, Seite 0 |h Online-Ressource |w (DE-627)NLEJ243926685 |w (DE-600)2016539-0 |x 1467-8640 |7 nnns |
| 773 | 1 | 8 | |g volume:16 |g year:2000 |g number:1 |g pages:0 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1111/0824-7935.00105 |q text/html |x Verlag |z Deutschlandweit zugänglich |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a ZDB-1-DJB | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 16 |j 2000 |e 1 |h 0 | ||
| author_variant |
r l m rl rlm |
|---|---|
| matchkey_str |
article:14678640:2000----::cmlxtmdlnaoyoilloihfreiinrea |
| hierarchy_sort_str |
2000 |
| publishDate |
2000 |
| allfields |
10.1111/0824-7935.00105 doi (DE-627)NLEJ242523277 DE-627 ger DE-627 rakwb Major, Raymond L. verfasserin aut A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction Oxford, UK and Boston, USA Blackwell Publishers Ltd 2000 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Using decision trees as a concept description language, we examine the time complexity for learning Boolean functions with polynomial-sized disjunctive normal form expressions when feature construction is performed on an initial decision tree containing only primitive attributes. A shortcoming of several feature-construction algorithms found in the literature is that it is difficult to develop time complexity results for them. We illustrate a way to determine a limit on the number of features to use for building more concise trees within a standard amount of time. We introduce a practical algorithm that forms a finite number of features using a decision tree in a polynomial amount of time. We show empirically that our procedure forms many features that subsequently appear in a tree and the new features aid in producing simpler trees when concepts are being learned from certain problem domains. Expert systems developers can use a method such as this to create a knowledge base of information that contains specific knowledge in the form of If-Then rules. 2002 Blackwell Publishing Journal Backfiles 1879-2005 |2002|||||||||| computational complexity In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 16(2000), 1, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:16 year:2000 number:1 pages:0 http://dx.doi.org/10.1111/0824-7935.00105 text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 16 2000 1 0 |
| spelling |
10.1111/0824-7935.00105 doi (DE-627)NLEJ242523277 DE-627 ger DE-627 rakwb Major, Raymond L. verfasserin aut A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction Oxford, UK and Boston, USA Blackwell Publishers Ltd 2000 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Using decision trees as a concept description language, we examine the time complexity for learning Boolean functions with polynomial-sized disjunctive normal form expressions when feature construction is performed on an initial decision tree containing only primitive attributes. A shortcoming of several feature-construction algorithms found in the literature is that it is difficult to develop time complexity results for them. We illustrate a way to determine a limit on the number of features to use for building more concise trees within a standard amount of time. We introduce a practical algorithm that forms a finite number of features using a decision tree in a polynomial amount of time. We show empirically that our procedure forms many features that subsequently appear in a tree and the new features aid in producing simpler trees when concepts are being learned from certain problem domains. Expert systems developers can use a method such as this to create a knowledge base of information that contains specific knowledge in the form of If-Then rules. 2002 Blackwell Publishing Journal Backfiles 1879-2005 |2002|||||||||| computational complexity In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 16(2000), 1, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:16 year:2000 number:1 pages:0 http://dx.doi.org/10.1111/0824-7935.00105 text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 16 2000 1 0 |
| allfields_unstemmed |
10.1111/0824-7935.00105 doi (DE-627)NLEJ242523277 DE-627 ger DE-627 rakwb Major, Raymond L. verfasserin aut A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction Oxford, UK and Boston, USA Blackwell Publishers Ltd 2000 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Using decision trees as a concept description language, we examine the time complexity for learning Boolean functions with polynomial-sized disjunctive normal form expressions when feature construction is performed on an initial decision tree containing only primitive attributes. A shortcoming of several feature-construction algorithms found in the literature is that it is difficult to develop time complexity results for them. We illustrate a way to determine a limit on the number of features to use for building more concise trees within a standard amount of time. We introduce a practical algorithm that forms a finite number of features using a decision tree in a polynomial amount of time. We show empirically that our procedure forms many features that subsequently appear in a tree and the new features aid in producing simpler trees when concepts are being learned from certain problem domains. Expert systems developers can use a method such as this to create a knowledge base of information that contains specific knowledge in the form of If-Then rules. 2002 Blackwell Publishing Journal Backfiles 1879-2005 |2002|||||||||| computational complexity In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 16(2000), 1, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:16 year:2000 number:1 pages:0 http://dx.doi.org/10.1111/0824-7935.00105 text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 16 2000 1 0 |
| allfieldsGer |
10.1111/0824-7935.00105 doi (DE-627)NLEJ242523277 DE-627 ger DE-627 rakwb Major, Raymond L. verfasserin aut A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction Oxford, UK and Boston, USA Blackwell Publishers Ltd 2000 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Using decision trees as a concept description language, we examine the time complexity for learning Boolean functions with polynomial-sized disjunctive normal form expressions when feature construction is performed on an initial decision tree containing only primitive attributes. A shortcoming of several feature-construction algorithms found in the literature is that it is difficult to develop time complexity results for them. We illustrate a way to determine a limit on the number of features to use for building more concise trees within a standard amount of time. We introduce a practical algorithm that forms a finite number of features using a decision tree in a polynomial amount of time. We show empirically that our procedure forms many features that subsequently appear in a tree and the new features aid in producing simpler trees when concepts are being learned from certain problem domains. Expert systems developers can use a method such as this to create a knowledge base of information that contains specific knowledge in the form of If-Then rules. 2002 Blackwell Publishing Journal Backfiles 1879-2005 |2002|||||||||| computational complexity In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 16(2000), 1, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:16 year:2000 number:1 pages:0 http://dx.doi.org/10.1111/0824-7935.00105 text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 16 2000 1 0 |
| allfieldsSound |
10.1111/0824-7935.00105 doi (DE-627)NLEJ242523277 DE-627 ger DE-627 rakwb Major, Raymond L. verfasserin aut A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction Oxford, UK and Boston, USA Blackwell Publishers Ltd 2000 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Using decision trees as a concept description language, we examine the time complexity for learning Boolean functions with polynomial-sized disjunctive normal form expressions when feature construction is performed on an initial decision tree containing only primitive attributes. A shortcoming of several feature-construction algorithms found in the literature is that it is difficult to develop time complexity results for them. We illustrate a way to determine a limit on the number of features to use for building more concise trees within a standard amount of time. We introduce a practical algorithm that forms a finite number of features using a decision tree in a polynomial amount of time. We show empirically that our procedure forms many features that subsequently appear in a tree and the new features aid in producing simpler trees when concepts are being learned from certain problem domains. Expert systems developers can use a method such as this to create a knowledge base of information that contains specific knowledge in the form of If-Then rules. 2002 Blackwell Publishing Journal Backfiles 1879-2005 |2002|||||||||| computational complexity In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 16(2000), 1, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:16 year:2000 number:1 pages:0 http://dx.doi.org/10.1111/0824-7935.00105 text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 16 2000 1 0 |
| source |
In Computational intelligence 16(2000), 1, Seite 0 volume:16 year:2000 number:1 pages:0 |
| sourceStr |
In Computational intelligence 16(2000), 1, Seite 0 volume:16 year:2000 number:1 pages:0 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
computational complexity |
| isfreeaccess_bool |
false |
| container_title |
Computational intelligence |
| authorswithroles_txt_mv |
Major, Raymond L. @@aut@@ |
| publishDateDaySort_date |
2000-01-01T00:00:00Z |
| hierarchy_top_id |
NLEJ243926685 |
| id |
NLEJ242523277 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ242523277</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210707160347.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">120427s2000 xx |||||o 00| ||und c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1111/0824-7935.00105</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ242523277</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Major, Raymond L.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Oxford, UK and Boston, USA</subfield><subfield code="b">Blackwell Publishers Ltd</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Using decision trees as a concept description language, we examine the time complexity for learning Boolean functions with polynomial-sized disjunctive normal form expressions when feature construction is performed on an initial decision tree containing only primitive attributes. A shortcoming of several feature-construction algorithms found in the literature is that it is difficult to develop time complexity results for them. We illustrate a way to determine a limit on the number of features to use for building more concise trees within a standard amount of time. We introduce a practical algorithm that forms a finite number of features using a decision tree in a polynomial amount of time. We show empirically that our procedure forms many features that subsequently appear in a tree and the new features aid in producing simpler trees when concepts are being learned from certain problem domains. Expert systems developers can use a method such as this to create a knowledge base of information that contains specific knowledge in the form of If-Then rules.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="d">2002</subfield><subfield code="f">Blackwell Publishing Journal Backfiles 1879-2005</subfield><subfield code="7">|2002||||||||||</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">computational complexity</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Computational intelligence</subfield><subfield code="d">Oxford [u.a.] : Wiley-Blackwell, 1985</subfield><subfield code="g">16(2000), 1, Seite 0</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ243926685</subfield><subfield code="w">(DE-600)2016539-0</subfield><subfield code="x">1467-8640</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:16</subfield><subfield code="g">year:2000</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1111/0824-7935.00105</subfield><subfield code="q">text/html</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-DJB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2000</subfield><subfield code="e">1</subfield><subfield code="h">0</subfield></datafield></record></collection>
|
| series2 |
Blackwell Publishing Journal Backfiles 1879-2005 |
| author |
Major, Raymond L. |
| spellingShingle |
Major, Raymond L. misc computational complexity A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction |
| authorStr |
Major, Raymond L. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ243926685 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
NL |
| publishPlace |
Oxford, UK and Boston, USA |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1467-8640 |
| topic_title |
A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction computational complexity |
| publisher |
Blackwell Publishers Ltd |
| publisherStr |
Blackwell Publishers Ltd |
| topic |
misc computational complexity |
| topic_unstemmed |
misc computational complexity |
| topic_browse |
misc computational complexity |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| hierarchy_parent_title |
Computational intelligence |
| hierarchy_parent_id |
NLEJ243926685 |
| hierarchy_top_title |
Computational intelligence |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ243926685 (DE-600)2016539-0 |
| title |
A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction |
| ctrlnum |
(DE-627)NLEJ242523277 |
| title_full |
A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction |
| author_sort |
Major, Raymond L. |
| journal |
Computational intelligence |
| journalStr |
Computational intelligence |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2000 |
| contenttype_str_mv |
zzz |
| container_start_page |
0 |
| author_browse |
Major, Raymond L. |
| container_volume |
16 |
| physical |
Online-Ressource |
| format_se |
Elektronische Aufsätze |
| author-letter |
Major, Raymond L. |
| doi_str_mv |
10.1111/0824-7935.00105 |
| title_sort |
a complexity model and a polynomial algorithm for decision-tree-based feature construction |
| title_auth |
A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction |
| abstract |
Using decision trees as a concept description language, we examine the time complexity for learning Boolean functions with polynomial-sized disjunctive normal form expressions when feature construction is performed on an initial decision tree containing only primitive attributes. A shortcoming of several feature-construction algorithms found in the literature is that it is difficult to develop time complexity results for them. We illustrate a way to determine a limit on the number of features to use for building more concise trees within a standard amount of time. We introduce a practical algorithm that forms a finite number of features using a decision tree in a polynomial amount of time. We show empirically that our procedure forms many features that subsequently appear in a tree and the new features aid in producing simpler trees when concepts are being learned from certain problem domains. Expert systems developers can use a method such as this to create a knowledge base of information that contains specific knowledge in the form of If-Then rules. |
| abstractGer |
Using decision trees as a concept description language, we examine the time complexity for learning Boolean functions with polynomial-sized disjunctive normal form expressions when feature construction is performed on an initial decision tree containing only primitive attributes. A shortcoming of several feature-construction algorithms found in the literature is that it is difficult to develop time complexity results for them. We illustrate a way to determine a limit on the number of features to use for building more concise trees within a standard amount of time. We introduce a practical algorithm that forms a finite number of features using a decision tree in a polynomial amount of time. We show empirically that our procedure forms many features that subsequently appear in a tree and the new features aid in producing simpler trees when concepts are being learned from certain problem domains. Expert systems developers can use a method such as this to create a knowledge base of information that contains specific knowledge in the form of If-Then rules. |
| abstract_unstemmed |
Using decision trees as a concept description language, we examine the time complexity for learning Boolean functions with polynomial-sized disjunctive normal form expressions when feature construction is performed on an initial decision tree containing only primitive attributes. A shortcoming of several feature-construction algorithms found in the literature is that it is difficult to develop time complexity results for them. We illustrate a way to determine a limit on the number of features to use for building more concise trees within a standard amount of time. We introduce a practical algorithm that forms a finite number of features using a decision tree in a polynomial amount of time. We show empirically that our procedure forms many features that subsequently appear in a tree and the new features aid in producing simpler trees when concepts are being learned from certain problem domains. Expert systems developers can use a method such as this to create a knowledge base of information that contains specific knowledge in the form of If-Then rules. |
| collection_details |
GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE |
| container_issue |
1 |
| title_short |
A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction |
| url |
http://dx.doi.org/10.1111/0824-7935.00105 |
| remote_bool |
true |
| ppnlink |
NLEJ243926685 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1111/0824-7935.00105 |
| up_date |
2024-07-06T02:16:38.645Z |
| _version_ |
1803794197928476672 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ242523277</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210707160347.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">120427s2000 xx |||||o 00| ||und c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1111/0824-7935.00105</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ242523277</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Major, Raymond L.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Complexity Model and a Polynomial Algorithm for Decision-Tree-Based Feature Construction</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Oxford, UK and Boston, USA</subfield><subfield code="b">Blackwell Publishers Ltd</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Using decision trees as a concept description language, we examine the time complexity for learning Boolean functions with polynomial-sized disjunctive normal form expressions when feature construction is performed on an initial decision tree containing only primitive attributes. A shortcoming of several feature-construction algorithms found in the literature is that it is difficult to develop time complexity results for them. We illustrate a way to determine a limit on the number of features to use for building more concise trees within a standard amount of time. We introduce a practical algorithm that forms a finite number of features using a decision tree in a polynomial amount of time. We show empirically that our procedure forms many features that subsequently appear in a tree and the new features aid in producing simpler trees when concepts are being learned from certain problem domains. Expert systems developers can use a method such as this to create a knowledge base of information that contains specific knowledge in the form of If-Then rules.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="d">2002</subfield><subfield code="f">Blackwell Publishing Journal Backfiles 1879-2005</subfield><subfield code="7">|2002||||||||||</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">computational complexity</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Computational intelligence</subfield><subfield code="d">Oxford [u.a.] : Wiley-Blackwell, 1985</subfield><subfield code="g">16(2000), 1, Seite 0</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ243926685</subfield><subfield code="w">(DE-600)2016539-0</subfield><subfield code="x">1467-8640</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:16</subfield><subfield code="g">year:2000</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1111/0824-7935.00105</subfield><subfield code="q">text/html</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-DJB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2000</subfield><subfield code="e">1</subfield><subfield code="h">0</subfield></datafield></record></collection>
|
| score |
7.3995953 |