Methods for Lower Approximation Reduction in Inconsistent Decision Table Based on Tolerance Relation
نویسندگان
چکیده
It is well known that most of information systems are based on tolerance relation instead of the classical equivalence relation because of various factors in real-world. To acquire brief decision rules from the information systems, lower approximation reduction is needed. In this paper, the lower approximation reduction is proposed in inconsistent information systems based on tolerance relation. Moreover, the properties are discussed. Furthermore, judgment theorem and discernibility matrix are obtained, from which an approach to lower reductions can be provided in the complicated information systems.
منابع مشابه
Approximation reduction in inconsistent incomplete decision tables
0950-7051/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.knosys.2010.02.004 * Corresponding author. Address: Key Laboratory o and Chinese, Information Processing of Ministry of China. E-mail addresses: [email protected] (Y. Qian [email protected] (D. Li), [email protected] (F. W (N. Ma). This article deals with approaches to attribute reductions in inconsistent incomplete decision tabl...
متن کاملTopological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملJoin and Meet Block Based Default Definite Decision Rule Mining from IDT and an Incremental Algorithm
Using maximal consistent blocks of tolerance relation on the universe in incomplete decision table, the concepts of join block and meet block are introduced and studied. Including tolerance class, other blocks such as tolerant kernel and compatible kernel of an object are also discussed at the same time. Upper and lower approximations based on those blocks are also defined. Default definite dec...
متن کاملBinary Relations as a Basis for Rule Induction in Presence of Quantitative Attributes
In original rough set theory, the notion of set approximation has been introduced by using indiscernibility relation defined on the set of objects. In some cases, it is necessary to generalize indiscernibility relation by using some other binary relations. In this paper, we consider similarity relations and tolerance relations among objects. These binary relations are defined from some similari...
متن کاملSearching for Relational Patterns in Data
We consider several basic classes of tolerance relations among objects. These (global) relations are deened from some predeened similarity measures on values of attributes. A tolerance relation in a given class of tolerance relations is optimal with respect to a given decision table A if it contains only pairs of objects with the same decision and the number of such pairs contained in the relat...
متن کامل