^

Combining Inductive and Analytical Learning

KBANN Algorithm

KBANN(domainTheory, trainingExamples)
domainTheory: set of propositional non-recursive Horn clauses
  1. for each instance attribute create a network input.
  2. for each Horn clause in domainTheory, create a network unit
    1. Connect inputs to attributes tested by antecedents.
    2. Each non-negated antecedent gets a weight W.
    3. Each negated antecedent gets a weight -W
    4. Threshold weight is -(n - .5), where n is the number of non-negated antecedents.
  3. Make all other connections between layers, giving these very low weights.
  4. Apply Backpropagation using trainingExamples

José M. Vidal .

12 of 32