Journal
INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS
Volume 26, Issue 6, Pages 518-539Publisher
WILEY
DOI: 10.1002/int.20482
Keywords
-
Categories
Ask authors/readers for more resources
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. (C) 2011 Wiley Periodicals, Inc.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available