Julie S. Weber
ABSTRACT
We present a new algorithm for active learning embedded within an interactive calendar management system that learns its users' scheduling preferences. When the system receives a meeting request, the active learner selects a set of alternative solutions to present to the user; learning is then achieved by noting the user's preferences for the selected schedule over the others presented. To achieve the goals of presenting solutions that meet the user's needs while enhancing the preference-learning process, we introduce a new approach to active learning that makes online decisions about the technique to use in selecting the schedules to present in response to each meeting request. The decision is based on the entropy of the available options: a highly diverse set of possible solutions calls for a selection technique that chooses instances that are different from one another, maximizing coarse-grained learning, whereas a set of possible solutions containing little diversity is met with a selection strategy that promotes fine-grained learning. We present experimental results that indicate that our entropy-driven approach provides a better balance between learning efficiency and user satisfaction than static selection techniques.
- Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R. E. The nonstochastic multiarmed bandit problem. SIAM Journal of Computing 32:1 (2002), pp. 48--77. Google Scholar
Digital Library
- Baram, Y., Yaniv, R. E., and Luz, K. Online choice of active learning algorithms. Journal of Machine Learning Research 5 (2004), pp. 255--291. Google ScholarDigital Library
- Berry, P., Conley, K., Gervasio, M., Peintner, B., Uribe, T., and Yorke-Smith, N. Deploying a personalized time management agent. In Proceedings of AAMAS'06 (May 8--May 12, Hakodate, Japan), 2006. Google ScholarDigital Library
- Brinker, K. Active learning of label ranking functions. In Proceedings of ICML'04 (July 4--July 8, Banff, Canada), 2004, pp. 129--136. Google ScholarDigital Library
- Furnkranz, J., and Hullermeier, E. Pairwise preference learning and ranking. In Proceedings of the European Conference on Artificial Intelligence, 2003.Google ScholarDigital Library
- Gervasio, M. T., Moffitt, M. D., Pollack, M. E., Taylor, J. M., and Uribe, T. E. Active preference learning for personalized calendar scheduling assistance. In Proceedings of IUI'05, 2005. Google ScholarDigital Library
- Joachims, T. Making large-scale svm learning practical. In Scholkopf, B., Burges, C., and Smola, A., eds., Advances in Kernel Methods - Support Vector Lerarning. MIT-Press, 1999. Google ScholarDigital Library
- Kozierok, R., and Maes, P. A learning interaces agent for scheduling meetings. In Proceedings of IUI'93, 1993. Google ScholarDigital Library
- Mitchell, T., Caruana, R., Freitag, D., McDermott, J., and Zabowski, D. Experience with a learning personal assistant. Communications of the ACM 37:7 (1994), pp. 81--91. Google ScholarDigital Library
- Myers, K., Berry, P., Blythe, J., Conley, K., Gervasio, M., McGuinness, D., Morley, D., Pfeffer, A., Pollack, M., and Tambe, M. An intelligent personal assistant for task and time management. To appear in AI Magazine 28 (2007).Google Scholar
- Saar-Tsechansky, M., and Provost, F. Active sampling for class probability estimation and ranking. Machine Learning 54 (2004), pp. 153--178. Google ScholarDigital Library
- Shannon, C., and Weaver, W. A Mathematical Theory of Communication. University of Illinois Press, 1949. Google ScholarDigital Library
- Spearman, C. The Proof and Measurement of Association Between Two Things. American Journal of Psychology 15 (1904) pp. 72--101.Google ScholarCross Ref
- Stergiou, K., and Koubarakis, M. Backtracking algorithms for disjunctions of temporal constraints. Fifteenth National Conference on Artificial Intelligence 1998. Google ScholarDigital Library
- Yu, H. Selective sampling for ranking with application to data retrieval. Proceedings of the ACM Conference on Knowledge Discovery and Data Mining 2005. Google ScholarDigital Library
Index Terms
- Entropy-Driven online active learning for interactive calendar management
Recommendations
Active preference learning for personalized calendar scheduling assistance
IUI '05: Proceedings of the 10th international conference on Intelligent user interfacesWe present PLIANT, a learning system that supports adaptive assistance in an open calendaring system. PLIANT learns user preferences from the feedback that naturally occurs during interactive scheduling. It contributes a novel application of active ...
Multiple-view multiple-learner active learning
Generally, collecting a large quantity of unlabeled examples is feasible, but labeling them all is not. Active learning can reduce the number of labeled examples needed to train a good classifier. Existing active learning algorithms can be roughly ...
Online Passive-Aggressive Active learning
We investigate online active learning techniques for online classification tasks. Unlike traditional supervised learning approaches, either batch or online learning, which often require to request class labels of each incoming instance, online active ...
Comments