Issue No. 10 - October (2006 vol. 18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.160
Jieping Ye , IEEE
Ravi Janardan , IEEE
Qi Li , IEEE
High-dimensional data appear in many applications of data mining, machine learning, and bioinformatics. Feature reduction is commonly applied as a preprocessing step to overcome the curse of dimensionality. Uncorrelated Linear Discriminant Analysis (ULDA) was recently proposed for feature reduction. The extracted features via ULDA were shown to be statistically uncorrelated, which is desirable for many applications. In this paper, an algorithm called ULDA/QR is proposed to simplify the previous implementation of ULDA. Then, the ULDA/GSVD algorithm is proposed, based on a novel optimization criterion, to address the singularity problem which occurs in undersampled problems, where the data dimension is larger than the sample size. The criterion used is the regularized version of the one in ULDA/QR. Surprisingly, our theoretical result shows that the solution to ULDA/GSVD is independent of the value of the regularization parameter. Experimental results on various types of data sets are reported to show the effectiveness of the proposed algorithm and to compare it with other commonly used feature reduction algorithms.
Feature reduction, uncorrelated linear discriminant analysis, QR-decomposition, generalized singular value decomposition.
H. Park, R. Janardan, Q. Li and J. Ye, "Feature Reduction via Generalized Uncorrelated Linear Discriminant Analysis," in IEEE Transactions on Knowledge & Data Engineering, vol. 18, no. , pp. 1312-1322, 2006.