Supervised dimensionality reduction via sequential semidefinite programming

✍ Scribed by Chunhua Shen; Hongdong Li; Michael J. Brooks

• Publisher: Elsevier Science
• Year: 2008
• Tongue: English
• Weight: 697 KB
• Volume: 41
• Category: Article
• ISSN: 0031-3203
• DOI: 10.1016/j.patcog.2008.06.015

✦ Synopsis

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.