Polyphonic music modeling with random fields
- 2 November 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 120-129
- https://doi.org/10.1145/957013.957041
Abstract
Recent interest in the area of music information retrieval and related technologies is exploding. However, very few of the existing techniques take advantage of recent developments in statistical modeling. In this paper we discuss an application of Random Fields to the problem of creating accurate yet flexible statistical models of polyphonic music. With such models in hand, the challenges of developing effective searching, browsing and organization techniques for the growing bodies of music collections may be successfully met. We offer an evaluation of these models in terms of perplexity and prediction accuracy, and show that random fields not only outperform Markov chains, but are much more robust in terms of overfitting.Keywords
This publication has 7 references indexed in Scilit:
- Maximum likelihood and discriminative training of direct translation modelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A whole sentence maximum entropy language modelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A comparison of algorithms for maximum entropy parameter estimationPublished by Association for Computational Linguistics (ACL) ,2002
- Melodic matching techniques for large music databasesPublished by Association for Computing Machinery (ACM) ,1999
- Manipulation of music for melody matchingPublished by Association for Computing Machinery (ACM) ,1998
- Inducing features of random fieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- The zero-frequency problem: estimating the probabilities of novel events in adaptive text compressionIEEE Transactions on Information Theory, 1991