Comparison of Matrix Decomposition in Null Space-Based LDA Method
Problems with small sample sizes and high dimensionality are common in pattern recognition. Almost all machine learning algorithms degrade in high-dimensional data, so that singularities in the scatter matrices, the main problem of the Linear Discriminant Analysis (LDA) technique, might result. A nu...
Saved in:
Main Authors: | Carissa Devina Usman, Farikhin, Titi Udjiani |
---|---|
Format: | Article |
Language: | English |
Published: |
Ikatan Ahli Informatika Indonesia
2024-06-01
|
Series: | Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) |
Subjects: | |
Online Access: | https://jurnal.iaii.or.id/index.php/RESTI/article/view/5637 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
GPS Phase Integer Ambiguity Resolution Based on Eliminating Coordinate Parameters and Ant Colony Algorithm
by: Ning Liu, et al.
Published: (2025-01-01) -
Comparison of Gaussian Elimination and Cholesky Decomposition Solving A Linear System Of Equation.
by: Nzabonimpa, Godfrey
Published: (2024) -
Medical image segmentation based on frequency domain decomposition SVD linear attention
by: Liu Qiong, et al.
Published: (2025-01-01) -
A Comparison of Gaussian Elimination and Cholesky Decomposition Methods in Solving a System of Linear Equations.
by: Niringiye, Richard
Published: (2024) -
Gearbox Status Recognition based on TMD-SVD and POS-BP Networks Under Strong Interference
by: Lei He, et al.
Published: (2021-05-01)