Twin Kernel Embedding with Relaxed Constraints on Dimensionality Reduction for Structured Data

This paper proposes a new nonlinear dimensionality reduction algorithm called RCTKE for highly structured data. It is built on the original TKE by incorporating a mapping function into the objective functional of TKE as regularization terms where the mapping function can be learned from training data and be used for novel samples. The experimental results on highly structured data is used to verify the effectiveness of the algorithm