Sciweavers

12 search results - page 1 / 3
» Penalty Decomposition Methods for Rank Minimization
Sort
View
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 4 months ago
Penalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
Zhaosong Lu, Yong Zhang
ECML
2007
Springer
13 years 10 months ago
On Minimizing the Position Error in Label Ranking
Conventional classification learning allows a classifier to make a one shot decision in order to identify the correct label. However, in many practical applications, the problem ...
Eyke Hüllermeier, Johannes Fürnkranz
FOCM
2011
175views more  FOCM 2011»
12 years 11 months ago
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
Donald Goldfarb, Shiqian Ma
IDA
2005
Springer
13 years 10 months ago
Learning Label Preferences: Ranking Error Versus Position Error
We consider the problem of learning a ranking function, that is a mapping from instances to rankings over a finite number of labels. Our learning method, referred to as ranking by...
Eyke Hüllermeier, Johannes Fürnkranz
SIAMMAX
2011
141views more  SIAMMAX 2011»
12 years 7 months ago
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...