Meta-interpretive learning of data transformation programs Andrew - - PowerPoint PPT Presentation

meta interpretive learning of data transformation programs
SMART_READER_LITE
LIVE PREVIEW

Meta-interpretive learning of data transformation programs Andrew - - PowerPoint PPT Presentation

Meta-interpretive learning of data transformation programs Andrew Cropper, Alireza Tamaddoni-Nezhad, Stephen H. Muggleton Imperial College London Input P_011 67 year Output lung disease: n/a, Diagnosis: Unknown P_011 67 Unknown 80.78%


slide-1
SLIDE 1

Andrew Cropper, Alireza Tamaddoni-Nezhad, Stephen H. Muggleton Imperial College London

Meta-interpretive learning of data transformation programs

slide-2
SLIDE 2

Input P_011 67 year lung disease: n/a, Diagnosis: Unknown 80.78% P_003 56 Diagnosis: carcinoma, lung disease: unknown 20.78 P_013 70 Diagnosis: pneumonia 55.9 Output P_011 67 Unknown P_003 56 carcinoma P_013 56 pneumonia

  • Semi-structured
  • Positive only learning
  • Background knowledge
slide-3
SLIDE 3

Input P_011 67 year lung disease: n/a, Diagnosis: Unknown 80.78% P_003 56 Diagnosis: carcinoma, lung disease: unknown 20.78 P_013 70 Diagnosis: pneumonia 55.9 Output P_011 67 Unknown P_003 56 carcinoma P_013 56 pneumonia f(A,B):- f2(A,C), f1(C,B). f2(A,B):- find_patient_id(A,C), find_int(C,B). f1(A,B):- open_interval(A,B,[':',' ‘],['','n']). f1(A,B):- open_interval(A,B,[':',' '],[',',' ']).

slide-4
SLIDE 4

MetagolD Implementation of meta-interpretive learning*, a form

  • f inductive logic programming based on a Prolog

meta-interpreter, which supports predicate invention and the learning of recursive theories

* S.H. Muggleton, D. Lin, and A. Tamaddoni-Nezhad. Meta-interpretive learning

  • f higher-order dyadic datalog: Predicate invention revisited. Machine

Learning, 100(1):49-73, 2015.

slide-5
SLIDE 5

Transformation language

  • find_sublist/3
  • closed_interval/4
  • open_interval/4
slide-6
SLIDE 6
  • pen_interval/4 and closed_interval/4

Input = [i,n,d,u,c,t,i,o,n], Start = [n,d], End = [t,i]

  • pen_interval(Input,[u,c],Start,End).

closed_interval(Input,[n,d,u,c,t,i],Start,End).

slide-7
SLIDE 7

Input

Harpalus rufipes eats large prey such as Lepidoptera Bembidion lampros. In cereals the main food was Collembola

Output

Harpalus rufipes eats Lepidoptera Bembidion lampros food Collembola

Learned program

f(A,B):- f3(A,C), find_species(C,B). f3(A,B):- find_species(A,C), f2(C,B). f2(A,B):- closed_interval(A,B,[f,o],[o,d]). f3(A,B):- find_species(A,C), f1(C,B). f1(A,B):- closed_interval(A,B,[e,a],[t,s]).

Experiment: ecological papers

slide-8
SLIDE 8

1 2 3 4 5 0.4 0.6 0.8 1

  • No. training examples

Mean predictive accuracy

delimiter size 1 delimiter size 2 delimiter size 3 default accuracy

1 2 3 4 5 20 40 60 80

  • No. training examples

Mean learning time (seconds)

delimiter size 1 delimiter size 2 delimiter size 3

Experiment: ecological papers

slide-9
SLIDE 9

Input P_011 67 year lung disease: n/a, Diagnosis: Unknown 80.78% P_003 56 Diagnosis: carcinoma, lung disease: unknown 20.78 P_013 70 Diagnosis: pneumonia 55.9 Output P_011 67 Unknown P_003 56 carcinoma P_013 56 pneumonia f(A,B):- f2(A,C), f1(C,B). f2(A,B):- find_patient_id(A,C), find_int(C,B). f1(A,B):- open_interval(A,B,[':',' ‘],['','n']). f1(A,B):- open_interval(A,B,[':',' '],[',',' ']).

Experiment: medical records

slide-10
SLIDE 10

1 2 3 4 5 0.4 0.6 0.8 1

  • No. training examples

Mean predictive accuracy delimiter size 1 delimiter size 2 delimiter size 3 default accuracy 1 2 3 4 5 20 40 60

  • No. training examples

Mean learning time (seconds) delimiter size 1 delimiter size 2 delimiter size 3

Experiment: medical records

slide-11
SLIDE 11

Conclusions

  • MIL is able to generate accurate data transformation

programs from a small number of examples

  • Delimiter size effects learning performance

Future work

  • Apply to problems which require recursion
  • Generate hypotheses in a scripting language
  • Probabilistic approaches / noise handling
slide-12
SLIDE 12

Thank you