Atzberger, DanielJobst, AdrianScheibel, WillyDöllner, JürgenHunter, DavidSlingsby, Aidan2024-09-092024-09-092024978-3-03868-249-3https://doi.org/10.2312/cgvc.20241224https://diglib.eg.org/handle/10.2312/cgvc20241224Dimensionality reductions are a class of unsupervised learning algorithms that aim to find a lower-dimensional embedding for a high-dimensional dataset while preserving local and global structures. By representing a high-dimensional dataset as a twodimensional scatterplot, a user can explore structures within the dataset. However, dimensionality reductions inherit distortions that might result in false deductions. This work presents a visualization approach that combines a two-dimensional scatterplot derived from a dimensionality reduction with two pointwise filtering possibilities. Each point is associated with two pointwise metrics that quantify the correctness of its neighborhood and similarity to surrounding data points. By setting threshold for these two metrics, the user is supported in several scatterplot analytics tasks, e.g., class separation and outlier detection. We apply our visualization to a text corpus to detect interesting data points visually and discuss the findings.Attribution 4.0 International LicenseCCS Concepts: Human-centered computing → Information visualization; Visual analyticsHuman centered computing → Information visualizationVisual analytics10.2312/cgvc.202412245 pages