New algorithms for budgeted learning

Machine Learning

Volumn 90, Issue 1, 2013, Pages 59-90

  Deng, Kun ^a   Zheng, Yaling ^b   Bourke, Chris ^b   Scott, Stephen ^b   Masciale, Julie ^c  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^c Union Pacific   (United States)

Author keywords

Budgeted learning; Multi armed bandit

Indexed keywords

BUDGETED LEARNING; CLASS LABELS; FREE ACCESS; LEARNING MODELS; MULTI ARMED BANDIT; MULTI-ARMED BANDIT PROBLEM; PERFORMANCE IMPROVEMENTS; SECOND ORDER STATISTICS; TRAINING EXAMPLE;

LEARNING ALGORITHMS; MEDICAL APPLICATIONS; PURCHASING;

BUDGET CONTROL;

EID: 84871928644     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-012-5299-2     Document Type: Article

References (38)

1. Abe, N., & Mamitsuka, H. (1998). Query learning strategies using boosting and bagging. In ICML '98 Proceedings of the fifteenth international conference on machine learning (pp. 1-10).
2. Antos, A., Grover, V., & Szepesvári, C. (2008). Active learning in multi-armed bandits. In ALT '08: Proceedings of the 19th international conference on algorithmic learning theory (pp. 287-302). Berlin: Springer.
3. Asuncion, A., & Newman, D. (2009). UCI machine learning repository. http://www.ics.uci.edu/~mlearn/MLRepository.html.
4. Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002a). Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47, 235-256.
5. Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (2002b). The non-stochastic multi-armed bandit problem. SIAM Journal on Computing, 32, 48-77.
6. Bubeck, S., Munos, R., & Stoltz, G. (2008). Pure exploration for multi-armed bandit problems. arXiv:0802.2655.
7. Campbell, C., Cristianini, N., & Smola, A. (2000). Query learning with large margin classifiers. In Proceedings of the 17th international conference on machine learning (pp. 111-118).
8. Culver, M., Kun, D., & Scott, S. (2006). Active learning to maximize area under the ROC curve. In Proceedings of the sixth IEEE international conference on data mining (pp. 149-158).
9. Deng, K., Bourke, C., Scott, S., Sunderman, J., & Zheng, Y. (2007). Bandit-based algorithms for budgeted learning. In ICDM '07: proceedings of the 2007 seventh IEEE international conference on data mining (pp. 463-468). Washington: IEEE Comput. Soc.
10. Gittins, J. C. (1979). Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society. Series B. Methodological, 41, 148-177.
11. Goel, A., Guha, S., & Munagala, K. (2006). Asking the right questions: model-driven optimization using probes. In PODS '06: proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (pp. 203-212). New York: ACM.
12. Goel, A., Khanna, S., & Null, B. (2009). The ratio index for budgeted learning, with applications. In SODA '09: proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms (pp. 18-27). Philadelphia: SIAM.
13. Greiner, R., Grove, A. J., & Roth, D. (2002). Learning cost-sensitive active classifiers. Artificial Intelligence, 139, 137-174.
14. Guha, S., & Munagala, K. (2007). Approximation algorithms for budgeted learning problems. In ACM symposium on theory of computing (pp. 104-113).
15. Kalai, A., & Vempala, S. (2005). Efficient algorithms for online decision problems. Journal of Computer and System Sciences, 71, 291-307.
16. Kapoor, A., & Greiner, R. (2005a). Budgeted learning of bounded active classifiers. In Proceedings of the ACM SIGKDD workshop on utility-based data mining. Held in conjunction with the 11th ACM SIGKDD international conference on knowledge discovery and data mining (KDD 2005).
17. Kapoor, A., & Greiner, R. (2005b). Learning and classifying under hard budgets. In 15th European conference on machine learning (ECML) (pp. 170-181).
18. Kapoor, A., & Greiner, R. (2005c). Reinforcement learning for active model selection. In Proceedings of the ACM SIGKDD workshop on utility-based data mining (pp. 17-23). Held in conjunction with the 11th ACM SIGKDD international conference on knowledge discovery and data mining (KDD 2005).
19. Lai, T. L., & Robbins, H. (1985). Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6, 4-22.
20. Lewis, D., & Gale, W. (1994). A sequential algorithm for training text classifiers. In Proceedings of the 17th annual international ACM SIGIR conference on research and development in information retrieval (pp. 3-12).
21. Li, L. (2009). Budgeted parameter learning of generative Bayesian networks. Master's thesis, University of Alberta.
22. Lizotte, D. J., Madani, O., & Greiner, R. (2003). Budgeted learning of naïve-Bayes classifiers. In Proceedings of the 19th annual conference on uncertainty in artificial intelligence (UAI-03) (pp. 378-385).
23. Lomasky, R., Brodley, C., Aernecke, M., Walt, D., & Friedl, M. (2007). Active class selection. In Machine learning: ECML 2007 (pp. 640-647). Berlin: Springer.
24. Madani, O., Lizotte, D., & Greiner, R. (2004). Active model selection. In Proceedings of the 20th conference on uncertainty in artificial intelligence (pp. 357-365). Banff, Canada.
25. Melville, P., & Mooney, R. J. (2004). Diverse ensembles for active learning. In ICML '04: Proceedings of the twenty-first international conference on machine learning (pp. 584-591).
26. Melville, P., Saar-Tsechansky, M., Provost, F., & Mooney, R. (2004). Active feature-value acquisition for classifier induction. In Fourth IEEE international conference on data mining (pp. 483-486).
27. Melville, P., Saar-Tsechansky, M., Provost, F., & Mooney, R. (2005). An expected utility approach to active feature-value acquisition. In Fifth IEEE international conference on data mining (p. 4).
28. Melville, P., Rosset, S., & Lawrence, R. D. (2008). Customer targeting models using actively-selected web content. In Proceeding of the 14th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 946-953). New York: ACM.
29. Robbins, H. (1952). Some aspects of the sequential design of experiments. Bulletin of the American Mathematical Society, 55, 527-535.
30. Saar-Tsechansky, M., Melville, P., & Provost, F. (2009). Active feature-value acquisition. Management Science, 55, 664-684.
31. Schohn, G., & Cohn, D. (2000). Less is more: Active learning with support vector machines. In Proceedings of the 17th international conference on machine learning (pp. 839-846).
32. Settles, B. (2009). Active learning literature survey (Technical Report 1648). University of Wisconsin-Madison.
33. Tong, S., & Koller, D. (2001). Support vector machine active learning with applications to text classification. Journal of Machine Learning Research, 2, 45-66.
34. Veeramachaneni, S., Olivetti, E., & Avesani, P. (2006). Active sampling for detecting irrelevant features. In Proceedings of the 23rd international conference on machine learning (pp. 961-968).
35. Wang, T., Lizotte, D., Bowling, M., & Schuurmans, D. (2005). Bayesian sparse sampling for on-line reward optimization. In ICML 2005 (pp. 956-963).
36. Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1(6), 80-83.
37. Witten, I. H., & Frank, E. (2005). Data mining: Practical machine learning tools and techniques (2nd ed.). San Francisco: Morgan Kaufmann.
38. Zheng, Z., & Padmanabhan, B. (2002). On active learning for data acquisition. In Proceedings of the IEEE international conference on data minding (pp. 562-570).