A simple coding for cross-domain matching with dimension reduction via spectral graph embedding

12/29/2014
by   Hidetoshi Shimodaira, et al.
0

Data vectors are obtained from multiple domains. They are feature vectors of images or vector representations of words. Domains may have different numbers of data vectors with different dimensions. These data vectors from multiple domains are projected to a common space by linear transformations in order to search closely related vectors across domains. We would like to find projection matrices to minimize distances between closely related data vectors. This formulation of cross-domain matching is regarded as an extension of the spectral graph embedding to multi-domain setting, and it includes several multivariate analysis methods of statistics such as multiset canonical correlation analysis, correspondence analysis, and principal component analysis. Similar approaches are very popular recently in pattern recognition and vision. In this paper, instead of proposing a novel method, we will introduce an embarrassingly simple idea of coding the data vectors for explaining all the above mentioned approaches. A data vector is concatenated with zero vectors from all other domains to make an augmented vector. The cross-domain matching is solved by applying the single-domain version of spectral graph embedding to these augmented vectors of all the domains. An interesting connection to the classical associative memory model of neural networks is also discussed by noticing a coding for association. A cross-validation method for choosing the dimension of the common space and a regularization parameter will be discussed in an illustrative numerical example.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2015

Cross-validation of matching correlation analysis by resampling matching weights

The strength of association between a pair of data vectors is represente...
research
11/27/2013

Cross-Domain Sparse Coding

Sparse coding has shown its power as an effective data representation me...
research
08/11/2019

Cross-Domain Collaborative Filtering via Translation-based Learning

With the proliferation of social media platforms and e-commerce sites, s...
research
07/22/2022

A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings

We study a simple embedding technique based on a matrix of personalized ...
research
05/21/2010

Reduction of Feature Vectors Using Rough Set Theory for Human Face Recognition

In this paper we describe a procedure to reduce the size of the input fe...
research
10/15/2020

Wasserstein Distance Regularized Sequence Representation for Text Matching in Asymmetrical Domains

One approach to matching texts from asymmetrical domains is projecting t...
research
03/03/2021

Minimum-Distortion Embedding

We consider the vector embedding problem. We are given a finite set of i...

Please sign up or login with your details

Forgot password? Click here to reset