Meta-Interpretive Learning of Data Transformation Programs

• Published in: Inductive Logic Programming Vol. 9575; pp. 46 - 59
• Main Authors: Cropper, Andrew, Tamaddoni-Nezhad, Alireza, Muggleton, Stephen H.
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 01.01.2016; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Mathematical theory of computation; Medical Patient Record; Predictive Accuracy; Prolog Program; Transformation Language; Transformation Rule
• ISBN: 3319405659; 9783319405650
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-40566-7_4

Data transformation involves the manual construction of large numbers of special-purpose programs. Although typically small, such programs can be complex, involving problem decomposition, recursion, and recognition of context. Building such programs is common in commercial and academic data analytic projects and can be labour intensive and expensive, making it a suitable candidate for machine learning. In this paper, we use the meta-interpretive learning framework (MIL) to learn recursive data transformation programs from small numbers of examples. MIL is well suited to this task because it supports problem decomposition through predicate invention, learning recursive programs, learning from few examples, and learning from only positive examples. We apply Metagol, a MIL implementation, to both semi-structured and unstructured data. We conduct experiments on three real-world datasets: medical patient records, XML mondial records, and natural language taken from ecological papers. The experimental results suggest that high levels of predictive accuracy can be achieved in these tasks from small numbers of training examples, especially when learning with recursion.