About a Fuzzy Distance between Two Fuzzy Partitions and Application in Attribute Reduction Problem

Size: px
Start display at page:

Download "About a Fuzzy Distance between Two Fuzzy Partitions and Application in Attribute Reduction Problem"

Transcription

1 BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND IORMATION TECHNOLOGIES Volume 6, No 4 Sofa 206 Prt ISSN: ; Ole ISSN: DOI: 0.55/cat About a Fuzzy Dstace betwee Two Fuzzy Parttos ad Applcato Attrbute Reducto Problem Cao Chh Ngha, Demetrovcs Jaos 2, Nguye Log Gag 3, Vu Duc Th 4 People s Polce Academy, Vet Nam 2 Isttute for Computer ad Cotrol (SZTAKI) Hugara Academy of Sceces 3 Isttute of Iformato Techology, VAST, Vet Nam 4 Isttute of Iformato Techology, VNU, Vet Nam Emals: ccgha@gmal.com demetrovcs@sztak.mta.hu lgag@ot.ac.v vdth@vu.edu.v Abstract: Accordg to tradtoal rough set theory approach, attrbute reducto methods are performed o the decso tables wth the dscretzed value doma, whch are decso tables obtaed by dscretzed data methods. I recet years, researches have proposed methods based o fuzzy rough set approach to solve the problem of attrbute reducto decso tables wth umercal value doma. I ths paper, we propose a fuzzy dstace betwee two parttos ad a attrbute reducto method umercal decso tables based o proposed fuzzy dstace. Expermets o data sets show that the classfcato accuracy of proposed method s more effcet tha the oes based fuzzy etropy. Keywords: Fuzzy rough set, fuzzy equvalece relato, fuzzy dstace, decso table, attrbute reducto, reduct.. Itroducto Attrbute reducto s a mportat ssue of data preprocessg steps data mg ad kowledge dscovery. The am of attrbute reducto s elmated redudat attrbutes to ehace the effectveess of data mg algorthms. Rough set theory of Pawlak s a effectve tool to solve the attrbute reducto problem decso tables ad the oe that researchers has performed for a log tme. Rough set based attrbute reducto methods are performed o decso tables wth dscretzed value doma [2-4]. I fact, the attrbute value doma of decso tables ofte cotas umercal values ad cotuous values. For example, the attrbute of body weght ad blood pressure patet data tables s usually umercal value, cotuous value. Whe performg attrbute reducto methods based o rough set, data eeds to be dscretzed. However, these dscretzed methods do ot preserve the tal dfferece 3

2 betwee objects the orgal data, so t reduces the classfcato accuracy after attrbute reducto. To solve the ssue of attrbute reducto decso tables wth umercal value ad cotuous value, recet years, researches have proposed ew methods based o fuzzy rough set approach. D u b o s ad P r a d e [] proposed fuzzy rough set theory s a combato of rough set theory ad fuzzy set theory order to approxmate fuzzy sets based o fuzzy equvalece relato. The fuzzy equvalece s determed by the attrbute value doma. Tradtoal rough set based o smlarty relato to approxmate sets. I rough set theory, two objects are called equvalet o the attrbute set (the smlarty s ) f ther attrbute values are equal o all attrbutes. Coversely, they are ot equal (the smlarty s 0). The fuzzy rough set theory has used the fuzzy equvalece relato to replace the equvalece relato. The value smlarty the rage [0, ] shows the close or smlar propertes of two objects. Therefore, the fuzzy equvalece preserves the dfferece or the smlarty of objects. Attrbute reducto methods based o fuzzy rough set approach has the potetal to preserve the classfcato accuracy after mplemetg attrbute reducto methods. I recet years, the topc of the attrbute reducto based o fuzzy rough set has attracted may researchers [5-4]. Wth attrbute reducto ssue drectly o the decso table based o fuzzy rough set, these related researches are cocerg two ma drectos: fuzzy postve rego approach ad fuzzy etropy approach. Based o fuzzy postve rego, H u, Xe ad Y u [8] proposed FAR-VPFRS algorthm to fd oe fuzzy postve rego reduct whch use the fuzzy membershp fucto. The expermetal data sets show that the classfcato accuracy of FAR- VPFRS algorthm s better tha the oe of algorthm whch use the membershp fucto accordg to tradtoal rough set. Q a et al. [4] proposed FA_FPR algorthm, whch s a mprovemet of FAR-VPFRS [8] terms of executed tme. Accordg to fuzzy etropy approach, H u, Y u ad Xe [7] proposed the fuzzy etropy whch s based o etropy Shao ad troduces FSCE to fd oe reduct usg fuzzy etropy. D a ad Xu [6] proposed fuzzy ga rato based o fuzzy etropy ad troduces GAIN_RATION_AS_FRS to fd oe reduct usg fuzzy ga rato. The expermetal data sets show that the classfcato of FSCE, GAIN_RATION_AS_FRS algorthms are better tha the oes based o tradtoal rough set. Q a et al. [4] who proposed FA_FSCE algorthm, s a mprovemet of FSCE algorthm [7] terms of executed tme. I both drecto approaches, authors [4] have ever evaluated the classfcato accuracy after mplemetg mproved algorthms FA_FPR, FA_FSCE. Wth drect reducto attrbute o the decso table based o fuzzy rough set, the am of ths paper s to propose a ew method whch mproves the classfcato accuracy more tha the prevous oes. I ths paper, we propose the heurstc algorthm to fd a best reducto of the decso table wth umercal attrbute value doma usg a fuzzy dstace. The fuzzy dstace s costructed betwee two parttos. The expermetal results data sets from UCI [7] show that the classfcato accuracy of proposed algorthm s better tha FA_FSCE ad FA_FPR algorthms [4]. The structure of ths paper s as follows. Secto 2 presets some basc cocepts of fuzzy rough set theory. Secto 3 presets the method of costructg the fuzzy dstace betwee two attrbute sets. 4

3 Secto 4 presets a attrbute reducto method usg fuzzy dstace measure. Secto 5 presets expermetal results. Fally, Secto 6 gves a cocluso of ths paper ad subsequet developmets. 2. Basc cocepts I ths secto, we troduce some cocepts rough set theory, fuzzy rough set theory ad some related cocepts fuzzy partto space. DS U, C D, where U be a o-empty fte set; A decso table s a par C s called codtoal attrbute set, D s called decso attrbute set wth C D. DS s called the umercal decso table where the value doma of c C s the umercal for ay c C. Pawlak s tradtoal rough set theory [5] used a equvalece relato to approxmate sets. A subset P C determes equvalece relato o attrbute value doma, deote by IND(P), IND P u, vu U a P, au av, av s deoted as the value attrbute a object v; IND(P) determes the partto o U, deoted by U / IND u. The P ad the equvalece class of u, deoted by P lower approxmato set ad the upper approxmate set of X s defed as ad PX u U u X P U related to P C PX u U u X. D. Dubos ad others proposed the fuzzy rough set whch used fuzzy equvalet to approxmate the fuzzy sets. The decso table wth umercal attrbute doma DS U, C D, the relato R defed o U s called fuzzy smlarty relato f t satsfes the followg codtos [4]: ) Reflectvty: R x, x. 2) Symmetry: R x, y R y, x. 3) Max-m trastvty: R x, z m R x, y, R y, z x, y, z U. Let U be a o-empty fte set ad o U f for ay x, y U, we have: ) RQ x, y RQ x, y, P, for ay R P và 2) R RQ R x, y max x, y, RQ x, y, 3) R RQ R x, y m x, y, RQ x, y, 4) RQ x, y RQ x, y. R Q be a fuzzy equvalece relato 5

4 6 The relato matrx of where pj x, x j R P deoted by M ( ) [ pj ] p p2... p p2 p22... p 2 M( ), p p2... p s the fuzzy relato value of x ad Let DS U, C D s defed as x o P, 0, j p. be a decso table wth umercal attrbutes ad P, Q C. Accordg to [] we have Ra ad Q RQ, t meas that Q x, y m x, y, RQ x, y M R P ap for ay x, y U. Suppose that p ad M ( RQ) q are relatoal matrces of R P, R j j correspodg, the the relatoal matrx o the attrbute sets S P Q s defed as M ( R ) M R s S P Q j For P C, U x,..., x wth sj m pj, qj., the fuzzy partto / P geerated from the fuzzy equvalece relato R P : U / x x,..., x where 2 2 R R R P U R o U ca be, P P P x p / x p / x... p / x s a fuzzy set, s called a fuzzy equvalece of object x. The membershp fucto of objects s determed by x x, x x, x p for ay xj U. The, the cardalty of x R P j j j j x R P fuzzy equvalece s calculated [] as x p Let s called a set of all of fuzzy parttos o U whch determed by fuzzy equvalece o attrbute sets. The s called a fuzzy partto space o U. Thus, the fuzzy partto space s determed by fuzzy equvalece relato whch chose from the attrbute value doma. Let x,..., x partto where j j. be a fuzzy x p / x... p / x. Specally, f p 0,, j, the x 0 ad the fuzzy partto s called the fest oe, wrte as The, x,..., x x j / x j,, j, j 0. where j j j Q. If

5 p,, j, j the x U, the coarsest oe, wrte as j x / x j j,, j, j. relato, ad the fuzzy partto. The, x,..., x s a fuzzy partto space o U, for R P, RQ s called where, the partal order : R R x x, p q,, j, deoted by R Q. Furthermore, P Q RQ j j R P RQ x x, p q,, j, R R j j deoted by RQ; P R P R Q R P R Q ad RQ deoted by R Q. Example. Let,, x, x U x x Q, 2 R 2, P R RQ x P, x RQ 2 RS x, x2, x 0./ x 0.2 / x2 where x 0.2 / x 0.3 / x 2 2 R S R, x 0.2 / x 0.3 / x RQ 2, x 0.3 / x 0.4 / x, The we have 2 RS S R, Q, x 0.4 / x 0.6 / x. 2 2 x, x, RS x, x, RQ RS x x, x x, x x 0.3 RQ RQ x 0.3 / x 0.4 / x, 2 RQ 2 x , RQ x , RS 0.5, x x, x x, x x RQ RS 0.3 RS RQ RS RS 3. Fuzzy dstace betwee two fuzzy parttos ad ts propertes 3.. Fuzzy dstace betwee two fuzzy sets Frstly, we have proposed a dstace measure betwee two fuzzy sets, called a fuzzy dstace. Lemma. Let a, b, m be three real umbers wth a b. The, we have a b m a, m m b, m. 7

6 P r o o f: It s easy to see that a b m a, m m b, m m a, b m a, m b. Ths completes the proof. satsfes: Lemma 2. Let A, B, C be three fuzzy sets o the same uverse U. The, we have: ) If A B the B B C A A C. 2) If A B the C C A C C B. 3) A A B C C A C C B. P r o o f: ) Because of A B, for ay x U we have x B A x. Accordg to Lemma, we have x x m x, x m x, x B A B C A C U U U x x m x, x B A B C U m, A x x B A B C A C B B C A A C. 2) Because of A B, for ay x U B C, we have x x A m x, x m x, B C A C x x m x, x x m x, x U C A C C B C U U x m x, x U C A C C B C C C A C C B x m x, x 3) From A C A, accordg to property ) we have (*) A A B A C A C B.. Furthermore, from A B A, accordg to property 2) we have (**) C C A B C C A. From (*) ad (**) we have A A B C C A A C A C B C C A C A B C C C A. 8

7 Proposto. Let AB, be two fuzzy sets o the same uverse U. The, d A, B A B 2 A B s a dstace measure betwee A ad B. d A, B 0. P r o o f: Obvously, from A A B ad B A B to Furthermore, d A, B d B, A loss of geeralty, oe eeds to prove d A, B d A, C d B, C Lemma 2 (Part 3), we have:. We eed to prove the tragle equalty; wthout (***) A A B C C A C C B, (****) A A C B B A B B C. It s ferred from (***) ad (****), we have. Accordg to A B 2 A B A C 2 A C B C 2 B C, smlarly d A, B d A, C d B, C. Therefore, d A, B s a dstace measure betwee fuzzy set A ad fuzzy set B, called fuzzy dstace. We have proposed a dstace betwee two fuzzy parttos based o fuzzy dstace Fuzzy dstace betwee two fuzzy parttos ad ts propertes Theorem. Let DS U, C D be a decso table, where U x x x, RQ,,..., 2 be two fuzzy parttos duced by two fuzzy equvalece R P, o P, Q C. The () D, RQ s a fuzzy dstace betwee P r o o f: Obvously, D RQ x x 2 x x R R R R P Q P Q, ad RQ., 0 ad P, Q Q, P D R R D R R. We eed to prove the tragle equalty, wthout loss of geeralty, for ay R,, P R Q R S D, RQ D, RS D RQ, RS, ad we prove. ad R Q 9

8 It s ferred from Proposto, for ay x The U we have d x, x d x, x d x, x. RQ RS RQ RS P, Q P, S D R R D R R = x x 2 x x RQ RQ x x 2 x x RS RS It s easy to see that,, d x x RQ d x x RS, d x x R Q R S Q S D R, R. D, RQ 0 RQ ; D, RQ ad RQ, (or, ad RQ ). Therefore, 0 D, RQ. Proposto 2. Let be a fuzzy partto o. The, we have D, D,. P r o o f: Suppose that x, x2,..., x D, 2 x, D R R, K P 2 x we have D, D,.. The R R R P P P P Example 2. Cotug from Example. Accordg to Theorem, we have P, Q 0., D RQ RS D, RS D R R, 0.25,. The, 20

9 Therefore: P Q Q S P S P Q P S Q S Q S P S P Q D R, R D R, R D R, R, D R, R D R, R D R, R, D R, R D R, R D R, R. 4. A fuzzy dstace based attrbute reducto method decso tables wth umercal attrbutes I ths secto, we troduce a fuzzy dstace based attrbute reducto method whch performs drectly o the decso tables wth umercal attrbutes. The ew fuzzy dstace s defed betwee two fuzzy parttos (see Secto 3). DS U, C D be a decso table wth umercal attrbutes, Let U x, x2,..., x. We use a fuzzy equvalece relato defed o codtoal attrbutes. For ay p C, the followg fuzzy equvalece relato R p s ofte used to costruct relatoal matrx M R p p [6] j j j p x p x p x p x 4, 0.25, (2) pj pmax pm pmax pm 0 otherwse, where p x s the value of the attrbute p object x ; pmax, pm are maxmum value, mmum value of the attrbute p, correspodg. IND D ad a equvalece matrx We use a equvalece relato M IND D d j o the decso attrbute set, d j f x x f xj x. I other words, a equvalece class x D D equvalece class, deoted by x j D D ad d 0 j D ca be see as a fuzzy f x, the membershp fucto f x x x ad 0 x x j D The, the fuzzy partto deoted by. j D D x x,..., x. D D D x x j Based o the fuzzy equvalece relato, we propose a fuzzy dstace betwee the codtoal attrbute set ad the decso attrbute set. I Secto 3, the attrbute set P C determed a fuzzy partto. Thus, for smplcty we replace the cocept fuzzy dstace betwee two parttos wth the cocept fuzzy dstace betwee two attrbute sets. D j 2

10 Defto. Let DS U, C D attrbutes,, RQ relatos R P, R Q o P, Q C be a decso table wth umercal be two fuzzy parttos duced by two fuzzy equvalece. The, fuzzy dstace betwee P ad Q, deote by d P, Q, s defed a fuzzy dstace betwee two fuzzy parttos RQ, t meas that d P Q D RQ,,. Proposto 3. Let DS U, C D attrbutes, where U x x x ad be a decso table wth umercal, 2,..., ad R be a fuzzy equvalece relato determed o codtoal attrbutes. The, fuzzy dstace betwee two attrbute sets C ad C D whch s determed as x x C x R RC D (2) d C, C D. P r o o f: From Defto ad Theorem, we have: C CD d C, C D D R, R x x 2 x x RC RCD RC RCD x x x RC RC RD x x x 2 x x RC RC RD RC RD x x x RC RC D. It s easy to see that 0 d C, C D ; d C C D R C D ad d C C D., RC, 0 ad x x Proposto 4. Let DS U, C D attrbutes, where U x, x2,..., x, B C determed o codtoal attrbutes. The, d B B D d C C D D for be a decso table wth umercal ad R be a fuzzy equvalece relato,,. 22

11 P r o o f: From B C, accordg to [4] we have RC RB meas that t ca be ferred from x x that x x For ay x U, we have: RC RB R, whch C for. x x x R R D x x j x x j x x j C C RC RC D j j R B m,, x x x R R D x x j x x j x x j m,. B B RB RB D j j () For ay x x we have j D x x j D, therefore x x C x C x x B x B (2) For ay x x we have 0, therefore j D 0. R R D R R D x x j D x x x x x x x x. RC RC D RC RB From (), (2) we have: RB RB D x x x x x x RB RB D RC RC D x x B x R RB x D x R x R D C C d B, B D d C, C D. It s easy to see that d B, B D d C, C D x x RB RC ay x U. I ext part, we preset a attrbute reducto method of the decso table usg the fuzzy dstace measure Proposto 3. Our method cludes: defg the reduct based o fuzzy dstace, defg the mportace of the attrbute ad desgg a heurstc algorthm to fd the best reduct based o the mportace of the attrbute. DS U, C D be a decso table wth umercal attrbutes, B C If Defto 2. Let ad R be a fuzzy equvalece relato determed o codtoal attrbutes. ) d B, B D d C, C D, 2) bb, d ( B b, B b D) d ( C, C D), the B s a reduct of C based o fuzzy dstace. DS U, C D be a decso table wth umercal Defto 3. Let attrbutes, B C ad b C B. The mportace of attrbute b wth respect to B s defed as SIG b d B, B D B d B b, B b D. for 23

12 24 b. The mportace of b From Proposto 4, we have SIG B 0 SIG B characterzes the classfcato accuracy of attrbute b wth respect to decso attrbute D. It s used as the attrbute selecto crteral for heurstc algorthms to fd the best reduct. Algorthm F_DBAR (Fuzzy dstace based o attrbute reducto): A heurstc algorthm to fd the best reduct by usg fuzzy dstace. Iput: Decso table wth umercal attrbutes DS U, C D equvalece relato R. Output: The best reduct B Step. B ; M( RB ) ;, fuzzy Step 2. Calculate relato matrx M( R C ), calculate equvalece matrx MIND D, calculate fuzzy dstace d C, C D ; //Addg gradually to B a attrbute havg the greatest mportace d B, B D d C, C D do Step 3. Whle Step 4. Beg Step 5. For each a C B calculate SIG B a d B, B D d B a, B a D ; Step 6. Select am C B Step 7. B B a m ; Step 8. Ed; so that SIG B am Max SIG B a //Remove redudat attrbute B Step 9. For each a B Step 0. Beg d B a B a D ; ; ac B Step. Calculate, Step 2. If d B a, B a D d C, C D the B B a ; Step 3. Ed; Step 4. Retur B; DS U, C D be a decso table wth umercal attrbutes Example 3. Let (Table ) where U u, u, u, u, u, u, C c, c, c, c, c, c equvalece relato R s defed the Formula (2). Table. The decso table wth umercal attrbutes u c C C 2 C 3 C 4 C 5 C 6 D u u u u u u , the fuzzy

13 By usg steps of F_DBAR algorthm to fd the best reduct, we have B ; M( RB ) ; d, D 0.375, ad we calculate some relato matrces M ( Rc ), M ( Rc ), M ( Rc ), M ( Rc ), M ( Rc ), M ( Rc ), M ( R C ), ad the equvalece matrx IND M D : M( Rc ), M ( Rc2 ) 0 0 0, M( Rc3 ), M ( Rc4 ) 0 0 0, M ( Rc5 ), M ( Rc6 ), M( RC ), M(INDD) Calculate d C, C D 0, d c, c D , d c2, c2 D , d c c D d c4, c4 D 0., d c c D, ; SIG B c , d c6 c6 D , , 5, , SIG B c , 25

14 B c SIG B c , SIG SIG 3333, Attrbute c 4 s selected. B c SIG B c , Smlarty, d { c4, c},{ c4, c} D 0, checked d { c4, c},{ c4, c} D df C, C D 0, the algorthm fshed ad B c, c. Cosequetly, B c, c of DS. 5. Expermets 4 s the best reduct We select eght data sets wth umercal attrbutes from the UCI repostory [7] to test proposed algorthm Table 2. Evrometal testg s PC wth Petum Core 3, 2.4 GHz CPU, 2 GB RAM, usg Wdows 0 operatg system. 4 Table 2. Data sets the exprmetal aalyss Id Data sets Number of codtoal attrbutes Number of objects Ecol Ioosphere Wdbc (Breast Cacer Wscos) Wpbc (Breast Cacer Wscos) We Glass Soar (Coectost Bech) Heart We select FA_FPR algorthm (Fdg Reduct based o Fuzzy Postve Rego) ad FA_FSCE algorthm (fdg reduct based o fuzzy etropy) [4] to compare wth F_DBAR proposed algorthm o the classfcato accuracy of reduct. The FA_FPR algorthm s a mpovemet of FAR-VPFRS algorthm [8] o executed tme, the FA_FSCE s a mpovemet of FSCE algorthm [7] o executed tme. Accordg to fuzzy rough set approach, the classfcato accuracy of FAR-VPFRS algorthm [8], FSCE algorthm [7] are almost hgher tha the oes rough set approach after dscretzed data. However, authors [] have ot evaluated the classfcato accuracy for algorthms FA_FSCE, FA_FPR. For testg, we perform the followg tasks: ) Code FA_FPR, FA_FSCE ad F_DBAR algorthms by program C#. Algorthms used the fuzzy equvalece relato defed by the formula (2). 2) Execute three algorthms o eght data sets by evromet testg. 3) Use C4.5 algorthm WEKA [8] to evaluate the classfcato accuracy of three algorthms by selectg 2/3 frst objects as trag set ad the remader objects as testg set. 26

15 Table 3 shows the testg results of eght data sets where U s the umber of objects, C s the umber of the codtoal attrbute, R s the umber of attrbute of the reduct for each algorthm. Table 3. The exprmetal result of three algorthms FA_FSCE, FA_FPR, F_DBAR Id Data set U C FA_FSCE Algorthm FA_FPR Algorthm F_DBAR Algorthm R Classfcato accuracy of C4.5 (%) R Classfcato accuracy of C4.5 (%) R Classfcato accuracy of C4.5 (%) Ecol Ioosphere Wdbc Wpbc We Glass Soar Heart The average classfcato accuracy of C FA_FSCE FA_FPR F_DBAR Fg.. The classfcato accuracy C4.5 of FA_FSCE, FA_FPR ad F_DBAR The exprmetal results Table 3 ad Fg. show that the average classfcato accuracy of F_DBAR (used the fuzzy dstace) s hghest, ext to FA_FPR (used fuzzy postve rego) ad FA_FSCE s lowest (used fuzzy etropy). For each data set, the classfcato accuracy of three algorthms are dfferet. Cosequetly, the classfcato accuracy of algorthm F_DBAR s the best oe of three algorthms. 6. Cocluso The am of attrbute reducto the decso table s to mprove the accuracy of classfcato model. Amog attrbute reductos the decso table wth umercal value doma, related researches show that attrbute reducto methods based o fuzzy rough set approach have the classfcato accuracy more hgher tha oe based o tradtoal rough set. I ths paper, we propose a attrbute reducto method o the decso table wth umercal attrbute value whch uses fuzzy dstace based o fuzzy rough set. Our research cludes: proposg a ew 27

16 fuzzy dstace betwee two fuzzy parttos, defg reduct ad mportace of attrbutes based o fuzzy dstace, proposg a heurstc algorthm to fd the best reduct. The expermetal results from data sets show that the classfcato accuracy of fuzzy dstace method s hgher tha that of the oes usg fuzzy postve rego ad fuzzy etropy. Our further research approach ssue s fdg the relato betwee reduct obtaed by dfferet methods to subgroup ad overall evaluato of methods based o fuzzy rough set approach. Ackowledgemets: Ths research has bee fuded by the Research Project, VAST 0.08/6-7. Vetam Academy of Scece ad Techology. R e f e r e c e s. D u b o s, D., H. P r a d e. Rough Fuzzy Sets ad Fuzzy Rough Sets. Iteratoal Joural of Geeral Systems, Vol. 7, 990, pp D e m e t r o v c s, J., V. D. Th, N. L. G a g. A Effcet Algorthm for Determg the Set of All Reductve Attrbutes Icomplete Decso Tables. Cyberetcs ad Iformato Techologes, Vol. 3, 203, No 4, pp D e m e t r o v c s, J., V. D. Th, N. L. G a g. O Fdg All Reducts of Cosstet Decso Tables. Cyberetcs ad Iformato Techologes, Vol. 4, 204, No 4, pp D e m e t r o v c s, J., N. Th, L. H u o g, V. D. Th, N. L. G a g. Metrc Based Attrbute Reducto Method Dyamc Decso Tables. Cyberetcs ad Iformato Techologes, Vol. 6, 206, No 2, pp T s a g, E. C. C., D. G. C h e, D. S. Y e u g, X. Z. W a g, J. W. T. Lee. Attrbutes Reducto Usg Fuzzy Rough Sets. IEEE Tras. Fuzzy Syst., Vol. 6, 2008, pp Da, J., Q. X u. Attrbute Selecto Based o Iformato Ga Rato Fuzzy Rough Set Theory wth Applcato to Tumor Classfcato. Appled Soft Computg, Vol. 3, 203, pp H u, Q., D. R. Y u, Z. X. Xe. Iformato-Preservg Hybrd Data Reducto Based o Fuzzy- Rough Techques. Patter Recogt. Lett., Vol. 27, 2006, No 5, pp H u, Q., Z. X. Xe, D. R. Y u. Hybrd Attrbute Reducto Based o a Novel Fuzzy-Rough Model ad Iformato Graulato. Patter Recogt., Vol. 40, 2007, pp J e s e, R., Q. S h e. Sematcs-Preservg Dmesoalty Reducto: Rough ad Fuzzy- Rough-Based Approaches. IEEE Tras. Kowl. Data Eg., Vol. 6, 2004, No 2, pp J e s e, R., Q. S h e. Fuzzy-Rough Attrbute Reducto wth Applcato to Web Categorzato. Fuzzy Sets Syst., Vol. 4, 2004, pp J e s e, R., Q. S h e. Fuzzy-Rough Sets Asssted Attrbute Reducto. IEEE Tras. Fuzzy Syst., Vol. 5, 2007, No, pp J e s e, R., Q. S h e. New Approaches to Fuzzy-Rough Feature Selecto. IEEE Tras. Fuzzy Syst., Vol. 7, 2009, No 4, pp B h a t t, R. B., M. G o p a l. O Fuzzy-Rough Sets Approach to Feature Selecto. Patter Recogt. Lett., Vol. 26, 2005, pp Q a, Y. H., Q. W a g, H. H. C h e g, J. Y. L a g, C. Y. D a g. Fuzzy-Rough Feature Selecto Accelerator. Fuzzy Sets ad Systems, Vol. 258, 205, pp P a w l a k, Z. Rough Sets: Theoretcal Aspects of Reasog about Data. Lodo, Kluwer Academc Publsher, P a w l a k, Z., J. W. G r z y m a l a-b u s s e, R. S l o w s k, W. Z a k o. Rough Sets. Commu. ACM, Vol. 38, 995, No, pp The UCI Mache Learg Repostory

Generalization of the Dissimilarity Measure of Fuzzy Sets

Generalization of the Dissimilarity Measure of Fuzzy Sets Iteratoal Mathematcal Forum 2 2007 o. 68 3395-3400 Geeralzato of the Dssmlarty Measure of Fuzzy Sets Faramarz Faghh Boformatcs Laboratory Naobotechology Research Ceter vesa Research Isttute CECR Tehra

More information

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc. Research on scheme evaluation method of automation mechatronic systems

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc. Research on scheme evaluation method of automation mechatronic systems [ype text] [ype text] [ype text] ISSN : 0974-7435 Volume 0 Issue 6 Boechology 204 Ida Joural FULL PPER BIJ, 0(6, 204 [927-9275] Research o scheme evaluato method of automato mechatroc systems BSRC Che

More information

Solving Constrained Flow-Shop Scheduling. Problems with Three Machines

Solving Constrained Flow-Shop Scheduling. Problems with Three Machines It J Cotemp Math Sceces, Vol 5, 2010, o 19, 921-929 Solvg Costraed Flow-Shop Schedulg Problems wth Three Maches P Pada ad P Rajedra Departmet of Mathematcs, School of Advaced Sceces, VIT Uversty, Vellore-632

More information

A New Method for Decision Making Based on Soft Matrix Theory

A New Method for Decision Making Based on Soft Matrix Theory Joural of Scetfc esearch & eports 3(5): 0-7, 04; rtcle o. JS.04.5.00 SCIENCEDOMIN teratoal www.scecedoma.org New Method for Decso Mag Based o Soft Matrx Theory Zhmg Zhag * College of Mathematcs ad Computer

More information

MULTIDIMENSIONAL HETEROGENEOUS VARIABLE PREDICTION BASED ON EXPERTS STATEMENTS. Gennadiy Lbov, Maxim Gerasimov

MULTIDIMENSIONAL HETEROGENEOUS VARIABLE PREDICTION BASED ON EXPERTS STATEMENTS. Gennadiy Lbov, Maxim Gerasimov Iteratoal Boo Seres "Iformato Scece ad Computg" 97 MULTIIMNSIONAL HTROGNOUS VARIABL PRICTION BAS ON PRTS STATMNTS Geady Lbov Maxm Gerasmov Abstract: I the wors [ ] we proposed a approach of formg a cosesus

More information

GENERATE FUZZY CONCEPTS BASED ON JOIN-IRREDUCIBLE ELEMENTS

GENERATE FUZZY CONCEPTS BASED ON JOIN-IRREDUCIBLE ELEMENTS GENERATE FUZZY CONCEPTS BASED ON JOIN-IRREDUCIBLE ELEMENTS Hua Mao ad *Zhe Zheg Departmet of Mathematcs ad Iformato Scece Hebe Uversty Baodg 071002 Cha *Author for Correspodece: 373380431@qq.com ABSTRACT

More information

PROJECTION PROBLEM FOR REGULAR POLYGONS

PROJECTION PROBLEM FOR REGULAR POLYGONS Joural of Mathematcal Sceces: Advaces ad Applcatos Volume, Number, 008, Pages 95-50 PROJECTION PROBLEM FOR REGULAR POLYGONS College of Scece Bejg Forestry Uversty Bejg 0008 P. R. Cha e-mal: sl@bjfu.edu.c

More information

MAX-MIN AND MIN-MAX VALUES OF VARIOUS MEASURES OF FUZZY DIVERGENCE

MAX-MIN AND MIN-MAX VALUES OF VARIOUS MEASURES OF FUZZY DIVERGENCE merca Jr of Mathematcs ad Sceces Vol, No,(Jauary 0) Copyrght Md Reader Publcatos wwwjouralshubcom MX-MIN ND MIN-MX VLUES OF VRIOUS MESURES OF FUZZY DIVERGENCE RKTul Departmet of Mathematcs SSM College

More information

PTAS for Bin-Packing

PTAS for Bin-Packing CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,

More information

Bayes (Naïve or not) Classifiers: Generative Approach

Bayes (Naïve or not) Classifiers: Generative Approach Logstc regresso Bayes (Naïve or ot) Classfers: Geeratve Approach What do we mea by Geeratve approach: Lear p(y), p(x y) ad the apply bayes rule to compute p(y x) for makg predctos Ths s essetally makg

More information

ABOUT ONE APPROACH TO APPROXIMATION OF CONTINUOUS FUNCTION BY THREE-LAYERED NEURAL NETWORK

ABOUT ONE APPROACH TO APPROXIMATION OF CONTINUOUS FUNCTION BY THREE-LAYERED NEURAL NETWORK ABOUT ONE APPROACH TO APPROXIMATION OF CONTINUOUS FUNCTION BY THREE-LAYERED NEURAL NETWORK Ram Rzayev Cyberetc Isttute of the Natoal Scece Academy of Azerbaa Republc ramrza@yahoo.com Aygu Alasgarova Khazar

More information

Introduction to local (nonparametric) density estimation. methods

Introduction to local (nonparametric) density estimation. methods Itroducto to local (oparametrc) desty estmato methods A slecture by Yu Lu for ECE 66 Sprg 014 1. Itroducto Ths slecture troduces two local desty estmato methods whch are Parze desty estmato ad k-earest

More information

18.413: Error Correcting Codes Lab March 2, Lecture 8

18.413: Error Correcting Codes Lab March 2, Lecture 8 18.413: Error Correctg Codes Lab March 2, 2004 Lecturer: Dael A. Spelma Lecture 8 8.1 Vector Spaces A set C {0, 1} s a vector space f for x all C ad y C, x + y C, where we take addto to be compoet wse

More information

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture) CSE 546: Mache Learg Lecture 6 Feature Selecto: Part 2 Istructor: Sham Kakade Greedy Algorthms (cotued from the last lecture) There are varety of greedy algorthms ad umerous amg covetos for these algorthms.

