(toiminnot)

hwechtla-tl: Inductive Logic Programming: from Machine Learning to Software Engineering: viime muutokset

[...]

A (((A program, its examples, and the procedures that are used to produce one from the other are naturally intimately connected. A procedure that produces a program from examples is an inductive inference machine IIM(''e'') = ''P''; a procedure that produces a set of examples from a program is a test set generation procedure TSG(''P'') = ''e''. ILP usually studies the construction of a known program. Basically, it could study the selection of an optimal example set for a given inductive inference machine, but usually studies the selection of the optimal IIM for a given set of examples (which is usually quite arbitrarily chosen). For induction, we could also study the optimal program to be produced for a given set of examples -- i.e. what the "correct" result of an IIM actually is. is.)))

[...]


(viimeksi muutettu 05.07.2007 20:40)