Spectral embedding of graphs

317 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Spatial Networks (2010, background): “For instance for random walks, it is related to the return probability and it can also be used (together with the eigenvectors) for visual representations of graphs known as spectral embeddings (see for example [219]).”
Discriminative prototype selection methods for graph embedding (2013, background): “…Switzerland a r t i c l e i n f o Article history: Received 6 July 2012 Received in revised form 24 September 2012 Accepted 21 November 2012 Keywords: Graph embedding Discriminative prototype selection Graph classification Dissimilarity representation 03/$ - see front matter & 2012 Elsevier Ltd.”
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning (2008, methodology): “Image classiﬁcation is a further area of research where graph based representation draws the attention [7, 8, 9, 10].”
Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching (2011, background): “Singular Value Decomposition and Eigenvalues) rather than the graphs themselves [ 2 ,3].”
Graph Embedding and Dimensionality Reduction - A Survey (2013, background): “problem of how to map the structure of a graph onto a vector of fixed length, we turn to graph-spectral decomposition methods[11].”