Online Submodular Set Cover, Ranking, and Repeated Active Learning.
Andrew GuilloryJeff A. BilmesPublished in: NIPS (2011)
Keyphrases
- set cover
- greedy algorithm
- active learning
- greedy heuristics
- approximation algorithms
- online learning
- network flow
- np hard
- batch mode
- pool based active learning
- genetic algorithm
- supervised learning
- greedy heuristic
- objective function
- learning to rank
- solution space
- learning algorithm
- worst case
- convex hull
- knapsack problem
- relevance feedback
- evolutionary algorithm
- decision trees
- expected loss