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

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

Journal: :Knowl.-Based Syst. 2015
Kao-Yi Shen Gwo-Hshiung Tzeng

Financial performance is vital for information technology (IT) companies to survive intense global competition. Because of the complexity in the business environment and the rapidly advancing technologies, companies lack specific guidance to understand the implicit relationship among crucial financial indicators for improving prospects in a contextual approach. To resolve the aforementioned con...

2007
Maxim Lifantsev Anita Wasilewska

We use the notion of the rough set diagram introduced by Wasilewska and Vigneron 8] to present a general decision procedure for validity of equations in rough boolean algebra. First, we establish equivalence of validity in rough boolean algebra to validity in so called simple rough boolean algebra. Second, we propose a decision method for simple rough boolean algebra, which is to construct and ...

Journal: :Computing and Informatics 2014
Qiang Wu

Many real world problems deal with ordering of objects instead of classifying objects, although most of research in data analysis has been focused on the latter. One of the extensions of classical rough sets to take into account the ordering properties is dominance-based rough sets approach which is mainly based on substitution of the indiscernibility relation by a dominance relation. In this p...

Journal: :Knowl.-Based Syst. 2013
Shaoyong Li Tianrui Li Dun Liu

Dominance-based Rough Sets Approach (DRSA) is a generalized model of the classical Rough Sets Theory (RST) which may handle information with preference-ordered attribute domain. The attribute set in the information system may evolve over time. Approximations of DRSA used to induce decision rules need updating for knowledge discovery and other related tasks. We firstly introduce a kind of domina...

Journal: :Int. J. Intell. Syst. 2013
Shaoyong Li Tianrui Li Dun Liu

Dominance-based rough sets approach (DRSA) is an effective tool to deal with information with preference-ordered attribute domains and decision classes. Any information system may evolve when new objects enter into or old objects get out. Approximations of DRSA need update for decision analysis or other relative tasks. Incremental updating is a feasible and effective technique to update approxi...

Journal: :Knowl.-Based Syst. 2015
Milosz Kadzinski Roman Slowinski Salvatore Greco

We introduce a new multiple criteria ranking/choice method that applies Dominance-based Rough Set Approach (DRSA) and represents the Decision Maker’s (DM’s) preferences with decision rules. The DM provides a set of pairwise comparisons indicating whether an outranking (weak preference) relation should hold for some pairs of reference alternatives. This preference information is structured using...

Journal: :Inf. Sci. 2012
Fan Min William Zhu

In data mining applications, we have a number of measurement methods to obtain a data item with different test costs and different error ranges. Test costs refer to time, money, or other resources spent in obtaining data items related to some object; observational errors correspond to differences in measured and true value of a data item. In supervised learning, we need to decide which data ite...

Journal: :Electronic Notes in Theoretical Computer Science 2003

Journal: :International Journal of Approximate Reasoning 2006

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

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