ATTRIBUTE REDUCTION IN VARIABLE PRECISION ROUGH SET MODEL

Author(s):  
MASAHIRO INUIGUCHI

In this paper, attribute reduction in variable precision rough set model is discussed. Several kinds of reducts preserving some of lower approximations, upper approximations, boundary regions and the unpredictable region are discussed. Relations among those kinds of reducts are investigated. As a basis for reduct computation, Boolean function representations of the preservation of lower approximations, upper approximations, boundary regions and the unpredictable region are discussed. Throughout this paper, the great difference between the analysis using variable precision rough sets and the classical rough set analysis is emphasized.

Author(s):  
Malcolm J. Beynon ◽  
Benjamin Griffiths

This chapter considers, and elucidates, the general methodology of rough set theory (RST), a nascent approach to rule based classification associated with soft computing. There are two parts of the elucidation undertaken in this chapter, firstly the levels of possible pre-processing necessary when undertaking an RST based analysis, and secondly the presentation of an analysis using variable precision rough sets (VPRS), a development on the original RST that allows for misclassification to exist in the constructed “if … then …” decision rules. Throughout the chapter, bespoke software underpins the pre-processing and VPRS analysis undertaken, including screenshots of its output. The problem of US bank credit ratings allows the pertinent demonstration of the soft computing approaches described throughout.


Author(s):  
Malcolm J. Beynon

Rough set theory (RST), since its introduction in Pawlak (1982), continues to develop as an effective tool in classification problems and decision support. In the majority of applications using RST based methodologies, there is the construction of ‘if .. then ..’ decision rules that are used to describe the results from an analysis. The variation of applications in management and decision making, using RST, recently includes discovering the operating rules of a Sicilian irrigation purpose reservoir (Barbagallo, Consoli, Pappalardo, Greco, & Zimbone, 2006), feature selection in customer relationship management (Tseng & Huang, 2007) and decisions that insurance companies make to satisfy customers’ needs (Shyng, Wang, Tzeng, & Wu, 2007). As a nascent symbolic machine learning technique, the popularity of RST is a direct consequence of its set theoretical operational processes, mitigating inhibiting issues associated with traditional techniques, such as within-group probability distribution assumptions (Beynon & Peel, 2001). Instead, the rudiments of the original RST are based on an indiscernibility relation, whereby objects are grouped into certain equivalence classes and inference taken from these groups. Characteristics like this mean that decision support will be built upon the underlying RST philosophy of “Let the data speak for itself” (Dunstch & Gediga, 1997). Recently, RST was viewed as being of fundamental importance in artificial intelligence and cognitive sciences, including decision analysis and decision support systems (Tseng & Huang, 2007). One of the first developments on RST was through the variable precision rough sets model (VPRSß), which allows a level of mis-classification to exist in the classification of objects, resulting in probabilistic rules (see Ziarko, 1993; Beynon, 2001; Li and Wang, 2004). VPRSß has specifically been applied as a potential decision support system with the UK Monopolies and Mergers Commission (Beynon & Driffield, 2005), predicting bank credit ratings (Griffiths & Beynon, 2005) and diffusion of medicaid home care programs (Kitchener, Beynon, & Harrington, 2004). Further developments of RST include extended variable precision rough sets (VPRSl,u), which infers asymmetric bounds on the possible classification and mis-classification of objects (Katzberg & Ziarko, 1996), dominance-based rough sets, which bases their approach around a dominance relation (Greco, Matarazzo, & Slowinski, 2004), fuzzy rough sets, which allows the grade of membership of objects to constructed sets (Greco, Inuiguchi, & Slowinski, 2006), and probabilistic bayesian rough sets model that considers an appropriate certainty gain function (Ziarko, 2005). A literal presentation of the diversity of work on RST can be viewed in the annual volumes of the Transactions on Rough Sets (most recent year 2006), also the annual conferences dedicated to RST and its developments (see for example, RSCTC, 2004). In this article, the theory underlying VPRSl,u is described, with its special case of VPRSß used in an example analysis. The utilisation of VPRSl,u, and VPRSß, is without loss of generality to other developments such as those referenced, its relative simplicity allows the non-proficient reader the opportunity to fully follow the details presented.


2014 ◽  
Vol 1 (1) ◽  
pp. 15-31 ◽  
Author(s):  
Sharmistha Bhattacharya Halder ◽  
Kalyani Debnath

Bayesian Decision theoretic rough set has been invented by the author. In this paper the attribute reduction by the aid of Bayesian decision theoretic rough set has been studied. Lot of other methods are there for attribute reduction such as Variable precision method, probabilistic approach, Bayesian method, Pawlaks rough set method using Boolean function. But with the help of some example it is shown that Bayesian decision theoretic rough set model gives better result than other method. Lastly an example of HIV /AIDS is taken and attribute reduction is done by this new method and various other method. It is shown that this method gives better result than the previously defined methods. By this method the authors get only the reduced attribute age which is the best significant attribute. Though in Pawlak model age sex or age living status are the reduced attribute and variable precision method fails to work here. In this paper attribute reduction is done by the help of discernibility matrix after determining the positive, boundary and negative region. This model is a hybrid model of Bayesian rough set model and decision theory. So this technique gives better result than Bayesian method and decision theoretic rough set method.


2011 ◽  
Vol 63-64 ◽  
pp. 664-667
Author(s):  
Hong Sheng Xu ◽  
Ting Zhong Wang

Formal concept lattices and rough set theory are two kinds of complementary mathematical tools for data analysis and data processing. The algorithm of concept lattice reduction based on variable precision rough set is proposed by combining the algorithms of β-upper and lower distribution reduction in variable precision rough set. The traditional algorithms aboutβvalue select algorithm, attribute reduction based on discernibility matrix and extraction rule in VPRS are discussed, there are defects in these traditional algorithms which are improved. Finally, the generation system of concept lattice based on variable precision rough set is designed to verify the validity of the improved algorithm and a case demonstrates the whole process of concept lattice construction.


Sign in / Sign up

Export Citation Format

Share Document