Variable Precision Rough Set Approximations in Concept Lattice

The notions of variable precision rough set and concept lattice are can be shared by a basic notion, which is the definability of a set of objects based on a set of properties. The two theories of rough set and concept lattice can be compared, combined and applied to each other based on definability. Based on introducing the definitions of variable precision rough set and concept lattice, this paper shows that any extension of a concept in concept lattice is an equivalence class of variable precision rough set. After that, we present a definition of lower and upper approximations in concept lattice and generate the lower and upper approximations concept of concept lattice. Afterwards, we discuss the properties of the new lower and upper approximations. Finally, an example is given to show the validity of the properties that the lower and upper approximations have

Semantics-Preserving Dimensionality Reduction: Rough and Fuzzy-Rough-Based Approaches

Abstract—Semantics-preserving dimensionality reduction refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine learning, pattern recognition, and signal processing. This has found successful application in tasks that involve data sets containing huge numbers of features (in the order of tens of thousands), which would be impossible to process further. Recent examples include text processing and Web content classification. One of the many successful applications of rough set theory has been to this feature selection area. This paper reviews those techniques that preserve the underlying semantics of the data, using crisp and fuzzy rough set-based methodologies. Several approaches to feature selection based on rough set theory are experimentally compared. Additionally, a new area in feature selection, feature grouping, is highlighted and a rough set-based feature grouping technique is detailed. Index Terms—Dimensionality reduction, feature selection, feature transformation, rough selection, fuzzy-rough selection.

Rough sets, their extensions and applications

Rough set theory provides a useful mathematical foundation for developing automated computational systems that can help understand and make use of imperfect knowledge. Despite its recency, the theory and its extensions have been widely applied to many problems, including decision analysis, data-mining, intelligent control and pattern recognition. This paper presents an outline of the basic concepts of rough sets and their major extensions, covering variable precision, tolerance and fuzzy rough sets. It also shows the diversity of successful applications these theories have entailed, ranging from financial and business, through biological and medicine, to physical, art, and meteorological

AN EFFICIENT MULTI-CRITERIA DECISION-MAKING APPROACH BASED ON HYBRIDIZING DATA MINING TECHNIQUES AN EFFICIENT MULTI-CRITERIA DECISION-MAKING APPROACH BASED ON HYBRIDIZING DATA MINING TECHNIQUES

Multiple-criteria decision-making (MCDM) that deals with multiple criteria in decision-making environments has been explicitly applied to various decision-making fields. Nevertheless, the critical issues of uncertainty and inaccuracy generally and gradually exists in the majority of the MCDM processes because of (1) prejudice and preference of decision-makers or experts as well as (2) the insufficiency information of the input and output. Therefore, this research efficiently proposed a novel method, FVM-index method, to resolve the limitations happened when MCDM is applied. The FVM-index approach, which consists of the fuzzy set theory (FST), the variable precision rough set (VPRS), and the cluster validity index (CVI) function, not only provides optimized classification results for the datasets but also filters out the uncertainty and inaccuracy instances from surveyed datasets by VPRS theory. Because the datasets are refined by the proposed FVM-index method, the decision makers will be able to effectively obtain the suitable results of MCD

The investigation of the Bayesian rough set model

AbstractThe original Rough Set model is concerned primarily with algebraic properties of approximately defined sets. The Variable Precision Rough Set (VPRS) model extends the basic rough set theory to incorporate probabilistic information. The article presents a non-parametric modification of the VPRS model called the Bayesian Rough Set (BRS) model, where the set approximations are defined by using the prior probability as a reference. Mathematical properties of BRS are investigated. It is shown that the quality of BRS models can be evaluated using probabilistic gain function, which is suitable for identification and elimination of redundant attributes