More information

Processing of Information with Uncertain Boundaries Fuzzy Sets and Vague Sets

Processing of Information with Uncertain Boundaries Fuzzy Sets and Vague Sets Processg of Iformato wth Ucerta odares Fzzy Sets ad Vage Sets JIUCHENG XU JUNYI SHEN School of Electroc ad Iformato Egeerg X'a Jaotog Uversty X'a 70049 PRCHIN bstract: - I the paper we aalyze the relatoshps

More information

The Necessarily Efficient Point Method for Interval Molp Problems

The Necessarily Efficient Point Method for Interval Molp Problems ISS 6-69 Eglad K Joural of Iformato ad omputg Scece Vol. o. 9 pp. - The ecessarly Effcet Pot Method for Iterval Molp Problems Hassa Mshmast eh ad Marzeh Alezhad + Mathematcs Departmet versty of Ssta ad

More information

Machine Learning. knowledge acquisition skill refinement. Relation between machine learning and data mining. P. Berka, /18

Machine Learning. knowledge acquisition skill refinement. Relation between machine learning and data mining. P. Berka, /18 Mache Learg The feld of mache learg s cocered wth the questo of how to costruct computer programs that automatcally mprove wth eperece. (Mtchell, 1997) Thgs lear whe they chage ther behavor a way that

More information

TWO NEW WEIGHTED MEASURES OF FUZZY ENTROPY AND THEIR PROPERTIES

TWO NEW WEIGHTED MEASURES OF FUZZY ENTROPY AND THEIR PROPERTIES merca. Jr. of Mathematcs ad Sceces Vol., No.,(Jauary 0) Copyrght Md Reader Publcatos www.jouralshub.com TWO NEW WEIGTED MESURES OF FUZZY ENTROPY ND TEIR PROPERTIES R.K.Tul Departmet of Mathematcs S.S.M.

More information

The number of observed cases The number of parameters. ith case of the dichotomous dependent variable. the ith case of the jth parameter

The number of observed cases The number of parameters. ith case of the dichotomous dependent variable. the ith case of the jth parameter LOGISTIC REGRESSION Notato Model Logstc regresso regresses a dchotomous depedet varable o a set of depedet varables. Several methods are mplemeted for selectg the depedet varables. The followg otato s

More information

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever. 9.4 Sequeces ad Seres Pre Calculus 9.4 SEQUENCES AND SERIES Learg Targets:. Wrte the terms of a explctly defed sequece.. Wrte the terms of a recursvely defed sequece. 3. Determe whether a sequece s arthmetc,

More information

Dice Similarity Measure between Single Valued Neutrosophic Multisets and Its Application in Medical. Diagnosis

Dice Similarity Measure between Single Valued Neutrosophic Multisets and Its Application in Medical. Diagnosis Neutrosophc Sets ad Systems, Vol. 6, 04 48 Dce Smlarty Measure betwee Sgle Valued Neutrosophc Multsets ad ts pplcato Medcal Dagoss Sha Ye ad Ju Ye Tasha Commuty Health Servce Ceter. 9 Hur rdge, Yuecheg

More information

Solution of General Dual Fuzzy Linear Systems. Using ABS Algorithm

Solution of General Dual Fuzzy Linear Systems. Using ABS Algorithm Appled Mathematcal Sceces, Vol 6, 0, o 4, 63-7 Soluto of Geeral Dual Fuzzy Lear Systems Usg ABS Algorthm M A Farborz Aragh * ad M M ossezadeh Departmet of Mathematcs, Islamc Azad Uversty Cetral ehra Brach,

More information

Derivation of 3-Point Block Method Formula for Solving First Order Stiff Ordinary Differential Equations

Derivation of 3-Point Block Method Formula for Solving First Order Stiff Ordinary Differential Equations Dervato of -Pot Block Method Formula for Solvg Frst Order Stff Ordary Dfferetal Equatos Kharul Hamd Kharul Auar, Kharl Iskadar Othma, Zara Bb Ibrahm Abstract Dervato of pot block method formula wth costat

More information

Functions of Random Variables

Functions of Random Variables Fuctos of Radom Varables Chapter Fve Fuctos of Radom Varables 5. Itroducto A geeral egeerg aalyss model s show Fg. 5.. The model output (respose) cotas the performaces of a system or product, such as weght,

More information

Chapter 5 Properties of a Random Sample

Chapter 5 Properties of a Random Sample Lecture 6 o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for the prevous lecture Cocepts: t-dstrbuto, F-dstrbuto Theorems: Dstrbutos of sample mea ad sample varace, relatoshp betwee sample mea ad sample

More information

Analyzing Fuzzy System Reliability Using Vague Set Theory

Analyzing Fuzzy System Reliability Using Vague Set Theory Iteratoal Joural of Appled Scece ad Egeerg 2003., : 82-88 Aalyzg Fuzzy System Relablty sg Vague Set Theory Shy-Mg Che Departmet of Computer Scece ad Iformato Egeerg, Natoal Tawa versty of Scece ad Techology,

More information

Summary of the lecture in Biostatistics

Summary of the lecture in Biostatistics Summary of the lecture Bostatstcs Probablty Desty Fucto For a cotuos radom varable, a probablty desty fucto s a fucto such that: 0 dx a b) b a dx A probablty desty fucto provdes a smple descrpto of the

More information

Hesitation. Degree. The theory. of similarity. a similarity later, Liang. distance to. The importance of. Abstract. Similarity Measure

Hesitation. Degree. The theory. of similarity. a similarity later, Liang. distance to. The importance of. Abstract. Similarity Measure 1091091091091097 Joural of Ucerta Systems Vol.8, No.2, pp. 109-115, 2014 Ole at: www.jus.org.uk Hestato Degree of Itutostc Fuzzy Sets a New Cose Smlarty Measure Lazm bdullah *, Wa Khadjah Wa Ismal Departmet

More information

Fourth Order Four-Stage Diagonally Implicit Runge-Kutta Method for Linear Ordinary Differential Equations ABSTRACT INTRODUCTION

Fourth Order Four-Stage Diagonally Implicit Runge-Kutta Method for Linear Ordinary Differential Equations ABSTRACT INTRODUCTION Malasa Joural of Mathematcal Sceces (): 95-05 (00) Fourth Order Four-Stage Dagoall Implct Ruge-Kutta Method for Lear Ordar Dfferetal Equatos Nur Izzat Che Jawas, Fudzah Ismal, Mohamed Sulema, 3 Azm Jaafar

More information

The internal structure of natural numbers, one method for the definition of large prime numbers, and a factorization test

The internal structure of natural numbers, one method for the definition of large prime numbers, and a factorization test Fal verso The teral structure of atural umbers oe method for the defto of large prme umbers ad a factorzato test Emmaul Maousos APM Isttute for the Advacemet of Physcs ad Mathematcs 3 Poulou str. 53 Athes

More information

Part 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971))

Part 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971)) art 4b Asymptotc Results for MRR usg RESS Recall that the RESS statstc s a specal type of cross valdato procedure (see Alle (97)) partcular to the regresso problem ad volves fdg Y $,, the estmate at the

More information

Rademacher Complexity. Examples

Rademacher Complexity. Examples Algorthmc Foudatos of Learg Lecture 3 Rademacher Complexty. Examples Lecturer: Patrck Rebesch Verso: October 16th 018 3.1 Itroducto I the last lecture we troduced the oto of Rademacher complexty ad showed

More information

Double Dominating Energy of Some Graphs

Double Dominating Energy of Some Graphs Iter. J. Fuzzy Mathematcal Archve Vol. 4, No., 04, -7 ISSN: 30 34 (P), 30 350 (ole) Publshed o 5 March 04 www.researchmathsc.org Iteratoal Joural of V.Kaladev ad G.Sharmla Dev P.G & Research Departmet

More information

Exercises for Square-Congruence Modulo n ver 11

Exercises for Square-Congruence Modulo n ver 11 Exercses for Square-Cogruece Modulo ver Let ad ab,.. Mark True or False. a. 3S 30 b. 3S 90 c. 3S 3 d. 3S 4 e. 4S f. 5S g. 0S 55 h. 8S 57. 9S 58 j. S 76 k. 6S 304 l. 47S 5347. Fd the equvalece classes duced

More information

Entropy ISSN by MDPI

