Sciweavers

648 search results - page 22 / 130
» A general dimension for query learning
Sort
View
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 1 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
CIKM
2003
Springer
14 years 2 months ago
High dimensional reverse nearest neighbor queries
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
Amit Singh, Hakan Ferhatosmanoglu, Ali Saman Tosun
SEMWEB
2004
Springer
14 years 2 months ago
Querying Faceted Databases
Faceted classification allows one to model applications with complex classification hierarchies using orthogonal dimensions. Recent work has examined the use of faceted classi...
Kenneth A. Ross, Angel Janevski
PKDD
2010
Springer
143views Data Mining» more  PKDD 2010»
13 years 7 months ago
A Unified Approach to Active Dual Supervision for Labeling Features and Examples
Abstract. When faced with the task of building accurate classifiers, active learning is often a beneficial tool for minimizing the requisite costs of human annotation. Traditional ...
Josh Attenberg, Prem Melville, Foster J. Provost
COLT
1998
Springer
14 years 1 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund