Sciweavers

90 search results - page 4 / 18
» Learning to learn implicit queries from gaze patterns
Sort
View
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
13 years 11 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
JALC
2007
95views more  JALC 2007»
13 years 7 months ago
Learning Regular Tree Languages from Correction and Equivalence Queries
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
Catalin Ionut Tîrnauca, Cristina Tîrna...
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
14 years 1 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
SIGIR
2008
ACM
13 years 7 months ago
Learning query intent from regularized click graphs
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
Xiao Li, Ye-Yi Wang, Alex Acero
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 7 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea