Spectral Dimensionality Reduction via Maximum Entropy

  • Lawrence N
  • 34

    Readers

    Mendeley users who have this article in their library.
  • 12

    Citations

    Citations of this article.

Abstract

Spectral approaches to dimensionality reduction typically reduce the dimensionality of a data set through taking the eigenvectors of a Laplacian or a similarity matrix. Classical multidimensional scaling also makes use of the eigenvectors of a similarity matrix. In this talk we introduce a maximum entropy approach to designing this similarity matrix. The approach is closely related to maximum variance unfolding. Other spectral approaches, e.g. locally linear embeddings, turn out to also be closely related. These methods can be seen as a sparse Gaussian graphical model where correlations between data points (rather than across data features) are specified in the graph. The hope is that this unifying perspective will allow the relationships between these methods to be better understood and will also provide the groundwork for further research.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Neil D Lawrence

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free