The Community for Technology Leaders
International Workshop on Knowledge Discovery and Data Mining (2009)
Jan. 23, 2009 to Jan. 25, 2009
ISBN: 978-0-7695-3543-2
pp: 697-700
We consider the problem of the correspondence leaning of two high-dimensional data sets via the manifold leaning techniques. It’s convenient for us to find the shared latent structure of the high-dimensional data sets, if they can be aligned in a uniformed low-dimensional data space. A local affine technique to address this problem is present here. Our method preserves more geometrical knowledge of the high dimensional data sets and can easily project the new test data into the aligned data space by the local transformation obtained during the training step. The effectiveness of our algorithm is validated by applying it to the problem of image sequences alignment.
manifold aligmnet, local block coordinate, manifold constraint, Data matching

G. Yang, X. Xu and L. Tu, "Manifold Alignment via Local Block Coordinate," 2009 Second International Workshop on Knowledge Discovery and Data Mining. WKDD 2009(WKDD), Moscow, 2009, pp. 697-700.
93 ms
(Ver 3.3 (11022016))