Cauchy Graph Embedding

Abstract

Laplacian embedding provides a lowdimensional representation for the nodes of a graph where the edge weights denote pairwise similarity among the node objects. It is commonly assumed that the Laplacian embedding results preserve the local topology of the original data on the low-dimensional projected subspaces, i.e., for any pair of graph nodes with large… (More)

Topics

6 Figures and Tables

Statistics

050100150201520162017
Citations per Year

Citation Velocity: 36

Averaging 36 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Luo2011CauchyGE, title={Cauchy Graph Embedding}, author={Dijun Luo and Chris H. Q. Ding and Feiping Nie and Heng Huang}, booktitle={ICML}, year={2011} }