Generalized Unsupervised Manifold Alignment

In this paper, we propose a generalized Unsupervised Manifold Alignment (GUMA) method to build the connections between different but correlated datasets without any known correspondences. Based on the assumption that datasets of the same theme usually have similar manifold structures, GUMA is formulated into an explicit integer optimization problem considering the structure matching and preserving criteria, as well as the feature comparability of the corresponding points in the mutual embedding space. The main benefits of this model include: (1) simultaneous discovery and alignment of manifold structures; (2) fully unsupervised matching without any pre-specified correspondences; (3) efficient iterative alignment without computations in all permutation cases. Experimental results on dataset matching and real-world applications demonstrate the effectiveness and the practicability of our manifold alignment method.

Authors

• Zhen Cui School of Artificial Intelligence, Beijing Normal University
• Hong Chang
• Shiguang Shan
• Xilin Chen Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences University of the Chinese Academy of Sciences

Keywords

No keywords are indexed for this paper.