標(biāo)題: Titlebook: Comparative Analysis of Deterministic and Nondeterministic Decision Trees; Mikhail Moshkov Book 2020 The Editor(s) (if applicable) and The [打印本頁] 作者: 不幸的你 時間: 2025-3-21 18:50
書目名稱Comparative Analysis of Deterministic and Nondeterministic Decision Trees影響因子(影響力)
書目名稱Comparative Analysis of Deterministic and Nondeterministic Decision Trees影響因子(影響力)學(xué)科排名
書目名稱Comparative Analysis of Deterministic and Nondeterministic Decision Trees網(wǎng)絡(luò)公開度
書目名稱Comparative Analysis of Deterministic and Nondeterministic Decision Trees網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Comparative Analysis of Deterministic and Nondeterministic Decision Trees被引頻次
書目名稱Comparative Analysis of Deterministic and Nondeterministic Decision Trees被引頻次學(xué)科排名
書目名稱Comparative Analysis of Deterministic and Nondeterministic Decision Trees年度引用
書目名稱Comparative Analysis of Deterministic and Nondeterministic Decision Trees年度引用學(xué)科排名
書目名稱Comparative Analysis of Deterministic and Nondeterministic Decision Trees讀者反饋
書目名稱Comparative Analysis of Deterministic and Nondeterministic Decision Trees讀者反饋學(xué)科排名
作者: 間諜活動 時間: 2025-3-21 23:35
978-3-030-41730-7The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: 悄悄移動 時間: 2025-3-22 01:42 作者: extinguish 時間: 2025-3-22 06:42 作者: milligram 時間: 2025-3-22 09:09 作者: 太空 時間: 2025-3-22 13:51
Frank Früchtel,Gudrun Cyprian,Wolfgang Buddeterministic, and strongly nondeterministic decision trees is studied. The obtained results have some independent interest. Proofs of these results illustrate mainly methods for the proof of lower bounds on complexity of decision trees.作者: 太空 時間: 2025-3-22 19:48 作者: JECT 時間: 2025-3-22 22:08 作者: canonical 時間: 2025-3-23 04:01 作者: habitat 時間: 2025-3-23 09:36
Frank Früchtel,Gudrun Cyprian,Wolfgang Budde. For a given signature ., each local lower type ., ., and each pair . such that in the matrix . at the intersection of the row with index . and the column with index . either . or . stays, we study upper and lower bounds on the function . true for any sccf-triple ..作者: trigger 時間: 2025-3-23 13:10 作者: 歌劇等 時間: 2025-3-23 15:58
Cornelia Kricheldorff Dr. phil., Dipl.This chapter contains definitions of the notions of decision table with many-valued decisions, decision tree schema, deterministic, nondeterministic, and strongly nondeterministic decision trees for decision tables, and complexity function.作者: 蔑視 時間: 2025-3-23 19:16 作者: Annotate 時間: 2025-3-23 22:47 作者: 時代 時間: 2025-3-24 04:58
https://doi.org/10.1007/978-3-531-90619-5In this chapter, for restricted sccf-triples ., we study functions ., ., located in the matrix of upper local bounds for the triple . on the main diagonal and below. For each of these functions, we list all possible upper types and consider criterion for each such type. In several cases, we give upper and lower bounds for the considered functions.作者: Anthrp 時間: 2025-3-24 07:37 作者: 駭人 時間: 2025-3-24 13:50
Sozialer Raum und Soziale ArbeitIn this chapter, we describe all possible six local upper types of restricted sccf-triples. For each of these six types, we consider the criterion of its implementation and give an example of a restricted sccf-triple with this type.作者: 神化怪物 時間: 2025-3-24 18:37 作者: commonsense 時間: 2025-3-24 21:22
Basic Definitions and NotationThis chapter contains definitions of the notions of decision table with many-valued decisions, decision tree schema, deterministic, nondeterministic, and strongly nondeterministic decision trees for decision tables, and complexity function.作者: 字謎游戲 時間: 2025-3-24 23:09
Lower Bounds on Complexity of Deterministic Decision Trees for Decision TablesIn this chapter, lower bounds on complexity of deterministic decision trees for decision tables are studied that are based on the notions of super-cover, super-partition, test, and system of representatives for decision tables. An approach to the proof of lower bounds is also considered which is based on the use of so-called proof-trees.作者: forthy 時間: 2025-3-25 05:54 作者: 祖先 時間: 2025-3-25 10:03 作者: MOAN 時間: 2025-3-25 13:06
Functions Over Main DiagonalIn this chapter, for restricted sccf-triples ., we study functions ., ., located in the matrix of upper local bounds for the triple . over the main diagonal. For each of these functions, we list all possible upper types and consider criterion for each such type. In several cases, we give upper and lower bounds for the considered functions.作者: Traumatic-Grief 時間: 2025-3-25 19:32
Local Upper Types of Restricted Sccf-TriplesIn this chapter, we describe all possible six local upper types of restricted sccf-triples. For each of these six types, we consider the criterion of its implementation and give an example of a restricted sccf-triple with this type.作者: 在駕駛 時間: 2025-3-25 20:08
Mikhail MoshkovFocuses on the comparative analysis of deterministic and nondeterministic decision trees for problems in information systems.Compares the complexity of problem representation and minimum complexities 作者: 表主動 時間: 2025-3-26 03:33
Intelligent Systems Reference Libraryhttp://image.papertrans.cn/c/image/230834.jpg作者: negotiable 時間: 2025-3-26 04:53
Frank Früchtel,Gudrun Cyprian,Wolfgang Buddeered. These bounds and algorithms are based on the use of so-called additive-bounded uncertainty measures for decision tables. The bounds are true for any complexity function having the property .. When developing algorithms, we assume that the complexity functions have properties ., ., and ..作者: 分發(fā) 時間: 2025-3-26 10:53
Frank Früchtel,Gudrun Cyprian,Wolfgang Buddeic and strongly nondeterministic decision trees. The bounds on complexity are true for arbitrary complexity functions. The approach to proof of lower bounds assumes that the complexity functions have the property .. The considered algorithms require complexity functions having properties ., ., and .作者: Demulcent 時間: 2025-3-26 13:17 作者: beta-cells 時間: 2025-3-26 20:05 作者: EVEN 時間: 2025-3-27 00:31
https://doi.org/10.1007/978-3-531-19047-1ems, decision trees over information systems, problems over information systems, classes of information systems, relationships among different parameters of problems, and upper and lower types of these relationships.作者: 使厭惡 時間: 2025-3-27 01:38
Frank Früchtel,Wolfgang Budde,Gudrun Cyprianworks of the local approach, the study of decision trees for problems can be reduced to the study of decision trees for decision tables. We prove that, instead of arbitrary classes of information systems, we can consider classes containing only one information system. We also show that the matrix of作者: Graduated 時間: 2025-3-27 08:44
https://doi.org/10.1007/978-3-531-90619-5triples . with .. For each pair . such that in the matrix . at the intersection of the row with index . and the column with index . either . or . stays, we study upper and lower bounds on the function . true for any sccf-triple ..作者: 主動 時間: 2025-3-27 09:55
Frank Früchtel,Gudrun Cyprian,Wolfgang Budde. For a given signature ., each local lower type ., ., and each pair . such that in the matrix . at the intersection of the row with index . and the column with index . either . or . stays, we study upper and lower bounds on the function . true for any sccf-triple ..作者: 慢跑 時間: 2025-3-27 15:34
Sozialer Raum und Soziale Arbeit,nimum complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees, problems of construction of decision trees with the minimum complexity, and the problem of solvability of systems of equations over information systems. We study relationships among these problems and 作者: 合乎習(xí)俗 時間: 2025-3-27 20:33
Upper Bounds and Algorithms for Construction of Deterministic Decision Trees for Decision Tables. Seered. These bounds and algorithms are based on the use of so-called additive-bounded uncertainty measures for decision tables. The bounds are true for any complexity function having the property .. When developing algorithms, we assume that the complexity functions have properties ., ., and ..作者: START 時間: 2025-3-27 22:46 作者: inquisitive 時間: 2025-3-28 05:27 作者: 吝嗇性 時間: 2025-3-28 10:20 作者: eardrum 時間: 2025-3-28 13:35
Basic Definitions and Notationems, decision trees over information systems, problems over information systems, classes of information systems, relationships among different parameters of problems, and upper and lower types of these relationships.作者: 積云 時間: 2025-3-28 17:13 作者: 一大群 時間: 2025-3-28 20:46
Matrices of Lower Local Bounds. For a given signature ., each local lower type ., ., and each pair . such that in the matrix . at the intersection of the row with index . and the column with index . either . or . stays, we study upper and lower bounds on the function . true for any sccf-triple ..作者: 南極 時間: 2025-3-29 00:11
Book 2020ation; and global, when decision trees can use arbitrary attributes from the information system. For both approaches, it describes all possible types of relationships among the four parameters considered and discusses the algorithmic problems related to decision tree optimization. The results presen作者: 起草 時間: 2025-3-29 05:21 作者: ARM 時間: 2025-3-29 10:13 作者: pessimism 時間: 2025-3-29 12:02 作者: 漂白 時間: 2025-3-29 19:37
Bounds on Complexity and Algorithms for Construction of Nondeterministic and Strongly Nondeterministic and strongly nondeterministic decision trees. The bounds on complexity are true for arbitrary complexity functions. The approach to proof of lower bounds assumes that the complexity functions have the property .. The considered algorithms require complexity functions having properties ., ., and .作者: ICLE 時間: 2025-3-29 21:47
Closed Classes of Boolean Functionsterministic, and strongly nondeterministic decision trees is studied. The obtained results have some independent interest. Proofs of these results illustrate mainly methods for the proof of lower bounds on complexity of decision trees.作者: confide 時間: 2025-3-30 02:16 作者: corpus-callosum 時間: 2025-3-30 04:02 作者: Odyssey 時間: 2025-3-30 08:31
Main Reductionsworks of the local approach, the study of decision trees for problems can be reduced to the study of decision trees for decision tables. We prove that, instead of arbitrary classes of information systems, we can consider classes containing only one information system. We also show that the matrix of作者: 萬神殿 時間: 2025-3-30 13:26 作者: 種族被根除 時間: 2025-3-30 16:49
Matrices of Lower Local Bounds. For a given signature ., each local lower type ., ., and each pair . such that in the matrix . at the intersection of the row with index . and the column with index . either . or . stays, we study upper and lower bounds on the function . true for any sccf-triple ..作者: 侵略者 時間: 2025-3-30 23:06
Algorithmic Problems. Local Approachnimum complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees, problems of construction of decision trees with the minimum complexity, and the problem of solvability of systems of equations over information systems. We study relationships among these problems and 作者: 細(xì)菌等 時間: 2025-3-31 03:39
1868-4394 mplexity of problem representation and minimum complexities .This book compares four parameters of problems in arbitrary information systems: complexity of problem representation and complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees for problem solving. Dete作者: opinionated 時間: 2025-3-31 09:00
Sozialer Raum und Soziale Arbeit, minimum complexity, and the problem of solvability of systems of equations over information systems. We study relationships among these problems and describe all variants of algorithmic problem behavior. We also discuss an algorithm for decision table construction and two algorithms that construct deterministic decision trees.作者: LVAD360 時間: 2025-3-31 09:40
Algorithmic Problems. Local Approach minimum complexity, and the problem of solvability of systems of equations over information systems. We study relationships among these problems and describe all variants of algorithmic problem behavior. We also discuss an algorithm for decision table construction and two algorithms that construct deterministic decision trees.作者: ALERT 時間: 2025-3-31 15:41
Book 2020, nondeterministic, and strongly nondeterministic decision trees for problem solving. Deterministic decision trees are widely used as classifiers, as a means of knowledge representation, and as algorithms. Nondeterministic (strongly nondeterministic) decision trees can be interpreted as systems of t作者: 剝皮 時間: 2025-3-31 18:51
