Inductive Logic Programming Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replacement - "===20" to "=== 20")
 
Line 1: Line 1:
An [[Inductive Logic Programming Algorithm]] is an [[Model-based]] [[Eager Supervised Classification Algorithm]] that can solve a [[Recursive Rule Learning Task]].
#REDIRECT [[Inductive Logic Programming (ILP) Algorithm]]
* <B>AKA:</B> [[ILP]], [[Inductive Logic Programming]].
* <B>Context</U>:</B>
** It can (typically) be used to solve a [[Knowledge-based Supervised Binary Classification Task]].
** It can (typically) find a [[Hypothesis]] <math>H</math>, such that
*** <math>B \cup H \vDash e, \forall e \in E^+</math>
*** <math>B \cup H \nvDash e, \forall f \in E^-</math>
*** <math>B \cup H</math> is [[consistent]].
*** assuming, <math>B \nvDash e, \exists e \in E^+</math>
** It can be applied by a [[Inductive Logic Programming System]].
** It can be a [[Rule Induction Algorithm]].
* <B>Example(s):</B>
** [[FOIL Algorithm]].
* <B>Counter-Example(s):</B>
** a [[Classification Tree Learning Algorithm]].
* <B>See:</B> [[Supervised Learning]]; [[First-Order Logic]]; [[Inductive Reasoning]]; [[Propositional Learner]]; [[Multi-Relational Data Mining]], [[Analytical Learning Algorithm]], [[Logic Programming]], [[Mathematical Induction]].
----
----
==References ==
 
=== 2014 ===
* (Wikipedia, 2014) &rArr; http://en.wikipedia.org/wiki/Inductive_logic_programming Retrieved:2014-5-6.
** '''Inductive logic programming</B> ('''ILP</B>) is a subfield of [[machine learning]] which uses [[logic programming]] as a uniform representation for examples, [[background knowledge]] and hypotheses. Given an encoding of the known [[background knowledge]] and a set of examples [[represented as]] a logical database of facts, an ILP system will derive a hypothesised logic program which entails all the positive and none of the [[negative example]]s. <P> Schema: ''positive examples'' + ''negative examples'' + ''background knowledge'' => ''hypothesis''. <P> Inductive logic programming is particularly useful in [[bioinformatics]] and [[natural language processing]]. <P> The term ''Inductive Logic Programming</i> was first introduced <ref> [[Luc De Raedt]]. A Perspective on Inductive Logic Programming. The Workshop on Current and Future Trends in Logic Programming, Shakertown, to appear in Springer LNCS, 1999. [[CiteSeerX]]: </ref> in a paper by [[Stephen Muggleton]] in 1991.  The term "<i>inductive</i>" here refers to [[Inductive reasoning|philosophical]] (i.e. suggesting a theory to explain observed facts) rather than [[mathematical induction|mathematical]] (i.e. proving a property for all members of a well-ordered set) induction.
<references/>
 
=== 2011===
* ([[De Raedt, 2011a]]) &rArr; [[Luc De Raedt]]. (2011). "Inductive Logic Programming." In: ([[Sammut & Webb, 2011]]) p.529
 
=== 1991===
* ([[Muggleton, 1991]]) ⇒ [[Stephen Muggleton]]. (1991). "Inductive Logic Programming." In: Journal of New Generation Computing, 8(4). [http://dx.doi.org/10.1007/BF03037089 doi:10.1007/BF03037089]
 
----
__NOTOC__
[[Category:Concept]]

Latest revision as of 16:47, 12 November 2017

Redirect to:

Retrieved from "http://www.gabormelli.com/RKB/index.php?title=Inductive_Logic_Programming_Algorithm&oldid=342196"