Multi-granulation Fuzzy Rough Sets in a Fuzzy Tolerance Approximation Space
|
|
- Marian Reeves
- 6 years ago
- Views:
Transcription
1 46 Internatonal Journal of Fuzzy Systes Vol No 4 Deceber 0 Mult-granulaton Fuzzy Rough Sets n a Fuzzy Tolerance pproxaton Space Wehua Xu Qaorong Wang and Xantao Zhang bstract ased on the analyss of the rough set odel on a tolerance relaton and the fuzzy rough set two types of fuzzy rough sets odels on tolerance relatons are constructed and researched Then we propose the optstc and pessstc ult-granulaton fuzzy rough sets odels n a fuzzy tolerance approxaton space wth the pont vew of granular coputng In these odels the fuzzy lower and upper approxatons of a fuzzy set are defned on ultple fuzzy tolerance relatons It follows the research on the propertes of the fuzzy lower and upper approxatons of the new odels The fuzzy rough set odel rough set odel on a tolerance relaton and ult-granulaton rough sets odels are specal cases of the new ones fro the perspectve of the consdered concepts related relatons and granular coputng The new odels are eanngful generalzatons of the classcal rough sets Keywords: pproxaton operators Fuzzy rough set Fuzzy tolerance relaton Mult-granulaton Introducton Rough set theory proposed by awlak [-] s a theory for the research of uncertanty anageent n a wde varety of applcatons related to artfcal ntellgence [ 5 8] The theory has been appled successfully n the felds of pattern recognton edcal dagnoss data nng conflct analyss algebra [ 4 0] whch relate an aount of precse vague and uncertan nforaton In recent years the rough set theory generated a great deal of nterest aong ore and ore researchers The generalzaton of the classcal rough set odel fro the perspectve of granular coputng s one of the study spotlghts Inforaton granules refer to peces classes and groups dvded n accordance wth characterstcs and perforances of coplex nforaton n the process of Correspondng uthor: Wehua Xu s wth the school of Matheatcs and Statstcs Chongqng Unversty of Technology Chongqng R Chna E-al: chxuwh@galco huan understandng reasonng and decson-akng Zadeh frstly proposed the concept of granular coputng and dscussed ssues of fuzzy nforaton granulaton n 979 [9] Then the basc dea of nforaton granulaton had been appled to any felds ncludng rough set [ ] In 985 Hobbs proposed the concept of granularty [4] Granular coputng played a ore and ore portant role gradually n soft coputng knowledge dscovery data nng and any excellent results were acheved [ ] In the pont vew of granular coputng the classcal awlak rough set and soe expanded rough sets lke tolerant odels [6 0 ] are based on a sngle granulaton nd an equvalence relaton or a tolerance relaton on the unverse can be regarded as a granulaton Ths approach to descrbng a concept s anly based on the followng assupton [6]: If R and R are two relatons nduced by the attrbutes subsets and and X U s a target concept then the rough set of X s derved fro the quotent set U ( R R ) = { x x [ ] [ ] R R [ x] U R [ x] U R [ x] [ x] R R R R whch suggests that we can perfor an ntersecton operaton between [ x] and [ x] and the target concept s R R approxately descrbed by usng the quotent set U ( R R) Then the target concept s descrbed by a fner granulaton (parttons or coverngs) fored through cobnng two known granulatons (parttons or coverngs) nduced fro two attrbute subsets However the cobnaton that generates a uch fner granulaton and ore knowledge destroys the orgnal granulaton structure In fact the above assupton cannot always be satsfed or requred generally The followng cases llustrate the restrctons Case In soe data analyss ssues for the sae obect there s a contradcton or nconsstent relatonshp between ts values under one attrbute set R and those under another attrbute set R In other words we cannot perfor the ntersecton operatons between ther quotent sets and the target concept cannot be approxated by usng U ( R R ) 0 TFS
2 Wehua Xu et al: Mult-granulaton Fuzzy Rough Sets n a Fuzzy Tolerance pproxaton Space 47 Case In the process of soe decson akng the decson or the vew of each of decson akers ay be ndependent for the sae proect Case To extract decson rules fro dstrbutve nforaton systes and groups of ntellgent agents for the reducton of the te coplexty of rule extractons t s unnecessary for us to perfor the ntersecton operatons n between all the stes n the context of dstrbutve nforaton systes To overcoe these ltatons Qan and Xu et al extended the awlak rough set to ult-granulaton rough set odels where the approxaton operators are defned by ultple equvalence relatons on the unverse [ ] However the knd of classfcaton s stll restrctve for t pays too uch attenton to the dfferences between obects and gnores the slartes between obects So we wll extend the odels by relaxng the equvalent relatons to tolerance relatons or fuzzy tolerance relatons and by cobnng wth other theores that deal wth uncertanty knowledge such as fuzzy sets ssocated tolerant rough set wth the theory of fuzzy rough set wth granular coputng pont vew we constructed two types of ult-granulaton fuzzy rough set odels on tolerance relatons [6] Moreover there exst ssues whch have to be solved by fuzzy relatons Therefore we propose the optstc and pessstc ult-granulaton fuzzy rough sets odels n a fuzzy tolerance approxaton space n whch the needed relatons are fuzzy ones to extend Skowron s [] and J Järnen s [6] tolerance rough set odel deterned by sngle tolerance relaton nd these odels are fuzzy cases fro the perspectve of both relatons and concepts The rest of ths paper s organzed as follows Soe prelnary concepts of tolerance rough set theory fuzzy rough sets theory and ult-granulaton rough sets are showed n Secton In Secton we represent our acheveents on two types of ult-granulaton fuzzy rough approxaton operators of a fuzzy concept based on ultple ordnary tolerance relatons Then we defne the fuzzy approxatons of the fuzzy rough sets n a fuzzy tolerance approxaton space and analyze the propertes of the n Secton 4 Especally one can fnd that the defnton of lower and upper approxaton operators proposed n ths paper are the generalzed odel of other forats n Secton not only fro the aspects of the consdered concepts but also fro the perspectve of granulaton nd fnally the paper s concluded by a suary n Secton 5 relnares In ths secton we wll frst revew soe basc concepts and notons n the theory of rough set on a tolerance relaton fuzzy rough sets and ult-granulaton rough sets on the bass of equvalence relatons More can be found n ref [ ] The Rough Set on a Tolerance Relaton The noton of nforaton syste provdes a convenent tool for the representaton of obects n ters of ther attrbute values tolerance nforaton syste [] s an ordered trple I = ( U T τ ) where U s the non-epty fnte set of obects known as unverse T s the non-epty fnte set of attrbutes t s the appng fro power set T nto the faly set R of tolerance relatons satsfyng reflexvty and syetry on unverse U Let I = ( U T τ ) be a tolerance nforaton syste for T X U R Rs a relaton wth respect to the attrbutes set Denote R ( x ) = x U ( x x ) R () where { U L then R ( x ) wll be called the tolerance class of x wth respect to the tolerance relaton R Note that a tolerance relaton can construct a coverng nstead of a partton of the unverse U Let I = ( U T τ ) be a tolerance nforaton syste The lower approxaton and upper approxaton of a set X U wth respect to a tolerance relaton R are respectvely defned by R = { x U R( x) X () R = { x U R( x) X The set ndr = R ( ) ( ) X R X s called the boundary of X The set R( X ) conssts of eleents whch surely belong to X n vew of the knowledge provded by R whle R( X ) conssts of eleents whch possbly belong to X The boundary s the actual area of uncertanty It conssts of eleents whose ebershp n X can not be decded when R -related obects can not be dstngushed fro each other Let I = ( U T τ ) be a tolerance nforaton syste The propertes of the lower approxaton and the upper approxaton of sets wth respect to a tolerance relaton R are as follows f X Y U and ~ X s the copleent of X () R X R () R( ) = R( ) = R( U) = R ( U) = U () ~ R = R(~ X)~ R = R(~ X) (4) ndr( X ) = ndr(~ X ) (5) X Y R R ( Y) R R ( Y)
3 48 Internatonal Journal of Fuzzy Systes Vol No 4 Deceber 0 The Fuzzy Set and Fuzzy Rough Set We wll frstly ntroduce soe basc concepts of fuzzy set [] Let U be a fnte and non-epty set called unverse fuzzy set s a appng fro U nto the unt nterval [ 0 ] : μ : [ 0] where each x U s the ebershp degree of x n ractcally we ay consder U as a set of obects of concern and crsp subset of U represents a non-vague" concept posed on obects n U Then a fuzzy set of U s thought of as a atheatcal representaton of vague" concept descrbed lngustcally The set of all the fuzzy sets defned on U s denoted by F( U ) Let and be two fuzzy sets on U the operaton between the are defned as ( )( x) = ax { ( x) ( x) ( )( x) = n { ( x) ( x) () ~ x ( ) = x ( ) ( x) ( x)( x U) Let U be the unverse R be an equvalence relaton for a fuzzy set on U f take R ( )( x ) = { y ( ) y [ x] R (4) R ( )( x) = { y ( ) y [ x] R then R ( ) and R ( ) are called the lower and upper approxaton of the fuzzy set wth respect to the relaton R where " " eans n" and " " eans ax" and [ x ] R s the equvalence class of x wth respect to equvalence relaton R [ 9] s a fuzzy defnable set f and only f satsfes R ( ) = R ( ) therwse s called a fuzzy rough set Let I = ( U T F) be an nforaton syste [9] { F = f n s a set of relatonshp between U and T where f : U V( n) V s the doan of attrbute a and n s the nuber of the attrbutes D : U [ 0 ]( r) f denote D = { D r then ( U T F D ) s a fuzzy target nforaton syste In a fuzzy target nforaton syste we can defne the approxaton operators wth respect the decson attrbute D slarly Let U be the unverse be an equvalence relaton F( U) the fuzzy lower and upper approxaton wth respect to relaton R satsfy the followng propertes () R ( ) R ( ) () R ( ) = R ( ) R ( ) R ( ) = R ( ) R ( ) () R( ) = ~ R(~ ) R( ) = ~ R(~ ) (4) R ( ) R ( ) R ( ) R ( ) R ( ) R ( ) (5) RR ( ( )) = RR ( ( )) = R ( ) (6) RR ( ( )) = RR ( ( )) = R ( ) (7) RU ( ) = U R( ) = (8) R( ) R( ) and R ( ) R ( ) C Mult-granulaton Rough Sets For splcty we ust recall the odels of ult-granulaton rough sets and detals can be seen n ref [6-8 5] Let I = ( U T F) be an nforaton syste T = L s the nuber of the consdered attrbute sets The optstc lower and upper approxatons of the set X U wth respect to T( = L ) are = t= { [ ] = { [ ] = R ( X ) = x U x X t R ( X ) = x U x X = and R s an equvalent relaton wth respect to the attrbutes set Moreover R ( X ) R ( X ) we say that X s the optstc t = = ult-granulaton rough set therwse we say that X s the optstc ult-granulaton defnable set Let I = ( U T F) be an nforaton syste T = L s the nuber of the consdered attrbute sets The pessstc lower and upper approxatons of the set X U wth respect to T( = L ) are where [ x] { x U ( x y) R Moreover = t= { [ ] = { [ ] ϕ = R ( X ) = x U x X t R ( X ) = x U x X t = t= (5) (6) R ( X ) R ( X ) we say that X s the pessstc ult-granulaton rough set therwse we say that X s the pessstc ult-granulaton defnable set Two Types of Mult-granulaton Fuzzy Rough Sets on Tolerance Relatons In ths secton we ake researches about ultgranulaton fuzzy rough set whch are on the proble of the rough approxatons of a fuzzy set on ultple tolerance relatons
4 Wehua Xu et al: Mult-granulaton Fuzzy Rough Sets n a Fuzzy Tolerance pproxaton Space 49 t frst we propose a fuzzy rough set odel (n bref FRS) on a tolerance relaton n the followng Let I = ( U T τ ) be a tolerance nforaton syste T For the fuzzy set X FU ( ) denote R( x) = { X( y) y R( x) (7) R( x) = { X( y) y R( x) where " " eans n" and " " eans ax" then R( X ) and R( X ) are the lower and upper approxaton of the fuzzy set X on the tolerance relaton R wth respect to the subset of attrbutes If R R then the fuzzy set X s a fuzzy rough set on the tolerance relaton We can easly fnd that ths odel wll be the fuzzy rough set odel we have ntroduced n the part of Secton f the above relaton R s an equvalence relaton The ptstc of Mult-granulaton Fuzzy Rough Set on Tolerance Relatons Frst the optstc two-granulaton fuzzy rough set (n bref optstc TGFRS) on tolerance relatons of a fuzzy set s defned Defnton [6]: Let I = ( U T τ ) be a tolerance nforaton syste T For the fuzzy set X FU ( ) denote { { { { R ( x) = X( y) y R ( x) X( y) y R ( x) + R+ ( x) = X( y) y R( x) X( y) y R( x) (8) where" " eans ax and " " eans n then R ( ) + X and R+ ( X ) are respectvely called the optstc two-granulaton lower approxaton and upper approxaton of X on tolerance relatons R wth respect to the subsets of attrbutes and X s a two-granulaton fuzzy rough set on tolerance relatons f and only f R+ ( X ) R+ ( X ) therwse X s a two-granulaton fuzzy defnable set on two tolerance relatons The boundary of the set s X defned as F ndr ( X ) = R ( ) (~ ( )) X R X (9) It can be found that the optstc TGFRS on tolerance relatons wll be degenerated nto fuzzy rough set when = and R( X ) and R ( X ) are equvalence classes wth respect to the subsets of attrbutes and That s to say a fuzzy rough set odel s a specal nstance of the optstc TGFRS on tolerance relatons What s ore the optstc TGFRS on tolerance relatons wll be degenerated nto a rough set odel on a tolerance relaton f = and the consdered concept X s a crsp set In the followng we eploy an exaple to llustrate the above concepts Exaple : fuzzy target nforaton syste s gven n Table The unverse U = { x x L x0 the set of condton attrbutes T = { a a a the set of decson attrbute D = { d If suppose = { a a and = { a a we consder the optstc two-granulaton lower and upper approxaton of D wth respect to and where the tolerance relaton s defned as R = {( x ) ( ) ( ) x U U f x a f x a a For the fuzzy set D = ( ) the sngle-granulaton lower and upper approxatons on a tolerance relaton are R ( ) ( ) D = R ( ) ( ) D = R ( ) ( ) D = R ( ) ( ) D = R ( ) ( ) D = R ( ) ( ) D = Fro Defnton we can copute the optstc two-granulaton lower and upper approxaton of D on tolerance relatons are R ( ) ( ) + D = R ( ) ( ) + D = bvously the followng can be found R + ( D) = R ( D) R ( D) R + ( D) = R ( ) ( ) D R D R ( D) R ( D) D R ( D) R ( D) + + Just fro Defnton we can obtan soe propertes of the optstc TGFRS n a tolerance nforaton syste Table fuzzy target nforaton syste U a a a d x x x x 4 x 5 x 6 x 7 x 8 x 9 x roposton [6]: Let I = ( U T τ ) be a tolerance nforaton syste T and X FU ( ) Then
5 50 Internatonal Journal of Fuzzy Systes Vol No 4 Deceber 0 the followng propertes hold () R + ( X ) X () R+ ( X ) X () R (~ X ) = ~ R ( X ) + + (4) R (~ X ) = ~ R ( X ) + + (5) R ( U ) = R ( U ) = U + + (6) R ( ) = R ( ) = + + (7) R ( X ) R ( R ( X )) (8) R+ ( X ) R+ ( R+ ( X )) roposton [6]: Let I = ( U T τ ) be a tolerance nforaton syste T X Y F( U) Then the followng propertes hold () R ( X Y ) R ( X ) R ( Y ) () R+ ( X Y ) R+ ( X ) R+ ( Y ) () X Y R R ( Y) + + (4) X Y R+ R+ ( Y) (5) R ( X Y ) R ( X ) R ( Y ) (6) R+ ( X Y ) R+ ( X ) R+ ( Y ) Defnton [6]: Let I = ( U T τ ) be a tolerance nforaton syste T For the fuzzy set X FU ( ) denote = = { { ( )( ) = ( )( ) ( ) R X x X y y R x = { { ( )( ) = ( )( ) ( ) R X x X y y R x = (0) where '' '' eans ''ax'' and '' '' eans ''n'' then R ( X ) and R ( X ) are respectvely called the = = optstc ult-granulaton lower approxaton and upper approxaton of X on the tolerance relatons R ( = L ) X s a ult-granulaton fuzzy rough set on the tolerance relatons R ( = L ) f and only f = = R ( X ) R ( X ) therwse X s a ult-granulaton fuzzy defnable set on the tolerance relatons R ( = L ) The boundary of the set X s de- fned as F ndr ( X ) = R ( X ) (~ R ( X )) = = = () It can be found that the optstc MGFRS on the tolerance relatons R ( = L ) wll be degenerated nto fuzzy rough set when = ( ) and R ( x ) are equvalence classes wth respect to the subsets of attrbutes ( = L ) That s to say a fuzzy rough set odel s a specal nstance of the optstc MGFRS on the tolerance relatons esdes ths odel can also be turned the optstc MGRS f the relatons are equvalence relatons and the consdered set s a crsp one What's ore the optstc MGFRS on tolerance relatons wll be degenerated nto a rough set odel on tolerance relatons f = ( ) and the consdered concept X s a crsp set The propertes about optstc MGFRS on tolerance relatons are lsted n the followng whch can be extended fro the optstc TGFRS odel on tolerance relatons roposton [6]: Let I = ( U T τ ) be a tolerance nforaton syste T and X FU ( ) Then the followng propertes hold () R ( X ) X = () R ( X ) X = () R (~ X ) = ~ R ( X ) = = (4) R (~ X ) = ~ R ( X ) = = (5) R ( U ) = R ( U ) = U = = (6) R ( ) = R ( ) = = = (7) R ( X ) R ( R ( X )) (8) = = = R ( X ) R ( R ( X )) = = = roposton 4[6]: Let I = ( U T τ ) be a tolerance nforaton syste T X Y F( U) Then the followng propertes hold () R ( X Y ) R ( X ) R ( Y ) = = = () R ( X Y ) R ( X ) R ( Y ) = = = () X Y R R ( Y) = = (4) X Y R R ( Y) = = (5) R ( X Y ) R ( X ) R ( Y ) = = = (6) R ( X Y ) R ( X ) R ( Y ) = = = The essstc Mult-granulaton Fuzzy Rough Set
6 Wehua Xu et al: Mult-granulaton Fuzzy Rough Sets n a Fuzzy Tolerance pproxaton Space 5 on Tolerance Relatons In ths subsecton we wll propose a pessstc MGFRS on tolerance relatons We frst defne the pessstc two-granulaton fuzzy rough set (n bref pessstc TGFRS) on tolerance relatons Defnton [6]: Let I = ( U T τ ) be a tolerance nforaton syste T For the fuzzy set X FU ( ) denote + + ( )( ) = { ( )( ) ( ) { ( y) y R ( x) ( )( ) = { { ( )( ) ( ) { ( y) y R ( x) R X x X y y R x R X x X y y R x () then R+ ( X ) and R+ ( X ) are respectvely called the pessstc two-granulaton lower approxaton and upper approxaton of X on the tolerance relatons R wth respect to the subsets of attrbutes and X s the pessstc two-granulaton fuzzy rough set on the tolerance relatons f and only f R+ ( X ) R+ ( X ) therwse X s the pessstc two-granulaton fuzzy defnable set on these tolerance relatons The boundary of the set X s defned as S ndr ( X ) = R ( ) ( ~ ( )) X R X () It can be found that the pessstc TGFRS on tolerance relatons wll be degenerated nto the fuzzy rough set odel when = and R( x ) and R ( x ) are equvalence classes wth respect to the subsets of attrbutes and That s a fuzzy rough set odel s a specal nstance of the pessstc TGFRS on tolerance relatons What's ore the pessstc TGFRS on tolerance relatons wll be degenerated nto a rough set odel on a tolerance relaton f = and the consdered concept X s a crsp set In the followng we contnue eg to llustrate the above concepts Exaple : (Contnued fro eg ) Fro Defnton we can copute the pessstc two-granulaton lower and upper approxaton of D on the tolerance relaton R and R are R + ( D) = ( ) ( D) = ( ) R bvously the followng can be found R D = R D R D ( ) ( ) ( ) ( ) = ( ) ( ) ( ) ( ) R ( D) R ( D) + R + D R D R D R D R D D + + roposton 5[6]: Let I = ( U T τ ) be a tolerance nforaton syste T and X FU ( ) Then the followng propertes hold () R+ ( X ) X () R+ ( X ) X () R+ (~ X ) = ~ R+ ( X ) (4) R+ (~ X ) = ~ R+ ( X ) (5) R+ ( U) = R+ ( U) = U (6) R+ ( ) = R+ ( ) = (7) R+ ( X ) R+ ( R+ ( X )) (8) R+ ( X ) R+ ( R+ ( X )) roposton 6[6]: Let I = ( U T τ ) be a tolerance nforaton syste T X Y F( U) Then the followng propertes hold () R+ ( X Y ) = R+ ( X ) R+ ( Y ) () R+ ( X Y ) = R+ ( X ) R+ ( Y ) () X Y R+ R+ ( Y) (4) X Y R+ R+ ( Y) (5) R+ ( X Y ) R+ ( X ) R+ ( Y ) (6) R+ ( X Y ) R+ ( X ) R+ ( Y ) In the followng we wll ntroduce the pessstc ult-granulaton fuzzy rough set (n bref pessstc MGFRS) on tolerance relatons and ts correspondng propertes by extendng the pessstc TGFRS on tolerance relatons Defnton 4[6]: Let I = ( U T τ ) be a tolerance nforaton syste T For the fuzzy set X FU ( ) denote = = { { ( )( ) = ( )( ) ( ) R X x X y y R x = { { ( )( ) = ( )( ) ( ) R X x X y y R x = (4) where '' '' eans ''ax'' and '' '' eans ''n'' then R ( X ) and R ( X ) are respectvely called the = = pessstc ult-granulaton lower approxaton and upper approxaton of X on tolerance relatons R wth respect to the subsets of attrbutes ( = L ) X s the pessstc ult-granulaton fuzzy rough set f and only f R ( X ) R ( X ) therwse X s = = the pessstc ult-granulaton fuzzy defnable set on any tolerance relatons The boundary of the set X s defned as
7 5 Internatonal Journal of Fuzzy Systes Vol No 4 Deceber 0 ( ) nd X = R ( X ) (~ R ( X )) F R = = = (5) It can be found that the pessstc MGFRS wll be degenerated nto fuzzy rough set when = ( ) and R ( x ) are equvalence classes wth respect to the subsets of attrbutes ( = L ) That s a fuzzy rough set odel s also a specal nstance of the pessstc MGFRS on tolerance relatons esdes ths odel can also been turned the pessstc MGRS f the relatons are equvalence relatons and the consdered set s a crsp one What's ore the pessstc MGFRS odel wll be degenerated nto a rough set odel on a tolerance relaton f = ( ) and the consdered concept X s a crsp set The propertes about the pessstc MGFRS on tolerance relatons are lsted n the followng whch can be extended fro the pessstc TGFRS odel on tolerance relatons roposton 7[6]: Let I = ( U T τ ) be a tolerance nforaton syste T and X FU ( ) Then the followng propertes hold () R ( X ) X = () R ( X ) X = () R (~ X ) = ~ R ( X ) = = (4) R (~ X) = ~ R = = (5) R ( U ) = R ( U ) = U = = (6) R ( ) = R ( ) = = = (7) R ( X ) R ( R ( X )) = = = (8) R ( X ) R ( R ( X )) = = = roposton 8[6]: Let I = ( U T τ ) be a tolerance nforaton syste T X Y F( U) Then the followng propertes hold () R ( X Y ) = R ( X ) R ( Y ) = = = () R ( X Y ) = R ( X ) R ( Y ) = = = () X Y R R ( Y) = = (4) (5) (6) X Y R R ( Y) = = R ( X Y ) R ( X ) R ( Y ) = = = R ( X Y ) R ( X ) R ( Y ) = = = n the bass of tolerance relatons we wll nvestgate the nterrelatonshps aong SGFRS the optstc MGFRS and the pessstc MGFRS after the dscusson of the propertes of the roposton 9[6]: Let I = ( U T τ ) be a tolerance nforaton syste T X FU ( ) Then the followng propertes hold () () () (4) (5) (6) (7) (8) R ( X ) = R ( X ) = = = U R ( X ) = R ( X ) = = I R ( X ) = R ( X ) = = I R ( X ) = R ( X ) = U R ( X ) R ( X ) R ( X ) U = = = R ( X ) R ( X ) R ( X ) U = = = R ( X ) R ( X ) R ( X ) = = R ( X ) R ( X ) R ( X ) = = 4 Two Type of Mult-granulaton Fuzzy Rough Sets n a Fuzzy Tolerance pproxaton Space In ths secton we wll propose two types of MGFRS odels n a tolerance approxaton space n whch the relatons are fuzzy tolerance relatons and the characterzed concepts are fuzzy sets The propertes of the approxatons wll be showed Then the optstc Mult-granulaton fuzzy rough sets wll be ntroduced frstly The ptstc Mult-granulaton Fuzzy Rough Sets n a Fuzzy Tolerance pproxaton Space ( U R ) s a fuzzy tolerance approxaton space where U s a non-epty fnte set of obects known as unverse R U U s a faly set of fuzzy tolerance relatons [0] satsfyng () Reflexvty: Rxx ( ) = x U
8 Wehua Xu et al: Mult-granulaton Fuzzy Rough Sets n a Fuzzy Tolerance pproxaton Space 5 () Syetry: Rxy ( ) = Ryx ( ) xy U In the followng we wll frstly defne the SGFRS n a fuzzy tolerance approxaton space Defnton 4: Let ( U R ) be a fuzzy tolerance fuzzy approxaton space R be a fuzzy tolerance relaton For the fuzzy set X FU ( ) denote RX ( )( x)= X( y) ( Rxy ( )) { RX ( )( x)= X( y) Rxy ( ) (6) then RX ( ) and RX ( ) are respectvely called the sngle-granulaton fuzzy lower and fuzzy upper approxatons of X on a fuzzy tolerance relaton X s a sngle-granulaton fuzzy rough set on a fuzzy tolerance relaton f and only f RX ( ) = RX ( ) therwse X s a sngle-granulaton fuzzy defnable set on the fuzzy tolerance relaton roposton 4: Let ( U R ) be a fuzzy tolerance fuzzy approxaton space R be a fuzzy tolerance relaton For the fuzzy set X Y F( U) we have () RX ( ) X () RX ( ) X () R(~ X) = ~ R (4) R(~ X) = ~ R (5) RU ( ) = RU ( ) = U (6) R( ) = R( ) = (7) RX ( Y) = RX ( ) RY ( ) (8) RX ( Y) = RX ( ) RY ( ) roof: We only prove the odd tes the rest can be proved slarly () Snce Rxx ( )= then X ( y) ( R( x y)) X( x) ( R( x x)) = X( x) Thus RX ( ) X () Fro Defnton 4 we have R(~ X)( x)= ( X( y)) ( R( x y)) { X y R x y = ( ) ( ) = ~ RX ( )( x) that s R(~ X) = ~ R (5) x U U( x) = and Rxx ( )= we have RU ( )( x) = U( y) ( R( x y)) = U( y) = = U( x) and RU ( )( x) = U( y) R( x y) = R( x y) = = U( x) Therefore RU ( ) = RU ( ) = U (7) x U X Y F( U) RX ( Y)( x)= ( XY)( y) ( Rxy ( )) {( X( y) ( R( x y) )) ( Y( y) ( R( x y) )) { ( X( y) ( R( x y) )) ( Y( y) ( R( x y) )) = = = RX ( ) RY ( ) Now we wll gve the defnton of the optstc ult-granulaton fuzzy rough set (n bref MGFRS) n a fuzzy tolerance approxaton space Defnton 4: Let ( U R ) be a fuzzy tolerance fuzzy approxaton space R( )be fuzzy tolerance relatons For the fuzzy set X FU ( ) denote then = = = { { y U R ( x)= X( y) ( R ( x y)) = { { y U R ( x)= X( y) R ( x y) R and = = (7) R are respectvely called the optstc ult-granulaton fuzzy lower and fuzzy upper approxatons of X on fuzzy tolerance relatons X s an optstc ult-granulaton fuzzy rough set n a fuzzy tolerance approxaton space f and only f = = R R therwse X s a ult-granulaton fuzzy defnable set n a fuzzy tolerance approxaton space We can obtan soe specal cases fro Defnton 4: () If X FU ( ) e X s a fuzzy set and fuzzy tolerance relatons R = R( ) then = = R ( x)= X( y) ( R ( x y)) = R ( x) { R ( x)= X( y) R ( x y) = R ( x) Hence the approxatons can be degenerated nto the ones n Defnton 4 () If X U R U U e X s a crsp set and R( ) are ordnary tolerance relatons R = R( ) then = R ( x)= R ( x)= X( y) ( R ( x y)) = ( y X ( x y) R ( y X y R ( x)) R ( x) X = R ( x)= R ( x)= y U stx ( y) = R ( x y) = X R ( x)
9 54 Internatonal Journal of Fuzzy Systes Vol No 4 Deceber 0 That s to say they can be changed to () () If X FU ( ) R( ) are ordnary tolerance relatons and R = R( ) then = R ( x)= R ( x) { X y R x y { X y x y R { X y y R x = ( ) ( ( )) = ( ) ) = ( ) ( ) = R ( x)= R ( x) { X( y) R ( x y) { X( y) ( x y) R { X( y) y R ( x) = = = Thus they are consstent to the approxatons n (7) (4) If X U R( ) are classcal equvalence relatons = R ( x)= R X( y) ( R( x y)) = R ( y X ( x y) R) R( y X y [ x] R ) R[ x] X = R { R = R = x U [ x] X = = R ( x)= R y U stx ( y) = R( x y) = R X R ( x) { R = R = x U [ x] X So the approxatons are the sae as the ones n (5) Thus t s easy to fnd that the odel as Defnton 4 showed s a reasonable generalzaton of odels presented n Secton In the followng we wll gve an exaple to llustrate the above defnton Exaple 4: LetU = { x x x x4 x5 x6 X = ( ) and tolerance relatons R S on U U are defned as R = S = Then the sngle-granulaton fuzzy lower and fuzzy upper approxatons of X on fuzzy tolerance relaton R S are respectvely RX ( )=( ) RX ( )=( ) S=( ) S=( ) R S=( ) R S=( ) R S=( ) R S=( ) nd the optstc ult-granulaton fuzzy lower and fuzzy upper approxatons of X on fuzzy tolerance relatons RSare R+ S =( ) R+ S =( ) We fnd that R+ S = R S R+ S = R S R S R+ S X R+ S R S Just fro Defnton 4 we can prove the followng propertes about the optstc ult-granulaton fuzzy rough set n fuzzy tolerance approxaton space hold roposton 4: Let ( U R ) be a fuzzy tolerance fuzzy approxaton space R( )be fuzzy tolerance relatons For the fuzzy set X FU ( ) the followng propertes hold () () () (4) (5) (6) = = R X R X = = = R (~ X) ~ R = = = R (~ X) ~ R = = R ( U) = R ( U) = U R = = ( ) = R ( ) =
10 Wehua Xu et al: Mult-granulaton Fuzzy Rough Sets n a Fuzzy Tolerance pproxaton Space 55 (7) = = = R U R = = = (8) R I R roof: They are straghtforward fro Defnton 4 and roposton 4 roposton 4: Let ( U R ) be a fuzzy tolerance fuzzy approxaton space R( )be fuzzy tolerance relatons For the fuzzy set X Y F( U) the followng propertes hold () R ( X Y) = ( R R( Y) ) U = = () R ( X Y) = ( R R( Y) ) () (4) (5) (6) (7) I = = = = = R ( X Y) R R ( Y) = = = X Y R R ( Y) = = R ( X Y) R R ( Y) = = X Y R R ( Y) = = = R ( X Y) R R ( Y) = = = (8) R ( X Y) R R ( Y) roof: We only prove the odd tes and the others can be proved slarly () X Y F( U) ( ) ( ) = = = = R ( X Y) U R ( X Y) = U R R ( Y) () x U X Y F( U) = R ( X Y) U = ( R X R Y ) = ( ) ( ) UR UR( Y) = = (5) If X Y then X Y= X It follows fro () that = = = = R R R ( Y) = = = R R ( Y) = = R ( X Y)= R R R ( Y) (7) It s clear that X X Y andy X Y It follows that and Hence = = R ( X Y) R R X Y R Y = = = = = ( ) ( ) R ( X Y) R R ( Y) The essstc Mult-granulaton Fuzzy Rough Sets n a Fuzzy Tolerance pproxaton Space In ths subsecton we wll gve the defnton of the pessstc ult-granulaton fuzzy rough set (n bref MGFRS) n a fuzzy tolerance approxaton space Defnton 4: Let ( U R ) be a fuzzy tolerance fuzzy approxaton space R( )be fuzzy tolerance relatons For the fuzzy set X FU ( ) denote R ( x)= { { X( y) ( R( x y)) = = (8) R ( x)= { X( y) R( x y) then = = R ( X ) and = y U = R ( X ) are respectvely called the pessstc ult-granulaton fuzzy lower and fuzzy upper approxatons of X on fuzzy tolerance relatons X s a MGFRS n a fuzzy tolerance approxaton space f and only f = = R R therwse X s a ult-granulaton fuzzy defnable set n a fuzzy tolerance approxaton space We can obtan soe specal cases fro Defnton 4: () If X FU ( ) e X s a fuzzy set and fuzzy tolerance relatons R = R( ) then = = R ( x)= X( y) ( R ( x y)) = R ( x) { R ( x)= X( y) R ( x y) = R ( x) Hence the approxatons can also be degenerated nto the ones n Defnton 4 () If X U R U U e X s a crsp set and R( ) are ordnary tolerance relatons R = R( ) then = R ( x)= R ( x)= X( y) ( R ( x y)) = ( y X ( x y) R ( y X y R ( x)) R ( x) X
11 56 Internatonal Journal of Fuzzy Systes Vol No 4 Deceber 0 = R ( x)= R ( x)= y U stx ( y) = R ( x y) = X R ( x) That s to say they can be changed to () () If X FU ( ) R( ) are ordnary tolerance relatons and R = R( ) then = = R ( x)= R ( x) { X y R x y { X y x y R { X y y R x = ( ) ( ( )) = ( ) ) = ( ) ( ) R ( x)= R ( x) { X( y) R ( x y) { X( y) ( x y) R { X( y) y R ( x) = = = Thus they are consstent to the approxatons n (7) (4) If X U R( ) are classcal equvalence relatons = R ( x)= R X( y) ( R( x y)) = R ( y X ( x y) R) R( y X y [ x] R ) R[ x] X = R { R = R = x U [ x] X = R ( x)= = R y U stx ( y) = R( x y) = R X R ( x) { R = R = x U [ x] X So the approxatons are the sae as the ones n (6) Thus t s easy to fnd that the odel as Defnton 4 showed s also a reasonable generalzaton of odels presented n Secton Exaple 4: (Contnued fro eg 4) Fro Defnton 4 we can copute the pessstc fuzzy lower and upper approxatons of X n the sae fuzzy tolerance space as follows R+ S =( ) R+ S =( ) We fnd that R+ S = R S R+ S = R S R+ S RS X RS R+ S Fro Defnton 4 we can prove the followng propertes about the MGFRS n a fuzzy tolerance approxaton space hold roposton 44: Let ( U R ) be a fuzzy tolerance fuzzy approxaton space R( )be fuzzy tolerance relatons For the fuzzy set X FU ( ) the followng propertes hold () () () (4) (5) (6) (7) = = R X R X = = = R (~ X) ~ R = = = R (~ X) ~ R = = R ( U) = R ( U) = U R = = ( ) = R ( ) = = = = R I R = = = (8) R U R roof: They are straghtforward fro Defnton 4 and roposton 4 roposton 45: Let ( U R ) be a fuzzy tolerance fuzzy approxaton space R( )be fuzzy tolerance relatons For the fuzzy set X Y F( U) the followng propertes hold () R ( X Y) = ( R R( Y) ) I = = () R ( X Y) = ( R R( Y) ) () (4) (5) (6) U = = = = = R ( X Y)= R R ( Y) = = = X Y R R ( Y) = = R ( X Y)= R R ( Y) = = X Y R R ( Y)
12 Wehua Xu et al: Mult-granulaton Fuzzy Rough Sets n a Fuzzy Tolerance pproxaton Space 57 (7) = = = R ( X Y) R R ( Y) = = = (8) R ( X Y) R R ( Y) roof: We only prove the odd tes and the others can be proved slarly () X Y F( U) ( ) ( ) = = = = R ( X Y) I R ( X Y) = I R R ( Y) () x U X Y F( U) = R ( X Y) I = ( R X R Y ) = ( ) ( ) = IR IR( Y) = = (5) If X Y then X Y= X It follows fro () that = = = = = R = R R ( Y) = = = R R ( Y) = = R ( X Y)= R R R ( Y) (7) It s clear that X X Y andy X Y It follows that and Hence = = R ( X Y) R R ( X Y) R ( Y) = = = = = R ( X Y) R R ( Y) roposton 46: Let ( U R ) be a fuzzy tolerance fuzzy approxaton space R( )be fuzzy tolerance relatons For the fuzzy set X FU ( ) the followng propertes hold () () = = R R R = = R R R () U R R = = = = (4) R U R = = R I R I R R = roof: The frst two tes are straghtforward to prove by roposton 4 and 44 We ust prove te () and = te (4) can be proved slarly by te () Snce x y U we have U I R R R = = R( x y) R( x y) R( x y) = = = = U I = = then by te () R ( x y) R ( x y) R ( x y) R ( x) R ( x) R ( x) = = = = U R R R and R R I R hold Ths proposton exposes the relatonshps aong SGFRS MGFRS and MGFRS n a fuzzy tolerance approxaton space 5 Conclusons The theory of rough sets has been sgnfcantly extended fro the pont vew of granular coputng by cobnng the theory of fuzzy sets The theory of fuzzy sets pays ore attenton to the fuzzness of knowledge whle the theory of rough sets to the roughness of knowledge n the pont vew of granular of knowledge For the copleent of the two types of theory fuzzy rough set odels are nvestgated to solve practcal proble Gven that the equvalence relaton n the fuzzy rough set theory s too rgorous for soe practcal applcaton t s necessary to weaken the equvalence relatons to tolerance relatons or fuzzy relatons The contrbuton of ths paper s havng constructed two new types of fuzzy rough set on fuzzy tolerance relatons assocated wth granular coputng called ult-granulaton fuzzy rough set odels n a fuzzy tolerance approxaton space n whch the set approxaton operators are defned on the bass of ultple fuzzy tolerance relatons What's ore we ake conclusons that fuzzy rough set odel rough set odel on a tolerance relaton and ult-granulaton rough sets odels are specal cases of the two types of ult-granulaton fuzzy rough set n a fuzzy tolerance approxaton space by analyzng the defntons of the More propertes of the two odels are dscussed and coparsons are ade wth fuzzy rough set on a tolerance relaton The constructon of the new types of fuzzy rough set odels n a fuzzy tolerance approxaton space are extensons n the pont vew of granular coputng and are eanngful n ters of the generalzaton of rough set theory
13 58 Internatonal Journal of Fuzzy Systes Vol No 4 Deceber 0 cknowledgent Ths work s supported by the Natonal Natural Scence Foundaton of Chna (No and 007) the Natonal Natural Scence Foundaton of Chongqng (Nocstc04007) and the ostdoctoral Scence Foundaton of Chna (No00048) References [] V S nanthanarayana M M Narasha and D K Subraanan Tree structure for effcent data nng usng rough sets attern Recognton Letter vol 4 pp [] I Düntsch and G Gedga Uncertanty easures of rough set predcton rtfcal Intellgence vol 06 pp [] D Dubos and H rade uttng rough sets and fuzzy sets together In: R Slownsk (Ed) Intellgent Decson Support: Handbook of pplcatons and dvances of the Sets Theory Kluwer Dordrecht pp 0-99 [4] J R Hobbs Granularty In: roceedng of Internaton Jont Conference on rtfcal Intellgence Los ngeles pp [5] G Jeon D K and J Jeong Rough sets attrbutes reducton based expert syste n nterlaced vdeo sequences IEEE Transactons on Consuer Electroncs vol 5 pp [6] J Järnen pproxatons and rough sets based on tolerances Sprnger erln/hedelberg pp [7] M Khan and M aneree Multple-Source approxaton systes: ebershp functons and ndscernblty roceedng of The Thrd Internatonal Conference on Rough Sets and Knowledge Technology Chengdu Chna vol 4 pp [8] J Y Lang C Y Dang K S Chn and C M Ya Rchard new ethod for easurng uncertanty and fuzzness n rough set theory Internatonal Journal of General Systes vol pp [9] J M Ma W X Zhang Y Leung and X X Song Granular coputng and dual Galos connecton Inforaton Scences vol 77 no pp [0] Y uyang Z D Wang and H Zhang n fuzzy rough sets based on tolerance relatons Inforaton Scences vol 80 no 4 pp [] Z awlak Rough sets Internatonal Journal of Coputer and Inforaton Scences vol no 5 pp [] Z awlak Rough Set: Theoretcal spects of Reasonng about Data Kluwer cadec ublshers Dordrecht 99 [] Z awlak and Skowron Rudents of rough sets Inforaton Scences vol [4] Z awlak Rough sets decson algorths and ayes s theore Europe Journal of peratonal Research vol 6 no pp [5] Y H Qan and J Y Lang Rough set ethod based on ult-granulatons The 5th IEEE Internatonal Conference on Cogntve Inforatcs eng Chna 006 [6] Y H Qan J Y Lang Y Y Yao and C H Dang MGRS: ult-granulaton rough set Inforaton Scences vol 80 pp [7] Y H Qan J Y Lang W edrycz and C Y Dang ostve approxaton: n accelerator for attrbute reducton n rough set theory rtfcal Intellgence vol 74 pp [8] Y H Qan J Y Lang and W We essstc rough decson In: Second Internatonal Workshop on Rough Sets Theory pp [9] T R Qu Q Lu and H K Huang Granular Coputng pproach to Knowledge Dscovery n Relatonal Databases cta utoatca Snca vol 5 no 8 pp [0] R W Swnarsk and Skowron Rough set ethod n feature selecton and recognton attern Recognton Letter vol 4 pp [] Skowron and J Stepanuk Tolerance approxaton space Fundaental Inforaton vol 7 pp [] W Z Wu Y Leung and J S M Granular Coputng and Knowledge Reducton n Foral Contexts IEEE Transactons on Knowledge and Data Engneerng vol no 0 pp [] Z Xu X G Hu and H Wang general rough set odel based on tolerance Internatonal cadec ublshers World ublshng Corporaton pp [4] W H Xu X Y Zhang and W X Zhang Knowledge granulaton knowledge entropy and knowledge uncertanty easure n ordered nforaton systes ppled soft coputng pp [5] W H Xu X Y Zhang and W X Zhang Two new types of ult-granulaton rough set Inforaton Scences (Subtted) [6] W H Xu Q R Wang and X T Zhang Mult-granulaton Fuzzy Rough Set Models on Tolerance Relatons roceedng of The Fourth Internatonal Workshop on dvanced Coputatonal Intellgence Wuhan Hube Chna pp
14 Wehua Xu et al: Mult-granulaton Fuzzy Rough Sets n a Fuzzy Tolerance pproxaton Space 59 [7] Y Y Yao Inforaton granulaton and rough set approxaton Internatonal Journal of Intellgent Systes vol 6 pp [8] Y Y Yao erspectves of granular coputng In: roceedngs of 005 IEEE Internatonal Conference on Granular Coputng vol pp [9] L Zadeh Fuzzy Sets and Inforaton Granularty dvances n fuzzy set theory and applcaton North Holland ublshng sterda 979 [0] W X Zhang Y Lang and W Z Wu Fuzzy nforaton systes and knowledge dscovery In: Inforaton systes and knowledge dscovery Scence ress pp Wehua Xu s a rofessor and Master Supervsor at Chongqng Unversty of Technology R Chna He receved a hd fro X an Jaotong Unversty R Chna n 007 He has publshed over 50 ournal papers Hs an research felds are rough sets fuzzy sets and the atheatcal foundaton of nforaton scence Qaorong Wang s a aster at Chongqng Unversty of Technology R Chna Her an research areas are rough sets fuzzy sets and the atheatcal foundaton of nforaton scence Xantao Zhang s a aster at Chongqng Unversty of Technology R Chna Hs an research areas are rough set and ntellgent coputng
Excess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationDesigning Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate
The Frst Internatonal Senar on Scence and Technology, Islac Unversty of Indonesa, 4-5 January 009. Desgnng Fuzzy Te Seres odel Usng Generalzed Wang s ethod and Its applcaton to Forecastng Interest Rate
More informationThe Parity of the Number of Irreducible Factors for Some Pentanomials
The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationAn improved approach to attribute reduction with covering rough sets
An mproved approach to attrbute reducton wth coverng rough sets Changzhong Wang a,, Baqng Sun b, Qnhua Hu c a Department of Mathematcs, Boha Unversty, Jnzhou, 121000, PRChna b Economy and management school,
More information1 Definition of Rademacher Complexity
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the
More informationFuzzy Boundaries of Sample Selection Model
Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationDetermination of the Confidence Level of PSD Estimation with Given D.O.F. Based on WELCH Algorithm
Internatonal Conference on Inforaton Technology and Manageent Innovaton (ICITMI 05) Deternaton of the Confdence Level of PSD Estaton wth Gven D.O.F. Based on WELCH Algorth Xue-wang Zhu, *, S-jan Zhang
More informationGadjah Mada University, Indonesia. Yogyakarta State University, Indonesia Karangmalang Yogyakarta 55281
Reducng Fuzzy Relatons of Fuzzy Te Seres odel Usng QR Factorzaton ethod and Its Applcaton to Forecastng Interest Rate of Bank Indonesa Certfcate Agus aan Abad Subanar Wdodo 3 Sasubar Saleh 4 Ph.D Student
More informationA Knowledge-Based Feature Selection Method for Text Categorization
A Knowledge-Based Feature Selecton Method for Text Categorzaton Yan Xu,2, JnTao L, Bn Wang,ChunMng Sun,2 Insttute of Coputng Technology,Chnese Acadey of Scences No.6 Kexueyuan South Road, Zhongguancun,Hadan
More informationOur focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.
SSTEM MODELLIN In order to solve a control syste proble, the descrptons of the syste and ts coponents ust be put nto a for sutable for analyss and evaluaton. The followng ethods can be used to odel physcal
More informationXII.3 The EM (Expectation-Maximization) Algorithm
XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles
More informationCollaborative Filtering Recommendation Algorithm
Vol.141 (GST 2016), pp.199-203 http://dx.do.org/10.14257/astl.2016.141.43 Collaboratve Flterng Recoendaton Algorth Dong Lang Qongta Teachers College, Haou 570100, Chna, 18689851015@163.co Abstract. Ths
More informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
More informationThree Algorithms for Flexible Flow-shop Scheduling
Aercan Journal of Appled Scences 4 (): 887-895 2007 ISSN 546-9239 2007 Scence Publcatons Three Algorths for Flexble Flow-shop Schedulng Tzung-Pe Hong, 2 Pe-Yng Huang, 3 Gwoboa Horng and 3 Chan-Lon Wang
More informationSlobodan Lakić. Communicated by R. Van Keer
Serdca Math. J. 21 (1995), 335-344 AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and
More informationCOS 511: Theoretical Machine Learning
COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that
More informationComplement of Type-2 Fuzzy Shortest Path Using Possibility Measure
Intern. J. Fuzzy Mathematcal rchve Vol. 5, No., 04, 9-7 ISSN: 30 34 (P, 30 350 (onlne Publshed on 5 November 04 www.researchmathsc.org Internatonal Journal of Complement of Type- Fuzzy Shortest Path Usng
More informationON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES
Journal of Algebra, Nuber Theory: Advances and Applcatons Volue 3, Nuber, 05, Pages 3-8 ON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES Feldstrasse 45 CH-8004, Zürch Swtzerland e-al: whurlann@bluewn.ch
More informationOn Pfaff s solution of the Pfaff problem
Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of
More informationQuantum Particle Motion in Physical Space
Adv. Studes Theor. Phys., Vol. 8, 014, no. 1, 7-34 HIKARI Ltd, www.-hkar.co http://dx.do.org/10.1988/astp.014.311136 Quantu Partcle Moton n Physcal Space A. Yu. Saarn Dept. of Physcs, Saara State Techncal
More informationSeveral generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c
Internatonal Conference on Appled Scence and Engneerng Innovaton (ASEI 205) Several generaton ethods of ultnoal dstrbuted rando nuber Tan Le, a,lnhe,b,zhgang Zhang,c School of Matheatcs and Physcs, USTB,
More informationChapter 12 Lyes KADEM [Thermodynamics II] 2007
Chapter 2 Lyes KDEM [Therodynacs II] 2007 Gas Mxtures In ths chapter we wll develop ethods for deternng therodynac propertes of a xture n order to apply the frst law to systes nvolvng xtures. Ths wll be
More informationPROBABILITY AND STATISTICS Vol. III - Analysis of Variance and Analysis of Covariance - V. Nollau ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE
ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE V. Nollau Insttute of Matheatcal Stochastcs, Techncal Unversty of Dresden, Gerany Keywords: Analyss of varance, least squares ethod, odels wth fxed effects,
More informationFinite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003
Fnte Vector Space epresentatons oss Bannster Data Asslaton esearch Centre, eadng, UK ast updated: 2nd August 2003 Contents What s a lnear vector space?......... 1 About ths docuent............ 2 1. Orthogonal
More information1 Review From Last Time
COS 5: Foundatons of Machne Learnng Rob Schapre Lecture #8 Scrbe: Monrul I Sharf Aprl 0, 2003 Revew Fro Last Te Last te, we were talkng about how to odel dstrbutons, and we had ths setup: Gven - exaples
More informationWhat is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.
(C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that
More informationFuzzy Logic and Zadeh Algebra
Advances n Pure Matheatcs, 2017, 7, 353-365 http://wwwscrporg/journal/ap ISSN Onlne: 2160-0384 ISSN Prnt: 2160-0368 Fuzzy Logc and Zadeh Algebra Paavo Kukkuranen School of Engneerng Scence, Lappeenranta
More informationFinite Fields and Their Applications
Fnte Felds and Ther Applcatons 5 009 796 807 Contents lsts avalable at ScenceDrect Fnte Felds and Ther Applcatons www.elsever.co/locate/ffa Typcal prtve polynoals over nteger resdue rngs Tan Tan a, Wen-Feng
More informationAN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU
AN ANALYI OF A FRACTAL KINETIC CURE OF AAGEAU by John Maloney and Jack Hedel Departent of Matheatcs Unversty of Nebraska at Oaha Oaha, Nebraska 688 Eal addresses: aloney@unoaha.edu, jhedel@unoaha.edu Runnng
More informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationFUZZY MODEL FOR FORECASTING INTEREST RATE OF BANK INDONESIA CERTIFICATE
he 3 rd Internatonal Conference on Quanttatve ethods ISBN 979-989 Used n Econoc and Busness. June 6-8, 00 FUZZY ODEL FOR FORECASING INERES RAE OF BANK INDONESIA CERIFICAE Agus aan Abad, Subanar, Wdodo
More informationAn Optimal Bound for Sum of Square Roots of Special Type of Integers
The Sxth Internatonal Syposu on Operatons Research and Its Applcatons ISORA 06 Xnang, Chna, August 8 12, 2006 Copyrght 2006 ORSC & APORC pp. 206 211 An Optal Bound for Su of Square Roots of Specal Type
More informationResearch Article Relative Smooth Topological Spaces
Advances n Fuzzy Systems Volume 2009, Artcle ID 172917, 5 pages do:10.1155/2009/172917 Research Artcle Relatve Smooth Topologcal Spaces B. Ghazanfar Department of Mathematcs, Faculty of Scence, Lorestan
More informationStatistical analysis of Accelerated life testing under Weibull distribution based on fuzzy theory
Statstcal analyss of Accelerated lfe testng under Webull dstrbuton based on fuzzy theory Han Xu, Scence & Technology on Relablty & Envronental Engneerng Laboratory, School of Relablty and Syste Engneerng,
More informationSolving Fuzzy Linear Programming Problem With Fuzzy Relational Equation Constraint
Intern. J. Fuzz Maeatcal Archve Vol., 0, -0 ISSN: 0 (P, 0 0 (onlne Publshed on 0 Septeber 0 www.researchasc.org Internatonal Journal of Solvng Fuzz Lnear Prograng Proble W Fuzz Relatonal Equaton Constrant
More informationCentroid Uncertainty Bounds for Interval Type-2 Fuzzy Sets: Forward and Inverse Problems
Centrod Uncertanty Bounds for Interval Type-2 Fuzzy Sets: Forward and Inverse Probles Jerry M. Mendel and Hongwe Wu Sgnal and Iage Processng Insttute Departent of Electrcal Engneerng Unversty of Southern
More informationRoot Structure of a Special Generalized Kac- Moody Algebra
Mathematcal Computaton September 04, Volume, Issue, PP8-88 Root Structu of a Specal Generalzed Kac- Moody Algebra Xnfang Song, #, Xaox Wang Bass Department, Bejng Informaton Technology College, Bejng,
More informationTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Te and Space Coplexty Reducton of a Cryptanalyss Algorth Mohaad Ghasezadeh Electrcal and Coputer Engneerng Departent, Yazd Unversty, Yazd, Iran.ghasezadeh@yazdun.ac.r Receved: /4/6; Accepted: /5/4 Pages:
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationMatrix-Norm Aggregation Operators
IOSR Journal of Mathematcs (IOSR-JM) e-issn: 78-578, p-issn: 39-765X. PP 8-34 www.osrournals.org Matrx-Norm Aggregaton Operators Shna Vad, Sunl Jacob John Department of Mathematcs, Natonal Insttute of
More informationDiscretization of Continuous Attributes in Rough Set Theory and Its Application*
Dscretzaton of Contnuous Attrbutes n Rough Set Theory and Its Applcaton* Gexang Zhang 1,2, Lazhao Hu 1, and Wedong Jn 2 1 Natonal EW Laboratory, Chengdu 610036 Schuan, Chna dylan7237@sna.com 2 School of
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationInternational Journal of Mathematical Archive-9(3), 2018, Available online through ISSN
Internatonal Journal of Matheatcal Archve-9(3), 208, 20-24 Avalable onlne through www.ja.nfo ISSN 2229 5046 CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS T. SHEKAR GOUD, JAGAN MOHAN RAO M AND N.CH.
More informationOn the number of regions in an m-dimensional space cut by n hyperplanes
6 On the nuber of regons n an -densonal space cut by n hyperplanes Chungwu Ho and Seth Zeran Abstract In ths note we provde a unfor approach for the nuber of bounded regons cut by n hyperplanes n general
More informationValuated Binary Tree: A New Approach in Study of Integers
Internatonal Journal of Scentfc Innovatve Mathematcal Research (IJSIMR) Volume 4, Issue 3, March 6, PP 63-67 ISS 347-37X (Prnt) & ISS 347-34 (Onlne) wwwarcournalsorg Valuated Bnary Tree: A ew Approach
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationSoft Neutrosophic Bi-LA-semigroup and Soft Neutrosophic N-LA-seigroup
Neutrosophc Sets and Systems, Vol. 5, 04 45 Soft Neutrosophc B-LA-semgroup and Soft Mumtaz Al, Florentn Smarandache, Muhammad Shabr 3,3 Department of Mathematcs, Quad--Azam Unversty, Islamabad, 44000,Pakstan.
More informationFermi-Dirac statistics
UCC/Physcs/MK/EM/October 8, 205 Fer-Drac statstcs Fer-Drac dstrbuton Matter partcles that are eleentary ostly have a type of angular oentu called spn. hese partcles are known to have a agnetc oent whch
More informationSome Concepts on Constant Interval Valued Intuitionistic Fuzzy Graphs
IOS Journal of Mathematcs (IOS-JM) e-issn: 78-578, p-issn: 39-765X. Volume, Issue 6 Ver. IV (Nov. - Dec. 05), PP 03-07 www.osrournals.org Some Concepts on Constant Interval Valued Intutonstc Fuzzy Graphs
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationInternational Journal of Mathematical Archive-3(3), 2012, Page: Available online through ISSN
Internatonal Journal of Mathematcal Archve-3(3), 2012, Page: 1136-1140 Avalable onlne through www.ma.nfo ISSN 2229 5046 ARITHMETIC OPERATIONS OF FOCAL ELEMENTS AND THEIR CORRESPONDING BASIC PROBABILITY
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationThe Quadratic Trigonometric Bézier Curve with Single Shape Parameter
J. Basc. Appl. Sc. Res., (3541-546, 01 01, TextRoad Publcaton ISSN 090-4304 Journal of Basc and Appled Scentfc Research www.textroad.com The Quadratc Trgonometrc Bézer Curve wth Sngle Shape Parameter Uzma
More informationChapter 13. Gas Mixtures. Study Guide in PowerPoint. Thermodynamics: An Engineering Approach, 5th edition by Yunus A. Çengel and Michael A.
Chapter 3 Gas Mxtures Study Gude n PowerPont to accopany Therodynacs: An Engneerng Approach, 5th edton by Yunus A. Çengel and Mchael A. Boles The dscussons n ths chapter are restrcted to nonreactve deal-gas
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationDenote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form
SET OF METHODS FO SOUTION THE AUHY POBEM FO STIFF SYSTEMS OF ODINAY DIFFEENTIA EUATIONS AF atypov and YuV Nulchev Insttute of Theoretcal and Appled Mechancs SB AS 639 Novosbrs ussa Introducton A constructon
More informationNew Approach to Fuzzy Decision Matrices
Acta Polytecnca Hungarca Vol. 14 No. 5 017 New Approac to Fuzzy Decson Matrces Pavla Rotterová Ondře Pavlačka Departent of Mateatcal Analyss and Applcatons of Mateatcs Faculty of cence Palacký Unversty
More informationSmarandache-Zero Divisors in Group Rings
Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the
More informationNeryškioji dichotominių testo klausimų ir socialinių rodiklių diferencijavimo savybių klasifikacija
Neryškoj dchotomnų testo klausmų r socalnų rodklų dferencjavmo savybų klasfkacja Aleksandras KRYLOVAS, Natalja KOSAREVA, Julja KARALIŪNAITĖ Technologcal and Economc Development of Economy Receved 9 May
More informatione companion ONLY AVAILABLE IN ELECTRONIC FORM
e copanon ONLY AVAILABLE IN ELECTRONIC FORM Electronc Copanon Decson Analyss wth Geographcally Varyng Outcoes: Preference Models Illustratve Applcatons by Jay Son, Crag W. Krkwood, L. Robn Keller, Operatons
More informationarxiv: v2 [math.co] 3 Sep 2017
On the Approxate Asyptotc Statstcal Independence of the Peranents of 0- Matrces arxv:705.0868v2 ath.co 3 Sep 207 Paul Federbush Departent of Matheatcs Unversty of Mchgan Ann Arbor, MI, 4809-043 Septeber
More informationSubset Topological Spaces and Kakutani s Theorem
MOD Natural Neutrosophc Subset Topologcal Spaces and Kakutan s Theorem W. B. Vasantha Kandasamy lanthenral K Florentn Smarandache 1 Copyrght 1 by EuropaNova ASBL and the Authors Ths book can be ordered
More informationCHAPTER 4 MAX-MIN AVERAGE COMPOSITION METHOD FOR DECISION MAKING USING INTUITIONISTIC FUZZY SETS
56 CHAPER 4 MAX-MIN AVERAGE COMPOSIION MEHOD FOR DECISION MAKING USING INUIIONISIC FUZZY SES 4.1 INRODUCION Intutonstc fuzz max-mn average composton method s proposed to construct the decson makng for
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationSmooth Neutrosophic Topological Spaces
65 Unversty of New Mexco Smooth Neutrosophc opologcal Spaces M. K. EL Gayyar Physcs and Mathematcal Engneerng Dept., aculty of Engneerng, Port-Sad Unversty, Egypt.- mohamedelgayyar@hotmal.com Abstract.
More informationComputational and Statistical Learning theory Assignment 4
Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}
More informationThe Impact of the Earth s Movement through the Space on Measuring the Velocity of Light
Journal of Appled Matheatcs and Physcs, 6, 4, 68-78 Publshed Onlne June 6 n ScRes http://wwwscrporg/journal/jap http://dxdoorg/436/jap646 The Ipact of the Earth s Moeent through the Space on Measurng the
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationOrientation Model of Elite Education and Mass Education
Proceedngs of the 8th Internatonal Conference on Innovaton & Management 723 Orentaton Model of Elte Educaton and Mass Educaton Ye Peng Huanggang Normal Unversty, Huanggang, P.R.Chna, 438 (E-mal: yepeng@hgnc.edu.cn)
More informationApproximate Technique for Solving Class of Fractional Variational Problems
Appled Matheatcs, 5, 6, 837-846 Publshed Onlne May 5 n ScRes. http://www.scrp.org/journal/a http://dx.do.org/.436/a.5.6578 Approxate Technque for Solvng Class of Fractonal Varatonal Probles Ead M. Soloua,,
More informationA Radon-Nikodym Theorem for Completely Positive Maps
A Radon-Nody Theore for Copletely Postve Maps V P Belavn School of Matheatcal Scences, Unversty of Nottngha, Nottngha NG7 RD E-al: vpb@aths.nott.ac.u and P Staszews Insttute of Physcs, Ncholas Coperncus
More informationDouble Layered Fuzzy Planar Graph
Global Journal of Pure and Appled Mathematcs. ISSN 0973-768 Volume 3, Number 0 07), pp. 7365-7376 Research Inda Publcatons http://www.rpublcaton.com Double Layered Fuzzy Planar Graph J. Jon Arockaraj Assstant
More informationKeyword Reduction for Text Categorization using Neighborhood Rough Sets
IJCSI Internatonal Journal of Computer Scence Issues, Volume 1, Issue 1, No, January 015 ISSN (rnt): 1694-0814 ISSN (Onlne): 1694-0784 www.ijcsi.org Keyword Reducton for Text Categorzaton usng Neghborhood
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationIntroducing Entropy Distributions
Graubner, Schdt & Proske: Proceedngs of the 6 th Internatonal Probablstc Workshop, Darstadt 8 Introducng Entropy Dstrbutons Noel van Erp & Peter van Gelder Structural Hydraulc Engneerng and Probablstc
More informationFREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,
FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then
More informationChapter One Mixture of Ideal Gases
herodynacs II AA Chapter One Mxture of Ideal Gases. Coposton of a Gas Mxture: Mass and Mole Fractons o deterne the propertes of a xture, we need to now the coposton of the xture as well as the propertes
More informationVoting Games with Positive Weights and. Dummy Players: Facts and Theory
Appled Mathematcal Scences, Vol 10, 2016, no 53, 2637-2646 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/ams201667209 Votng Games wth Postve Weghts and Dummy Players: Facts and Theory Zdravko Dmtrov
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationChapter 8 Indicator Variables
Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n
More informationA Method for Filling up the Missed Data in Information Table
A Method for Fllng up the Mssed Data Gao Xuedong, E Xu, L Teke & Zhang Qun A Method for Fllng up the Mssed Data n Informaton Table Gao Xuedong School of Management, nversty of Scence and Technology Beng,
More informationMultipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18
Multpont Analyss for Sblng ars Bostatstcs 666 Lecture 8 revously Lnkage analyss wth pars of ndvduals Non-paraetrc BS Methods Maxu Lkelhood BD Based Method ossble Trangle Constrant AS Methods Covered So
More informationAmusing Properties of Odd Numbers Derived From Valuated Binary Tree
IOSR Journal of Mathematcs (IOSR-JM) e-iss: 78-578, p-iss: 19-765X. Volume 1, Issue 6 Ver. V (ov. - Dec.016), PP 5-57 www.osrjournals.org Amusng Propertes of Odd umbers Derved From Valuated Bnary Tree
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More information1. Statement of the problem
Volue 14, 010 15 ON THE ITERATIVE SOUTION OF A SYSTEM OF DISCRETE TIMOSHENKO EQUATIONS Peradze J. and Tsklaur Z. I. Javakhshvl Tbls State Uversty,, Uversty St., Tbls 0186, Georga Georgan Techcal Uversty,
More information2 Complement Representation PIC. John J. Sudano Lockheed Martin Moorestown, NJ, 08057, USA
The yste Probablty nforaton ontent P Relatonshp to ontrbutng oponents obnng ndependent Mult-ource elefs Hybrd and Pedgree Pgnstc Probabltes ohn. udano Lockheed Martn Moorestown 08057 U john.j.sudano@lco.co
More informationCHAPTER 4. Vector Spaces
man 2007/2/16 page 234 CHAPTER 4 Vector Spaces To crtcze mathematcs for ts abstracton s to mss the pont entrel. Abstracton s what makes mathematcs work. Ian Stewart The man am of ths tet s to stud lnear
More informationA New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems
Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More information