Results 11 to 20 of about 170,610 (66)
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes [PDF]
Entropy, 2023 In this paper, we consider classes of decision tables with many-valued decisions closed under operations of the removal of columns, the changing of decisions, the permutation of columns, and the duplication of columns.
Azimkhon Ostonov, Mikhail Moshkov
semanticscholar +4 more sources
End-to-End Learning of Deterministic Decision Trees [PDF]
German Conference on Pattern Recognition, 2019 Conventional decision trees have a number of favorable properties, including interpretability, a small computational footprint and the ability to learn from little training data.
Thomas M. Hehn, Fred A. Hamprecht
openalex +3 more sources
arXiv.org, 2023 In this paper, we consider classes of decision tables with many-valued decisions closed relative to removal of attributes (columns) and changing sets of decisions assigned to rows.
Azimkhon Ostonov, Mikhail Moshkov
openalex +3 more sources
Proof complexity of systems of (non-deterministic) decision trees and branching programs
Annual Conference for Computer Science Logic, 2019 This paper studies propositional proof systems in which lines are sequents of decision trees or branching programs - deterministic and nondeterministic.
Sam Buss, Anupam Das, Alexander Knop
openalex +3 more sources
C-Net: A Method for Generating Non-deterministic and Dynamic Multivariate Decision Trees [PDF]
Knowledge and Information Systems, 2001 Hussein A. Abbass +2 more
openalex +2 more sources
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
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
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees
ACM Trans. Algorithms, 2023 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(n4/3) time,
Timothy M. Chan, Da Wei Zheng
semanticscholar +1 more source
Food Science & Nutrition, 2023 Appropriate tree fertilization with essential nutrients is considered as one of the major factors in enhancing the quality and quantity of horticultural crops. The most efficient way to fertilize trees is to dig holes around the trunks and fill them with
M. Heidarisoltanabadi +3 more
semanticscholar +1 more source
BMC Medical Informatics and Decision Making, 2023 Background The progressive ageing in developed countries entails an increase in multimorbidity. Population-wide predictive models for adverse health outcomes are crucial to address these growing healthcare needs.
Alexander Olza +2 more
semanticscholar +1 more source