Demo Data from EDBT 2026 / reviewers in the wild / expert
Benoît Colange
dblp:249/8161
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author
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 |
Representation and self-supervised learning · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › representation learning
dimensionality reduction |
0.4 | 1 | 2020 | Steering Distortions to Preserve Classes and Neighbors in Supervised Dimensionality Reduction · NeurIPS 2020 |
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning
neighbor embedding |
0.4 | 1 | 2020 | Steering Distortions to Preserve Classes and Neighbors in Supervised Dimensionality Reduction · NeurIPS 2020 |
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
supervised dimensionality reduction |
0.4 | 1 | 2020 | Steering Distortions to Preserve Classes and Neighbors in Supervised Dimensionality Reduction · NeurIPS 2020 |
Methods — techniques the papers use, named apart from their topics
stress function · 0.4stochastic neighbor embedding · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Steering Distortions to Preserve Classes and Neighbors in Supervised Dimensionality ReductionabstractNonlinear dimensionality reduction of high-dimensional data is challenging as the low-dimensional embedding will necessarily contain distortions, and it can be hard to determine which distortions are the most important to avoid. When annotation of data into known relevant classes is available, it can be used to guide the embedding to avoid distortions that worsen class separation. The supervised mapping method introduced in the present paper, called ClassNeRV, proposes an original stress function that takes class annotation into account and evaluates embedding quality both in terms of false neighbors and missed neighbors. ClassNeRV shares the theoretical framework of a family of methods descended from Stochastic Neighbor Embedding (SNE). Our approach has a key advantage over previous ones: in the literature supervised methods often emphasize class separation at the price of distorting the data neighbors' structure; conversely, unsupervised methods provide better preservation of structure at the price of often mixing classes. Experiments show that ClassNeRV can preserve both neighbor structure and class separation, outperforming nine state of the art alternatives. Benoît Colange, Jaakko Peltonen, Michaël Aupetit 0001, Denys Dutykh, Sylvain Lespinats |
NeurIPS | 1 |