Results 81 to 90 of about 320,698 (271)
Rockburst prediction in kimberlite using decision tree with incomplete data
A rockburst is a common engineering geological hazard. In order to predict rockburst potential in kimberlite at an underground diamond mine, a decision tree method was employed.
Yuanyuan Pu, Derek B. Apel, Bob Lingga
doaj
Boosting-Based Sequential Meta-Tree Ensemble Construction for Improved Decision Trees [PDF]
A decision tree is one of the most popular approaches in machine learning fields. However, it suffers from the problem of overfitting caused by overly deepened trees. Then, a meta-tree is recently proposed. It solves the problem of overfitting caused by overly deepened trees.
arxiv
Purpose Linear accelerator (LINAC)‐based single‐isocenter multi‐target (SIMT) treatment has streamlined the cranial stereotactic radiosurgery (SRS) workflow. Though efficient, SIMT delivery adds additional challenges that should be considered, including increased sensitivity to rotational errors for off‐isocenter targets.
Yohan A. Walter+4 more
wiley +1 more source
An Algorithmic Framework for Constructing Multiple Decision Trees by Evaluating Their Combination Performance Throughout the Construction Process [PDF]
Predictions using a combination of decision trees are known to be effective in machine learning. Typical ideas for constructing a combination of decision trees for prediction are bagging and boosting. Bagging independently constructs decision trees without evaluating their combination performance and averages them afterward.
arxiv
Abstract Objectives This study sought to evaluate proteomic, metabolomic, and immune signatures in the cerebrospinal fluid of individuals with Down Syndrome Regression Disorder (DSRD). Methods A prospective case–control study comparing proteomic, metabolomic, and immune profiles in individuals with DSRD was performed.
Jonathan D. Santoro+12 more
wiley +1 more source
The goal of this paper is to reduce the classification (inference) complexity of tree ensembles by choosing a single representative model out of ensemble of multiple decision-tree models. We compute the similarity between different models in the ensemble
Abraham Itzhak Weinberg, Mark Last
doaj +1 more source
Provably optimal decision trees with arbitrary splitting rules in polynomial time [PDF]
In this paper, we introduce a generic data structure called decision trees, which integrates several well-known data structures, including binary search trees, K-D trees, binary space partition trees, and decision tree models from machine learning. We provide the first axiomatic definition of decision trees.
arxiv
A composition theorem for decision tree complexity [PDF]
We completely characterise the complexity in the decision tree model of computing composite relations of the form h = g(f^1,...,f^n), where each relation f^i is boolean-valued. Immediate corollaries include a direct sum theorem for decision tree complexity and a tight characterisation of the decision tree complexity of iterated boolean functions.
arxiv
Objective We aimed to assess differences in baseline characteristics, efficacy, and safety of advanced therapies between male and female patients with axial spondyloarthritis (axSpA) in randomized controlled trials (RCTs). Methods We conducted a systematic literature search for RCTs assessing the efficacy of advanced therapies in patients with axSpA ...
Angel Gao+5 more
wiley +1 more source