3517 search results - page 127 / 704 » Online Learning with Queries |
128
click to vote
ALT
2010
Springer
15 years 6 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
117
click to vote
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
130
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
We present BlogScope (www.blogscope.net), a system for online analysis of temporally ordered streaming text, currently applied to the analysis of the Blogosphere1 . The system cur...
142
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
147
click to vote
NIPS
2000
15 years 6 months ago
2000
Bayesian networks are graphical representations of probability distributions. In virtually all of the work on learning these networks, the assumption is that we are presented with...