نتایج جستجو برای: covering based rough set

تعداد نتایج: 3402629  

2004
HUANG Bing HE Xin ZHOU Xian-Zhong

In generalized rough set covering reduction theory, it is necessary to find a new measure to knowledge and rough set because the upper and lower approximations of rough sets are determined by their covering reduction. In this paper, information entropy is introduced to discuss the rough entropy of knowledge and the roughness of rough set, based on generalized rough set covering reduction. A new...

2014
Şaziye Yüksel Zehra Güzel Ergül Naime Tozlu

Soft rough sets which are a hybrid model combining rough sets with soft sets are defined by using soft rough approximation operators. Soft rough sets can be seen as a generalized rough set model based on soft sets. The present paper aims to combine the covering soft set with rough set, which gives rise to the new kind of soft rough sets. Based on the covering soft sets, we establish soft coveri...

2012
Bin Chen Jinjin Li

Rough set theory, a mathematical tool to deal with vague concepts, has originally described the indiscernibility of elements by equivalence relations. Covering-based 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 subbase, neighborhood and separation axioms have bee...

2011
Shiping Wang William Zhu Fan Min

In many real world applications, data are organized by coverings, not partitions. Covering-based rough sets have been proposed to cope with this type of data. Covering-based rough set theory is more general than rough set theory, then there is a need to employ sophisticated theories to make it more adaptive to real world application. The covering is one of core concepts in covering-based rough ...

2011
Shiping Wang Fan Min William Zhu

Rough set theory provides a systematic way for rule extraction, attribute reduction and knowledge classification in information systems. Some measurements are important in rough sets. For example, information entropy, knowledge dependency are useful in attribute reduction algorithms. This paper proposes the concepts of the lower and upper covering numbers to establish measurements in covering-b...

Journal: :European Journal of Pure and Applied Mathematics 2019

Journal: :Artificial Intelligence Review 2022

In this paper, we propose a new type of fuzzy covering-based rough set model over two different universes by using Zadeh’s extension principle. We mainly address the following issues in paper. First, present definition $$\beta$$ -neighborhood, which can be seen as mapping from universe to sets on another and study its properties. Then define investigate properties model. Meanwhile, give necessa...

Journal: :CoRR 2012
Nguyen Duc Thuan

—Covering-based rough set theory is an extension to classical rough set. The main purpose of this paper is to study covering rough sets from a topological point of view. The relationship among upper approximations based on topological spaces are explored.

Journal: :Fuzzy Sets and Systems 2018
Lynn D'eer Chris Cornelis

Fuzzy covering-based rough set models are hybrid models using both rough set and fuzzy set theory. The former is often used to deal with uncertain and incomplete information, while the latter is used to describe vague concepts. The study of fuzzy rough set models has provided very good tools for machine learning algorithms such as feature and instance selection. In this article, we discuss diff...

پایان نامه :0 1391

employees always concern about losing their job , or in other word , losing their income resources. for this purpose, every government requires strong system for covering these concerns. the unemployment insurance (ui) program’s can be used for achieving this goal. in this thesis, we price ui based on the insurance history of employee and the duration of being unemployed. we use the weibull dis...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید