Demo Data from EDBT 2026 / reviewers in the wild / expert
Haoyan Luo
dblp:334/4036
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 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.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 70% Machine learning and data management · 30% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › feature engineering
automated feature engineering |
0.7 | 1 | 2023 | OpenFE: Automated Feature Generation with Expert-level Performance · ICML 2023 |
Machine learning and data management
feature pruning |
0.7 | 1 | 2023 | OpenFE: Automated Feature Generation with Expert-level Performance · ICML 2023 |
Data mining › dimensionality reduction
feature selection |
0.7 | 1 | 2023 | OpenFE: Automated Feature Generation with Expert-level Performance · ICML 2023 |
Data mining
tabular data |
0.2 | 1 | 2023 | OpenFE: Automated Feature Generation with Expert-level Performance · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
two-stage pruning · 0.7feature boosting · 0.7coarse-to-fine pruning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | OpenFE: Automated Feature Generation with Expert-level PerformanceabstractThe goal of automated feature generation is to liberate machine learning experts from the laborious task of manual feature generation, which is crucial for improving the learning performance of tabular data. The major challenge in automated feature generation is to efficiently and accurately identify effective features from a vast pool of candidate features. In this paper, we present OpenFE, an automated feature generation tool that provides competitive results against machine learning experts. OpenFE achieves high efficiency and accuracy with two components: 1) a novel feature boosting method for accurately evaluating the incremental performance of candidate features and 2) a two-stage pruning algorithm that performs feature pruning in a coarse-to-fine manner. Extensive experiments on ten benchmark datasets show that OpenFE outperforms existing baseline methods by a large margin. We further evaluate OpenFE in two Kaggle competitions with thousands of data science teams participating. In the two competitions, features generated by OpenFE with a simple baseline model can beat 99.3% and 99.6% data science teams respectively. In addition to the empirical results, we provide a theoretical perspective to show that feature generation can be beneficial in a simple yet representative setting. Tianping Zhang, Zheyu Aqa Zhang, Zhiyuan Fan, Haoyan Luo, Qian Liu 0033, Li Jian |
ICML | 4 |