A connectionist approach to rule refinement

摘要

A novel approach to rule refinement based upon connectionism is presented. This approach is capable of performing rule deletion, rule addition, changing rule quality, and modification of rule strengths. The fundamental algorithm is referred to as the Consistent-Shift algorithm. Its basis for identifying incorrect connections is that incorrect connections will often undergo larger inconsistent weight shift that correct ones during training with correct samples. By properly adjusting the detection threshold, incorrect connections would be uncovered, which can then be deleted or modified. Deletion of incorrect connections and addition of correct connections then translate into various forms of rule refinement just mentioned. The viability of this approach is demonstrated empirically.