Grassmann Graph Embedding
Geometric deep learning that employs the geometric and topological features of data has attracted increasing attention in deep neural networks. Learning the intrinsic structure property of data is a crucial step for dimensionality reduction and effective feature extraction. This paper develops Grassmann graph embedding, which combines graph convolutions to capture the main components within graphs' hidden representations. Each set of featured graph nodes is mapped to a point on a Grassmann matrix manifold through Singular Value Decomposition, which is then embedded into a symmetric matrix space that approximates denoised second-order feature information. The view of treating nodes as a set could inspire many potential applications. In particular, we propose Grassmann (global graph) pooling that can connect with any graph convolution for graph neural networks. The Grassmann pooling achieves state-of-the-art performance on a variety of graph prediction benchmarks.
Code (0)
등록된 구현이 없습니다.
Tasks
Dimensionality ReductionGraph EmbeddingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Embedding Graphs on Grassmann Manifold
Learning efficient graph representation is the key to favorably addressing downstream tasks on graphs, such as node or graph property prediction. Given the non-Euclidean structural property of graphs, preserving the orig…
Graph EmbeddingGraph Property PredictionGraph Representation LearningProperty Prediction+1Extrinsic Methods for Coding and Dictionary Learning on Grassmann Manifolds
Sparsity-based representations have recently led to notable results in various visual recognition tasks. In a separate line of research, Riemannian manifolds have been shown useful for dealing with features and models th…
Action RecognitionClassificationDictionary LearningFace Recognition+4Classification of Hyperspectral Imagery on Embedded Grassmannians
We propose an approach for capturing the signal variability in hyperspectral imagery using the framework of the Grassmann manifold. Labeled points from each class are sampled and used to form abstract points on the Grass…
ClassificationGeneral ClassificationDictionary Learning and Sparse Coding on Grassmann Manifolds: An Extrinsic Solution
Recent advances in computer vision and machine learning suggest that a wide range of problems can be addressed more appropriately by considering non-Euclidean geometry. In this paper we explore sparse dictionary learning…
Action RecognitionDictionary LearningFace RecognitionGeneral Classification+3Grassmannian diffusion maps based dimension reduction and classification for high-dimensional data
This work introduces the Grassmannian Diffusion Maps, a novel nonlinear dimensionality reduction technique that defines the affinity between points through their representation as low-dimensional subspaces corresponding …
ClusteringDimensionality ReductionFace RecognitionGeneral Classification+1