This paper presents two algorithms for autonomously selecting the best projection among all possible configurations when projecting a high-dimensional (HD) data set on to a 3-dimensional (3D) space using 3D star coordinate projection (3D SCP). The proposed automated algorithms use two different objective functions that minimize the stress and preserve the pair wise distance among data points before and after the projection. The objective functions follow the principle of preserving topology similar to the multidimensional scaling (MDS). The concept of topology preserving mapping is found to be effective in autonomously selecting the best projection using the 3D SCP for visualization. Empirical analyses on artificial and real datasets are pe...
Preserving all multidimensional data in two-dimensional visualization is a long-standing problem in ...
Abstract — Star coordinates is a popular projection technique from an nD data space to a 2D/3D visua...
Mapping high-dimensional data in a low-dimensional space, for example, for visualization, is a probl...
This paper presents two algorithms for autonomously selecting the best projection among all possible...
The 3D Star Coordinate Projection (3DSCP) visualisation algorithm has been developed to address the ...
This paper presents a 3D star coordinate-based visualization technique for exploratory data analysis...
Multidimensional projections map data points, defined in a high-dimensional data space, into a 1D, 2...
The Star Plot approach to high-dimensional data visualization is applied to multi-attribute dichotom...
Most multidimensional projection techniques rely on distance (dissimilarity) information between dat...
In the visual analysis of high-dimensional data points, star coordinate plot maps the data points in...
Visualization harnesses the perceptual capabilities of humans to provide the visual insight into dat...
Visualization of high-dimensional data requires a mapping to a visual space. Whenever the goal is to...
In recent years, many dimensionality reduction (DR) algorithms have been proposed for visual analysi...
International audienceMapping high-dimensional data in a low-dimensional space, for example, for vis...
Mapping high-dimensional data in a low-dimensional space, for example, for visualization, is a probl...
Preserving all multidimensional data in two-dimensional visualization is a long-standing problem in ...
Abstract — Star coordinates is a popular projection technique from an nD data space to a 2D/3D visua...
Mapping high-dimensional data in a low-dimensional space, for example, for visualization, is a probl...
This paper presents two algorithms for autonomously selecting the best projection among all possible...
The 3D Star Coordinate Projection (3DSCP) visualisation algorithm has been developed to address the ...
This paper presents a 3D star coordinate-based visualization technique for exploratory data analysis...
Multidimensional projections map data points, defined in a high-dimensional data space, into a 1D, 2...
The Star Plot approach to high-dimensional data visualization is applied to multi-attribute dichotom...
Most multidimensional projection techniques rely on distance (dissimilarity) information between dat...
In the visual analysis of high-dimensional data points, star coordinate plot maps the data points in...
Visualization harnesses the perceptual capabilities of humans to provide the visual insight into dat...
Visualization of high-dimensional data requires a mapping to a visual space. Whenever the goal is to...
In recent years, many dimensionality reduction (DR) algorithms have been proposed for visual analysi...
International audienceMapping high-dimensional data in a low-dimensional space, for example, for vis...
Mapping high-dimensional data in a low-dimensional space, for example, for visualization, is a probl...
Preserving all multidimensional data in two-dimensional visualization is a long-standing problem in ...
Abstract — Star coordinates is a popular projection technique from an nD data space to a 2D/3D visua...
Mapping high-dimensional data in a low-dimensional space, for example, for visualization, is a probl...