Average time complexity of decision trees:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg
Springer
2011
|
| Schriftenreihe: | Intelligent systems reference library
21 |
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | XII, 99 S. graph. Darst. 24 cm |
| ISBN: | 9783642226601 3642226604 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV039681643 | ||
| 003 | DE-604 | ||
| 007 | t | ||
| 008 | 111103s2011 d||| |||| 00||| eng d | ||
| 015 | |a 11,N26 |2 dnb | ||
| 016 | 7 | |a 1012996360 |2 DE-101 | |
| 020 | |a 9783642226601 |c Pp. : EUR 106.95 (DE) (freier Pr.), sfr 143.50 (freier Pr.) |9 978-3-642-22660-1 | ||
| 020 | |a 3642226604 |c Pp. : EUR 106.95 (DE) (freier Pr.), sfr 143.50 (freier Pr.) |9 3-642-22660-4 | ||
| 024 | 3 | |a 9783642226601 | |
| 028 | 5 | 2 | |a Best.-Nr.: 80073973 |
| 035 | |a (OCoLC)760202875 | ||
| 035 | |a (DE-599)DNB1012996360 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 | ||
| 082 | 0 | |a 511.352 |2 22/ger | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Chikalov, Igor |e Verfasser |0 (DE-588)1014889731 |4 aut | |
| 245 | 1 | 0 | |a Average time complexity of decision trees |c Igor Chikalov |
| 264 | 1 | |a Berlin ; Heidelberg |b Springer |c 2011 | |
| 300 | |a XII, 99 S. |b graph. Darst. |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Intelligent systems reference library |v 21 | |
| 500 | |a Literaturangaben | ||
| 650 | 0 | 7 | |a Zeitkomplexität |0 (DE-588)4258103-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Entscheidungsbaum |0 (DE-588)4347788-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Entscheidungsbaum |0 (DE-588)4347788-4 |D s |
| 689 | 0 | 1 | |a Zeitkomplexität |0 (DE-588)4258103-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |t Average Time Complexity of Decision Trees |
| 830 | 0 | |a Intelligent systems reference library |v 21 |w (DE-604)BV035704685 |9 21 | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3845094&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024530630&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024530630 | |
Datensatz im Suchindex
| _version_ | 1805145488623665152 |
|---|---|
| adam_text |
IMAGE 1
CONTENTS
INTRODUCTION 1
1.1 BASIC NOTIONS 4
1.1.1 INFORMATION SYSTEMS 4
1.1.2 PROBLEMS OVER INFORMATION SYSTEMS 4
1.1.3 DECISION TREES 5
1.1.4 DECISION TABLES 5
1.1.5 COMPLEXITY MEASURES OF DECISION TREES 6
1.2 OVERVIEW OF RESULTS 7
1.2.1 BOUNDS ON AVERAGE WEIGHTED DEPTH 7
1.2.2 REPRESENTING BOOLEAN FUNCTIONS BY DECISION TREES. 9 1.2.3
ALGORITHMS FOR DECISION TREE CONSTRUCTION 11
1.2.4 RESTRICTED INFORMATION SYSTEMS 12
BOUNDS ON AVERAGE TIME COMPLEXITY OF DECISION TREES . 15 2.1 KNOWN
BOUNDS 16
2.2 BOUNDS ON AVERAGE WEIGHTED DEPTH 16
2.3 UPPER BOUND ON AVERAGE DEPTH 18
2.3.1 PROCESS OF BUILDING DECISION TREES YU,V 19
2.3.2 PROOFS OF THEOREMS 2.3 AND 2.4 20
2.4 ON POSSIBILITY OF PROBLEM DECOMPOSITION 26
2.4.1 PROPER PROBLEM DECOMPOSITION 26
2.4.2 THEOREM OF DECOMPOSITION 27
2.4.3 EXAMPLE OF DECOMPOSABLE PROBLEM 37
REPRESENTING BOOLEAN FUNCTIONS BY DECISION TREES 41 3.1 ON AVERAGE DEPTH
OF DECISION TREES IMPLEMENTING BOOLEAN FUNCTIONS 42
3.1.1 AUXILIARY NOTIONS 42
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1012996360
DIGITALISIERT DURCH
IMAGE 2
XII CONTENTS
3.1.2 BOUNDS ON FUNCTION 7IB(TI) 43
3.1.3 PROOFS OF PROPOSITIONS 3.1-3.13 45
3.2 ON BRANCHING PROGRAMS WITH MINIMUM AVERAGE DEPTH 58
4 ALGORITHMS FOR DECISION TREE CONSTRUCTION 61
4.1 ALGORITHM A FOR DECISION TREE CONSTRUCTION 62
4.1.1 REPRESENTATION OF SET OF IRREDUNDANT DECISION TREES . 63 4.1.2
PROCEDURE OF OPTIMIZATION 66
4.2 GREEDY ALGORITHMS 69
4.3 MODELING MONOTONIE BOOLEAN FUNCTIONS BY DECISION TREES . . 72 4.4
CONSTRUCTING OPTIMAL DECISION TREES FOR CORNER POINT DETECTION 74
4.4.1 CORNER POINT DETECTION PROBLEM 74
4.4.2 EXPERIMENTAL RESULTS 76
5 PROBLEMS OVER INFORMATION SYSTEMS 79
5.1 ON BOUNDS ON AVERAGE DEPTH OF DECISION TREES DEPENDING ONLY ON
ENTROPY 79
5.2 POLYNOMIALITY CRITERION FOR ALGORITHM A 83
A CLOSED CLASSES OF BOOLEAN FUNCTIONS 87
A.I SOME DEFINITIONS AND NOTATION 87
A.2 DESCRIPTION OF ALL CLOSED CLASSES OF BOOLEAN FUNCTIONS 89
REFERENCES 95
INDEX 101 |
| any_adam_object | 1 |
| author | Chikalov, Igor |
| author_GND | (DE-588)1014889731 |
| author_facet | Chikalov, Igor |
| author_role | aut |
| author_sort | Chikalov, Igor |
| author_variant | i c ic |
| building | Verbundindex |
| bvnumber | BV039681643 |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)760202875 (DE-599)DNB1012996360 |
| dewey-full | 511.352 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.352 |
| dewey-search | 511.352 |
| dewey-sort | 3511.352 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV039681643</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">111103s2011 d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">11,N26</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1012996360</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642226601</subfield><subfield code="c">Pp. : EUR 106.95 (DE) (freier Pr.), sfr 143.50 (freier Pr.)</subfield><subfield code="9">978-3-642-22660-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642226604</subfield><subfield code="c">Pp. : EUR 106.95 (DE) (freier Pr.), sfr 143.50 (freier Pr.)</subfield><subfield code="9">3-642-22660-4</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642226601</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 80073973</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)760202875</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1012996360</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.352</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chikalov, Igor</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1014889731</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Average time complexity of decision trees</subfield><subfield code="c">Igor Chikalov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 99 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">24 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Intelligent systems reference library</subfield><subfield code="v">21</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zeitkomplexität</subfield><subfield code="0">(DE-588)4258103-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Entscheidungsbaum</subfield><subfield code="0">(DE-588)4347788-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Entscheidungsbaum</subfield><subfield code="0">(DE-588)4347788-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Zeitkomplexität</subfield><subfield code="0">(DE-588)4258103-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="t">Average Time Complexity of Decision Trees</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Intelligent systems reference library</subfield><subfield code="v">21</subfield><subfield code="w">(DE-604)BV035704685</subfield><subfield code="9">21</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3845094&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024530630&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024530630</subfield></datafield></record></collection> |
| id | DE-604.BV039681643 |
| illustrated | Illustrated |
| indexdate | 2024-07-21T00:14:49Z |
| institution | BVB |
| isbn | 9783642226601 3642226604 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024530630 |
| oclc_num | 760202875 |
| open_access_boolean | |
| owner | DE-11 |
| owner_facet | DE-11 |
| physical | XII, 99 S. graph. Darst. 24 cm |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Springer |
| record_format | marc |
| series | Intelligent systems reference library |
| series2 | Intelligent systems reference library |
| spelling | Chikalov, Igor Verfasser (DE-588)1014889731 aut Average time complexity of decision trees Igor Chikalov Berlin ; Heidelberg Springer 2011 XII, 99 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Intelligent systems reference library 21 Literaturangaben Zeitkomplexität (DE-588)4258103-5 gnd rswk-swf Entscheidungsbaum (DE-588)4347788-4 gnd rswk-swf Entscheidungsbaum (DE-588)4347788-4 s Zeitkomplexität (DE-588)4258103-5 s DE-604 Erscheint auch als Online-Ausgabe Average Time Complexity of Decision Trees Intelligent systems reference library 21 (DE-604)BV035704685 21 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3845094&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024530630&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Chikalov, Igor Average time complexity of decision trees Intelligent systems reference library Zeitkomplexität (DE-588)4258103-5 gnd Entscheidungsbaum (DE-588)4347788-4 gnd |
| subject_GND | (DE-588)4258103-5 (DE-588)4347788-4 |
| title | Average time complexity of decision trees |
| title_auth | Average time complexity of decision trees |
| title_exact_search | Average time complexity of decision trees |
| title_full | Average time complexity of decision trees Igor Chikalov |
| title_fullStr | Average time complexity of decision trees Igor Chikalov |
| title_full_unstemmed | Average time complexity of decision trees Igor Chikalov |
| title_short | Average time complexity of decision trees |
| title_sort | average time complexity of decision trees |
| topic | Zeitkomplexität (DE-588)4258103-5 gnd Entscheidungsbaum (DE-588)4347788-4 gnd |
| topic_facet | Zeitkomplexität Entscheidungsbaum |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3845094&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024530630&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV035704685 |
| work_keys_str_mv | AT chikalovigor averagetimecomplexityofdecisiontrees |