Demo Data from EDBT 2026 / reviewers in the wild / expert
Dan Imre
dblp:37/9529
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1
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.
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics
high-dimensional data visualization |
0.2 | 1 | 2014 | A Structure-Based Distance Metric for High-Dimensional Space Exploration with Multidimensional Scaling · IEEE Trans. Vis. Comput. Graph. 2014 |
Visualization and visual analytics › dimensionality reduction
multidimensional scaling |
0.2 | 1 | 2014 | A Structure-Based Distance Metric for High-Dimensional Space Exploration with Multidimensional Scaling · IEEE Trans. Vis. Comput. Graph. 2014 |
Visualization and visual analytics › high-dimensional data visualization
parallel coordinates |
0.1 | 1 | 2014 | A Structure-Based Distance Metric for High-Dimensional Space Exploration with Multidimensional Scaling · IEEE Trans. Vis. Comput. Graph. 2014 |
Methods — techniques the papers use, named apart from their topics
parallel coordinates · 0.2multidimensional scaling · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | A Structure-Based Distance Metric for High-Dimensional Space Exploration with Multidimensional ScalingabstractAlthough the euclidean distance does well in measuring data distances within high-dimensional clusters, it does poorly when it comes to gauging intercluster distances. This significantly impacts the quality of global, low-dimensional space embedding procedures such as the popular multidimensional scaling (MDS) where one can often observe nonintuitive layouts. We were inspired by the perceptual processes evoked in the method of parallel coordinates which enables users to visually aggregate the data by the patterns the polylines exhibit across the dimension axes. We call the path of such a polyline its structure and suggest a metric that captures this structure directly in high-dimensional space. This allows us to better gauge the distances of spatially distant data constellations and so achieve data aggregations in MDS plots that are more cognizant of existing high-dimensional structure similarities. Our biscale framework distinguishes far-distances from near-distances. The coarser scale uses the structural similarity metric to separate data aggregates obtained by prior classification or clustering, while the finer scale employs the appropriate euclidean distance. Jenny Hyunjung Lee, Kevin T. McDonnell, Alla Zelenyuk, Dan Imre, Klaus Mueller 0001 |
IEEE Trans. Vis. Comput. Graph. | 4 |
| 2013 | GPU-accelerated incremental correlation clustering of large data with visual feedbackabstractClustering is an important preparation step in big data processing. It may even be used to detect redundant data points as well as outliers. Elimination of redundant data and duplicates can serve as a viable means for data reduction and it can also aid in sampling. Visual feedback is very valuable here to give users confidence in this process. Furthermore, big data preprocessing is seldom interactive, which stands at conflict with users who seek answers immediately. The best one can do is incremental preprocessing in which partial and hopefully quite accurate results become available relatively quickly and are then refined over time. We propose a correlation clustering framework which uses MDS for layout and GPU-acceleration to accomplish these goals. Our domain application is the correlation clustering of atmospheric mass spectrum data with 8 million data points of 450 dimensions each. Eric Papenhausen, Bing Wang 0007, Sungsoo Ha, Alla Zelenyuk, Dan Imre, Klaus Mueller 0001 |
IEEE BigData | 5 |