返回
The Trace Ratio Optimization Problem
DOI:10.1137/120864799.png)
摘要
En 中文
This paper considers the problem of optimizing the ratio Tr[V-T AV]/Tr[V-T BV] over all unitary matrices V with p columns, where A, B are two positive definite matrices. This problem is common in supervised learning techniques. However, because its numerical solution is typically expensive it is often replaced by the simpler optimization problem which consists of optimizing Tr[V-T AV] under the constraint that V-T BV = I, the identity matrix. The goal of this paper is to examine this trace ratio optimization problem in detail, to consider different algorithms for solving it, and to illustrate the use of these algorithms for dimensionality reduction.
Keyword:
trace optimization
classification
linear dimensionality reduction
face recognition
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.1
论文数:
888
被引数:
1.4W
机构
引用论文
没有更多内容

