Sciweavers

4255 search results - page 533 / 851
» On Learning Boolean Functions
Sort
View
KDD
2002
ACM
169views Data Mining» more  KDD 2002»
16 years 7 months ago
Optimizing search engines using clickthrough data
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system shoul...
Thorsten Joachims
COLT
2007
Springer
16 years 25 days ago
Improved Rates for the Stochastic Continuum-Armed Bandit Problem
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...
Peter Auer, Ronald Ortner, Csaba Szepesvári
COLT
2000
Springer
15 years 11 months ago
Model Selection and Error Estimation
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
Peter L. Bartlett, Stéphane Boucheron, G&aa...
IJCAI
2007
15 years 8 months ago
A Subspace Kernel for Nonlinear Feature Extraction
Kernel based nonlinear Feature Extraction (KFE) or dimensionality reduction is a widely used pre-processing step in pattern classification and data mining tasks. Given a positive...
Mingrui Wu, Jason D. R. Farquhar
ICML
2010
IEEE
15 years 7 months ago
Local Minima Embedding
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
Minyoung Kim, Fernando De la Torre