|Author:||Szymon Wojciechowski <sw10 interiaDOTpl>|
|Maintainer:||Szymon Wojciechowski <sw10 interiaDOTpl>|
This project is a WEKA (Waikato Environment for Knowledge Analysis) compatible implementation of MODLEM - a Machine Learning algorithm which induces minimum set of rules. These rules can be adopted as a classifier (in terms of ML). It is a sequential covering algorithm, which was invented to cope with numeric data without discretization. Actually the nominal and numeric attributes are treated in the same way: attribute's space is being searched to find the best rule condition during rule induction. In result numeric attribute's conditions are more precise and closely describe the class. This algorithm contains some aspects of Rough Set Theory: the class definition can be described accordingly to its lower or upper approximation. For more information, see: Stefanowski, Jerzy. The rough set based rule induction technique for classification problems. In: Proc. 6th European Congress on Intelligent Techniques and Soft Computing, vol. 1. Aachen, 1998. s. 109-113.
All available versions: