Английская Википедия:Aleph (ILP)

Содержание

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Aleph (A Learning Engine for Proposing Hypotheses)Шаблон:Sfn is an inductive logic programming system introduced by Ashwin Srinivasan in 2001. Шаблон:As of it is still one of the most widely used inductive logic programming systems. It is based on the earlier system Progol.Шаблон:Sfn

Learning task

The input to Aleph is background knowledge, specified as a logic program, a language bias in the form of mode declarations, as well as positive and negative examples specified as ground facts.Шаблон:Sfn

As output it returns a logic program which, together with the background knowledge, entails all of the positive examples and none of the negative examples.Шаблон:Sfn

Basic algorithm

Starting with an empty hypothesis, Aleph proceeds as follows:Шаблон:Sfn

• It chooses a positive example to generalise; if none are left, it aborts and outputs the current hypothesis.
• Then it constructs the bottom clause, that is, the most specific clause that is allowed by the mode declarations and covers the example.
• It then searches for a generalisation of the bottom clause that scores better on the chosen metric.
• It then adds the new clause to the hypothesis program and removes all examples that are covered by the new clause.

Search algorithm

Aleph searches for clauses in a top-down manner, using the bottom clause constructed in the preceding step to bound the search from below. It searches the refinement graph in a breadth-first manner, with tunable parameters to bound the maximal clause size and proof depth. It scores each clause using one of 13 different evaluation metrics, as chosen in advance by the user.Шаблон:Sfn

References

• Шаблон:Cite journal
• Шаблон:Cite journal