4 search results - page 1 / 1 » Quasi-Morphism and Comprehensibility of Rules in Inductive L... |
IEEEICCI
2002
IEEE
13 years 9 months ago
2002
IEEE
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 an...
CSREASAM
2003
13 years 5 months ago
2003
Automated rule induction procedures like machine learning and statistical techniques result in rules that lack generalization and maintainability. Developing rules manually throug...
GECCO
2009
Springer
13 years 9 months ago
2009
Springer
In this paper, we evaluate the performance of ten well-known evolutionary and non-evolutionary rule learning algorithms. The comparative study is performed on a real-world classi...
MLDM
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...