• Corpus ID: 14256493

Manifold Alignment Determination: finding correspondences across different data views

@article{Damianou2017ManifoldAD,
  title={Manifold Alignment Determination: finding correspondences across different data views},
  author={Andreas C. Damianou and Neil D. Lawrence and Carl Henrik Ek},
  journal={ArXiv},
  year={2017},
  volume={abs/1701.03449}
}
We present Manifold Alignment Determination (MAD), an algorithm for learning alignments between data points from multiple views or modalities. The approach is capable of learning correspondences between views as well as correspondences between individual data-points. The proposed method requires only a few aligned examples from which it is capable to recover a global alignment through a probabilistic model. The strong, yet flexible regularization provided by the generative model is sufficient… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 10 REFERENCES

Bayesian object matching

  • Arto Klami
  • Computer Science, Mathematics
    Machine Learning
  • 2013
TLDR
This work provides both variational and sampling-based inference for approximative Bayesian analysis, and demonstrates on three data sets that the resulting methods outperform the earlier solutions.

Manifold Relevance Determination

TLDR
This paper presents a fully Bayesian latent variable model which exploits conditional nonlinear (in)-dependence structures to learn an efficient latent representation and introduces a relaxation to the discrete segmentation and allow for a "softly" shared latent space.

Bayesian Canonical correlation analysis

TLDR
This work introduces a novel efficient solution that imposes group-wise sparsity to estimate the posterior of an extended model which not only extracts the statistical dependencies between data sets but also decomposes the data into shared and data set-specific components.

Kronecker Graphs: An Approach to Modeling Networks

TLDR
Kronecker graphs naturally obey common network properties and it is rigorously proved that they do so, and KRONFIT, a fast and scalable algorithm for fitting the Kronecker graph generation model to large real networks, is presented.

The Hungarian method for the assignment problem

  • H. Kuhn
  • Economics
    50 Years of Integer Programming
  • 2010
This paper has been presented with the Best Paper Award. It will appear in print in Volume 52, No. 1, February 2005.

An inter-battery method of factor analysis

The inter-battery method of factor analysis was devised to provide information relevant to the stability of factors over different selections of tests. Two batteries of tests, postulated to depend on

While pursuing this work, A. Damianou was funded by the European research project EU FP7-ICT (Project Ref 612139

  • While pursuing this work, A. Damianou was funded by the European research project EU FP7-ICT (Project Ref 612139

and very challenging) task in multiview learning that we believe needs to be highlighted in order to stimulate further research

  • and very challenging) task in multiview learning that we believe needs to be highlighted in order to stimulate further research

Arto Klami, Seppo Virtanen, and Samuel Kaski

  • Bayesian Canonical Correlation Analysis