Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Journal article
Title: Supervised dimensionality reduction via sequential semidefinite programming
Author: Shen, C.
Li, H.
Brooks, M.
Citation: Pattern Recognition, 2008; 41(12):3644-3652
Publisher: Pergamon-Elsevier Science Ltd
Issue Date: 2008
ISSN: 0031-3203
Statement of
Chunhua Shen, Hongdong Li, Michael J. Brooks
Abstract: Many dimensionality reduction problems end up with a trace quotient formulation. Since it is difficult to directly solve the trace quotient problem, traditionally the trace quotient cost function is replaced by an approximation such that the generalized eigenvalue decomposition can be applied. In contrast, we directly optimize the trace quotient in this work. It is reformulated as a quasi-linear semidefinite optimization problem, which can be solved globally and efficiently using standard off-the-shelf semidefinite programming solvers. Also this optimization strategy allows one to enforce additional constraints (for example, sparseness constraints) on the projection matrix. We apply this optimization framework to a novel dimensionality reduction algorithm. The performance of the proposed algorithm is demonstrated in experiments by several UCI machine learning benchmark examples, USPS handwritten digits as well as ORL and Yale face data. © 2008 Elsevier Ltd. All rights reserved.
Keywords: Dimensionality reduction
Semidefinite programming
Linear discriminant analysis
DOI: 10.1016/j.patcog.2008.06.015
Grant ID: ARC
Published version:
Appears in Collections:Aurora harvest
Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.