Relational IBL in classical music

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.

[1]  Nell P. McAngusTodd,et al.  The dynamics of dynamics: A model of musical expression , 1992 .

[2]  Maurice Bruynooghe,et al.  A polynomial time computable metric between point sets , 2001, Acta Informatica.

[3]  Gerhard Widmer,et al.  Relational IBL in Music with a New Structural Similarity Measure , 2003, ILP.

[4]  Céline Rouveirol,et al.  Extensions of Inversion of Resolution Applied to Theory Completion , 1992 .

[5]  Gerhard Widmer,et al.  In Search of the Horowitz Factor , 2003, AI Mag..

[6]  Luc De Raedt,et al.  Inductive Logic Programming: Theory and Methods , 1994, J. Log. Program..

[7]  Gerhard Widmer,et al.  Playing Mozart by Analogy: Learning Multi-level Timing and Dynamics Strategies , 2003 .

[8]  Maurice Bruynooghe,et al.  A Framework for Defining Distances Between First-Order Logic Objects , 1998, ILP.

[9]  Nicolas Helft,et al.  Induction as Nonmonotonic Inference , 1989, KR.

[10]  Michèle Sebag,et al.  Tractable Induction and Classification in First Order Logic Via Stochastic Matching , 1997, IJCAI.

[11]  Gilles Bisson,et al.  Learning in FOL with a Similarity Measure , 1992, AAAI.

[12]  Gerhard Widmer,et al.  Playing Mozart Phrase by Phrase , 2003, ICCBR.

[13]  Saso Dzeroski,et al.  Diterpene Structure Elucidation from 13CNMR Spectra with Inductive Logic Programming , 1998, Appl. Artif. Intell..

[14]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[15]  Gerhard Widmer,et al.  Discovering simple rules in complex data: A meta-learning algorithm and some surprising musical discoveries , 2003, Artif. Intell..

[16]  Dietrich Wettschereck,et al.  Relational Instance-based Learning { an Initial Case Study , 1996 .

[17]  L. D. Raedt Interactive theory revision: an inductive logic programming approach , 1992 .

[18]  Dietrich Wettschereck,et al.  Relational Instance-Based Learning , 1996, ICML.

[19]  Stephen Muggleton,et al.  Efficient Induction of Logic Programs , 1990, ALT.

[20]  Gerhard Widmer,et al.  Machine Discoveries: A Few Simple, Robust Local Expression Principles , 2002 .