Saved in:
Bibliographic Details
Main Authors: Yu, Peng, Chen, Yike, Xu, Chao, Bifet, Albert, Read, Jesse
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2511.08470
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914151334412288
author Yu, Peng
Chen, Yike
Xu, Chao
Bifet, Albert
Read, Jesse
author_facet Yu, Peng
Chen, Yike
Xu, Chao
Bifet, Albert
Read, Jesse
contents In the context of the Classification and Regression Trees (CART) algorithm, the efficient splitting of categorical features using standard criteria like GINI and Entropy is well-established. However, using the Mean Absolute Error (MAE) criterion for categorical features has traditionally relied on various numerical encoding methods. This paper demonstrates that unsupervised numerical encoding methods are not viable for the MAE criteria. Furthermore, we present a novel and efficient splitting algorithm that addresses the challenges of handling categorical features with the MAE criterion. Our findings underscore the limitations of existing approaches and offer a promising solution to enhance the handling of categorical data in CART algorithms.
format Preprint
id arxiv_https___arxiv_org_abs_2511_08470
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Binary Split Categorical feature with Mean Absolute Error Criteria in CART
Yu, Peng
Chen, Yike
Xu, Chao
Bifet, Albert
Read, Jesse
Machine Learning
Artificial Intelligence
In the context of the Classification and Regression Trees (CART) algorithm, the efficient splitting of categorical features using standard criteria like GINI and Entropy is well-established. However, using the Mean Absolute Error (MAE) criterion for categorical features has traditionally relied on various numerical encoding methods. This paper demonstrates that unsupervised numerical encoding methods are not viable for the MAE criteria. Furthermore, we present a novel and efficient splitting algorithm that addresses the challenges of handling categorical features with the MAE criterion. Our findings underscore the limitations of existing approaches and offer a promising solution to enhance the handling of categorical data in CART algorithms.
title Binary Split Categorical feature with Mean Absolute Error Criteria in CART
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2511.08470