.png){kind=icon}
.png){kind=icon}
Return
Graph regularization multidimensional projection
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2022.108690.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces a novel multidimensional projection method of datasets. Our method called Graph Regularization Multidimensional Projection (GRMP) is based on a technique from the graph signal processing theory, the graph regularization. Initially, a similarity graph is built on the high-dimensional space where the dataset lies. A two-dimensional distribution of points is then created in the visual space using a phyllotactic distribution. The similarity graph is copied properly over the phyllotactic distribution and the graph regularization is applied to their coordinates, which are interpreted as graph signals. The graph regularization reorganizes the phyllotactic distribution by bringing together points that represent similar data in the high-dimensional space. We employ synthetic and real datasets to demonstrate the effectiveness of our method. Furthermore, since the solution of the graph regularization can still be approximated using a fast approximation mechanism based on the Chebyshev polynomials, our method is computationally efficient even for large graphs.
Keywords:
Mapping of patterns
Bidimensional mapping
Visualization
Multidimensional projection
Graph signal processing
Data analysis
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W