A fast fixed-point algorithm for independent component analysis
Neural Computation
Fast principal component analysis using fixed-point algorithm
Pattern Recognition Letters
A Gradient Linear Discriminant Analysis for Small Sample Sized Problem
Neural Processing Letters
Design and Implementation of a Face Recognition System Using Fast PCA
CSA '08 Proceedings of the International Symposium on Computer Science and its Applications
Nonlinear Component Analysis for Large-Scale Data Set Using Fixed-Point Algorithm
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III
Fast global k-means clustering using cluster membership and inequality
Pattern Recognition
New fast principal component analysis for real-time face detection
Machine Graphics & Vision International Journal
Improved direct LDA and its application to DNA microarray gene expression data
Pattern Recognition Letters
A feature selection method using improved regularized linear discriminant analysis
Machine Vision and Applications
Hi-index | 0.00 |
As the performance of hardware is limited, the focus has been to develop objective, optimized and computationally efficient algorithms for a given task. To this extent, fixed-point and approximate algorithms have been developed and successfully applied in many areas of research. In this paper we propose a feature selection method based on fixed-point algorithm and show its application in the field of human cancer classification using DNA microarray gene expression data. In the fixed-point algorithm, we utilize between-class scatter matrix to compute the leading eigenvector. This eigenvector has been used to select genes. In the computation of the eigenvector, the eigenvalue decomposition of the scatter matrix is not required which significantly reduces its computational complexity and memory requirement.