@inproceedings{paiement:2005:ismir,
  author = {J.-F. Paiement and D. Eck and S. Bengio},
  title = {A Probabilistic Model for Chord Progressions},
  booktitle = {International Conference on Music Information Retrieval, {ISMIR}},
  year = 2005,
  url = {publications/ps/paiement_2005_ismir.ps.gz},
  pdf = {publications/pdf/paiement_2005_ismir.pdf},
  djvu = {publications/djvu/paiement_2005_ismir.djvu},
  original = {2005/music_ismir},
  topics = {graphical_models},
  abstract = {Chord progressions are the building blocks from which tonal music is constructed. Inferring chord progressions is thus an essential step towards modeling long term dependencies in music. In this paper, a distributed representation for chords is designed such that Euclidean distances roughly correspond to psychoacoustic dissimilarities. Estimated probabilities of chord substitutions are derived from this representation and are used to introduce smoothing in graphical models observing chord progressions. Parameters in the graphical models are learnt with the EM algorithm and the classical Junction Tree algorithm is used for inference. Various model architectures are compared in terms of conditional out-of-sample likelihood. Both perceptual and statistical evidence show that binary trees related to meter are well suited to capture chord dependencies.},
  categorie = {C},
}

{"_id":"7PbWLohMQWvQAFHy8","bibbaseid":"paiement-eck-bengio-aprobabilisticmodelforchordprogressions-2005","authorIDs":[],"author_short":["Paiement, J.","Eck, D.","Bengio, S."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["J.-F."],"propositions":[],"lastnames":["Paiement"],"suffixes":[]},{"firstnames":["D."],"propositions":[],"lastnames":["Eck"],"suffixes":[]},{"firstnames":["S."],"propositions":[],"lastnames":["Bengio"],"suffixes":[]}],"title":"A Probabilistic Model for Chord Progressions","booktitle":"International Conference on Music Information Retrieval, ISMIR","year":"2005","url":"publications/ps/paiement_2005_ismir.ps.gz","pdf":"publications/pdf/paiement_2005_ismir.pdf","djvu":"publications/djvu/paiement_2005_ismir.djvu","original":"2005/music_ismir","topics":"graphical_models","abstract":"Chord progressions are the building blocks from which tonal music is constructed. Inferring chord progressions is thus an essential step towards modeling long term dependencies in music. In this paper, a distributed representation for chords is designed such that Euclidean distances roughly correspond to psychoacoustic dissimilarities. Estimated probabilities of chord substitutions are derived from this representation and are used to introduce smoothing in graphical models observing chord progressions. Parameters in the graphical models are learnt with the EM algorithm and the classical Junction Tree algorithm is used for inference. Various model architectures are compared in terms of conditional out-of-sample likelihood. Both perceptual and statistical evidence show that binary trees related to meter are well suited to capture chord dependencies.","categorie":"C","bibtex":"@inproceedings{paiement:2005:ismir,\n author = {J.-F. Paiement and D. Eck and S. Bengio},\n title = {A Probabilistic Model for Chord Progressions},\n booktitle = {International Conference on Music Information Retrieval, {ISMIR}},\n year = 2005,\n url = {publications/ps/paiement_2005_ismir.ps.gz},\n pdf = {publications/pdf/paiement_2005_ismir.pdf},\n djvu = {publications/djvu/paiement_2005_ismir.djvu},\n original = {2005/music_ismir},\n topics = {graphical_models},\n abstract = {Chord progressions are the building blocks from which tonal music is constructed. Inferring chord progressions is thus an essential step towards modeling long term dependencies in music. In this paper, a distributed representation for chords is designed such that Euclidean distances roughly correspond to psychoacoustic dissimilarities. Estimated probabilities of chord substitutions are derived from this representation and are used to introduce smoothing in graphical models observing chord progressions. Parameters in the graphical models are learnt with the EM algorithm and the classical Junction Tree algorithm is used for inference. Various model architectures are compared in terms of conditional out-of-sample likelihood. Both perceptual and statistical evidence show that binary trees related to meter are well suited to capture chord dependencies.},\n categorie = {C},\n}\n\n","author_short":["Paiement, J.","Eck, D.","Bengio, S."],"key":"paiement:2005:ismir","id":"paiement:2005:ismir","bibbaseid":"paiement-eck-bengio-aprobabilisticmodelforchordprogressions-2005","role":"author","urls":{"Paper":"http://bengio.abracadoudou.com/publications/ps/paiement_2005_ismir.ps.gz"},"downloads":0},"bibtype":"inproceedings","biburl":"http://bengio.abracadoudou.com/samy.bib","creationDate":"2020-03-18T03:43:27.394Z","downloads":0,"keywords":[],"search_terms":["probabilistic","model","chord","progressions","paiement","eck","bengio"],"title":"A Probabilistic Model for Chord Progressions","year":2005,"dataSources":["9NCW2CDr4M3s5DvNX"]}