# Structure preserving embedding

@inproceedings{Shaw2009StructurePE, title={Structure preserving embedding}, author={B. Shaw and T. Jebara}, booktitle={ICML '09}, year={2009} }

Structure Preserving Embedding (SPE) is an algorithm for embedding graphs in Euclidean space such that the embedding is low-dimensional and preserves the global topological properties of the input graph. Topology is preserved if a connectivity algorithm, such as k-nearest neighbors, can easily recover the edges of the input graph from only the coordinates of the nodes after embedding. SPE is formulated as a semidefinite program that learns a low-rank kernel matrix constrained by a set of linearâ€¦Â Expand

#### Supplemental Video

#### 187 Citations

Kernel-based embeddings for large graphs with centrality constraints

- Mathematics, Computer Science
- 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
- 2015

struc2gauss: Structure Preserving Network Embedding via Gaussian Embedding

- Computer Science
- ArXiv
- 2018

Data Compression as a Comprehensive Framework for Graph Drawing and Representation Learning

- Computer Science
- KDD
- 2020

Signed Laplacian Embedding for Supervised Dimension Reduction

- Computer Science
- AAAI
- 2014

#### References

SHOWING 1-3 OF 3 REFERENCES

Nonlinear Dimensionality Reduction by Semidefinite Programming and Kernel Matrix Factorization

- Mathematics, Computer Science
- AISTATS
- 2005

Training structural SVMs when exact inference is intractable

- Computer Science
- ICML '08
- 2008