Techniques for efficient empirical induction [chapter]

Geoffrey I. Webb
1990 Lecture Notes in Computer Science  
This paper describes the LEI algorithm for empirical induction. The LEI algorithm provides efficient empirical induction for discrete attribute value data. It derives a classification procedure in the form of a set of predicate logic classification rules. This contrasts with the only other efficient approach to exhaustive empirical induction, the derivatives of the CLS algorithm, which present their classification procedures in the form of a decision tree. The LEI algorithm will always find the
more » ... simplest nondisjunctive rule that correctly classifies all examples of a single class where such a rule exists.
doi:10.1007/3-540-52062-7_82 fatcat:d6gk32tlv5hnph6ydbajaf4lo4