Yichen Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yichen Zhou has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Giles Hooker
Department of Statistics and Data Science Cornell University Ithaca New York USA
3 shared publications Skyler Seto
1 shared publication- Wenyu Zhang
Cornell University, Statistics and Data Science, Ithaca, USA
1 shared publication - Zhengze Zhou
Department of Statistical Science Department of Statistical Science Cornell University Cornell University
1 shared publication
Latest Publications
- 11 January 2023
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 38 (5) , 3308-3346
Approximation trees: statistical reproducibility in model distillation
- 11 January 2023
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 38 (5) , 3308-3346
Approximation trees: statistical reproducibility in model distillation
- Open Access
- 30 September 2022
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 36 (6) , 2237-2271
Decision tree boosted varying coefficient models
Varying coefficient models are a flexible extension of generic parametric models whose coefficients are functions of a set of effect-modifying covariates instead of fitted constants. They are capable of achieving higher model complexity while preserving the structure of the underlying parametric models, hence generating interpretable predictions. In this paper we study the use of gradient boosted decision trees as those coefficient-deciding functions in varying coefficient models with linearly structured outputs. In contrast to the traditional choices of splines or kernel smoothers, boosted trees are more flexible since they require no structural assumptions in the effect modifier space. We introduce our proposed method from the perspective of a localized version of gradient descent, prove its theoretical consistency under mild assumptions commonly adapted by decision tree research, and empirically demonstrate that the proposed tree boosted varying coefficient models achieve high performance qualified by their training speed, prediction accuracy and intelligibility as compared to several benchmark algorithms.
- 30 September 2022
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 36 (6) , 2237-2271
Open AccessDecision tree boosted varying coefficient models
Varying coefficient models are a flexible extension of generic parametric models whose coefficients are functions of a set of effect-modifying covariates instead of fitted constants. They are capable of achieving higher model complexity while preserving the structure of the underlying parametric models, hence generating interpretable predictions. In this paper we study the use of gradient boosted decision trees as those coefficient-deciding functions in varying coefficient models with linearly structured outputs. In contrast to the traditional choices of splines or kernel smoothers, boosted trees are more flexible since they require no structural assumptions in the effect modifier space. We introduce our proposed method from the perspective of a localized version of gradient descent, prove its theoretical consistency under mild assumptions commonly adapted by decision tree research, and empirically demonstrate that the proposed tree boosted varying coefficient models achieve high performance qualified by their training speed, prediction accuracy and intelligibility as compared to several benchmark algorithms.
- Open Access
Interpreting Models via Single Tree Approximation
We propose a procedure to build a decision tree which approximates the performance of complex machine learning models. This single approximation tree can be used to interpret and simplify the predicting pattern of random forests (RFs) and other models. The use of a tree structure is particularly relevant in medical questionnaires where it enables an adaptive shortening of the questionnaire, reducing response burden. We study the asymptotic behavior of splits and introduce an improved splitting method designed to stabilize tree structure. Empirical studies on both simulation and real data sets illustrate that our method can simultaneously achieve high approximation power and stability.
Open AccessInterpreting Models via Single Tree Approximation
We propose a procedure to build a decision tree which approximates the performance of complex machine learning models. This single approximation tree can be used to interpret and simplify the predicting pattern of random forests (RFs) and other models. The use of a tree structure is particularly relevant in medical questionnaires where it enables an adaptive shortening of the questionnaire, reducing response burden. We study the asymptotic behavior of splits and introduce an improved splitting method designed to stabilize tree structure. Empirical studies on both simulation and real data sets illustrate that our method can simultaneously achieve high approximation power and stability.
- Open Access
Multivariate Time Series Classification Using Dynamic Time Warping Template Selection for Human Activity Recognition
Accurate and computationally efficient means for classifying human activities have been the subject of extensive research efforts. Most current research focuses on extracting complex features to achieve high classification accuracy. We propose a template selection approach based on Dynamic Time Warping, such that complex feature extraction and domain knowledge is avoided. We demonstrate the predictive capability of the algorithm on both simulated and real smartphone data.
Open AccessMultivariate Time Series Classification Using Dynamic Time Warping Template Selection for Human Activity Recognition
Accurate and computationally efficient means for classifying human activities have been the subject of extensive research efforts. Most current research focuses on extracting complex features to achieve high classification accuracy. We propose a template selection approach based on Dynamic Time Warping, such that complex feature extraction and domain knowledge is avoided. We demonstrate the predictive capability of the algorithm on both simulated and real smartphone data.