VLDB 2026 Research / reviewers in the wild / expert
Yi-Xiao He
dblp:326/5022
· DBLP profile ↗
7ranked-venue papers
3as first author
7since 2021 · last 2026
0000-0002-9518-5313ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 4 · 2 first-author · 4 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A semi-supervised deep forest framework based on margin distribution optimization for tabular data
Shen-Huan Lyu, Jia-Le Xu, Yi-Xiao He, Yanyan Wang 0001, Qingfu Zhang 0001 |
Inf. Sci. | 3 |
| 2026 | Interpreting Deep Forest through Feature Contribution and MDI Feature ImportanceabstractDeep forest is a non-differentiable deep model that has achieved impressive empirical success across a wide variety of applications, especially on categorical/symbolic or mixed modeling tasks. Many of the application fields prefer explainable models, such as random forests with feature contributions that can provide a local explanation for each prediction, and Mean Decrease Impurity (MDI) that can provide global feature importance. However, deep forest, as a cascade of random forests, possesses interpretability only at the first layer. From the second layer on, many of the tree splits occur on the new features generated by the previous layer, which makes existing explaining tools for random forests inapplicable. To disclose the impact of the original features in the deep layers, we design a calculation method with an estimation step followed by a calibration step for each layer, and propose our feature contribution and MDI feature importance calculation tools for deep forest. Experimental results on both simulated data and real-world data verify the effectiveness of our methods. Yi-Xiao He, Shen-Huan Lyu, Yuan Jiang 0001 |
ACM Trans. Knowl. Discov. Data | 1 |
| 2025 | Enhance learning efficiency of oblique decision tree via feature concatenation
Shen-Huan Lyu, Yi-Xiao He, Yanyan Wang 0001, Zhihao Qu, Bin Tang 0002 |
Inf. Sci. | 2 |
| 2024 | Multi-class imbalance problem: A multi-objective solution
Yi-Xiao He, Dan-Xuan Liu, Shen-Huan Lyu, Chao Qian 0001, Zhi-Hua Zhou |
Inf. Sci. | 1 |
| 2024 | Margin distribution and structural diversity guided ensemble pruning
Yi-Xiao He, Yu-Chang Wu, Chao Qian 0001, Zhi-Hua Zhou |
Mach. Learn. | 1 |
| 2022 | Depth is More Powerful than Width with Prediction Concatenation in Deep ForestabstractRandom Forest (RF) is an ensemble learning algorithm proposed by \citet{breiman2001random} that constructs a large number of randomized decision trees individually and aggregates their predictions by naive averaging. \citet{zhou2019deep} further propose Deep Forest (DF) algorithm with multi-layer feature transformation, which significantly outperforms random forest in various application fields. The prediction concatenation (PreConc) operation is crucial for the multi-layer feature transformation in deep forest, though little has been known about its theoretical property. In this paper, we analyze the influence of Preconc on the consistency of deep forest. Especially when the individual tree is inconsistent (as in practice, the individual tree is often set to be fully grown, i.e., there is only one sample at each leaf node), we find that the convergence rate of two-layer DF \textit{w.r.t.} the number of trees $M$ can reach $\mathcal{O}(1/M^2)$ under some mild conditions, while the convergence rate of RF is $\mathcal{O}(1/M)$. Therefore, with the help of PreConc, DF with deeper layer will be more powerful than the shallower layer. Experiments confirm theoretical advantages. Shen-Huan Lyu, Yi-Xiao He, Zhi-Hua Zhou |
NeurIPS | 2 |
| 2022 | Multi-objective Evolutionary Ensemble Pruning Guided by Margin Distribution
Yu-Chang Wu, Yi-Xiao He, Chao Qian 0001, Zhi-Hua Zhou |
PPSN (1) | 2 |