<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05977245</id>
  <dt>a</dt>
  <an>05977245</an>
  <augroup>
    <au>Su, Ja-Hwung</au>
    <au>Hung, Tzu-Shiang</au>
    <au>Lee, Chun-Jen</au>
    <au>Lu, Chung-Li</au>
    <au>Chang, Wei-Lun</au>
    <au>Tseng, Vincent S.</au>
  </augroup>
  <ti>Effective content-based music retrieval with pattern-based relevance feedback.</ti>
  <so>K\"onig, Andreas (ed.) et al., Knowlege-based and intelligent information and engineering systems. 15th international conference, KES 2011, Kaiserslautern, Germany, September 12--14, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-23862-8/pbk). Lecture Notes in Computer Science 6882. Lecture Notes in Artificial Intelligence, 285-295 (2011).</so>
  <py>2011</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>content-based music retrieval</ut>
    <ut>pattern-based relevance feedback</ut>
    <ut>query point movement</ut>
    <ut>query re-weighting</ut>
    <ut>query expansion</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-23863-5_29</li>
  </ligroup>
  <abgroup>
    <ab>Summary: To retrieve the preferred music piece from a music database, contentbased music retrieval has been studied for several years. However, it is not easy to retrieve the desired music pieces within only one query process. It motivates us to propose a novel query refinement technique called PBRF (Pattern-based Relevance Feedback) to predict the user's preference on music via a series of feedbacks, which combines three kinds of query refinement strategies, namely QPM (Query Point Movement), QR (Query Reweighting) and QEX (Query Expansion). In this work, each music piece is transformed into a pattern string, and the related discriminability and representability of each pattern can be calculated then. According to the information of discriminability and representability calculated, the user's preference on music can be retrieved by matching patterns of music pieces in the music database with those of a query music piece. In addition, with considering the local-optimal problem, extensive and intensive search methods based on user's feedbacks are proposed to approximate the successful search. Through the integration of QPM, QR, QEX and switch-based search strategies, the user's intention can be captured more effectively. The experimental results reveal that our proposed approach performs better than existing methods in terms of effectiveness.</ab>
    <rv></rv>
  </abgroup>
</item>