Demo Data from VLDB 2026 / reviewers in the wild / expert
Daniel Alcaide
dblp:185/8200
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0001-5996-6158ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 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.
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% | |
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics
dimensionality reduction |
0.5 | 1 | 2021 | Spanning Trees as Approximation of Data Structures · IEEE Trans. Vis. Comput. Graph. 2021 |
Graph algorithms and graph theory › spanning tree
minimum spanning tree |
0.5 | 1 | 2021 | Spanning Trees as Approximation of Data Structures · IEEE Trans. Vis. Comput. Graph. 2021 |
Graph algorithms and graph theory
spanning tree |
0.5 | 1 | 2021 | Spanning Trees as Approximation of Data Structures · IEEE Trans. Vis. Comput. Graph. 2021 |
Data mining
high-dimensional data analysis |
0.1 | 1 | 2021 | Spanning Trees as Approximation of Data Structures · IEEE Trans. Vis. Comput. Graph. 2021 |
Methods — techniques the papers use, named apart from their topics
minimum spanning tree · 1.5correlation maximization · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Spanning Trees as Approximation of Data StructuresabstractThe connections in a graph generate a structure that is independent of a coordinate system. This visual metaphor allows creating a more flexible representation of data than a two-dimensional scatterplot. In this article, we present STAD (Simplified Topological Abstraction of Data), a parameter-free dimensionality reduction method that projects high-dimensional data into a graph. STAD generates an abstract representation of high-dimensional data by giving each data point a location in a graph which preserves the approximate distances in the original high-dimensional space. The STAD graph is built upon the Minimum Spanning Tree (MST) to which new edges are added until the correlation between the distances from the graph and the original dataset is maximized. Additionally, STAD supports the inclusion of additional functions to focus the exploration and allow the analysis of data from new perspectives, emphasizing traits in data which otherwise would remain hidden. We demonstrate the effectiveness of our method by applying it to two real-world datasets: traffic density in Barcelona and temporal measurements of air quality in Castile and León in Spain. Daniel Alcaide, Jan Aerts |
IEEE Trans. Vis. Comput. Graph. | 1 |