.png){kind=icon}
Return
Orthogonal component analysis: A fast dimensionality reduction algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2015.11.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Most existing dimensionality reduction algorithms have two disadvantages: their computational cost is high and they cannot estimate the intrinsic dimension of the original dataset by themselves. To deal with these problems, in this paper we propose a fast linear dimensionality reduction method named Orthogonal Component Analysis (OCA). While avoiding solving eigenproblem and matrix inverse problem, OCA successfully achieves high-speed orthogonal component extraction. By proposing an adaptive threshold scheme, OCA is able to estimate the dimension of the feature space automatically. Meanwhile, the algorithm is guaranteed to be numerical stable. In the experiments, OCA is compared with several typical dimensionality reduction algorithms. The experimental results demonstrate that as a universal algorithm, OCA is efficient and effective. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Dimensionality reduction
Orthogonal component
Intrinsic dimension estimation
High-speed component learning
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
ShareSaveShareSaveAvascular Necrosis With Complete Resorption of the Proximal Humerus Following Undisplaced Three-Part Fracture.png)
Orthopedics
OrthopedicsIF0
PREAI
ShareSave
ShareSaveGlobal bifurcations and chaos for a rotor-active magnetic bearing system with time-varying stiffness
PREAI
ShareSaveA comparative study of dimensionality reduction methods for large-scale image retrievalNEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSave
View more