Results 11 to 20 of about 219,190 (262)

optRF: Optimising random forest stability by determining the optimal number of trees

open access: yesBMC Bioinformatics
Machine learning is frequently used to make decisions based on big data. Among these techniques, random forest is particularly prominent. Although random forest is known to have many advantages, one aspect that is often overseen is that it is a non ...
Thomas M. Lange   +3 more
doaj   +2 more sources

C-Net: A Method for Generating Non-deterministic and Dynamic Multivariate Decision Trees

open access: yesKnowledge and Information Systems, 2001
Despite the fact that artificial neural networks (ANNs) are universal function approximators, their black box nature (that is, their lack of direct interpretability or expressive power) limits their utility. In contrast, univariate decision trees (UDTs) have expressive power, although usually they are not as accurate as ANNs. We propose an improvement,
H. Abbass, M. Towsey, G. Finn
semanticscholar   +5 more sources

Comparing deterministic and statistical approaches for predicting “short can” defects in aluminium beverage can production [PDF]

open access: yesComputer Methods in Materials Science, 2023
In the production of beverage cans, “short can” defects in the form of material discontinuities can occur during the deep drawing of cylindrical thin-walled aluminium products.
Wojciech Baran*   +3 more
doaj   +1 more source

An Explainable Bayesian Decision Tree Algorithm

open access: yesFrontiers in Applied Mathematics and Statistics, 2021
Bayesian Decision Trees provide a probabilistic framework that reduces the instability of Decision Trees while maintaining their explainability. While Markov Chain Monte Carlo methods are typically used to construct Bayesian Decision Trees, here we ...
Giuseppe Nuti   +2 more
doaj   +1 more source

Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2014
We consider the synthesis of deterministic tree transducers from automaton definable specifications, given as binary relations, over finite trees.
Christof Löding, Sarah Winter
doaj   +1 more source

Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees [PDF]

open access: yesACM-SIAM Symposium on Discrete Algorithms, 2021
We revisit Hopcroft's problem and related fundamental problems about geometric range searching. Given $n$ points and $n$ lines in the plane, we show how to count the number of point-line incidence pairs or the number of point-above-line pairs in $O(n^{4 ...
Timothy M. Chan, D. Zheng
semanticscholar   +1 more source

Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes

open access: yesCoRR, 2023
In this paper, we consider classes of decision tables with 0-1-decisions closed relative to removal of attributes (columns) and changing decisions assigned to rows. For tables from an arbitrary closed class, we study the dependence of the minimum complexity of deterministic decision trees on various parameters of the tables: the minimum complexity of a
Azimkhon Ostonov, Mikhail Moshkov
openaire   +2 more sources

Exploring the PV Power Forecasting at Building Façades Using Gradient Boosting Methods

open access: yesEnergies, 2023
Solar power forecasting is of high interest in managing any power system based on solar energy. In the case of photovoltaic (PV) systems, and building integrated PV (BIPV) in particular, it may help to better operate the power grid and to manage the ...
Jesús Polo   +5 more
doaj   +1 more source

Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes

open access: yesIEEE Access, 2023
This paper investigates classes of decision tables (DTs) with 0-1-decisions that are closed under the removal of attributes (columns) and changes to the assigned decisions to rows. For tables from any closed class (CC), the authors examine how the minimum complexity of deterministic decision trees (DDTs) depends on the minimum complexity of a strongly ...
Azimkhon Ostonov, Mikhail Moshkov
openaire   +3 more sources

Mesoporous-Shell Monolayer Plasmonic Architecture Enables Quantitative and Decision-Guided SERS. [PDF]

open access: yesAdv Sci (Weinh)
Mesoporous‐shell‐regulated molecular transport combined with monolayer hotspot determinism transforms surface‐enhanced Raman spectroscopy (SERS) from ultrasensitive detection into quantitative and decision‐guided molecular sensing. ABSTRACT Quantitative surface‐enhanced Raman spectroscopy (SERS) has long been impeded by stochastic hotspot formation ...
Huang G   +9 more
europepmc   +2 more sources

Home - About - Disclaimer - Privacy