/Learning user preferences in distributed calendar scheduling

Learning user preferences in distributed calendar scheduling

Jean Hyaejin Oh and Stephen Smith
Book Section/Chapter, Carnegie Mellon University, Practice and Theory of Automated Timetabling V, LNCS, Vol. 3616, March, 2005

Download Publication (PDF)

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

Within the field of software agents, there has been increasing interest in automating the process of calendar scheduling in recent years. Calendar (or meeting) scheduling is an example of a timetabling domain that is most naturally formulated and solved as a continuous, distributed problem. Fundamentally, it involves reconciliation of a given user’s scheduling preferences with those of others that the user needs to meet with, and hence techniques for eliciting and reasoning about a user’s preferences are crucial to finding good solutions. In this paper, we present work aimed at learning a user’s time preference for scheduling a meeting. We adopt a passive machine learning approach that observes the user engaging in a series of meeting scheduling episodes with other meeting participants and infers the user’s true preference model from accumulated data. After describing our basic modeling assumptions and approach to learning user preferences, we report the results obtained in an initial set of proof of principle experiments. In these experiments, we use a set of automated CMRADAR calendar scheduling agents to simulate meeting scheduling among a set of users, and use information generated during these interactions as training data for each user’s learner. The learned model of a given user is then evaluated with respect to how well it satisfies that user’s true preference model on a separate set of meeting scheduling tasks. The results show that each learned model is statistically indistinguishable from the true model in their performance with strong confidence, and that the learned model is also significantly better than a random choice model.

BibTeX Reference
@incollection{Oh-2005-9138,
author = {Jean Hyaejin Oh and Stephen Smith},
title = {Learning user preferences in distributed calendar scheduling},
booktitle = {Practice and Theory of Automated Timetabling V, LNCS},
editor = {Springer},
year = {2005},
month = {March},
volume = {3616},
keywords = {statistical machine learning, calendar agents, preference learning},
}
2017-09-13T10:43:31+00:00