High Quality Content by WIKIPEDIA articles! Decision lists are a representation for Boolean functions . Single term decision lists are more expressive than disjunctions and conjunctions, however 1-term decision lists are less expressive than the general disjunctive normal form and the conjunctive normal form. The language specified by a k-length decision list includes as a subset the language specified by a k-depth decision tree. Learning decision lists can be used for attribute efficient learning .

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.