Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yi-He Chen

dblp:312/3979 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Kernel, tree and ensemble methods · 50% Graph learning · 50%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods › ensemble learning
deep forest
0.512021
Improving Deep Forest by Exploiting High-order Interactions · ICDM 2021
Machine learning › Graph learning
high-order interaction
0.512021
Improving Deep Forest by Exploiting High-order Interactions · ICDM 2021
Data mining › predictive modeling › classification
ensemble learning
0.112021
Improving Deep Forest by Exploiting High-order Interactions · ICDM 2021
Data mining › predictive modeling › classification › ensemble learning
random forest
0.112021
Improving Deep Forest by Exploiting High-order Interactions · ICDM 2021

Methods — techniques the papers use, named apart from their topics

random intersection trees · 1.0activated linear combination · 1.0
YearPublicationVenuePosition
2021 Improving Deep Forest by Exploiting High-order Interactions
abstract
Recent studies on deep forests have shown that deep learning frameworks can be built on non-differentiable modules without a backpropagation training process. However, the feature representations of deep forests only consist of predicted class probabilities. The information these class probabilities deliver is very limited and lacks diversity, especially when the number of output labels is far less than the number of input features. Besides, the prediction-based representations require us to save multiple layers of random forests to use them during testing, which is high-memory and high-time cost. In this paper, we propose a novel deep forest model that utilizes high-order interactions of input features to generate more informative and diverse feature representations. Specifically, we design a generalized version of Random Intersection Trees (gRIT) to discover stable high-order interactions and apply Activated Linear Combination (ALC) to transform them into hierarchical distributed representations. These interaction-based representations obviate the need to store random forests in the front layers, thus greatly improving the computational efficiency. Our experiments show that our method achieves highly competitive predictive performance with significantly reduced time and memory cost.
Yi-He Chen, Shen-Huan Lyu, Yuan Jiang 0001
ICDM1