Sciweavers

9 search results - page 2 / 2
» Query by Committee, Linear Separation and Random Walks
Sort
View
ML
2007
ACM
156views Machine Learning» more  ML 2007»
13 years 4 months ago
Active learning for logistic regression: an evaluation
Which active learning methods can we expect to yield good performance in learning binary and multi-category logistic regression classifiers? Addressing this question is a natural ...
Andrew I. Schein, Lyle H. Ungar
CORR
2006
Springer
125views Education» more  CORR 2006»
13 years 4 months ago
Barriers and local minima in energy landscapes of stochastic local search
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
Petteri Kaski
CIVR
2007
Springer
139views Image Analysis» more  CIVR 2007»
13 years 11 months ago
Video search in concept subspace: a text-like paradigm
Though both quantity and quality of semantic concept detection in video are continuously improving, it still remains unclear how to exploit these detected concepts as semantic ind...
Xirong Li, Dong Wang, Jianmin Li, Bo Zhang
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 5 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe