Transforming decision systems into formal decision contexts is studied.Relationship between "AND" decision rules and granular rules is discussed.Relationship between "OR" decision rules and disjunctive rules is investigated.Support and certainty factors of different rules are compared.Algorithm complexity of rule acquisition is analyzed. Recently, by combining rough set theory with granular computing, pessimistic and optimistic multigranulation rough sets have been proposed to derive "AND" and "OR" decision rules from decision systems. At the same time, by integrating granular computing and formal concept analysis, Wille's concept lattice and object-oriented concept lattice were used to obtain granular rules and disjunctive rules from formal decision contexts. So, the problem of rule acquisition can bring rough set theory, granular computing and formal concept analysis together. In this study, to shed some light on the comparison and combination of rough set theory, granular computing and formal concept analysis, we investigate the relationship between multigranulation rough sets and concept lattices via rule acquisition. Some interesting results are obtained in this paper: (1) "AND" decision rules in pessimistic multigranulation rough sets are proved to be granular rules in concept lattices, but the inverse may not be true; (2) the combination of the truth parts of an "OR" decision rule in optimistic multigranulation rough sets is an item of the decomposition of a disjunctive rule in concept lattices; (3) a non-redundant disjunctive rule in concept lattices is shown to be the multi-combination of the truth parts of "OR" decision rules in optimistic multigranulation rough sets; and (4) the same rule is defined with a same certainty factor but a different support factor in multigranulation rough sets and concept lattices. Moreover, algorithm complexity analysis is made for the acquisition of "AND" decision rules, "OR" decision rules, granular rules and disjunctive rules.

/pdf/a-comparative-study-of-multigranulation-rough-sets-and-4inzhhg5mw.pdf

A comparative study of multigranulation rough sets and concept lattices via rule acquisition

For heterogeneous data sets containing numerical and symbolic feature values, feature selection based on fuzzy neighborhood multigranulation rough sets (FNMRS) is a very significant step to preprocess data and improve its classification performance. This article presents an FNMRS-based feature selection approach in neighborhood decision systems. First, some concepts of fuzzy neighborhood rough sets and neighborhood multigranulation rough sets are given, and then the FNMRS model is investigated to construct uncertainty measures. Second, the optimistic and pessimistic FNMRS models are built by using fuzzy neighborhood multigranulation lower and upper approximations from algebra view, and some fuzzy neighborhood entropy-based uncertainty measures are developed in information view. Inspired by both algebra and information views based on the FNMRS model, the fuzzy neighborhood pessimistic multigranulation entropy is proposed. Third, the Fisher score model is utilized to delete irrelevant features to decrease the complexity of high-dimensional data sets, and then, a forward feature selection algorithm is provided to promote the performance of heterogeneous data classification. Experimental results on 12 data sets show that the presented model is effective for selecting important features with the higher stability of classification in neighborhood decision systems.

Feature Selection Using Fuzzy Neighborhood Entropy-Based Uncertainty Measures for Fuzzy Neighborhood Multigranulation Rough Sets

Classical rough set theory is considered a useful tool for dealing with the uncertainty of categorical data. The major deficiency of this model is that the classical rough set model is sensitive to noise in classification learning due to the stringent condition of equivalence relation. Thus, a class of fuzzy similarity relations was introduced to describe the similarity between samples with categorical attributes. However, these kinds of similarity relations also have deficiencies when they are used in fuzzy rough computation. In this article, we propose a new fuzzy-rough-set model for categorical data by introducing a variable parameter to control the similarity of samples. This model employs the iterative computation strategy to define fuzzy rough approximations and dependence functions. It is proved that the proposed rough dependence function is monotonic. Finally, the proposed model is applied to the attribute reduction of categorical data. The experimental results indicate that the proposed model is more effective for categorical data than some existing algorithms.

Fuzzy Rough Attribute Reduction for Categorical Data

Multi-source information fusion based on rough set theory: A review

Attribute subset selection is an important issue in data mining and information processing. However, most automatic methodologies consider only the relevance factor between samples while ignoring the diversity factor. This may not allow the utilization value of hidden information to be exploited. For this reason, we propose a hybrid model named intuitionistic fuzzy (IF) rough set to overcome this limitation. The model combines the technical advantages of rough set and IF set and can effectively consider the above-mentioned statistical factors. First, fuzzy information granules based on IF relations are defined and used to characterize the hierarchical structures of the lower and upper approximations of IF rough set within the framework of granular computing. Then, the computation of IF rough approximations and knowledge reduction in IF information systems are investigated. Third, based on the approximations of IF rough set, significance measures are developed to evaluate the approximation quality and classification ability of IF relations. Furthermore, a forward heuristic algorithm for finding one optimal reduct of IF information systems is developed using these measures. Finally, numerical experiments are conducted on public datasets to examine the effectiveness and efficiency of the proposed algorithm in terms of the number of selected attributes, computational time, and classification accuracy.

Intuitionistic Fuzzy Rough Set-Based Granular Structures and Attribute Subset Selection

Matrix-based set approximations and reductions in covering decision information systems

Evidence-theory-based numerical characterization of multigranulation rough sets in incomplete information systems

Connections between covering-based rough sets and concept lattices

The intuitionistic fuzzy set is introduced to fuzzy incomplete information systems, the membership and non-membership degrees that an object belongs to a concept are constructed based on the similarity relation. By combining the fuzzy rough set and intuitionistic fuzzy set, we make three-way decisions. Various situations in fuzzy incomplete information systems are discussed.

Anhui Tan

Papers

Intuitionistic Fuzzy Rough Set-Based Granular Structures and Attribute Subset Selection

Matrix-based set approximations and reductions in covering decision information systems

Evidence-theory-based numerical characterization of multigranulation rough sets in incomplete information systems

Connections between covering-based rough sets and concept lattices

Three-way decisions in fuzzy incomplete information systems