Sciweavers

Share
IEEEICCI
2002
IEEE

Quasi-Morphism and Comprehensibility of Rules in Inductive Learning

9 years 2 months ago
Quasi-Morphism and Comprehensibility of Rules in Inductive Learning
We present a model of creating a hierarchical set of rules that encode generalizations and exceptions derived from induction learning. The rules use the input features directly and are therefore comprehensible to the users. Learning is performed by a feedforward neural network and the rules are extracted from the trained network. A pattern classification task is used to demonstrate the efficacy of our approach. We show that the rules have similar classification performance while being more comprehensible to the users.
Wiphada Wettayaprasit, Chidchanok Lursinsap, Chee-
Added 15 Jul 2010
Updated 15 Jul 2010
Type Conference
Year 2002
Where IEEEICCI
Authors Wiphada Wettayaprasit, Chidchanok Lursinsap, Chee-Hung Henry Chu
Comments (0)
books