sphincter 发表于 2025-3-27 00:21:53

Dynamic Programming Algorithms for Minimization of Decision Tree Complexitycomputer experiments on various data sets from the UCI ML Repository and randomly generated Boolean functions. Decision trees with hypotheses, generally, have less complexity than conventional decision trees, i.e., they are more understandable and more suitable as a means for knowledge representatio

ticlopidine 发表于 2025-3-27 01:17:38

Construction of Optimal Decision Trees and Deriving Decision Rules from Themumber of working (nonterminal) nodes. We make computer experiments on various data sets from the UCI Machine Learning Repository and randomly generated Boolean functions to compare the length and coverage of decision rules derived from different kinds of optimal decision trees. The obtained results

栏杆 发表于 2025-3-27 05:55:27

http://reply.papertrans.cn/27/2644/264318/264318_33.png

显微镜 发表于 2025-3-27 12:25:35

Decision Trees with Hypotheses for Recognition of Monotone Boolean Functions and for Sortingt elements from linearly ordered set, .. For each of these problems, we compare the complexity of five types of optimal (relative to the depth or the number of realizable nodes) decision trees. We also study the complexity of decision trees constructed by greedy algorithms and analyze the length of

Abrade 发表于 2025-3-27 14:12:26

Infinite Binary Information Systems. Decision Trees of Types 1, 2, and 3 which consists of an infinite set of elements and an infinite set of two-valued functions (attributes) defined on the set of elements. We consider the notion of a problem over information system, which is described by a finite number of attributes: for a given element, we should recognize values of

焦虑 发表于 2025-3-27 19:08:14

http://reply.papertrans.cn/27/2644/264318/264318_36.png

分离 发表于 2025-3-27 22:52:16

http://reply.papertrans.cn/27/2644/264318/264318_37.png

Psa617 发表于 2025-3-28 02:49:24

Construction of Optimal Decision Trees and Deriving Decision Rules from Themd Boolean functions to compare the length and coverage of decision rules derived from different kinds of optimal decision trees. The obtained results show that the decision rules derived from optimal decision trees with hypotheses in many cases are better than the rules derived from optimal conventional decision trees.

没有希望 发表于 2025-3-28 09:46:10

http://reply.papertrans.cn/27/2644/264318/264318_39.png

cancellous-bone 发表于 2025-3-28 12:43:21

http://reply.papertrans.cn/27/2644/264318/264318_40.png
页: 1 2 3 [4] 5
查看完整版本: Titlebook: Decision Trees with Hypotheses; Mohammad Azad,Igor Chikalov,Beata Zielosko Book 2022 The Editor(s) (if applicable) and The Author(s), unde