Sciweavers

187 search results - page 7 / 38
» Bounding the cost of learned rules
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
CVPR
2009
IEEE
15 years 2 months ago
What's It Going to Cost You?: Predicting Effort vs. Informativeness for Multi-Label Image Annotations
Active learning strategies can be useful when manual labeling effort is scarce, as they select the most informative examples to be annotated first. However, for visual category ...
Sudheendra Vijayanarasimhan (University of Texas a...
FUZZIEEE
2007
IEEE
14 years 1 months ago
An On-Line Fuzzy Predictor from Real-Time Data
The algorithm of on-line predictor from input-output data pairs will be proposed. In this paper, it proposed an approach to generate fuzzy rules of predictor from real-time input-o...
Chih-Ching Hsiao, Shun-Feng Su
CDC
2008
IEEE
142views Control Systems» more  CDC 2008»
14 years 1 months ago
Convergence of rule-of-thumb learning rules in social networks
— We study the problem of dynamic learning by a social network of agents. Each agent receives a signal about an underlying state and communicates with a subset of agents (his nei...
Daron Acemoglu, Angelia Nedic, Asuman E. Ozdaglar
AAAI
2007
13 years 9 months ago
Learning Equilibrium in Resource Selection Games
We consider a resource selection game with incomplete information about the resource-cost functions. All the players know is the set of players, an upper bound on the possible cos...
Itai Ashlagi, Dov Monderer, Moshe Tennenholtz