Multi-point dimensionality reduction to improve projection layout reliability
In ordinary Dimensionality Reduction (DR), each data instance in a high dimensional space (original space), or on a distance matrix denoting original space distances, is mapped to (projected onto) one point in a low dimensional space (visual space), building a layout of projected points trying to preserve as much as possible some property of data such as distances, neighbourhood relationships, and/or topology structures, with the ultimate goal of approximating semantic properties of data with preserved geometric properties or topology structures in visual space. In this paper, the concept of Multi-point Dimensionality Reduction is elaborated on where each data instance can be mapped to (projected onto) possibly more than one point in visual space by providing the first general solution (algorithm) for it as a move in the direction of improving reliablity, usability and interpretability of dimensionality reduction. Furthermore by allowing the points in visual space to be split into two layers while maintaining the possibility of having more than one projection (mapping) per data instance , the benefit of separating more reliable points from less reliable points is dicussed notwithstanding the effort to improve less reliable points. The proposed solution (algorithm) in this paper, named Layered Vertex Splitting Data Embedding (LVSDE), is built upon and extends a combination of ordinary DR and graph drawing techniques. Based on the experiments of this paper on some data sets, the particular proposed algorithm (LVSDE) practically outperforms popular ordinary DR methods visually (semantics, group separation, subgroup detection or combinational group detection) in a way that is easily explainable.
Code (0)
등록된 구현이 없습니다.
Tasks
Dimensionality ReductionSimilar Papers 제목 키워드 기반
Improved Dimensionality Reduction of various Datasets using Novel Multiplicative Factoring Principal Component Analysis (MPCA)
Principal Component Analysis (PCA) is known to be the most widely applied dimensionality reduction approach. A lot of improvements have been done on the traditional PCA, in order to obtain optimal results in the dimensio…
Dimensionality ReductionTowards Making High Dimensional Distance Metric Learning Practical
In this work, we study distance metric learning (DML) for high dimensional data. A typical approach for DML with high dimensional data is to perform the dimensionality reduction first before learning the distance metric.…
Dimensionality ReductionMetric LearningVocal Bursts Intensity PredictionA Visual Interaction Framework for Dimensionality Reduction Based Data Exploration
Dimensionality reduction is a common method for analyzing and visualizing high-dimensional data. However, reasoning dynamically about the results of a dimensionality reduction is difficult. Dimensionality-reduction algor…
Dimensionality ReductionConvexity-Driven Projection for Point Cloud Dimensionality Reduction
We propose Convexity-Driven Projection (CDP), a boundary-free linear method for dimensionality reduction of point clouds that targets preserving detour-induced local non-convexity. CDP builds a $k$-NN graph, identifies a…
Dimensionality ReductionPoint CloudsMind the Gaps: Measuring Visual Artifacts in Dimensionality Reduction
Dimensionality Reduction (DR) techniques are commonly used for the visual exploration and analysis of high-dimensional data due to their ability to project datasets of high-dimensional points onto the 2D plane. However, …
Dimensionality Reduction