@COMMENT This file was generated by bib2html.pl <http://www.cs.cmu.edu/~pfr/misc_software/index.html#bib2html> version 0.90
@COMMENT written by Patrick Riley <http://www.cs.cmu.edu/~pfr>
@COMMENT This file came from Peter Stone's publication pages at
@COMMENT http://www.cs.utexas.edu/~pstone/papers
@InProceedings{IAAI2017-eladlieb,
  author = {Elad Liebman and Piyush Khandelwal and Maytal Saar-Tsechansky and Peter Stone},
  title = {Designing Better Playlists with Monte Carlo Tree Search},
  booktitle = {Proceedings of the Twenty-Ninth Conference On Innovative Applications Of Artificial Intelligence (IAAI-17)},
  location = {San Francisco, USA},
  month = {February},
  year = {2017},
  abstract = {
  In recent years, there has been growing interest in the study of automated
  playlist generation - music rec- ommender systems that focus on modeling
  preferences over song sequences rather than on individual songs in isolation.
  This paper addresses this problem by learn- ing personalized models on the
  fly of both song and transition preferences, uniquely tailored to each user’s
  musical tastes. Playlist recommender systems typically include two main
  components: i) a preference-learning component, and ii) a planning component
  for select- ing the next song in the playlist sequence. While there has been
  much work on the former, very little work has been devoted to the latter.
  This paper bridges this gap by focusing on the planning aspect of
  playlist gen- eration within the context of DJ-MC, our playlist rec-
  ommendation application. This paper also introduces a new variant of
  playlist recommendation, which in- corporates the notion of diversity and
  novelty directly into the reward model. We empirically demonstrate that
  the proposed planning approach significantly im- proves performance
  compared to the DJ-MC baseline in two playlist recommendation settings,
  increasing the usability of the framework in real world settings.
  },
}