A Riemannian approach to graph embedding
From MaRDI portal
Publication:856472
DOI10.1016/J.PATCOG.2006.05.031zbMATH Open1119.68210DBLPjournals/pr/Robles-KellyH07OpenAlexW2105598743WikidataQ60431188 ScholiaQ60431188MaRDI QIDQ856472FDOQ856472
Antonio Robles-Kelly, Edwin R. Hancock
Publication date: 7 December 2006
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.1551
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multidimensional scaling. I: Theory and method
- Modern multidimensional scaling: theory and applications
- From graph to manifold Laplacian: the convergence rate
- The Laplacian on a Riemannian manifold. An introduction to analysis on manifolds
- A Panoramic View of Riemannian Geometry
- Learning Theory
- Riemannian geometry and geometric analysis
- Differential forms. With applications to the physical sciences
- Open problems of Paul Erd�s in graph theory
- Learning Theory
- An eigendecomposition approach to weighted graph matching problems
- Efficient orthogonal drawings of high degree graphs
- On-line Planar Graph Embedding
Cited In (18)
- A distance measure for large graphs based on prime graphs
- Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering
- Recent advances in graph-based pattern recognition with applications in document analysis
- A study of graph spectra for comparing graphs and trees
- Projective Nonnegative Graph Embedding
- Lightning graph matching
- A nonparametric Riemannian framework on tensor field with application to foreground segmentation
- A Graph Framework for Manifold-Valued Data
- Title not available (Why is that?)
- Geodesic Entropic Graphs for Dimension and Entropy Estimation in Manifold Learning
- \(L^\alpha \) Riemannian weighted centers of mass applied to compose an image filter to diffusion tensor imaging
- Graph Similarity through Entropic Manifold Alignment
- On the eigenvectors of \(p\)-Laplacian
- Ricci flow embedding for rectifying non-Euclidean dissimilarity data
- Generalized median graph computation by means of graph embedding in vector spaces
- Critical imbeddings with multivariate rearrangements
- The graph matching problem
- Graph kernels from the Jensen-Shannon divergence
This page was built for publication: A Riemannian approach to graph embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856472)