Premium
Probabilistic rule induction with the LERS data mining system
Author(s) -
GrzymalaBusse Jerzy W.,
Yao Yiyu
Publication year - 2011
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.20482
Subject(s) - rule induction , probabilistic logic , rough set , computer science , boundary (topology) , set (abstract data type) , data mining , artificial intelligence , mathematics , machine learning , algorithm , mathematical analysis , programming language
Abstract Based on classical rough set approximations, the LERS (Learning from Examples based on Rough Sets) data mining system induces two types of rules, namely, certain rules from lower approximations and possible rules from upper approximations. By relaxing the stringent requirement of the classical rough sets, one can obtain probabilistic approximations. The LERS can be easily applied to induce probabilistic positive and boundary rules from probabilistic positive and boundary regions. This paper discusses several fundamental issues related to probabilistic rule induction with LERS, including rule induction algorithm, quantitative measures associated with rules, and the rule conflict resolution method. © 2011 Wiley Periodicals, Inc.