Sciweavers

146 search results - page 14 / 30
» Learning to rank with multiple objective functions
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
Recognition by association via learning per-exemplar distances
We pose the recognition problem as data association. In this setting, a novel object is explained solely in terms of a small set of exemplar objects to which it is visually simila...
Tomasz Malisiewicz, Alexei A. Efros
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 2 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
13 years 2 months ago
Rank-loss support instance machines for MIML instance annotation
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich
ICPR
2008
IEEE
16 years 26 days ago
Multiple kernel learning from sets of partially matching image features
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
Guo ShengYang, Min Tan, Si-Yao Fu, Zeng-Guang Hou,...
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
15 years 1 months ago
Learning incoherent sparse and low-rank patterns from multiple tasks
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
Jianhui Chen, Ji Liu, Jieping Ye