Multiple Kernel Spectral Regression for Dimensionality Reduction
Traditional manifold learning algorithms, such as locally linear embedding, Isomap, and Laplacian eigenmap, only provide the embedding results of the training samples. To solve the out-of-sample extension problem, spectral regression (SR) solves the problem of learning an embedding function by estab...
Saved in:
Main Authors: | Bing Liu, Shixiong Xia, Yong Zhou |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/427462 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Classification of Error-Diffused Halftone Images Based on Spectral Regression Kernel Discriminant Analysis
by: Zhigao Zeng, et al.
Published: (2016-01-01) -
Kernel Sliced Inverse Regression: Regularization and Consistency
by: Qiang Wu, et al.
Published: (2013-01-01) -
On the Convergence Rate of Kernel-Based Sequential Greedy Regression
by: Xiaoyin Wang, et al.
Published: (2012-01-01) -
Video Genre Classification Using Weighted Kernel Logistic Regression
by: Ahmed A. M. Hamed, et al.
Published: (2013-01-01) -
Nonlinear Small Sample Data Regression with a New Rational-Quadratic Minkowski Kernel for Tobacco Laser Perforation Process Tar Reduction Estimation
by: Juan Huo, et al.
Published: (2025-01-01)