Entropy ISSN by MDPI Etropy 2003, 5, 233-238 Etropy ISSN 1099-4300 2003 by MDPI www.mdp.org/etropy O the Measure Etropy of Addtve Cellular Automata Hasa Aı Arts ad Sceces Faculty, Departmet of Mathematcs, Harra Uversty; 63100,

More information

TESTS BASED ON MAXIMUM LIKELIHOOD

TESTS BASED ON MAXIMUM LIKELIHOOD ESE 5 Toy E. Smth. The Basc Example. TESTS BASED ON MAXIMUM LIKELIHOOD To llustrate the propertes of maxmum lkelhood estmates ad tests, we cosder the smplest possble case of estmatg the mea of the ormal

More information

Distance and Similarity Measures for Intuitionistic Hesitant Fuzzy Sets

Distance and Similarity Measures for Intuitionistic Hesitant Fuzzy Sets Iteratoal Coferece o Artfcal Itellgece: Techologes ad Applcatos (ICAITA 206) Dstace ad Smlarty Measures for Itutostc Hestat Fuzzy Sets Xumg Che,2*, Jgmg L,2, L Qa ad Xade Hu School of Iformato Egeerg,

More information

CHAPTER VI Statistical Analysis of Experimental Data

CHAPTER VI Statistical Analysis of Experimental Data Chapter VI Statstcal Aalyss of Expermetal Data CHAPTER VI Statstcal Aalyss of Expermetal Data Measuremets do ot lead to a uque value. Ths s a result of the multtude of errors (maly radom errors) that ca

More information

13. Parametric and Non-Parametric Uncertainties, Radial Basis Functions and Neural Network Approximations

13. Parametric and Non-Parametric Uncertainties, Radial Basis Functions and Neural Network Approximations Lecture 7 3. Parametrc ad No-Parametrc Ucertates, Radal Bass Fuctos ad Neural Network Approxmatos he parameter estmato algorthms descrbed prevous sectos were based o the assumpto that the system ucertates

More information

Assignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)

Assignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class) Assgmet 5/MATH 7/Wter 00 Due: Frday, February 9 class (!) (aswers wll be posted rght after class) As usual, there are peces of text, before the questos [], [], themselves. Recall: For the quadratc form

More information

NP!= P. By Liu Ran. Table of Contents. The P versus NP problem is a major unsolved problem in computer

NP!= P. By Liu Ran. Table of Contents. The P versus NP problem is a major unsolved problem in computer NP!= P By Lu Ra Table of Cotets. Itroduce 2. Prelmary theorem 3. Proof 4. Expla 5. Cocluso. Itroduce The P versus NP problem s a major usolved problem computer scece. Iformally, t asks whether a computer

More information

Analysis of Lagrange Interpolation Formula

Analysis of Lagrange Interpolation Formula P IJISET - Iteratoal Joural of Iovatve Scece, Egeerg & Techology, Vol. Issue, December 4. www.jset.com ISS 348 7968 Aalyss of Lagrage Iterpolato Formula Vjay Dahya PDepartmet of MathematcsMaharaja Surajmal

More information

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights CIS 800/002 The Algorthmc Foudatos of Data Prvacy October 13, 2011 Lecturer: Aaro Roth Lecture 9 Scrbe: Aaro Roth Database Update Algorthms: Multplcatve Weghts We ll recall aga) some deftos from last tme:

More information

Lecture 07: Poles and Zeros

Lecture 07: Poles and Zeros Lecture 07: Poles ad Zeros Defto of poles ad zeros The trasfer fucto provdes a bass for determg mportat system respose characterstcs wthout solvg the complete dfferetal equato. As defed, the trasfer fucto

More information

A tighter lower bound on the circuit size of the hardest Boolean functions

A tighter lower bound on the circuit size of the hardest Boolean functions Electroc Colloquum o Computatoal Complexty, Report No. 86 2011) A tghter lower boud o the crcut sze of the hardest Boolea fuctos Masak Yamamoto Abstract I [IPL2005], Fradse ad Mlterse mproved bouds o the

More information

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions Iteratoal Joural of Computatoal Egeerg Research Vol, 0 Issue, Estmato of Stress- Stregth Relablty model usg fte mxture of expoetal dstrbutos K.Sadhya, T.S.Umamaheswar Departmet of Mathematcs, Lal Bhadur

More information

Arithmetic Mean and Geometric Mean

Arithmetic Mean and Geometric Mean Acta Mathematca Ntresa Vol, No, p 43 48 ISSN 453-6083 Arthmetc Mea ad Geometrc Mea Mare Varga a * Peter Mchalča b a Departmet of Mathematcs, Faculty of Natural Sceces, Costate the Phlosopher Uversty Ntra,

More information

arxiv: v4 [math.nt] 14 Aug 2015

arxiv: v4 [math.nt] 14 Aug 2015 arxv:52.799v4 [math.nt] 4 Aug 25 O the propertes of terated bomal trasforms for the Padova ad Perr matrx sequeces Nazmye Ylmaz ad Necat Tasara Departmet of Mathematcs, Faculty of Scece, Selcu Uversty,

More information

Mu Sequences/Series Solutions National Convention 2014

Mu Sequences/Series Solutions National Convention 2014 Mu Sequeces/Seres Solutos Natoal Coveto 04 C 6 E A 6C A 6 B B 7 A D 7 D C 7 A B 8 A B 8 A C 8 E 4 B 9 B 4 E 9 B 4 C 9 E C 0 A A 0 D B 0 C C Usg basc propertes of arthmetc sequeces, we fd a ad bm m We eed

More information

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Numercal Computg -I UNIT SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Structure Page Nos..0 Itroducto 6. Objectves 7. Ital Approxmato to a Root 7. Bsecto Method 8.. Error Aalyss 9.4 Regula Fals Method

More information

A Remark on the Uniform Convergence of Some Sequences of Functions

A Remark on the Uniform Convergence of Some Sequences of Functions Advaces Pure Mathematcs 05 5 57-533 Publshed Ole July 05 ScRes. http://www.scrp.org/joural/apm http://dx.do.org/0.436/apm.05.59048 A Remark o the Uform Covergece of Some Sequeces of Fuctos Guy Degla Isttut

More information

Combining Gray Relational Analysis with Cumulative Prospect Theory for Multi-sensor Target Recognition

Combining Gray Relational Analysis with Cumulative Prospect Theory for Multi-sensor Target Recognition Sesors & Trasducers, Vol 172, Issue 6, Jue 2014, pp 39-44 Sesors & Trasducers 2014 by IFSA Publshg, S L http://wwwsesorsportalcom Combg Gray Relatoal Aalyss wth Cumulatve Prospect Theory for Mult-sesor

More information

An Introduction to. Support Vector Machine

An Introduction to. Support Vector Machine A Itroducto to Support Vector Mache Support Vector Mache (SVM) A classfer derved from statstcal learg theory by Vapk, et al. 99 SVM became famous whe, usg mages as put, t gave accuracy comparable to eural-etwork

More information

A New Measure of Probabilistic Entropy. and its Properties

A New Measure of Probabilistic Entropy. and its Properties Appled Mathematcal Sceces, Vol. 4, 200, o. 28, 387-394 A New Measure of Probablstc Etropy ad ts Propertes Rajeesh Kumar Departmet of Mathematcs Kurukshetra Uversty Kurukshetra, Ida rajeesh_kuk@redffmal.com

More information

On Modified Interval Symmetric Single-Step Procedure ISS2-5D for the Simultaneous Inclusion of Polynomial Zeros

On Modified Interval Symmetric Single-Step Procedure ISS2-5D for the Simultaneous Inclusion of Polynomial Zeros It. Joural of Math. Aalyss, Vol. 7, 2013, o. 20, 983-988 HIKARI Ltd, www.m-hkar.com O Modfed Iterval Symmetrc Sgle-Step Procedure ISS2-5D for the Smultaeous Icluso of Polyomal Zeros 1 Nora Jamalud, 1 Masor

More information

Uniform asymptotical stability of almost periodic solution of a discrete multispecies Lotka-Volterra competition system

Uniform asymptotical stability of almost periodic solution of a discrete multispecies Lotka-Volterra competition system Iteratoal Joural of Egeerg ad Advaced Research Techology (IJEART) ISSN: 2454-9290, Volume-2, Issue-1, Jauary 2016 Uform asymptotcal stablty of almost perodc soluto of a dscrete multspeces Lotka-Volterra

More information

