7150 search results - page 39 / 1430 » An Approximation Algorithm for Approximation Rank |
114
click to vote
ICMCS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we present an AUC (i.e., the Area Under the Curve of Receiver Operating Characteristics (ROC)) maximization based learning algorithm to design the classifier for ma...
88
Voted
CSB
2004
IEEE
15 years 4 months ago
2004
IEEE
A great deal of recent research has focused on the challenging task of selecting differentially expressed genes from microarray data (`gene selection'). Numerous gene selecti...
123
Voted
NIPS
2008
15 years 1 months ago
2008
This paper studies global ranking problem by learning to rank methods. Conventional learning to rank methods are usually designed for `local ranking', in the sense that the r...
91
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
78
Voted
MP
2006
15 years 13 days ago
2006
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...