Demo Data from EDBT 2026 / reviewers in the wild / expert
Mingyuan Wang 0005
dblp:216/6341-5
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0001-6569-1154ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Databases, 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.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 33% Data stream processing · 33% Recommender systems · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data stream processing › evolving data
concept drift |
0.7 | 1 | 2023 | Online Feature Screening for Data Streams With Concept Drift · IEEE Trans. Knowl. Data Eng. 2023 |
Data mining › dimensionality reduction
feature selection |
0.7 | 1 | 2023 | Online Feature Screening for Data Streams With Concept Drift · IEEE Trans. Knowl. Data Eng. 2023 |
Recommender systems
model update |
0.7 | 1 | 2023 | Online Feature Screening for Data Streams With Concept Drift · IEEE Trans. Knowl. Data Eng. 2023 |
Methods — techniques the papers use, named apart from their topics
model adaptation · 0.7feature screening · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Online Feature Screening for Data Streams With Concept DriftabstractScreening feature selection methods are often used as a preprocessing step for reducing the number of variables before training a model. Traditional screening methods only focus on dealing with complete high dimensional datasets. However, modern datasets not only have higher dimensions and larger sample size, but also have properties such as streaming input, sparsity, and concept drift. Therefore a considerable number of online feature selection methods were introduced to handle these kinds of problems in recent years. Online screening methods are one of the categories of online feature selection methods. The methods that we propose in this paper are capable of handling all three situations mentioned above, in classification settings. Our experiments show that the proposed methods can generate the same feature importance as their offline versions with faster speed and less storage requirements. Furthermore, the results show that online screening methods with integrated model adaptation have a higher true feature detection rate than without model adaptation on data streams exhibiting concept drift. Among the three large real datasets that potentially have concept drift, online screening methods with model adaptation show advantages in either saving computation time and space, reducing model complexity, or improving prediction accuracy. Mingyuan Wang 0005, Adrian Barbu |
IEEE Trans. Knowl. Data Eng. | 1 |