Q-analogue of a Linear Transformation Preserving Log-concavity

Q-analogue of a Linear Transformation Preserving Log-concavity Iteratoal Joural of Algebra, Vol. 1, 2007, o. 2, 87-94 Q-aalogue of a Lear Trasformato Preservg Log-cocavty Daozhog Luo Departmet of Mathematcs, Huaqao Uversty Quazhou, Fua 362021, P. R. Cha ldzblue@163.com

More information

X ε ) = 0, or equivalently, lim

X ε ) = 0, or equivalently, lim Revew for the prevous lecture Cocepts: order statstcs Theorems: Dstrbutos of order statstcs Examples: How to get the dstrbuto of order statstcs Chapter 5 Propertes of a Radom Sample Secto 55 Covergece

More information

Beam Warming Second-Order Upwind Method

Beam Warming Second-Order Upwind Method Beam Warmg Secod-Order Upwd Method Petr Valeta Jauary 6, 015 Ths documet s a part of the assessmet work for the subject 1DRP Dfferetal Equatos o Computer lectured o FNSPE CTU Prague. Abstract Ths documet

More information

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d 9 U-STATISTICS Suppose,,..., are P P..d. wth CDF F. Our goal s to estmate the expectato t (P)=Eh(,,..., m ). Note that ths expectato requres more tha oe cotrast to E, E, or Eh( ). Oe example s E or P((,

More information

On Eccentricity Sum Eigenvalue and Eccentricity Sum Energy of a Graph

On Eccentricity Sum Eigenvalue and Eccentricity Sum Energy of a Graph Aals of Pure ad Appled Mathematcs Vol. 3, No., 7, -3 ISSN: 79-87X (P, 79-888(ole Publshed o 3 March 7 www.researchmathsc.org DOI: http://dx.do.org/.7/apam.3a Aals of O Eccetrcty Sum Egealue ad Eccetrcty

More information

COMPROMISE HYPERSPHERE FOR STOCHASTIC DOMINANCE MODEL

COMPROMISE HYPERSPHERE FOR STOCHASTIC DOMINANCE MODEL Sebasta Starz COMPROMISE HYPERSPHERE FOR STOCHASTIC DOMINANCE MODEL Abstract The am of the work s to preset a method of rakg a fte set of dscrete radom varables. The proposed method s based o two approaches:

More information

Point Estimation: definition of estimators

Point Estimation: definition of estimators Pot Estmato: defto of estmators Pot estmator: ay fucto W (X,..., X ) of a data sample. The exercse of pot estmato s to use partcular fuctos of the data order to estmate certa ukow populato parameters.

More information

Generating Multivariate Nonnormal Distribution Random Numbers Based on Copula Function

Generating Multivariate Nonnormal Distribution Random Numbers Based on Copula Function 7659, Eglad, UK Joural of Iformato ad Computg Scece Vol. 2, No. 3, 2007, pp. 9-96 Geeratg Multvarate Noormal Dstrbuto Radom Numbers Based o Copula Fucto Xaopg Hu +, Jam He ad Hogsheg Ly School of Ecoomcs

More information

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution: Chapter 4 Exercses Samplg Theory Exercse (Smple radom samplg: Let there be two correlated radom varables X ad A sample of sze s draw from a populato by smple radom samplg wthout replacemet The observed

More information

Block-Based Compact Thermal Modeling of Semiconductor Integrated Circuits

Block-Based Compact Thermal Modeling of Semiconductor Integrated Circuits Block-Based Compact hermal Modelg of Semcoductor Itegrated Crcuts Master s hess Defese Caddate: Jg Ba Commttee Members: Dr. Mg-Cheg Cheg Dr. Daqg Hou Dr. Robert Schllg July 27, 2009 Outle Itroducto Backgroud

More information

CS 1675 Introduction to Machine Learning Lecture 12 Support vector machines

CS 1675 Introduction to Machine Learning Lecture 12 Support vector machines CS 675 Itroducto to Mache Learg Lecture Support vector maches Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square Mdterm eam October 9, 7 I-class eam Closed book Stud materal: Lecture otes Correspodg chapters

More information

A New Method for Solving Fuzzy Linear. Programming by Solving Linear Programming

A New Method for Solving Fuzzy Linear. Programming by Solving Linear Programming ppled Matheatcal Sceces Vol 008 o 50 7-80 New Method for Solvg Fuzzy Lear Prograg by Solvg Lear Prograg S H Nasser a Departet of Matheatcs Faculty of Basc Sceces Mazadara Uversty Babolsar Ira b The Research

More information

Chapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements

Chapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements Aoucemets No-Parametrc Desty Estmato Techques HW assged Most of ths lecture was o the blacboard. These sldes cover the same materal as preseted DHS Bometrcs CSE 90-a Lecture 7 CSE90a Fall 06 CSE90a Fall

More information

Chapter 2 - Free Vibration of Multi-Degree-of-Freedom Systems - II

Chapter 2 - Free Vibration of Multi-Degree-of-Freedom Systems - II CEE49b Chapter - Free Vbrato of Mult-Degree-of-Freedom Systems - II We ca obta a approxmate soluto to the fudametal atural frequecy through a approxmate formula developed usg eergy prcples by Lord Raylegh

More information

Unsupervised Learning and Other Neural Networks

Unsupervised Learning and Other Neural Networks CSE 53 Soft Computg NOT PART OF THE FINAL Usupervsed Learg ad Other Neural Networs Itroducto Mture Destes ad Idetfablty ML Estmates Applcato to Normal Mtures Other Neural Networs Itroducto Prevously, all

More information

Chapter 9 Jordan Block Matrices

Chapter 9 Jordan Block Matrices Chapter 9 Jorda Block atrces I ths chapter we wll solve the followg problem. Gve a lear operator T fd a bass R of F such that the matrx R (T) s as smple as possble. f course smple s a matter of taste.

More information

Maps on Triangular Matrix Algebras

Maps on Triangular Matrix Algebras Maps o ragular Matrx lgebras HMED RMZI SOUROUR Departmet of Mathematcs ad Statstcs Uversty of Vctora Vctora, BC V8W 3P4 CND sourour@mathuvcca bstract We surveys results about somorphsms, Jorda somorphsms,

More information

NP!= P. By Liu Ran. Table of Contents. The P vs. NP problem is a major unsolved problem in computer

NP!= P. By Liu Ran. Table of Contents. The P vs. NP problem is a major unsolved problem in computer NP!= P By Lu Ra Table of Cotets. Itroduce 2. Strategy 3. Prelmary theorem 4. Proof 5. Expla 6. Cocluso. Itroduce The P vs. NP problem s a major usolved problem computer scece. Iformally, t asks whether

More information

1 Onto functions and bijections Applications to Counting

1 Onto functions and bijections Applications to Counting 1 Oto fuctos ad bectos Applcatos to Coutg Now we move o to a ew topc. Defto 1.1 (Surecto. A fucto f : A B s sad to be surectve or oto f for each b B there s some a A so that f(a B. What are examples of

More information

KLT Tracker. Alignment. 1. Detect Harris corners in the first frame. 2. For each Harris corner compute motion between consecutive frames

KLT Tracker. Alignment. 1. Detect Harris corners in the first frame. 2. For each Harris corner compute motion between consecutive frames KLT Tracker Tracker. Detect Harrs corers the frst frame 2. For each Harrs corer compute moto betwee cosecutve frames (Algmet). 3. Lk moto vectors successve frames to get a track 4. Itroduce ew Harrs pots

More information

The Primitive Idempotents in

The Primitive Idempotents in Iteratoal Joural of Algebra, Vol, 00, o 5, 3 - The Prmtve Idempotets FC - I Kulvr gh Departmet of Mathematcs, H College r Jwa Nagar (rsa)-5075, Ida kulvrsheora@yahoocom K Arora Departmet of Mathematcs,

More information

Support vector machines II

Support vector machines II CS 75 Mache Learg Lecture Support vector maches II Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square Learl separable classes Learl separable classes: here s a hperplae that separates trag staces th o error

More information

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem CS86. Lecture 4: Dur s Proof of the PCP Theorem Scrbe: Thom Bohdaowcz Prevously, we have prove a weak verso of the PCP theorem: NP PCP 1,1/ (r = poly, q = O(1)). Wth ths result we have the desred costat

More information

ECONOMETRIC THEORY. MODULE VIII Lecture - 26 Heteroskedasticity

ECONOMETRIC THEORY. MODULE VIII Lecture - 26 Heteroskedasticity ECONOMETRIC THEORY MODULE VIII Lecture - 6 Heteroskedastcty Dr. Shalabh Departmet of Mathematcs ad Statstcs Ida Isttute of Techology Kapur . Breusch Paga test Ths test ca be appled whe the replcated data

More information

On the construction of symmetric nonnegative matrix with prescribed Ritz values

On the construction of symmetric nonnegative matrix with prescribed Ritz values Joural of Lear ad Topologcal Algebra Vol. 3, No., 14, 61-66 O the costructo of symmetrc oegatve matrx wth prescrbed Rtz values A. M. Nazar a, E. Afshar b a Departmet of Mathematcs, Arak Uversty, P.O. Box

More information

Research Article A New Derivation and Recursive Algorithm Based on Wronskian Matrix for Vandermonde Inverse Matrix

Research Article A New Derivation and Recursive Algorithm Based on Wronskian Matrix for Vandermonde Inverse Matrix Mathematcal Problems Egeerg Volume 05 Artcle ID 94757 7 pages http://ddoorg/055/05/94757 Research Artcle A New Dervato ad Recursve Algorthm Based o Wroska Matr for Vadermode Iverse Matr Qu Zhou Xja Zhag

More information

L5 Polynomial / Spline Curves

L5 Polynomial / Spline Curves L5 Polyomal / Sple Curves Cotets Coc sectos Polyomal Curves Hermte Curves Bezer Curves B-Sples No-Uform Ratoal B-Sples (NURBS) Mapulato ad Represetato of Curves Types of Curve Equatos Implct: Descrbe a

More information

C-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory

C-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory ROAD MAP... AE301 Aerodyamcs I UNIT C: 2-D Arfols C-1: Aerodyamcs of Arfols 1 C-2: Aerodyamcs of Arfols 2 C-3: Pael Methods C-4: Th Arfol Theory AE301 Aerodyamcs I Ut C-3: Lst of Subects Problem Solutos?

More information

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen.

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen. .5 x 54.5 a. x 7. 786 7 b. The raked observatos are: 7.4, 7.5, 7.7, 7.8, 7.9, 8.0, 8.. Sce the sample sze 7 s odd, the meda s the (+)/ 4 th raked observato, or meda 7.8 c. The cosumer would more lkely

More information

Lecture 3. Sampling, sampling distributions, and parameter estimation

Lecture 3. Sampling, sampling distributions, and parameter estimation Lecture 3 Samplg, samplg dstrbutos, ad parameter estmato Samplg Defto Populato s defed as the collecto of all the possble observatos of terest. The collecto of observatos we take from the populato s called

More information

To use adaptive cluster sampling we must first make some definitions of the sampling universe:

To use adaptive cluster sampling we must first make some definitions of the sampling universe: 8.3 ADAPTIVE SAMPLING Most of the methods dscussed samplg theory are lmted to samplg desgs hch the selecto of the samples ca be doe before the survey, so that oe of the decsos about samplg deped ay ay

More information

ENGI 4421 Joint Probability Distributions Page Joint Probability Distributions [Navidi sections 2.5 and 2.6; Devore sections

ENGI 4421 Joint Probability Distributions Page Joint Probability Distributions [Navidi sections 2.5 and 2.6; Devore sections ENGI 441 Jot Probablty Dstrbutos Page 7-01 Jot Probablty Dstrbutos [Navd sectos.5 ad.6; Devore sectos 5.1-5.] The jot probablty mass fucto of two dscrete radom quattes, s, P ad p x y x y The margal probablty

More information

Non-uniform Turán-type problems

Non-uniform Turán-type problems Joural of Combatoral Theory, Seres A 111 2005 106 110 wwwelsevercomlocatecta No-uform Turá-type problems DhruvMubay 1, Y Zhao 2 Departmet of Mathematcs, Statstcs, ad Computer Scece, Uversty of Illos at

More information

Unimodality Tests for Global Optimization of Single Variable Functions Using Statistical Methods

Unimodality Tests for Global Optimization of Single Variable Functions Using Statistical Methods Malaysa Umodalty Joural Tests of Mathematcal for Global Optmzato Sceces (): of 05 Sgle - 5 Varable (007) Fuctos Usg Statstcal Methods Umodalty Tests for Global Optmzato of Sgle Varable Fuctos Usg Statstcal

More information

Research Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings

Research Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings Hdaw Publshg Corporato Iteratoal Joural of Mathematcs ad Mathematcal Sceces Volume 009, Artcle ID 391839, 9 pages do:10.1155/009/391839 Research Artcle A New Iteratve Method for Commo Fxed Pots of a Fte

More information

Lattices. Mathematical background

Lattices. Mathematical background Lattces Mathematcal backgroud Lattces : -dmesoal Eucldea space. That s, { T x } x x = (,, ) :,. T T If x= ( x,, x), y = ( y,, y), the xy, = xy (er product of xad y) x = /2 xx, (Eucldea legth or orm of

More information

Further Results on Pair Sum Labeling of Trees

Further Results on Pair Sum Labeling of Trees Appled Mathematcs 0 70-7 do:046/am0077 Publshed Ole October 0 (http://wwwscrporg/joural/am) Further Results o Par Sum Labelg of Trees Abstract Raja Poraj Jeyaraj Vjaya Xaver Parthpa Departmet of Mathematcs

More information

MEASURES OF DISPERSION

MEASURES OF DISPERSION MEASURES OF DISPERSION Measure of Cetral Tedecy: Measures of Cetral Tedecy ad Dsperso ) Mathematcal Average: a) Arthmetc mea (A.M.) b) Geometrc mea (G.M.) c) Harmoc mea (H.M.) ) Averages of Posto: a) Meda

More information

Median as a Weighted Arithmetic Mean of All Sample Observations

Median as a Weighted Arithmetic Mean of All Sample Observations Meda as a Weghted Arthmetc Mea of All Sample Observatos SK Mshra Dept. of Ecoomcs NEHU, Shllog (Ida). Itroducto: Iumerably may textbooks Statstcs explctly meto that oe of the weakesses (or propertes) of

More information

2. Independence and Bernoulli Trials

2. Independence and Bernoulli Trials . Ideedece ad Beroull Trals Ideedece: Evets ad B are deedet f B B. - It s easy to show that, B deedet mles, B;, B are all deedet ars. For examle, ad so that B or B B B B B φ,.e., ad B are deedet evets.,

More information

One-Factor ANOVA Model Using Trapezoidal Fuzzy Numbers Through Alpha Cut Interval Method

One-Factor ANOVA Model Using Trapezoidal Fuzzy Numbers Through Alpha Cut Interval Method athematcal Theory ad odelg ISSN 4-584 (Paper) ISSN 5-5 (Ole) Vol5, No3, 5 wwwsteorg Oe-Factor NOV odel sg Trapezodal Fuzzy Numbers Through lpha ut Iterval ethod bstract P Gajvaradha ad S Parthba * Departmet

More information

BERNSTEIN COLLOCATION METHOD FOR SOLVING NONLINEAR DIFFERENTIAL EQUATIONS. Aysegul Akyuz Dascioglu and Nese Isler

BERNSTEIN COLLOCATION METHOD FOR SOLVING NONLINEAR DIFFERENTIAL EQUATIONS. Aysegul Akyuz Dascioglu and Nese Isler Mathematcal ad Computatoal Applcatos, Vol. 8, No. 3, pp. 293-300, 203 BERNSTEIN COLLOCATION METHOD FOR SOLVING NONLINEAR DIFFERENTIAL EQUATIONS Aysegul Ayuz Dascoglu ad Nese Isler Departmet of Mathematcs,

More information

Bounds for the Connective Eccentric Index

Bounds for the Connective Eccentric Index It. J. Cotemp. Math. Sceces, Vol. 7, 0, o. 44, 6-66 Bouds for the Coectve Eccetrc Idex Nlaja De Departmet of Basc Scece, Humates ad Socal Scece (Mathematcs Calcutta Isttute of Egeerg ad Maagemet Kolkata,

More information

For combinatorial problems we might need to generate all permutations, combinations, or subsets of a set.

For combinatorial problems we might need to generate all permutations, combinations, or subsets of a set. Addtoal Decrease ad Coquer Algorthms For combatoral problems we mght eed to geerate all permutatos, combatos, or subsets of a set. Geeratg Permutatos If we have a set f elemets: { a 1, a 2, a 3, a } the

More information