BEST: a decision tree algorithm that handles missing values

DOI10.48550/ARXIV.1804.10168MaRDI QIDQ143925zbMATH OpenOpenAlexFDO

Authors Cédric Beaulac, Jeffrey S. Rosenthal, Cédric Beaulac, Jeffrey S. Rosenthal

Publication date 26 April 2018

Published in Computational Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1804.10168

zbMATH Keywords

missing datainterpretable modelsapplied machine learningclassification and regression treevariable importance analysis

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Abstract: The main contribution of this paper is the development of a new decision tree algorithm. The proposed approach allows users to guide the algorithm through the data partitioning process. We believe this feature has many applications but in this paper we demonstrate how to utilize this algorithm to analyse data sets containing missing values. We tested our algorithm against simulated data sets with various missing data structures and a real data set. The results demonstrate that this new classification procedure efficiently handles missing values and produces results that are slightly more accurate and more interpretable than most common procedures without any imputations or pre-processing.

Recommendations

• An investigation of missing data methods for classification trees applied to binary response data
• Tree-based algorithms for missing data imputation
• Handling missing values when applying classification models
• Dealing with Missing Values in a Probabilistic Decision Tree during Classification
• Addressing the problem of missing data in decision tree modeling

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 1834445 (Why is no real title available?)
• An investigation of missing data methods for classification trees applied to binary response data
• Bagging predictors
• Extremely randomized trees
• Handling missing values when applying classification models
• Inference and missing data
• Random forests
• SinaPlot: An Enhanced Chart for Simple and Truthful Representation of Single Observations Over Multiple Classes
• Understanding machine learning. From theory to algorithms
• What is meant by ``missing at random?
• ggplot2. Elegant graphics for data analysis. With contributions by Carson Sievert

Cited in

(2)

• BESTree
• Imputation Scores

Describes a project that uses

Uses Software

• sinaplot
• C4.5
• MICE
• C50
• ggplot2
• rpart
• R

This page was built for publication: BEST: a decision tree algorithm that handles missing values

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q143925)