skip to main content
10.1145/1040830.1040857acmconferencesArticle/Chapter ViewAbstractPublication PagesiuiConference Proceedingsconference-collections
Article

Active preference learning for personalized calendar scheduling assistance

Published:10 January 2005Publication History

ABSTRACT

We 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 learning in a domain where the choice of candidate schedules to present to the user must balance usefulness to the learning module with immediate benefit to the user. Our experimental results provide evidence of PLIANT's ability to learn user preferences under various conditions and reveal the tradeoffs made by the different active learning selection strategies.

References

  1. Berry, P. M, Gervasio, M., Uribe, T. E., Myers, K., & Nitz, K. (2004). A personalized calendar assistant. Working Notes of the AAAI Spring Symposium on Interaction between Humans and Autonomous Systems over Extended Operation.]]Google ScholarGoogle Scholar
  2. Cohn, D., Ghaharamani, Z., & Jordan, M. I. (1994). Active learning with statistical models. Advances in Neural Information Processing Systems 7.]]Google ScholarGoogle Scholar
  3. Cristianini, N. & Shawe-Taylor, J. (2000). An Introduction to Support Vector Machines. Cambridge University Press.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Engelbrecht, A. P. (2001). Selective learning for multilayer feedforward neural networks. Fundamenta Informaticae, 45:295--328.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Ephrati, E., Zlotkin, G., & Rosenschein, J.S. (1994). A non manipulable meeting scheduling system. Proceedings of the Thirteenth International Distributed Artificial Intelligence Workshop. Seattle, WA.]]Google ScholarGoogle Scholar
  6. Fiechter, C.-N. & Rogers, S. (2000). Learning subjective functions with large margins. Proceedings of the Seventeenth International Conference on Machine Learning, 287--294.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Fung, G., Mangasarian, O. L., & Shavlik, J. (2002). Knowledge-based support vector machine classifiers. Advances in Neural Information Processing Systems 15.]]Google ScholarGoogle Scholar
  8. Gervasio, M., Iba, W., & Langley, P. (1999). Learning user evaluation functions for adaptive scheduling assistance. Proceedings of the Sixteenth International Conference on Machine Learning, 152--161.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Gratch, J. & Chien, S. (1996). Adaptive problem-solving for large-scale scheduling problems: a case study. Journal of Artificial Intelligence Research, 4:365--396.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Joachims, T. (2002). Optimizing search engines using clickthrough data. Proceedings of the ACM Conference on Knowledge Discovery and Data Mining.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Kiefer, J. (1959). Optimum experimental designs. J. R. Stat. Soc., series B, 21:272--304.]]Google ScholarGoogle Scholar
  12. MacKay, D. J. C. (1992). Information-based objective functions for active data selection. Neural Computation, 4 (4): 590--604.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Mitchell, T. M., Caruana, R., Freitag, D., McDermott, J., & Zabowski, D. (1994). Experience with a learning personal assistant. Communications of the ACM 37 (7):80--91.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Miyashita, K. & Sycara, K. (1995). CABINS: a framework of knowledge acquisition and iterative revision for schedule improvement and reactive repair. Artificial Intelligence, 76 (1--2).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Morley, D. & Myers, K. (2004). The SPARK agent framework. Proceedings of the Third International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-04).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Murphy, K. P. (2003). Active learning of causal Bayes net structure. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 426--435.]]Google ScholarGoogle Scholar
  17. Sandip, S. & Durfee, E.H. (1998). A formal study of distributed meeting scheduling. Group Decision and Negotiation, 7:265--298.]]Google ScholarGoogle ScholarCross RefCross Ref
  18. Tong, S. & Koller, D. (2000). Support vector machine active learning with applications to text classification. Proceedings of the Seventeenth International Conference on Machine Learning.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Thrun, S.B. (2002). The role of exploration in learning control. Neural Networks, 15 (4):665--687.]]Google ScholarGoogle Scholar
  20. Zhang, W. & Dietterich, T. (1995). A reinforcement learning approach to job-shop scheduling. Proceedings of the 14th International Joint Conference on Artificial Intelligence.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Active preference learning for personalized calendar scheduling assistance

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            IUI '05: Proceedings of the 10th international conference on Intelligent user interfaces
            January 2005
            344 pages
            ISBN:1581138946
            DOI:10.1145/1040830

            Copyright © 2005 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 10 January 2005

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate746of2,811submissions,27%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader