Relational IBL in Classical Music
Abstract
It is well known that many hard tasks considered in machine learning and data mining can be solved in a rather simple and robust way with an instance- and distance-based approach. In this work we present another difficult task: learning, from large numbers of complex performances by concert pianists, to play music expressively. We model the problem as a multi-level decomposition and prediction task. We show that this is a fundamentally relational learning problem and propose a new similarity measure for structured objects, which is built into a relational instance-based learning algorithm named DISTALL. Experiments with data derived from a substantial number of Mozart piano sonata recordings by a skilled concert pianist demonstrate that the approach is viable. We show that the instance-based learner operating on structured, relational data outperforms a propositional k -NN algorithm. In qualitative terms, some of the piano performances produced by DISTALL after learning from the human artist are of substantial musical quality; one even won a prize in an international ‘computer music performance’ contest. The experiments thus provide evidence of the capabilities of ILP in a highly complex domain such as music.
Cite
Text
Tobudic and Widmer. "Relational IBL in Classical Music." Machine Learning, 2006. doi:10.1007/S10994-006-8260-4Markdown
[Tobudic and Widmer. "Relational IBL in Classical Music." Machine Learning, 2006.](https://mlanthology.org/mlj/2006/tobudic2006mlj-relational/) doi:10.1007/S10994-006-8260-4BibTeX
@article{tobudic2006mlj-relational,
title = {{Relational IBL in Classical Music}},
author = {Tobudic, Asmir and Widmer, Gerhard},
journal = {Machine Learning},
year = {2006},
pages = {5-24},
doi = {10.1007/S10994-006-8260-4},
volume = {64},
url = {https://mlanthology.org/mlj/2006/tobudic2006mlj-relational/}
}