arrow
返回

Coefficient tree regression: fast, accurate and interpretable predictive modeling

delete2021-11-12
delete4
delete
OA
AI
Ö
Özge Sürer *
D
Daniel W. Apley
E
Edward C. Malthouse
DOI:10.1007/s10994-021-06091-7delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The proliferation of data collection technologies often results in large data sets with many observations and many variables. In practice, highly relevant engineered features are often groups of predictors that share a common regression coefficient (i.e., the predictors in the group affect the response only via their collective sum), where the groups are unknown in advance and must be discovered from the data. We propose an algorithm called coefficient tree regression (CTR) to discover the group structure and fit the resulting regression model. In this regard CTR is an automated way of engineering new features, each of which is the collective sum of the predictors within each group. The algorithm can be used when the number of variables is larger than, or smaller than, the number of observations. Creating new features that affect the response in a similar manner improves predictive modeling, especially in domains where the relationships between predictors are not known a priori. CTR borrows computational strategies from both linear regression (fast model updating when adding/modifying a feature in the model) and regression trees (fast partitioning to form and split groups) to achieve outstanding computational and predictive performance. Finding features that represent hidden groups of predictors (i.e., a hidden ontology) that impact the response only via their sum also has major interpretability advantages, which we demonstrate with a real data example of predicting political affiliations with television viewing habits. In numerical comparisons over a variety of examples, we demonstrate that both computational expense and predictive performance are far superior to existing methods that create features as groups of predictors. Moreover, CTR has overall predictive performance that is comparable to or slightly better than the regular lasso method, which we include as a reference benchmark for comparison even though it is non-group-based, in addition to having substantial computational and interpretive advantages over lasso.
Keyword:
Aggregation
Group structure
Ontology
Feature engineering

期刊

Machine Learning 封面图
Machine Learning
IF:
2.9
论文数:
2.7K
被引数:
3.4W

机构

N
Northwestern University
学者数:
6.1W
论文数: 5.3W
被引数: 3.9K
引用论文

引用论文

IL-9 and Th9 cells: progress and challenges
err2013-09-11
err0
errOAAI
errPicheng Zhao; Xiang Xiao; Rafik M. Ghobrial; Xian C. Li
err分享
err收藏
Parasuicide in Edinburgh—A Seven-Year Review 1968–74
err2018-01-29
err0
PREAI
errT. A. Holding; Dorothy Buglass; J. C. Duffy; Norman Kreitman
err分享
err收藏
Random Matrices in Physics
err1967-01-01
err0
PREAI
errEugene P. Wigner
err分享
err收藏
Isotopes of titanium in Aldebaran
err1977-01-01
err0
errOAAI
errD. L. Lambert; R. E. Luck
err分享
err收藏
err分享
err收藏
学者 查看更多内容