This paper is two folded. In first fold, the authors have illustrated the interplay among fuzzy, rough, and soft set theory and their way of handling vagueness. In second fold, the authors have studied their individual strengths to discover association rules. The performance of these three approaches in discovering comprehensible rules are presented. Usage of Fuzzy, Rough, and Soft Set Approach...

The main objective of this special issue is to present readers with the significantly extended and improved versions of the articles presented at the International Conference on Rough Sets, Fuzzy Sets, and Granular Computing (RSFDGrC’05) held in Regina, Canada in September 2005. In the standard rough set model, the lower and upper approximations are defined based on the two extreme cases (full ...

Data usually exists with hybrid formats in real-world applications, and a unified data reduction for hybrid data is desirable. In this paper a unified information measure is proposed to computing discernibility power of a crisp equivalence relation and a fuzzy one, which is the key concept in classical rough set model and fuzzy rough set model. Based on the information measure, a general defini...

As two important expanded quantification rough set models, the probabilistic rough set (PRS) model and the graded rough set (GRS) model are used to measure relative quantitative information and absolute quantitative information between the equivalence classes and a basic concept, respectively. The decision-theoretic rough set (DTRS) model is a special case of PRS model which mainly utilizes the...

In recent years, fuzzy rough set theory has emerged as a suitable tool for performing feature selection. Fuzzy rough feature selection enables us to analyze the discernibility of the attributes, highlighting the most attractive features in the construction of classifiers. However, its results can be enhanced even more if other data reduction techniques, such as instance selection, are considere...

There exists a direct relation between fuzzy rough sets and fuzzy preorders. On the other hand, it is well known the existing parallelism between Formal Concept Analysis and Rough Set Theory. In both cases, Galois connections play a central role. In this work, we focus on adjunctions (also named isotone Galois connections) between fuzzy preordered sets; specifically, we study necessary conditio...

In this paper, we propose a dominance-based rough set approach for the decision analysis of a preference-ordered uncertain data table, which is comprised of a finite set of objects described by a finite set of criteria. The domains of the criteria may have ordinal properties that express preference scales. In the proposed approach, we first compute the degree of dominance between any two object...

Data reduction plays an important role in machine learning and pattern recognition with a high-dimensional data. In real-world applications data usually exists with hybrid formats, and a unified data reducing technique for hybrid data is desirable. In this paper, an information measure is proposed to computing discernibility power of a crisp equivalence relation or a fuzzy one, which is the key...

This paper proposes a fuzzy-rough method of maintaining CaseBased Reasoning (CBR) systems. The methodology is mainly based on the idea that a large case library can be transformed to a small case library together with a group of adaptation rules, which take the form of fuzzy rules generated by the rough set technique. In paper [1], we have proposed a methodology for case base maintenance which ...