|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2007 Seventh IEEE International Conference on Data Mining
Bandit-Based Algorithms for Budgeted Learning
Omaha, Nebraska, USA
October 28-October 31
ISBN: 0-7695-3018-4
| ASCII Text | x | ||
| Kun Deng, Chris Bourke, Stephen Scott, Julie Sunderman, Yaling Zheng??, "Bandit-Based Algorithms for Budgeted Learning," Data Mining, IEEE International Conference on, pp. 463-468, 2007 Seventh IEEE International Conference on Data Mining, 2007. | |||
| BibTex | x | ||
| @article{ 10.1109/ICDM.2007.91, author = {Kun Deng and Chris Bourke and Stephen Scott and Julie Sunderman and Yaling Zheng??}, title = {Bandit-Based Algorithms for Budgeted Learning}, journal ={Data Mining, IEEE International Conference on}, volume = {0}, year = {2007}, issn = {1550-4786}, pages = {463-468}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2007.91}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Data Mining, IEEE International Conference on TI - Bandit-Based Algorithms for Budgeted Learning SN - 1550-4786 SP463 EP468 A1 - Kun Deng, A1 - Chris Bourke, A1 - Stephen Scott, A1 - Julie Sunderman, A1 - Yaling Zheng??, PY - 2007 VL - 0 JA - Data Mining, IEEE International Conference on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2007.91
We explore the problem of budgeted machine learning, in which the learning algorithm has free access to the training examples' labels but has to pay for each attribute that is specified. This learning model is appropriate in many areas, including medical applications. We present new algorithms for choosing which attributes to purchase of which examples in the budgeted learning model based on algorithms for the multi-armed bandit problem. All of our approaches outperformed the current state of the art. Furthermore, we present a new means for selecting an example to purchase after the attribute is selected, instead of selecting an example uniformly at random, which is typically done. Our new example selection method improved performance of all the algorithms we tested, both ours and those in the literature.
Citation:
Kun Deng, Chris Bourke, Stephen Scott, Julie Sunderman, Yaling Zheng??, "Bandit-Based Algorithms for Budgeted Learning," icdm, pp.463-468, 2007 Seventh IEEE International Conference on Data Mining, 2007
Usage of this product signifies your acceptance of the Terms of Use.
