Discretization of Continuous Attributes in Rough Set Theory and Its Application*
|
|
- Gwendolyn Morgan
- 6 years ago
- Views:
Transcription
1
2
3 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 Schuan, Chna dylan7237@sna.com 2 School of Electrcal Engneerng, Southwest Jaotong Unversty, Chengdu , Schuan, Chna Abstract. Exstng dscretzaton methods cannot process contnuous ntervalvalued attrbutes n rough set theory. Ths paper extended the exstng defnton of dscretzaton based on cut-splttng and gave the defnton of generalzed dscretzaton usng class-separablty crteron functon frstly. Then, a new approach was proposed to dscretze contnuous nterval-valued attrbutes. The ntroduced approach emphaszed on the class-separablty n the process of dscretzaton of contnuous attrbutes, so the approach helped to smplfy the classfer desgn and to enhance accurate recognton rate n pattern recognton and machne learnng. In the smulaton experment, the decson table was composed of 8 features and 10 radar emtter sgnals, and the results obtaned from dscretzaton of contnuous nterval-valued attrbutes, reducton of attrbutes and automatc recognton of 10 radar emtter sgnals show that the reduced attrbute set acheves hgher accurate recognton rate than the orgnal attrbute set, whch verfes that the ntroduced approach s vald and feasble. 1 Introducton Rough set theory (RST), proposed by Pawlak [1], s a new fundamental theory of soft computng. [2] RST can mne useful nformaton from a large number of data and generates decson rules wthout pror knowledge [3,4], so t s used generally n many domans [2,3,5 9]. Because RST can only deal wth dscrete attrbutes, a lot of contnuous attrbutes exstng n engneerng applcatons can be processed only after the attrbutes are dscretzed. Thus, dscretzaton becomes a very mportant extended research ssue n rough set theory. [2,6,7,8] Although many dscretzaton methods, ncludng hard dscretzaton [2,5,6] and soft dscretzaton [7,8], have been presented n rough set theory, the methods are only used to dscretze pont attrbute values (fxed values). However, n engneerng applcatons, especally n pattern recognton and machne learnng, the features obtaned usng some feature extracton approaches usually vary n a certan range (nterval values) nstead of fxed values because of * Ths work was supported by the Natonal Defence Foundaton (No ZS0502). J. Zhang, J.-H. He, and Y. Fu (Eds.): CIS 2004, LNCS 3314, pp , Sprnger-Verlag Berln Hedelberg 2004
4 Dscretzaton of Contnuous Attrbutes n Rough Set Theory and Its Applcaton 1021 several reasons, such as plenty of nose. So a new dscretzaton approach s proposed to process the decson table n whch the attrbutes vary contnuously n some ranges. 2 Defnton of Generalzed Dscretzaton The man pont of the exstng dscretzaton defnton [2] s that condton attrbute space s splt usng selected cuts. The exstng dscretzaton methods [2,5-8] always try to fnd the best cuttng set. When the attrbutes are nterval values, t s dffcult to fnd the cuttng set. So t s necessary to generalze the exstng defnton of dscretzaton. The followng descrpton gves the generalzed dscretzaton defnton. Decson system S = U, R, V, f, where R = A { d} s attrbute set, and the subsets A = { a, a,, a } and { d} are called as condton attrbute set and decson 1 2 m attrbute set respectvely. U = { x, x,, x } 1 2 n s a fnte object set,.e. unverse. For any a ( = 1, 2,, m) A, there s nformaton mappng value doman,.e. x mn mn max mn max mn max x1 x1 x2 x2 xn xn max xj a a a U V a, where Va s the V = {[ v, v ],[ v, v ],,[ v, v ]} (1) a a a a a a a j Where v, v R,( j = 1,2,, n). For attrbute ( A), all objects n unverse U are parttoned usng class-separablty crteron functon JV ( ) a a and an equvalence relaton Ra s obtaned, that s, a knd of categorzaton of unverse U s got. Thus, n attrbute set A, we can acheve an equvalence relaton famly P, ( P = { R, R,, R }) a a a 1 2 m composed of m equvalence relatons R, R,, R a a a 1 2 m. So P the equvalence relaton famly P defnes a new decson system S = U, R, P P P V, f, where f ( x) = k, x U, k = {0,1, }. After dscretzaton, the orgnal decson system s replaced wth the new one. Dfferent class-separablty crteron functons generate dfferent equvalence relaton famles that construct dfferent dscrete decson systems. The core of the defnton s that the dscretzaton of contnuous attrbutes s regarded as a functon that transforms contnuous attrbutes nto dscrete attrbutes. The new defnton s an extended verson of the old one and emphaszes on the separablty of dfferent classes n dscretzaton. The defnton provdes a good way to dscretze contnuous nterval-valued attrbutes. Addtonally, consderng the separablty of classes n the process of dscretzaton can smplfy the structure of classfer and enhance accurate recognton rate. If mn max x x j j v = v,( j = 1,2,, n), the dscretzaton of a a nterval-valued attrbutes becomes the dscretzaton of fxed-pont attrbutes. If the class-separablty crteron J ( ) s a specal functon that can partton the value doman V of attrbute a ( a A) nto several subntervals, that s, the specal functon a decdes a cuttng-pont set n the value doman V a, the defnton of generalzed dscretzaton becomes the common defnton of dscretzaton.
5 1022 G. Zhang, L. Hu, and W. Jn 3 Dscretzaton Algorthm The key problem of dscretzng nterval-valued attrbutes s to choose a good classsepablty crteron functon. So a class-sepablty crteron functon s gven frstly n the followng descrpton. When an attrbute value vares n a certan range, n general, the attrbute value always orders a certan law. Ths paper only dscusses the decson system n whch the attrbutes have a certan law. To the extracted features, the law s consdered approxmately as a knd of probablty dstrbuton. Suppose that functons f( x) and g( x) that are one-dmensonal, contnuous and non-negatve real, are respectvely the probablty dstrbuton functons of attrbute values of two objects n unverse U n decson system. The below class-separablty crteron functon s ntroduced. J = 1 f( x) g( x) dx ( ) ( ) 2 2 f x dx g x dx Functon J n (2) satsfes the three condtons of class-separablty crteron functons [10]: () the crteron functon value s non-negatve; () the crteron functon value gets to the maxmum when the dstrbuton functons of two classes have nonoverlappng; () the crteron functon value equals to zero when the dstrbuton functons of two classes are dentcal. Because f( x) and g( x) are non-negatve real functons, accordng to the famous Cauchy Schwartz nequaton, we can get ( ) ( ) ( ) ( ) f x g x dx f x dx g x dx (3) So the value doman of the crteron functon J n (2) s [0,1]. The followng descrpton gves the nterpretaton that functon J can be used to justfy whether the two classes are separable or not. When the two functons f( x) and g( x ) n (2) are regarded respectvely as probablty dstrbuton functons of attrbute values of two objects A and B n unverse U, several separablty cases of A and B are shown n fgure 1. For all x, f one of f( x) and g( x ) s zero at least, whch s shown n Fg. 1(a), A and B are completely separable and the crteron functon J arrves at the maxmal value 1. If there are some ponts of x that make f ( x) and g( x ) not equal to 0 smultaneously, whch s shown n Fg.1(b), A and B are partly separable and the crteron functon J les n the range between 0 and 1. For all x, f f( x) = k g( x), k R +, whch s shown n Fg.1(c), k = 2, A and B are unseparable completely and the crteron functon J arrves at the mnmal value 0. Therefore, t s reasonable that the crteron functon J s used to evaluate separablty of two classes. Accordng to the above class-separablty crteron functon, the dscretzaton algorthm of nterval-valued attrbutes n decson system s gven as follows. Step 1. Intalzaton: decdng the number n of objects n unverse U and the number m of attrbutes. (2)
6 Dscretzaton of Contnuous Attrbutes n Rough Set Theory and Its Applcaton 1023 Step 2. Constructng decson table: all attrbute values are arrayed nto a twodmensonal table n whch all attrbute values are represented wth an nterval values. Step 3. Choosng a lttle postve number as the threshold T of class separablty. h Step 4. For the attrbute a (n the begnnng, = 1 ), all attrbutes are sorted by the central values from the smallest to the bggest and sorted results are v, v,, v. 1 2 n Step 5. The poston, where the smallest attrbute value v 1 n attrbute a s, s encoded to zero (Code=0) to be the ntal value of dscretzaton process. Step 6. Begnnng wth v 1 n the attrbute a, the class-separablty crteron functon value J k of v and v ( k = 1,2,, n 1) s computed by the sorted k k + 1 order v 1, v 2,, v n turn. If J T, whch ndcates the two objects are separable n k h completely, the dscrete value of the correspondng poston of attrbute v k + adds 1, 1.e. Code=Code+1. Otherwse, J < T, whch ndcates the two objects are k h unseparable, the dscrete value of the correspondng poston of attrbute v k + keeps 1 unchangng. Step 7. Repeatng step 6 tll all attrbute values n attrbute a are dscretzed. Step 8. If m, whch ndcates there are some attrbute values to be dscretzed, = + 1, the algorthm goes to step 4 and contnues untl > m, mplyng all contnuous attrbute values are dscretzed. Step 9. The orgnal decson system s replaced wth the dscretzed one. f(x) f(x) f(x) g(x) g(x) g(x) (a) J =1 (b) 0< J <1 (c) J =0 Fg. 1. Three separablty cases of functons f ( x) and g( x) 4 Applcaton Example 10 radar emtter sgnals (RESs), represented wth x 1, x 2,, x 10 respectvely, are chosen to make the smulaton experment. Attrbute set s made up of 8 features [11-13] that are represented wth a 1, a 2,, a 8. When sgnal-to-nose (SNR) vares from 5 db to 20 db, 8 features extracted from 10 RESs construct the attrbute table shown n Table 1. Table 2 s the dscretzed result of Table 1 usng the proposed approach. In the process of dscretzaton, the parameters n = 10, m = 8, T h = 0.99, and all attrbute values are regarded as a Gaussan dstrbuton functons wth the parameters expectaton and varance. After dscretzaton, the reducton method usng dscernblty matrx and logc operaton [2,3] s used to reduce Table 2. The fnal result s L = a ( a + a a + a ( a + a ( a + a ) + a a )) (4)
7 1024 G. Zhang, L. Hu, and W. Jn Table 1. The attrbute table before dscretzaton Attrbutes A 1 a 2 a 3 a 4 x 1 [0.6903,0.7071] [1.4018,1.4036] [0.1217,0.1249] [0.2707,0.2724] x 2 [0.6711,0.6821] [1.4296,1.5758] [0.1151,0.1615] [0.2136,0.2774] x 3 [0.5460,0.5976] [1.5823,1.5857] [0.2924,0.3040] [0.2251,0.2261] x 4 [0.8927,0.8959] [1.4370,1.4900] [0.3735,0.6523] [0.9896,1.000] x 5 [0.8966,0.9089] [1.5610,1.7682] [0.2002,0.2230] [0.7253,0.7270] x 6 [0.4194,0.4528] [1.2190,1.2238] [0.5616,0.5856] [0.1410,0.1424] x 7 [0.3959,0.4129] [1.2805,1.2841] [0.0802,0.0818] [0.0395,0.0404] x 8 [0.6569,0.6841] [1.4788,1.4832] [0.0657,0.0671] [0.1821,0.1914] x 9 [0.5211,0.5619] [1.3938,1.4004] [0.0780,0.0806] [0.7066,0.7294] x 10 [0.9048,0.9076] [1.3841,1.4585] [0.3317,0.3481] [0.6250,0.6301] Attrbutes a 5 a 6 a 7 a 8 x 1 [0.4346,0.4365] [1.9615,2.3013] [0.9516,1.0209] [0.4201,0.4334] x 2 [0.3619,0.4278] [1.0884,2.9913] [1.1154,1.2605] [0.4055,0.4549] x 3 [0.3741,0.3755] [0.7260,1.1110] [0.6909,0.7549] [0.5343,0.5495] x 4 [0.8562,0.8672] [11.738,20.222] [2.1570,2.9600] [0.1985,0.2009] x 5 [0.3304,0.3369] [6.8174,7.7484] [2.8992,3.1304] [0.1986,0.2015] x 6 [0.2434,0.2439] [2.6183,2.9668] [0.1946,0.3095] [0.7721,0.7866] x 7 [0.0000,0.0007] [6.4044,6.7258] [0.2569,0.3264] [0.6758,0.6873] x 8 [0.1149,0.1289] [2.1474,3.3136] [1.4230,1.6642] [0.3932,0.4133] x 9 [0.5843,0.6121] [17.351,19.069] [0.9215,0.9771] [0.5043,0.5241] x 10 [0.5561,0.5606] [0.3448,4.668] [3.1142,3.7371] [0.2022,0.2108] In (4), there are 6 reducts correspondng to 6 feature subsets. The complexty of feature extracton s ntroduced to select the lowest complexty reducts. Fnally, the feature subset composed of a, a, a s regarded as the fnal result after computng To test the performances of the reduced result, three-layer BP neural network s used to desgn classfers. For every RES, 150 feature samples are generated n each of 5dB, 10dB, 15dB and 20dB. Thus, 600 samples of each RES n total are generated when SNR vares from 5dB to 20dB. The samples are classfed nto two groups: tranng group and testng group. The tranng group, whch conssts of one thrd of all samples, s appled to tran neural network classfers (NNC). The testng group, represented by other two thrds of samples, s used to test traned NNC. The structure of NNC s We choose RPROP algorthm [14] as the tranng algorthm. Ideal outputs are 1. Output tolerance s 0.05 and output error s The average accurate recognton rates of 50 experments are shown n Table 3. To brng nto comparson, the orgnal feature set composed of 8 features s also used to recognze the 10 sgnals and the results are also shown n Table 3. Attrbute reducton method not only smplfy the structure of classfers greatly, but also the average accurate recognton rate amounts to 97.23%, whch s 1.18% hgher than the orgnal feature set made up of 8 features.
8 Dscretzaton of Contnuous Attrbutes n Rough Set Theory and Its Applcaton 1025 Table 2. The attrbute table after dscretzaton Attrbutes a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 8 x x x x x x x x x x Table 3. Accurate recognton rates (%) before reducton (BR) and after reducton (AR) Sg x 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 x 10 BR AR Concludng Remarks Ths paper generalzes frstly the defnton of dscretzaton based on cut-splttng and gves a generalzed defnton of dscretzaton usng class-separablty functon. Also, a new dscretzaton approach s proposed to dscretze contnuous nterval-valued attrbutes. Expermental results show that the ntroduced approach can dscretze contnuous nterval-valued attrbutes effectvely. The reduced attrbute set smplfes the structure of classfers and acheves hgher accurate recognton rate than the orgnal attrbute set. References 1. Pawlak, Z.: Rough sets. Informatonal Journal of Informaton and Computer Scence. Vol.11, No.5. (1982) Ln, T.Y.: Introducton to the specal ssue on rough sets. Internatonal Journal of Approxmate Reasonng. Vo.15. (1996) Wang, G.Y.: Rough set theory and knowledge acquston. X an: X an Jaotong Unversty Press, (2001) 4. Walczak, B., Massart, D.L.: Rough sets theory. Chemometrcs and Intellgent Laboratory Systems. Vol.47. (1999) Shen, L.X., Tay, F.E.H, Qu, L.S., and Shen, Y.D.: Fault dagnoss usng rough set theory. Computers n Industry. Vol.43. (2000) Da, J.H., L Y.X.: Study on dscretzaton based on rough set theory. Proc. of the frst Int. Conf. on Machne Learnng and Cybernetcs. (2002)
9 1026 G. Zhang, L. Hu, and W. Jn 7. Roy, A., Pal, S.K.: Fuzzy dscretzaton of feature space for a rough set classfer. Pattern Recognton Letter. Vol.24. (2003) Susmaga, R.: Analyzng dscretzatons of contnuous attrbutes gven a monotonc dscrmnaton functon. Intellgent Data Analyss. Vol.1. (1997) Kusak, A.: Rough set theory: a data mnng tool for semconductor manufacturng. IEEE Trans. on Electroncs Packagng Manufacturng. Vol.24, No.1. (2001) Ban, Z.Q., Zhang, X.G.: Pattern recognton. Bejng: Tsnghua Unversty Press, (2000) 11. Zhang, G.X., Jn, W.D., and Hu, L.Z.: Fractal feature extracton of radar emtter sgnals. Proc. of 3 rd Asa-Pacfc conf. on Envronmental Electromagnetcs. (2003) Zhang, G.X., Hu, L.Z., and Jn, W.D.: Complexty feature extracton of radar emtter sgnals. Proc. of 3 rd Asa-Pacfc Conf. on Envronmental Electromagnetcs. (2003) Zhang, G.X., Rong, H.N., Jn, W.D., and Hu, L.Z.: Radar emtter sgnal recognton based on resemblance coeffcent features. LNCS. Vol (2004) Redmller M., Braun H.: A drect adaptve method for faster back propagaton learnng: the RPROP algorthm. Proc. of IEEE Int. Conf. on Neural Networks. (1993)
2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationApplication research on rough set -neural network in the fault diagnosis system of ball mill
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(4):834-838 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 Applcaton research on rough set -neural network n the
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 informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
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 informationMultilayer Perceptron (MLP)
Multlayer Perceptron (MLP) Seungjn Cho Department of Computer Scence and Engneerng Pohang Unversty of Scence and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjn@postech.ac.kr 1 / 20 Outlne
More informationSemi-supervised Classification with Active Query Selection
Sem-supervsed Classfcaton wth Actve Query Selecton Jao Wang and Swe Luo School of Computer and Informaton Technology, Beng Jaotong Unversty, Beng 00044, Chna Wangjao088@63.com Abstract. Labeled samples
More informationAn Improved multiple fractal algorithm
Advanced Scence and Technology Letters Vol.31 (MulGraB 213), pp.184-188 http://dx.do.org/1.1427/astl.213.31.41 An Improved multple fractal algorthm Yun Ln, Xaochu Xu, Jnfeng Pang College of Informaton
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 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 informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
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 informationA New Evolutionary Computation Based Approach for Learning Bayesian Network
Avalable onlne at www.scencedrect.com Proceda Engneerng 15 (2011) 4026 4030 Advanced n Control Engneerng and Informaton Scence A New Evolutonary Computaton Based Approach for Learnng Bayesan Network Yungang
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationResearch Article Green s Theorem for Sign Data
Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
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 informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
More informationarxiv:cs.cv/ Jun 2000
Correlaton over Decomposed Sgnals: A Non-Lnear Approach to Fast and Effectve Sequences Comparson Lucano da Fontoura Costa arxv:cs.cv/0006040 28 Jun 2000 Cybernetc Vson Research Group IFSC Unversty of São
More informationMultigradient for Neural Networks for Equalizers 1
Multgradent for Neural Netorks for Equalzers 1 Chulhee ee, Jnook Go and Heeyoung Km Department of Electrcal and Electronc Engneerng Yonse Unversty 134 Shnchon-Dong, Seodaemun-Ku, Seoul 1-749, Korea ABSTRACT
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationA Fast Computer Aided Design Method for Filters
2017 Asa-Pacfc Engneerng and Technology Conference (APETC 2017) ISBN: 978-1-60595-443-1 A Fast Computer Aded Desgn Method for Flters Gang L ABSTRACT *Ths paper presents a fast computer aded desgn method
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 informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
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 informationQuantum and Classical Information Theory with Disentropy
Quantum and Classcal Informaton Theory wth Dsentropy R V Ramos rubensramos@ufcbr Lab of Quantum Informaton Technology, Department of Telenformatc Engneerng Federal Unversty of Ceara - DETI/UFC, CP 6007
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationSparse Gaussian Processes Using Backward Elimination
Sparse Gaussan Processes Usng Backward Elmnaton Lefeng Bo, Lng Wang, and Lcheng Jao Insttute of Intellgent Informaton Processng and Natonal Key Laboratory for Radar Sgnal Processng, Xdan Unversty, X an
More informationAn Improved Prediction Model based on Fuzzy-rough Set Neural Network
Internatonal Journal of Computer Theory and Engneerng, Vol.3, No.1, February, 011 1793-801 An Improved Predcton Model based on Fuzzy-rough Set Neural Network Jng Hong Abstract After the bref revew of the
More informationChapter 2 A Class of Robust Solution for Linear Bilevel Programming
Chapter 2 A Class of Robust Soluton for Lnear Blevel Programmng Bo Lu, Bo L and Yan L Abstract Under the way of the centralzed decson-makng, the lnear b-level programmng (BLP) whose coeffcents are supposed
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationRBF Neural Network Model Training by Unscented Kalman Filter and Its Application in Mechanical Fault Diagnosis
Appled Mechancs and Materals Submtted: 24-6-2 ISSN: 662-7482, Vols. 62-65, pp 2383-2386 Accepted: 24-6- do:.428/www.scentfc.net/amm.62-65.2383 Onlne: 24-8- 24 rans ech Publcatons, Swtzerland RBF Neural
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
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 informationA Network Intrusion Detection Method Based on Improved K-means Algorithm
Advanced Scence and Technology Letters, pp.429-433 http://dx.do.org/10.14257/astl.2014.53.89 A Network Intruson Detecton Method Based on Improved K-means Algorthm Meng Gao 1,1, Nhong Wang 1, 1 Informaton
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
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 informationWavelet chaotic neural networks and their application to continuous function optimization
Vol., No.3, 04-09 (009) do:0.436/ns.009.307 Natural Scence Wavelet chaotc neural networks and ther applcaton to contnuous functon optmzaton Ja-Ha Zhang, Yao-Qun Xu College of Electrcal and Automatc Engneerng,
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 informationProbability Theory (revisited)
Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationWhat would be a reasonable choice of the quantization step Δ?
CE 108 HOMEWORK 4 EXERCISE 1. Suppose you are samplng the output of a sensor at 10 KHz and quantze t wth a unform quantzer at 10 ts per sample. Assume that the margnal pdf of the sgnal s Gaussan wth mean
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationA New Scrambling Evaluation Scheme based on Spatial Distribution Entropy and Centroid Difference of Bit-plane
A New Scramblng Evaluaton Scheme based on Spatal Dstrbuton Entropy and Centrod Dfference of Bt-plane Lang Zhao *, Avshek Adhkar Kouch Sakura * * Graduate School of Informaton Scence and Electrcal Engneerng,
More informationMAXIMUM A POSTERIORI TRANSDUCTION
MAXIMUM A POSTERIORI TRANSDUCTION LI-WEI WANG, JU-FU FENG School of Mathematcal Scences, Peng Unversty, Bejng, 0087, Chna Center for Informaton Scences, Peng Unversty, Bejng, 0087, Chna E-MIAL: {wanglw,
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
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 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 informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationA Particle Filter Algorithm based on Mixing of Prior probability density and UKF as Generate Importance Function
Advanced Scence and Technology Letters, pp.83-87 http://dx.do.org/10.14257/astl.2014.53.20 A Partcle Flter Algorthm based on Mxng of Pror probablty densty and UKF as Generate Importance Functon Lu Lu 1,1,
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 informationHigh resolution entropy stable scheme for shallow water equations
Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal
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 informationRelevance Vector Machines Explained
October 19, 2010 Relevance Vector Machnes Explaned Trstan Fletcher www.cs.ucl.ac.uk/staff/t.fletcher/ Introducton Ths document has been wrtten n an attempt to make Tppng s [1] Relevance Vector Machnes
More informationError Probability for M Signals
Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationAn Application of Fuzzy Hypotheses Testing in Radar Detection
Proceedngs of the th WSES Internatonal Conference on FUZZY SYSEMS n pplcaton of Fuy Hypotheses estng n Radar Detecton.K.ELSHERIF, F.M.BBDY, G.M.BDELHMID Department of Mathematcs Mltary echncal Collage
More informationClock-Gating and Its Application to Low Power Design of Sequential Circuits
Clock-Gatng and Its Applcaton to Low Power Desgn of Sequental Crcuts ng WU Department of Electrcal Engneerng-Systems, Unversty of Southern Calforna Los Angeles, CA 989, USA, Phone: (23)74-448 Massoud PEDRAM
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 informationConjugacy and the Exponential Family
CS281B/Stat241B: Advanced Topcs n Learnng & Decson Makng Conjugacy and the Exponental Famly Lecturer: Mchael I. Jordan Scrbes: Bran Mlch 1 Conjugacy In the prevous lecture, we saw conjugate prors for the
More informationGaussian Mixture Models
Lab Gaussan Mxture Models Lab Objectve: Understand the formulaton of Gaussan Mxture Models (GMMs) and how to estmate GMM parameters. You ve already seen GMMs as the observaton dstrbuton n certan contnuous
More informationCSC 411 / CSC D11 / CSC C11
18 Boostng s a general strategy for learnng classfers by combnng smpler ones. The dea of boostng s to take a weak classfer that s, any classfer that wll do at least slghtly better than chance and use t
More informationNatural Language Processing and Information Retrieval
Natural Language Processng and Informaton Retreval Support Vector Machnes Alessandro Moschtt Department of nformaton and communcaton technology Unversty of Trento Emal: moschtt@ds.untn.t Summary Support
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationSystem identifications by SIRMs models with linear transformation of input variables
ORIGINAL RESEARCH System dentfcatons by SIRMs models wth lnear transformaton of nput varables Hrofum Myama, Nortaka Shge, Hrom Myama Graduate School of Scence and Engneerng, Kagoshma Unversty, Japan Receved:
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 informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationNatural Images, Gaussian Mixtures and Dead Leaves Supplementary Material
Natural Images, Gaussan Mxtures and Dead Leaves Supplementary Materal Danel Zoran Interdscplnary Center for Neural Computaton Hebrew Unversty of Jerusalem Israel http://www.cs.huj.ac.l/ danez Yar Wess
More informationFeature Selection in Multi-instance Learning
The Nnth Internatonal Symposum on Operatons Research and Its Applcatons (ISORA 10) Chengdu-Juzhagou, Chna, August 19 23, 2010 Copyrght 2010 ORSC & APORC, pp. 462 469 Feature Selecton n Mult-nstance Learnng
More informationDETERMINATION OF UNCERTAINTY ASSOCIATED WITH QUANTIZATION ERRORS USING THE BAYESIAN APPROACH
Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata TC XVII IMEKO World Congress Metrology n the 3rd Mllennum June 7, 3,
More informationLecture 3: Dual problems and Kernels
Lecture 3: Dual problems and Kernels C4B Machne Learnng Hlary 211 A. Zsserman Prmal and dual forms Lnear separablty revsted Feature mappng Kernels for SVMs Kernel trck requrements radal bass functons SVM
More informationKernels in Support Vector Machines. Based on lectures of Martin Law, University of Michigan
Kernels n Support Vector Machnes Based on lectures of Martn Law, Unversty of Mchgan Non Lnear separable problems AND OR NOT() The XOR problem cannot be solved wth a perceptron. XOR Per Lug Martell - Systems
More informationStudy on Active Micro-vibration Isolation System with Linear Motor Actuator. Gong-yu PAN, Wen-yan GU and Dong LI
2017 2nd Internatonal Conference on Electrcal and Electroncs: echnques and Applcatons (EEA 2017) ISBN: 978-1-60595-416-5 Study on Actve Mcro-vbraton Isolaton System wth Lnear Motor Actuator Gong-yu PAN,
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationCOMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION. Erdem Bala, Dept. of Electrical and Computer Engineering,
COMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION Erdem Bala, Dept. of Electrcal and Computer Engneerng, Unversty of Delaware, 40 Evans Hall, Newar, DE, 976 A. Ens Cetn,
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
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 informationExcess 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 informationOver-Temperature protection for IGBT modules
Over-Temperature protecton for IGBT modules Ke Wang 1, Yongjun Lao 2, Gaosheng Song 1, Xanku Ma 1 1 Mtsubsh Electrc & Electroncs (Shangha) Co., Ltd., Chna Room2202, Tower 3, Kerry Plaza, No.1-1 Zhongxns
More informationSuppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl
RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationAdaptive Consensus Control of Multi-Agent Systems with Large Uncertainty and Time Delays *
Journal of Robotcs, etworkng and Artfcal Lfe, Vol., o. (September 04), 5-9 Adaptve Consensus Control of Mult-Agent Systems wth Large Uncertanty and me Delays * L Lu School of Mechancal Engneerng Unversty
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationAssessment of Site Amplification Effect from Input Energy Spectra of Strong Ground Motion
Assessment of Ste Amplfcaton Effect from Input Energy Spectra of Strong Ground Moton M.S. Gong & L.L Xe Key Laboratory of Earthquake Engneerng and Engneerng Vbraton,Insttute of Engneerng Mechancs, CEA,
More informationLIU W Y et al.: A Fuzzy Approach to Classfcaton of Text Documents 6 Generally, the goal of document classfcaton s to assgn the documents to a fxed num
Sept. 00, Vol.8, No., pp.60 67 J. Comput. Sc. & Technol. A Fuzzy Approach to Classfcaton of Text Documents LIU WeY ( ΛΞ) ; and SONG Nng ( ) Department of Computer Scence, Yunnan Unversty, Kunmng 6009,
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 informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationA Two-Level Detection Algorithm for Optical Fiber Vibration
PHOTOIC SESORS/ Vol. 5, o. 3, 05: 84 88 A Two-Level Detecton Algorthm for Optcal Fber Vbraton Fukun BI, uecong RE *, Hongquan QU, and Ruqng JIAG College of Informaton Engneerng, orth Chna Unversty of Technology,
More informationFinite Mixture Models and Expectation Maximization. Most slides are from: Dr. Mario Figueiredo, Dr. Anil Jain and Dr. Rong Jin
Fnte Mxture Models and Expectaton Maxmzaton Most sldes are from: Dr. Maro Fgueredo, Dr. Anl Jan and Dr. Rong Jn Recall: The Supervsed Learnng Problem Gven a set of n samples X {(x, y )},,,n Chapter 3 of
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 informationA Compression Method of Decision Table Based on Matrix Computation
A ompresson Method of ecson Table Based on Matrx omputaton Lapeng Luo and Ergen Lu School of Basc Scences, East hna Jaotong Unversty, Nanchang, P.R. hna loulp@tom.com Abstract. A new algorthm of attrbute
More informationP exp(tx) = 1 + t 2k M 2k. k N
1. Subgaussan tals Defnton. Say that a random varable X has a subgaussan dstrbuton wth scale factor σ< f P exp(tx) exp(σ 2 t 2 /2) for all real t. For example, f X s dstrbuted N(,σ 2 ) then t s subgaussan.
More information