Sciweavers

45 search results - page 6 / 9
» Machine learning for online query relaxation
Sort
View
ALT
2006
Springer
14 years 4 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen
COLT
1992
Springer
13 years 12 months ago
Learning Switching Concepts
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
Avrim Blum, Prasad Chalasani
CIDR
2009
157views Algorithms» more  CIDR 2009»
13 years 8 months ago
SCADS: Scale-Independent Storage for Social Computing Applications
Collaborative web applications such as Facebook, Flickr and Yelp present new challenges for storing and querying large amounts of data. As users and developers are focused more on...
Michael Armbrust, Armando Fox, David A. Patterson,...
NECO
2000
86views more  NECO 2000»
13 years 7 months ago
A Bayesian Committee Machine
The Bayesian committee machine (BCM) is a novel approach to combining estimators which were trained on different data sets. Although the BCM can be applied to the combination of a...
Volker Tresp
KDD
2000
ACM
153views Data Mining» more  KDD 2000»
13 years 11 months ago
The generalized Bayesian committee machine
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
Volker Tresp