Sciweavers

60 search results - page 5 / 12
» Convex Relaxations for Subset Selection
Sort
View
ACMSE
2010
ACM
13 years 2 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
MP
2010
128views more  MP 2010»
13 years 5 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth
ICIP
2003
IEEE
14 years 9 months ago
Optimal Gabor kernel location selection for face recognition
In local feature?based face recognition systems, the topographical locations of feature extractors directly affect the discriminative power of a recognizer. Better recognition acc...
Berk Gökberk, Ethem Alpaydin, Lale Akarun, M....
ACML
2009
Springer
13 years 11 months ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo
MCS
2010
Springer
13 years 5 months ago
A Support Kernel Machine for Supervised Selective Combining of Diverse Pattern-Recognition Modalities
Abstract. The Support Kernel Machine (SKM) and the Relevance Kernel Machine (RKM) are two principles for selectively combining objectrepresentation modalities of different kinds b...
Alexander Tatarchuk, Eugene Urlov, Vadim Mottl, Da...