21 August 2003 in International Journal of Intelligent Systems
This article deals with approaches to knowledge reductions in inconsistent information systems (ISs). The main objective of this work was to introduce a new kind of knowledge reduction called a maximum distribution reduct, which preserves all maximum decision classes. This type of reduction eliminates the harsh requirements of the distribution reduct and overcomes the drawback of the possible reduct that the derived decision rules may be incompatible with the ones derived from the original system. Then, the relationships among the maximum distribution reduct, the distribution reduct, and the possible reduct were discussed. The judgement theorems and discernibility matrices associated with the three reductions were examined, from which we can obtain approaches to knowledge reductions in rough set theory (RST).
1 February 2005 in International Journal of General Systems
This paper extends Pawlak's rough set onto the basis of a fuzzy partition of the universe of discourse. Some basic properties of partition-based fuzzy approximation operators are examined. To measure uncertainty in generalized fuzzy rough sets, a new notion of entropy of a fuzzy set is introduced. The notion is demonstrated to be adequate for measuring the fuzziness of a fuzzy event. The entropy of a fuzzy partition and conditional entropy are also proposed. These kinds of entropy satisfy some basic properties similar to those of Shannon's entropy. It is proved that the measure of fuzziness of a partition-based fuzzy rough set, FR(A), is equal to zero if and only if the set A is crisp and definable.
1 September 2004 in Computers & Mathematics with Applications
19 July 2011 in International Journal of Machine Learning and Cybernetics
9 November 2019 in Soft Computing
3 July 2023 in Artificial Intelligence Review