Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
395922 | Information Sciences | 2008 | 9 Pages |
Abstract
Rough set theory is an important technique for knowledge discovery in databases, and its algebraic structure is part of the foundation of rough set theory. In this paper, we present the structures of the lower and upper approximations based on arbitrary binary relations. Some existing results concerning the interpretation of belief functions in rough set backgrounds are also extended. Based on the concepts of definable sets in rough set theory, two important Boolean subalgebras in the generalized rough sets are investigated. An algorithm to compute atoms for these two Boolean algebras is presented.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Guilong Liu, William Zhu,