Sciweavers

395 search results - page 9 / 79
» Learning to rank with partially-labeled data
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 2 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
142
Voted
CVPR
2009
IEEE
16 years 9 months ago
Shared Kernel Information Embedding for Discriminative Inference
Latent Variable Models (LVM), like the Shared-GPLVM and the Spectral Latent Variable Model, help mitigate over- fitting when learning discriminative methods from small or modera...
David J. Fleet, Leonid Sigal, Roland Memisevic
115
Voted
CVPR
2008
IEEE
16 years 3 months ago
Manifold learning using robust Graph Laplacian for interactive image search
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a ...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
FGR
2008
IEEE
214views Biometrics» more  FGR 2008»
15 years 8 months ago
Normalized LDA for semi-supervised learning
Linear Discriminant Analysis (LDA) has been a popular method for feature extracting and face recognition. As a supervised method, it requires manually labeled samples for training...
Bin Fan, Zhen Lei, Stan Z. Li
WSDM
2010
ACM
245views Data Mining» more  WSDM 2010»
15 years 11 months ago
Improving Quality of Training Data for Learning to Rank Using Click-Through Data
In information retrieval, relevance of documents with respect to queries is usually judged by humans, and used in evaluation and/or learning of ranking functions. Previous work ha...
Jingfang Xu, Chuanliang Chen, Gu Xu, Hang Li, Elbi...