Results 11 to 20 of about 286,084 (291)
Credible capacity evaluation of virtual power plants considering wind and PV uncertainties [PDF]
Scientific ReportsThe increasing integration of weather-dependent renewable energy sources into Virtual Power Plants (VPPs) introduces significant uncertainty in short-term dispatch planning.
Chaojie Li +7 more
doaj +2 more sources
MathematicsCorporate financing decisions, particularly the choice between equity and debt, significantly impact a company’s financial health and value. This study predicts binary corporate debt levels (high or low) using supervised machine learning (ML) models and ...
Joseph F. Hair +3 more
doaj +2 more sources
Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT [PDF]
2012 IEEE 27th Conference on Computational Complexity, 2012 We show how to approximate any function in AC^0 by decision trees of much smaller height than its number of variables. More precisely, we show that any function in n variables computable by an unbounded fan-in circuit of AND, OR, and NOT gates that has size S and depth d can be approximated by a decision tree of height n - \beta n to within error exp(-\
P. Beame, R. Impagliazzo, S. Srinivasan
semanticscholar +2 more sources
C-Net: A Method for Generating Non-deterministic and Dynamic Multivariate Decision Trees
Knowledge 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. A. Abbass, M. Towsey, G. Finn
semanticscholar +4 more sources
optRF: Optimising random forest stability by determining the optimal number of trees
BMC BioinformaticsMachine 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
An Explainable Bayesian Decision Tree Algorithm
Frontiers 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
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees [PDF]
ACM-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
Exploring the PV Power Forecasting at Building Façades Using Gradient Boosting Methods
Energies, 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
IEEE 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 +2 more sources
DeltaBoost: Gradient Boosting Decision Trees with Efficient Machine Unlearning
Proc. ACM Manag. Data, 2023 As machine learning (ML) has been widely developed in real-world applications, the privacy of ML models draws an increasing concern. In this paper, we study how to forget specific data records from ML models to preserve the privacy of these data ...
Zhaomin Wu +3 more
semanticscholar +1 more source