Combinatorial machine learning: a rough set approach
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2011
|
| Schriftenreihe: | Studies in computational intelligence
360 |
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | XIV, 181 S. graph. Darst. |
| ISBN: | 9783642209949 3642209947 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV039160573 | ||
| 003 | DE-604 | ||
| 007 | t | ||
| 008 | 110727s2011 d||| |||| 00||| eng d | ||
| 016 | 7 | |a 1010922459 |2 DE-101 | |
| 020 | |a 9783642209949 |9 978-3-642-20994-9 | ||
| 020 | |a 3642209947 |9 3-642-20994-7 | ||
| 035 | |a (OCoLC)725083580 | ||
| 035 | |a (DE-599)DNB1010922459 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 |a DE-473 |a DE-634 | ||
| 082 | 0 | |a 006.31 |2 22/ger | |
| 084 | |a ST 300 |0 (DE-625)143650: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a 621.3 |2 sdnb | ||
| 100 | 1 | |a Moshkov, Mikhail Ju. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Combinatorial machine learning |b a rough set approach |c Mikhail Moshkov and Beata Zielosko |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2011 | |
| 300 | |a XIV, 181 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Studies in computational intelligence |v 360 | |
| 500 | |a Literaturangaben | ||
| 650 | 0 | 7 | |a Optimierungsproblem |0 (DE-588)4390818-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Data Mining |0 (DE-588)4428654-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Entscheidungsregel |0 (DE-588)4152406-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Grobmenge |0 (DE-588)4362502-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Maschinelles Lernen |0 (DE-588)4193754-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Wissensextraktion |0 (DE-588)4546354-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Entscheidungstabelle |0 (DE-588)4152411-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Entscheidungsbaum |0 (DE-588)4347788-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Maschinelles Lernen |0 (DE-588)4193754-5 |D s |
| 689 | 0 | 1 | |a Grobmenge |0 (DE-588)4362502-2 |D s |
| 689 | 0 | 2 | |a Optimierungsproblem |0 (DE-588)4390818-4 |D s |
| 689 | 0 | 3 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | 4 | |a Entscheidungsbaum |0 (DE-588)4347788-4 |D s |
| 689 | 0 | 5 | |a Entscheidungsregel |0 (DE-588)4152406-8 |D s |
| 689 | 0 | 6 | |a Entscheidungstabelle |0 (DE-588)4152411-1 |D s |
| 689 | 0 | 7 | |a Data Mining |0 (DE-588)4428654-5 |D s |
| 689 | 0 | 8 | |a Wissensextraktion |0 (DE-588)4546354-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Zielosko, Beata |e Verfasser |4 aut | |
| 830 | 0 | |a Studies in computational intelligence |v 360 |w (DE-604)BV020822171 |9 360 | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3710632&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=024178079&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024178079 | |
Datensatz im Suchindex
| _version_ | 1805096478245388288 |
|---|---|
| adam_text |
IMAGE 1
CONTENTS
INTRODUCTION 1
1 EXAMPLES FROM APPLICATIONS 5
1.1 PROBLEMS 5
1.2 DECISION TABLES 7
1.3 EXAMPLES 9
1.3.1 THREE CUPS AND SMALL BALL 9
1.3.2 DIAGNOSIS OF ONE-GATE CIRCUIT 10
1.3.3 PROBLEM OF THREE POST-OFFICES 13
1.3.4 RECOGNITION OF DIGITS 15
1.3.5 TRAVELING SALESMAN PROBLEM WITH FOUR CITIES 16 1.3.6 TRAVELING
SALESMAN PROBLEM WITH N 4 CITIES 18 1.3.7 DATA TABLE WITH EXPERIMENTAL
DATA 19
1.4 CONCLUSIONS 20
PART I TOOLS
2 SETS OF TESTS, DECISION RULES AND TREES 23
2.1 DECISION TABLES, TREES, RULES AND TESTS 23
2.2 SETS OF TESTS, DECISION RULES AND TREES 25
2.2.1 MONOTONE BOOLEAN FUNCTIONS 25
2.2.2 SET OF TESTS 26
2.2.3 SET OF DECISION RULES 29
2.2.4 SET OF DECISION TREES 32
2.3 RELATIONSHIPS AMONG DECISION TREES, RULES AND TESTS 34 2.4
CONCLUSIONS 36
3 BOUNDS ON COMPLEXITY OF TESTS, DECISION RULES AND TREES 37
3.1 LOWER BOUNDS 37
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1010922459
DIGITALISIERT DURCH
IMAGE 2
XII CONTENTS
3.2 UPPER BOUNDS 43
3.3 CONCLUSIONS 46
4 ALGORITHMS FOR CONSTRUCTION OF TESTS, DECISION RULES AND TREES 47
4.1 APPROXIMATE ALGORITHMS FOR OPTIMIZATION OF TESTS AND DECISION RULES
47
4.1.1 SET COVER PROBLEM 48
4.1.2 TESTS: FROM DECISION TABLE TO SET COVER PROBLEM . . 50 4.1.3
DECISION RULES: FROM DECISION TABLE TO SET COVER PROBLEM 50
4.1.4 FROM SET COVER PROBLEM TO DECISION TABLE 52
4.2 APPROXIMATE ALGORITHM FOR DECISION TREE OPTIMIZATION . . . 55 4.3
EXACT ALGORITHMS FOR OPTIMIZATION OF TREES, RULES AND TESTS 59
4.3.1 OPTIMIZATION OF DECISION TREES 59
4.3.2 OPTIMIZATION OF DECISION RULES 61
4.3.3 OPTIMIZATION OF TESTS 64
4.4 CONCLUSIONS 67
5 DECISION TABLES WITH MANY-VALUED DECISIONS 69
5.1 EXAMPLES CONNECTED WITH APPLICATIONS 69
5.2 MAIN NOTIONS 72
5.3 RELATIONSHIPS AMONG DECISION TREES, RULES AND TESTS 74 5.4 LOWER
BOUNDS 76
5.5 UPPER BOUNDS 77
5.6 APPROXIMATE ALGORITHMS FOR OPTIMIZATION OF TESTS AND DECISION RULES
78
5.6.1 OPTIMIZATION OF TESTS 78
5.6.2 OPTIMIZATION OF DECISION RULES 79
5.7 APPROXIMATE ALGORITHMS FOR DECISION TREE OPTIMIZATION . . 81 5.8
EXACT ALGORITHMS FOR OPTIMIZATION OF TREES, RULES AND TESTS 83
5.9 EXAMPLE 83
5.10 CONCLUSIONS 86
6 APPROXIMATE TESTS, DECISION TREES AND RULES 87
6.1 MAIN NOTIONS 87
6.2 RELATIONSHIPS AMONG A-TREES, A-RULES AND A-TESTS 89
6.3 LOWER BOUNDS 91
6.4 UPPER BOUNDS , 96
6.5 APPROXIMATE ALGORITHM FOR A-DECISION RULE OPTIMIZATION 100
6.6 APPROXIMATE ALGORITHM FOR A-DECISION TREE OPTIMIZATION 103
IMAGE 3
CONTENTS XIII
6.7 ALGORITHMS FOR A-TEST OPTIMIZATION 106
6.8 EXACT ALGORITHMS FOR OPTIMIZATION OF A-DECISION TREES AND RULES 106
6.9 CONCLUSIONS 108
PART II APPLICATIONS
7 SUPERVISED LEARNING 113
7.1 CLASSIFIERS BASED ON DECISION TREES 114
7.2 CLASSIFIERS BASED ON DECISION RULES 115
7.2.1 USE OF GREEDY ALGORITHMS 115
7.2.2 USE OF DYNAMIC PROGRAMMING APPROACH 116 7.2.3 FROM TEST TO
COMPLETE SYSTEM OF DECISION RULES 116 7.2.4 FROM DECISION TREE TO
COMPLETE SYSTEM OF DECISION RULES 117
7.2.5 SIMPLIFICATION OF RULE SYSTEM 117
7.2.6 SYSTEM OF RULES AS CLASSIFIER 118
7.2.7 PRUNING 118
7.3 LAZY LEARNING ALGORITHMS 119
7.3.1 FC-NEAREST NEIGHBOR ALGORITHM 120
7.3.2 LAZY DECISION TREES AND RULES 120
7.3.3 LAZY LEARNING ALGORITHM BASED ON DECISION RULES. 122 7.3.4 LAZY
LEARNING ALGORITHM BASED ON REDUCTS 124 7.4 CONCLUSIONS 125
8 LOCAL AND GLOBAL APPROACHES TO STUDY OF TREES AND RULES 127
8.1 BASIC NOTIONS 127
8.2 LOCAL APPROACH TO STUDY OF DECISION TREES AND RULES 129 8.2.1 LOCAL
SHANNON FUNCTIONS FOR ARBITRARY INFORMATION SYSTEMS 130
8.2.2 RESTRICTED BINARY INFORMATION SYSTEMS 132
8.2.3 LOCAL SHANNON FUNCTIONS FOR FINITE INFORMATION SYSTEMS 135
8.3 GLOBAL APPROACH TO STUDY OF DECISION TREES AND RULES 136 8.3.1
INFINITE INFORMATION SYSTEMS 136
8.3.2 GLOBAL SHANNON FUNCTION /IF, FOR TWO-VALUED FINITE INFORMATION
SYSTEMS 140
8.4 CONCLUSIONS 141
9 DECISION TREES AND RULES OVER QUASILINEAR INFORMATION SYSTEMS 143
9.1 BOUNDS ON COMPLEXITY OF DECISION TREES AND RULES 144 9.1.1
QUASILINEAR INFORMATION SYSTEMS 144
IMAGE 4
XIV CONTENTS
9.1.2 LINEAR INFORMATION SYSTEMS 145
9.2 OPTIMIZATION PROBLEMS OVER QUASILINEAR INFORMATION SYSTEMS 147
9.2.1 SOME DEFINITIONS 148
9.2.2 PROBLEMS OF UNCONDITIONAL OPTIMIZATION 148
9.2.3 PROBLEMS OF UNCONDITIONAL OPTIMIZATION OF ABSOLUTE VALUES 149
9.2.4 PROBLEMS OF CONDITIONAL OPTIMIZATION 150
9.3 ON DEPTH OF ACYCLIC PROGRAMS 151
9.3.1 MAIN DEFINITIONS 151
9.3.2 RELATIONSHIPS BETWEEN DEPTH OF DETERMINISTIC AND NONDETERMINISTIC
ACYCLIC PROGRAMS 152
9.4 CONCLUSIONS 153
10 RECOGNITION OF WORDS AND DIAGNOSIS OF FAULTS 155
10.1 REGULAR LANGUAGE WORD RECOGNITION 155
10.1.1 PROBLEM OF RECOGNITION OF WORDS 155
10.1.2 A-SOURCES 156
10.1.3 TYPES OF REDUCED A-SOURCES 157
10.1.4 MAIN RESULT 158
10.1.5 EXAMPLES 159
10.2 DIAGNOSIS OF CONSTANT FAULTS IN CIRCUITS 161
10.2.1 BASIC NOTIONS 161
10.2.2 COMPLEXITY OF DECISION TREES FOR DIAGNOSIS OF FAULTS 164
10.2.3 COMPLEXITY OF CONSTRUCTION OF DECISION TREES FOR DIAGNOSIS 166
10.2.4 DIAGNOSIS OF ITERATION-FREE CIRCUITS 166
10.2.5 APPROACH TO CIRCUIT CONSTRUCTION AND DIAGNOSIS . . . 169 10.3
CONCLUSIONS 169
FINAL REMARKS 171
REFERENCES 173
INDEX 179 |
| any_adam_object | 1 |
| author | Moshkov, Mikhail Ju Zielosko, Beata |
| author_facet | Moshkov, Mikhail Ju Zielosko, Beata |
| author_role | aut aut |
| author_sort | Moshkov, Mikhail Ju |
| author_variant | m j m mj mjm b z bz |
| building | Verbundindex |
| bvnumber | BV039160573 |
| classification_rvk | ST 300 |
| ctrlnum | (OCoLC)725083580 (DE-599)DNB1010922459 |
| dewey-full | 006.31 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 006 - Special computer methods |
| dewey-raw | 006.31 |
| dewey-search | 006.31 |
| dewey-sort | 16.31 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik Elektrotechnik / Elektronik / Nachrichtentechnik |
| 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">BV039160573</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110727s2011 d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1010922459</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642209949</subfield><subfield code="9">978-3-642-20994-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642209947</subfield><subfield code="9">3-642-20994-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)725083580</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1010922459</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><subfield code="a">DE-473</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.31</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 300</subfield><subfield code="0">(DE-625)143650:</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="084" ind1=" " ind2=" "><subfield code="a">621.3</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Moshkov, Mikhail Ju.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial machine learning</subfield><subfield code="b">a rough set approach</subfield><subfield code="c">Mikhail Moshkov and Beata Zielosko</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 181 S.</subfield><subfield code="b">graph. Darst.</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">Studies in computational intelligence</subfield><subfield code="v">360</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Data Mining</subfield><subfield code="0">(DE-588)4428654-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Entscheidungsregel</subfield><subfield code="0">(DE-588)4152406-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Grobmenge</subfield><subfield code="0">(DE-588)4362502-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Maschinelles Lernen</subfield><subfield code="0">(DE-588)4193754-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Wissensextraktion</subfield><subfield code="0">(DE-588)4546354-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Entscheidungstabelle</subfield><subfield code="0">(DE-588)4152411-1</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">Maschinelles Lernen</subfield><subfield code="0">(DE-588)4193754-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Grobmenge</subfield><subfield code="0">(DE-588)4362502-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><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="5"><subfield code="a">Entscheidungsregel</subfield><subfield code="0">(DE-588)4152406-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="6"><subfield code="a">Entscheidungstabelle</subfield><subfield code="0">(DE-588)4152411-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="7"><subfield code="a">Data Mining</subfield><subfield code="0">(DE-588)4428654-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="8"><subfield code="a">Wissensextraktion</subfield><subfield code="0">(DE-588)4546354-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zielosko, Beata</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Studies in computational intelligence</subfield><subfield code="v">360</subfield><subfield code="w">(DE-604)BV020822171</subfield><subfield code="9">360</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=3710632&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=024178079&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-024178079</subfield></datafield></record></collection> |
| id | DE-604.BV039160573 |
| illustrated | Illustrated |
| indexdate | 2024-07-20T11:15:49Z |
| institution | BVB |
| isbn | 9783642209949 3642209947 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024178079 |
| oclc_num | 725083580 |
| open_access_boolean | |
| owner | DE-11 DE-473 DE-BY-UBG DE-634 |
| owner_facet | DE-11 DE-473 DE-BY-UBG DE-634 |
| physical | XIV, 181 S. graph. Darst. |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Springer |
| record_format | marc |
| series | Studies in computational intelligence |
| series2 | Studies in computational intelligence |
| spelling | Moshkov, Mikhail Ju. Verfasser aut Combinatorial machine learning a rough set approach Mikhail Moshkov and Beata Zielosko Berlin [u.a.] Springer 2011 XIV, 181 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Studies in computational intelligence 360 Literaturangaben Optimierungsproblem (DE-588)4390818-4 gnd rswk-swf Data Mining (DE-588)4428654-5 gnd rswk-swf Entscheidungsregel (DE-588)4152406-8 gnd rswk-swf Grobmenge (DE-588)4362502-2 gnd rswk-swf Maschinelles Lernen (DE-588)4193754-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Wissensextraktion (DE-588)4546354-2 gnd rswk-swf Entscheidungstabelle (DE-588)4152411-1 gnd rswk-swf Entscheidungsbaum (DE-588)4347788-4 gnd rswk-swf Maschinelles Lernen (DE-588)4193754-5 s Grobmenge (DE-588)4362502-2 s Optimierungsproblem (DE-588)4390818-4 s Komplexitätstheorie (DE-588)4120591-1 s Entscheidungsbaum (DE-588)4347788-4 s Entscheidungsregel (DE-588)4152406-8 s Entscheidungstabelle (DE-588)4152411-1 s Data Mining (DE-588)4428654-5 s Wissensextraktion (DE-588)4546354-2 s DE-604 Zielosko, Beata Verfasser aut Studies in computational intelligence 360 (DE-604)BV020822171 360 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3710632&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=024178079&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Moshkov, Mikhail Ju Zielosko, Beata Combinatorial machine learning a rough set approach Studies in computational intelligence Optimierungsproblem (DE-588)4390818-4 gnd Data Mining (DE-588)4428654-5 gnd Entscheidungsregel (DE-588)4152406-8 gnd Grobmenge (DE-588)4362502-2 gnd Maschinelles Lernen (DE-588)4193754-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Wissensextraktion (DE-588)4546354-2 gnd Entscheidungstabelle (DE-588)4152411-1 gnd Entscheidungsbaum (DE-588)4347788-4 gnd |
| subject_GND | (DE-588)4390818-4 (DE-588)4428654-5 (DE-588)4152406-8 (DE-588)4362502-2 (DE-588)4193754-5 (DE-588)4120591-1 (DE-588)4546354-2 (DE-588)4152411-1 (DE-588)4347788-4 |
| title | Combinatorial machine learning a rough set approach |
| title_auth | Combinatorial machine learning a rough set approach |
| title_exact_search | Combinatorial machine learning a rough set approach |
| title_full | Combinatorial machine learning a rough set approach Mikhail Moshkov and Beata Zielosko |
| title_fullStr | Combinatorial machine learning a rough set approach Mikhail Moshkov and Beata Zielosko |
| title_full_unstemmed | Combinatorial machine learning a rough set approach Mikhail Moshkov and Beata Zielosko |
| title_short | Combinatorial machine learning |
| title_sort | combinatorial machine learning a rough set approach |
| title_sub | a rough set approach |
| topic | Optimierungsproblem (DE-588)4390818-4 gnd Data Mining (DE-588)4428654-5 gnd Entscheidungsregel (DE-588)4152406-8 gnd Grobmenge (DE-588)4362502-2 gnd Maschinelles Lernen (DE-588)4193754-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Wissensextraktion (DE-588)4546354-2 gnd Entscheidungstabelle (DE-588)4152411-1 gnd Entscheidungsbaum (DE-588)4347788-4 gnd |
| topic_facet | Optimierungsproblem Data Mining Entscheidungsregel Grobmenge Maschinelles Lernen Komplexitätstheorie Wissensextraktion Entscheidungstabelle Entscheidungsbaum |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3710632&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=024178079&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV020822171 |
| work_keys_str_mv | AT moshkovmikhailju combinatorialmachinelearningaroughsetapproach AT zieloskobeata combinatorialmachinelearningaroughsetapproach |