Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

ICML
2010
IEEE

favoriteEmaildiscussreport

209views Machine Learning» more ICML 2010»

Interactive Submodular Set Cover

13 years 5 months ago

Interactive Submodular Set Cover

Download ssli.ee.washington.edu

We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submodular set cover. Applications include advertising in social networks with hidden information. We give an approximation guarantee for a novel greedy algorithm and give a hardness of approximation result which matches up to constant factors. We also discuss negative results for simpler approaches and present encouraging early experimental results.

Andrew Guillory, Jeff Bilmes

Real-time Traffic

Exact Active Learning | Finite Hypothesis Class | ICML 2010 | Machine Learning | Submodular Set Cover |

claim paper

Related Content

» Approximability of Combinatorial Problems with Multiagent Submodular Cost Functions

» Covering Problems with Hard Capacities

» Scheduling to minimize power consumption using submodular functions

» Thresholded Covering Algorithms for Robust and Maxmin Optimization

» Capacitated facility location Separation algorithms and computational experience

» Judging a bot by its cover an experiment on expectation setting for personal robots

» The Flow Set with Partial Order

» Cartesian contour a concise representation for a collection of frequent sets

» Minimal Spanning Set for Coverage Testing of Interactive Systems

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2010
Where	ICML
Authors	Andrew Guillory, Jeff Bilmes

Comments (0)