Nonlinear Dimensionality Reduction on Graphs
In this era of data deluge, many signal processing and machine learning tasks are faced with high-dimensional datasets, including images, videos, as well as time series generated from social, commercial and brain network interactions. Their efficient processing calls for dimensionality reduction techniques capable of properly compressing the data while preserving task-related characteristics, going beyond pairwise data correlations. The present paper puts forth a nonlinear dimensionality reduction framework that accounts for data lying on known graphs. The novel framework encompasses most of the existing dimensionality reduction methods, but it is also capable of capturing and preserving possibly nonlinear correlations that are ignored by linear methods. Furthermore, it can take into account information from multiple graphs. The proposed algorithms were tested on synthetic as well as real datasets to corroborate their effectiveness.
Code (0)
등록된 구현이 없습니다.
Tasks
Dimensionality ReductionTime SeriesTime Series AnalysisSimilar Papers 제목 키워드 기반
A Local Similarity-Preserving Framework for Nonlinear Dimensionality Reduction with Neural Networks
Real-world data usually have high dimensionality and it is important to mitigate the curse of dimensionality. High-dimensional data are usually in a coherent structure and make the data in relatively small true degrees o…
ClusteringDimensionality ReductionRepresentation LearningDimensionality Reduction of QAOA Parameter Space with Kernel PCA for Max-Cut
The Quantum Approximate Optimization Algorithm (QAOA) is a leading variational algorithm for combinatorial optimization on near term quantum devices. As circuit depth increases, the number of optimization parameters grow…
Dimensionality ReductionFeature Learning for Nonlinear Dimensionality Reduction toward Maximal Extraction of Hidden Patterns
Dimensionality reduction (DR) plays a vital role in the visual analysis of high-dimensional data. One main aim of DR is to reveal hidden patterns that lie on intrinsic low-dimensional manifolds. However, DR often overloo…
Dimensionality ReductionSpaceland Embedding of Sparse Stochastic Graphs
We introduce a nonlinear method for directly embedding large, sparse, stochastic graphs into low-dimensional spaces, without requiring vertex features to reside in, or be transformed into, a metric space. Graph data and …
Data VisualizationDimensionality ReductionGraph EmbeddingA Tangent Distance Preserving Dimensionality Reduction Algorithm
This paper considers the problem of nonlinear dimensionality reduction. Unlike existing methods, such as LLE, ISOMAP, which attempt to unfold the true manifold in the low dimensional space, our algorithm tries to preserv…
Dimensionality Reduction