نتایج جستجو برای: covering based rough set
تعداد نتایج: 3402629 فیلتر نتایج به سال:
Classical rough set theory is a technique of granular computing for handling the uncertainty, vagueness, and granularity in information systems. Covering-based rough sets are proposed to generalize this theory for dealing with covering data. By introducing a concept of misclassification rate functions, an extended variable precision covering-based rough set model is proposed in this paper. In a...
There exist two formulations of rough sets: the conceptual and computational one. The conceptual or semantical approach of rough set theory focuses on the meaning and interpretation of concepts, while algorithms to compute those concepts are studied in the computational formulation. However, the research on the former is rather limited. In this paper, we focus on a semantically sound approach o...
Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of classical rough sets by relaxing the partitions arising from equivalence relations to coverings. Recently, some topological concepts such as neighborhood have b...
To explore the constraint range of geographic video space, is the key points and difficulties to video GIS research. Reflecting by spatial constraints in the geographic range, sports entity and its space environment between complicated constraint and relationship of video play a significant role in semantic understanding. However, how to position this precision to meet the characteristic behavi...
Covering-based rough sets are important generalizations of the classical rough sets of Pawlak. A common way to shape lower and upper approximations within this framework is by means of a neighborhood operator. In this article, we study 24 such neighborhood operators that can be derived from a single covering. We verify equalities between them, reducing the original collection to 13 different ne...
For set-valued information systems, there are many original dot-based approximation models based on tolerance relations and other developed relations. Because of the lack efficient algorithms, they not to accommodate bigger table. Therefore, it is a real challenge how efficiently calculate high-quality set in systems. To address challenge, we propose reliable operators semi-monolayer covering f...
As an alternative to the price-based traditional auction model, the multi-attribute auction model is an integrated model requiring the simultaneous trade of different types of attributes as the sellers and buyers deal. As a result, the design and modeling of the auction mechanism have become very difficult. This paper proposes a multiattribute auction model using the dominance-based rough sets ...
This study differs from previous ones applying multivariate statistical analysis and multiple criteria decision-making (MCDM) methods. We use the Variable Consistency Dominance-based Rough Set Approach (VC-DRSA) to formulate airline service strategies by generating airline service decision rules thatmodelpassengerpreferences for airline servicequality. Flowgraphsare applied to inferdecision rul...
In this paper, a variable-precision dominance-based rough set approach (VP-DRSA) is proposed together with several VP-DRSA-based approaches to attribute reduction. The properties of VP-DRSA are shown in comparison to previous dominance-based rough set approaches. An advantage of VP-DRSA over variable-consistency dominance-based rough set approach in decision rule induction is emphasized. Some r...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید