Some invariant properties of incomplete information systems homomorphism are studied in this paper. Demand conditions of tolerance class, attribute reduction, indispensable attribute and dispensable attribute being invariant under homomorphism in incomplete information system are revealed and discussed. The existing condition of endohomomorphism on an incomplete information system is also explored. It establishes some theoretical foundations for further investigations on incomplete information systems in rough set theory, like in information systems
This paper presents some functional dependency relations defined on the attribute set of an informat...
This paper presents some functional dependency relations defined on the attribute set of an informat...
The key point of the tolerance relation or similarity relation presented in the literature is to ass...
Relation between tolerance class and indispensable attribute and knowledge dependency in rough set m...
Abstract The tolerance rough set is developed as one of the outstanding extensions of the Pawlak's r...
AbstractAn information system is one of the most important mathematical models in the field of artif...
Rough set theory is an effective approach to imprecision, vagueness, and uncertainty. This theory ov...
AbstractIn reality we are always faced with a large number of complex massive databases. In this wor...
This paper investigated the incomplete information system in which situation of the more missing or ...
The rough set theory, based on the original definition of the indiscernibility relation, is not usef...
In this paper, we present a new closure operator defined on the set of attributes of an information ...
AbstractIn reality we are always faced with a large number of complex massive databases. In this wor...
In this paper, we present a new closure operator defined on the set of attributes of an information ...
Incomplete information systems are expanded with the significance of objects in order to combine fac...
In recent years, rough set theory has been considered as a strong solution to solve artificial intel...
This paper presents some functional dependency relations defined on the attribute set of an informat...
This paper presents some functional dependency relations defined on the attribute set of an informat...
The key point of the tolerance relation or similarity relation presented in the literature is to ass...
Relation between tolerance class and indispensable attribute and knowledge dependency in rough set m...
Abstract The tolerance rough set is developed as one of the outstanding extensions of the Pawlak's r...
AbstractAn information system is one of the most important mathematical models in the field of artif...
Rough set theory is an effective approach to imprecision, vagueness, and uncertainty. This theory ov...
AbstractIn reality we are always faced with a large number of complex massive databases. In this wor...
This paper investigated the incomplete information system in which situation of the more missing or ...
The rough set theory, based on the original definition of the indiscernibility relation, is not usef...
In this paper, we present a new closure operator defined on the set of attributes of an information ...
AbstractIn reality we are always faced with a large number of complex massive databases. In this wor...
In this paper, we present a new closure operator defined on the set of attributes of an information ...
Incomplete information systems are expanded with the significance of objects in order to combine fac...
In recent years, rough set theory has been considered as a strong solution to solve artificial intel...
This paper presents some functional dependency relations defined on the attribute set of an informat...
This paper presents some functional dependency relations defined on the attribute set of an informat...
The key point of the tolerance relation or similarity relation presented in the literature is to ass...