Spectral embedding of graphs.

DOI10.1016/S0031-3203(03)00084-0zbMath1054.68105DBLPjournals/pr/LuoWH03OpenAlexW2094826395WikidataQ60431423 ScholiaQ60431423MaRDI QIDQ1403778

Edwin R. Hancock, Richard C. Wilson, Bin Luo

Publication date: 4 September 2003

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0031-3203(03)00084-0

zbMATH Keywords

Principal component analysisIndependent component analysisMultidimensional scalingGraph clusteringGraph spectraView based recognition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (22)

A new protein graph model for function prediction ⋮ Graph characterization by counting sink star subgraphs ⋮ Latent structure blockmodels for Bayesian spectral graph clustering ⋮ Graph embedding using tree edit-union ⋮ A long trip in the charming world of graphs for pattern recognition ⋮ Heat kernel embeddings, differential geometry and graph structure ⋮ A new dissimilarity measure for comparing labeled graphs ⋮ Graph spectra in computer science ⋮ Recent advances in graph-based pattern recognition with applications in document analysis ⋮ Generalized median graph computation by means of graph embedding in vector spaces ⋮ Fuzzy multilevel graph embedding ⋮ Spectral graph features for the classification of graphs and graph sequences ⋮ Graph characteristics from the heat kernel trace ⋮ Spectral methods for graph clustering - a survey ⋮ A spectral approach to learning structural variations in graphs ⋮ Graph Similarity through Entropic Manifold Alignment ⋮ Hierarchical graph embedding in vector space by graph pyramid ⋮ Lagrangian relaxation graph matching ⋮ A Polynomial Algorithm for Submap Isomorphism ⋮ Graph Regularisation Using Gaussian Curvature ⋮ Characteristic Polynomial Analysis on Matrix Representations of Graphs ⋮ Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering

Cites Work

• Subgraph isomorphism, matching relational structures and maximal cliques
• Probabilistic models of appearance for 3-D object recognition
• Nonmetric multidimensional scaling. A numerical method
• The geometry of view space of opaque objects bounded by smooth surfaces
• Multidimensional scaling. I: Theory and method
• Computing stable poses of piecewise smooth objects
• A graph distance metric based on the maximal common subgraph
• A distance measure between attributed relational graphs for pattern recognition
• 3D Object Recognition and Pose with Relational Indexing
• Some distance properties of latent root and vector methods used in multivariate analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spectral embedding of graphs.