| 000 | 03997nam a22005415i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-08585-7 | ||
| 003 | DE-He213 | ||
| 005 | 20240730163608.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 221118s2022 sz | s |||| 0|eng d | ||
| 020 |
_a9783031085857 _9978-3-031-08585-7 |
||
| 024 | 7 |
_a10.1007/978-3-031-08585-7 _2doi |
|
| 050 | 4 | _aQ342 | |
| 072 | 7 |
_aUYQ _2bicssc |
|
| 072 | 7 |
_aCOM004000 _2bisacsh |
|
| 072 | 7 |
_aUYQ _2thema |
|
| 082 | 0 | 4 |
_a006.3 _223 |
| 100 | 1 |
_aAzad, Mohammad. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _979406 |
|
| 245 | 1 | 0 |
_aDecision Trees with Hypotheses _h[electronic resource] / _cby Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov, Beata Zielosko. |
| 250 | _a1st ed. 2022. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2022. |
|
| 300 |
_aXI, 145 p. 9 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aSynthesis Lectures on Intelligent Technologies, _x2731-6920 |
|
| 505 | 0 | _aIntroduction -- Main Notions -- Dynamic Programming Algorithms for Minimization of Decision Tree Complexity -- Construction of Optimal Decision Trees and Deriving Decision Rules from Them -- Greedy Algorithms for Construction of Decision Trees with Hypotheses -- Decision Trees with Hypotheses for Recognition of Monotone Boolean Functions and for Sorting -- Infinite Binary Information Systems. Decision Trees of Types 1, 2, and 3 -- Infinite Binary Information Systems. Decision Trees of Types 4 and 5 -- Infinite Families of Concepts. | |
| 520 | _aIn this book, the concept of a hypothesis about the values of all attributes is added to the standard decision tree model, considered, in particular, in test theory and rough set theory. This extension allows us to use the analog of equivalence queries from exact learning and explore decision trees that are based on various combinations of attributes, hypotheses, and proper hypotheses (analog of proper equivalence queries). The two main goals of this book are (i) to provide tools for the experimental and theoretical study of decision trees with hypotheses and (ii) to compare these decision trees with conventional decision trees that use only queries, each based on a single attribute. Both experimental and theoretical results show that decision trees with hypotheses can have less complexity than conventional decision trees. These results open up some prospects for using decision trees with hypotheses as a means of knowledge representation and algorithms for computing Boolean functions. The obtained theoretical results and tools for studying decision trees with hypotheses are useful for researchers using decision trees and rules in data analysis. This book can also be used as the basis for graduate courses. | ||
| 650 | 0 |
_aComputational intelligence. _97716 |
|
| 650 | 0 |
_aOperations research. _912218 |
|
| 650 | 1 | 4 |
_aComputational Intelligence. _97716 |
| 650 | 2 | 4 |
_aOperations Research and Decision Theory. _931599 |
| 700 | 1 |
_aChikalov, Igor. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _979407 |
|
| 700 | 1 |
_aHussain, Shahid. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _979408 |
|
| 700 | 1 |
_aMoshkov, Mikhail. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _979409 |
|
| 700 | 1 |
_aZielosko, Beata. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _979410 |
|
| 710 | 2 |
_aSpringerLink (Online service) _979411 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031085840 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031085864 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031085871 |
| 830 | 0 |
_aSynthesis Lectures on Intelligent Technologies, _x2731-6920 _979412 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-08585-7 |
| 912 | _aZDB-2-SXSC | ||
| 942 | _cEBK | ||
| 999 |
_c84776 _d84776 |
||