Results 41 to 50 of about 962,663 (328)
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes [PDF]
arXiv, 2023 In this paper, we consider classes of decision tables with many-valued decisions closed under operations of removal of columns, changing of decisions, permutation of columns, and duplication of columns. We study relationships among three parameters of these tables: the complexity of a decision table (if we consider the depth of decision trees, then the
arxiv
KnowledgeKnowledge comes in various forms: scientific, artistic, legal, and many others. For most non-computer scientists, it is far easier to express their knowledge in text than in programming code.
Joseph Vidal +5 more
doaj +1 more source
Decision Stream: Cultivating Deep Decision Trees
, 2017 Various modifications of decision trees have been extensively used during the past years due to their high efficiency and interpretability. Tree node splitting based on relevant feature selection is a key step of decision tree learning, at the same time ...
Ignatov, Andrey, Ignatov, Dmitry
core +1 more source
A Local Approach to Studying the Time and Space Complexity of Deterministic and Nondeterministic Decision Trees [PDF]
arXiv, 2023 In this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe. We consider the notion of a problem over information system, which is described by a finite number of attributes and a mapping associating a ...
arxiv
On the parity complexity measures of Boolean functions [PDF]
, 2010 The parity decision tree model extends the decision tree model by allowing the computation of a parity function in one step. We prove that the deterministic parity decision tree complexity of any Boolean function is polynomially related to the non ...
Beals +10 more
core +2 more sources
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity [PDF]
, 2010 A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees for all ...
Ambainis +9 more
core +2 more sources
CSNL: A cost-sensitive non-linear decision tree algorithm [PDF]
, 2010 This article presents a new decision tree learning algorithm called CSNL that induces Cost-Sensitive Non-Linear decision trees. The algorithm is based on the hypothesis that nonlinear decision nodes provide a better basis than axis-parallel decision ...
Allwein E. L. +20 more
core +3 more sources
Effects of chronic browsing on life‐history traits of an irruptive large herbivore population
Population Ecology, EarlyView.This study aimed to determine the relationship between diet quality, body mass, and size (hind foot length), and female reproduction and sought to identify the mechanism by which high density under severe food limitations is maintained. Our results demonstrated that sika deer introduced to Nakanoshima Island have maintained high densities through high ...
Koichi Kaji +9 more
wiley +1 more source
Machine Learning Methods with Decision Forests for Parkinson’s Detection
Applied Sciences, 2021 Biomedical engineers prefer decision forests over traditional decision trees to design state-of-the-art Parkinson’s Detection Systems (PDS) on massive acoustic signal data.
Moumita Pramanik +4 more
doaj +1 more source