Manifold Alignment without Correspondence
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 1273-1277.
Abstract
Manifold alignment has been found to be useful in many areas of machine learning and data mining. In this paper we introduce a novel manifold alignment approach, which differs from semi-supervised alignment and Procrustes alignment in that it does not require predetermining correspondences. Our approach learns a projection that maps data instances (from two different spaces) to a lower dimensional space simultaneously matching the local geometry and preserving the neighborhood relationship within each set. This approach also builds connections between spaces defined by different features and makes direct knowledge transfer possible. The performance of our algorithm is demonstrated and validated in a series of carefully designed experiments in information retrieval and bioinformatics.Chang Wang, Sridhar Mahadevan
@inproceedings{ijcai2009p214,
title = {Manifold Alignment without Correspondence},
author = {Wang, Chang and Mahadevan, Sridhar},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {1273--1277},
year = {2009},
url = {https://ijcai.org/proceedings/2009/214},
}
TY - CPAPER TI - Manifold Alignment without Correspondence AU - Wang, Chang AU - Mahadevan, Sridhar T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 1273 EP - 1277 UR - https://ijcai.org/proceedings/2009/214 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: