Global-Local Partial Least Squares Discriminant Analysis And Its Extension In Reproducing Kernel Hilbert Space
Subspace learning is an essential approach for learning a low dimensional representation of a high dimensional space. When data samples are represented as points in a high dimensional space, learning with the high dimensionality becomes challenging as the effectiveness and efficiency of the learn...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English |
| 出版: |
2021
|
| 主题: | |
| 在线阅读: | http://eprints.usm.my/51628/1/AMINU%20MUHAMMAD.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
| 总结: | Subspace learning is an essential approach for learning a low dimensional representation
of a high dimensional space. When data samples are represented as points
in a high dimensional space, learning with the high dimensionality becomes challenging
as the effectiveness and efficiency of the learning algorithms drops significantly
as the dimensionality increases. Thus, subspace learning techniques are employed to
reduce the dimensionality of the data prior to employing other learning algorithms.
Recently, there has been a lot of interest in subspace learning techniques that are based
on the global and local structure preserving (GLSP) framework. The main idea of the
GLSP approach is to find a transformation of the high dimensional data into a lower dimensional
subspace, where both the global and local structure information of the data
are preserved in the lower dimensional subspace. This thesis consider the case where
data is sampled from an underlying manifold embedded in a high dimensional ambient
space. Two novel subspace learning algorithms called locality preserving partial
least squares discriminant analysis (LPPLS-DA) and neighborhood preserving partial
least squares discriminant analysis (NPPLS-DA) which are based on the GLSP framework
are proposed for discriminant subspace learning. Unlike the conventional partial
least squares discriminant analysis (PLS-DA) which aims at preserving only the global
Euclidean structure of the data space, the proposed LPPLS-DA and NPPLS-DA algorithms
find an embedding that preserves both the global and local manifold structure. |
|---|