Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms

Size: px
Start display at page:

Download "Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms"

Transcription

1 Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka , JAPAN Phoe: Takashi Yamamoto Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka, , JAPAN Phoe: Abstract This paper shows how a small umber of fuzzy rules ca be selected for desigig iterpretable fuzzy rule-based classificatio systems. Our approach cosists of two phases: cadidate rule geeratio by data miig criteria ad rule selectio by geetic algorithms. First a large umber of cadidate rules are geerated ad prescreeed usig two rule evaluatio criteria i data miig. Next a small umber of fuzzy rules are selected from cadidate rules usig geetic algorithms. Rule selectio is formulated as a optimizatio problem with three objectives: to maximize the classificatio accuracy, to miimize the umber of selected rules, ad to miimize the total rule legth. Thus the task of geetic algorithms is to fid o-domiated rule sets with respect to the three objectives. 1. INTRODUCTION Fuzzy rule-based systems have bee successfully applied to various fields such as cotrol, modelig, ad classificatio (Leodes 1999). While the mai goal i the desig of fuzzy rule-based systems has bee the performace maximizatio, their iterpretability has also bee take ito accout i some recet studies (Pee- Reyes & Sipper 1999, Castillo et al. 2001, Roubos & Setes 2001, ad Casillas et al. 2002). I this paper, we cosider three objectives i the desig of fuzzy rule-based classificatio systems as i Ishibuchi, Nakashima & Murata (2001): Classificatio accuracy, the umber of fuzzy rules, ad the total legth of fuzzy rules. The legth of a fuzzy rule is the umber of its atecedet coditios (i.e., the umber of attributes i its atecedet part). The first objective is the performace maximizatio while the others are related to the iterpretability. Usually huma users do ot wat to maually check hudreds of fuzzy rules. Thus the umber of fuzzy rules is closely related to the iterpretability of fuzzy rule-based systems. Fuzzy rule-based systems with a small umber of fuzzy rules are ot always iterpretable. Huma users caot ituitively uderstad log fuzzy rules with may atecedet coditios. Thus the rule legth is also closely related to the iterpretability of fuzzy rule-based systems. I this paper, we maximize the classificatio accuracy of fuzzy rule-based systems, miimize the umber of fuzzy rules, ad miimize the total legth of fuzzy rules. Multiobjective geetic algorithms are used for fidig odomiated rule sets with respect to these three objectives. Fuzzy rule geeratio methods ca be categorized ito two approaches accordig to their strategies for dividig the iput space ito fuzzy subspaces. Oe approach is based o grid-type fuzzy partitios where the domai iterval of each iput is divided ito atecedet fuzzy sets with liguistic labels. Fig. 1 is a example of such a gridtype fuzzy partitio. The other approach uses multidimesioal atecedet fuzzy sets defied o the iput space. Fig. 2 illustrates two-dimesioal ellipsoidal atecedet fuzzy sets. Multi-dimesioal atecedet fuzzy sets usually lead to fuzzy rule-based systems with high accuracy but low iterpretability. O the other had, fuzzy rule-based systems with high iterpretability ca be geerated from grid-type fuzzy partitios. Sice our goal is to geerate iterpretable fuzzy rule-based systems, we use the first approach (i.e., grid-type fuzzy partitios). As discussed i Suzuki & Furuhashi (2001), homogeeous fuzzy partitios are more iterpretable tha adjusted oes. Thus we use homogeeous fuzzy partitios as show i Fig. 1. Usually we do ot kow a appropriate fuzzy partitio for each iput. I geeral, each iput may have a differet fuzzy partitio while the two axes of the iput space is divided by the same fuzzy partitio i Fig. 1. Moreover, geeral rules may use coarse fuzzy partitios while specific rules may use fie fuzzy partitios i a sigle fuzzy rule-based system. For hadlig such a situatio with differet fuzzy partitios of differet graularities, we specify each atecedet coditio of

2 fuzzy rules by choosig a atecedet fuzzy set from various fuzzy partitios for each iput. I this paper, we use four fuzzy partitios i Fig. 3 where the total umber of atecedet fuzzy sets is 14. For geeratig short fuzzy rules with a small umber of atecedet coditios, we use do t care as a additioal atecedet fuzzy set. Thus a atecedet fuzzy set for each iput is chose from the 14 fuzzy sets i Fig. 3 ad do t care. The total umber of combiatios of atecedet fuzzy sets is 15 for a -dimesioal patter classificatio problem. Figure 1: A 5 S S MS M ML L x 1 L ML M MS S x 2 5 fuzzy grid of a two-dimesioal iput space. x 2 x 1 Figure 2: Ellipsoidal atecedet fuzzy sets. L S 4 MS 4 ML 4 L 4 S 3 M 3 L 3 S 5 MS 5 M 5 ML 5 L 5 Figure 3: Four fuzzy partitios. The meaig of each label is as follows: S: small, MS: medium small, M: medium, ML: medium large, ad L: large. The superscript of each label deotes the graularity of the correspodig fuzzy partitio. Geetic algorithm-based fuzzy rule selectio (Ishibuchi, Nakashima & Murata, 2001) cosists of two phases. I the first phase, a large umber of cadidate rules are geerated from various combiatios of atecedet fuzzy sets. I the secod phase, subsets of the geerated cadidate rules are examied usig geetic algorithms for fidig o-domiated rule sets with respect to the abovemetioed three objectives. I Ishibuchi, Nakashima & Murata (2001), a sigle fuzzy partitio was used for all iputs as i Fig. 1. I this case, the total umber of combiatios of atecedet fuzzy sets icludig do t care is ( 5 + 1) for a -dimesioal patter classificatio problem. This is much smaller tha 15 i this paper. That is, we have much more cadidate rules. It should be oted that the search space for fidig odomiated rule sets expoetially expads as the umber of cadidate rules icreases. The efficiecy of geetic algorithms is sigificatly deteriorated by the icrease i the umber of cadidate rules as show i this paper. Thus we eed a trick for decreasig the umber of cadidate rules. Our idea is to prescree cadidate rules based o fuzzy versios of two rule evaluatio criteria (i.e., cofidece ad support) for associatio rules, which have bee freuetly used i the field of data miig (Agrawal et al. 1996). I our prescreeig procedure, fuzzy rules are divided ito several groups accordig to their coseuet classes. The fuzzy rules i each group are sorted i a descedig order of the product of cofidece ad support. Fially a pre-specified umber of fuzzy rules are chose from the top of the rule list for each group. The selected fuzzy rules are used as cadidate rules i our geetic algorithm-based rule selectio method. I the ext sectio, we show how the desig of fuzzy rulebased classificatio systems ca be formulated as a threeobjective rule selectio problem. I Sectio 3, we propose a prescreeig procedure of cadidate rules usig fuzzy versios of the two rule evaluatio criteria i data miig. I Sectio 4, we describe a three-objective geetic algorithm for rule selectio. The effect of the proposed prescreeig procedure o the efficiecy of the geetic algorithm-based rule selectio method is examied i Sectio 5 through computer simulatios. Fially Sectio 6 cocludes this paper. 2. PROBLEM FORMULATION Let us cosider a M-class patter classificatio problem with m labeled patters x p = ( x p1,..., x p ), p = 1, 2,...,m i a -dimesioal cotiuous patter space. For simplicity of explaatio, we assume that the patter space is the -dimesioal uit hypercube [ 0, 1]. That is, we assume that all attribute values are real umbers i the uit iterval [ 0, 1]. For our patter classificatio problem, we use fuzzy rules of the followig form: Rule R : If x 1 is A 1 ad... ad x is the Class A C with CF, (1)

3 where R is the -th fuzzy rule, x = ( x1,..., x ) is a -dimesioal patter vector, A i is a atecedet fuzzy set, C is a coseuet class (i.e., oe of the M classes), ad CF is a rule weight (i.e., certaity factor). The atecedet fuzzy set A i is oe of the 14 fuzzy sets i Fig. 3 or do t care. The rule weight CF is a real umber i the uit iterval [ 0, 1]. As show i the ext sectio, the coseuet class C ad the rule weight CF are determied i a heuristic maer from compatible traiig patters with the atecedet part of R. Let S be a subset of 15 fuzzy rules of the form (1). Our task is to fid rule sets with high classificatio ability ad high iterpretability. This task ca be rephrased as fidig a small umber of simple fuzzy rules with high classificatio ability. As i Ishibuchi, Nakashima & Murata (2001), our rule selectio problem is formulated as the followig three-objective optimizatio problem: Maximize f 1 ( S ), ad miimize f 2 ( S ), f 3 ( S ), (2) where f 1 ( S ) is the umber of correctly classified traiig patters by S, f 2 ( S ) is the umber of fuzzy rules i S, ad f 3 ( S ) is the total rule legth of fuzzy rules i S. Usually there is o optimal rule set with respect to all the three objectives. Thus our task is to fid multiple rule sets that are ot domiated by ay other rule sets. A rule set S B is said to domiate aother rule set S A (i.e., S B is better tha S A : S A S B ) if all the followig ieualities hold: f 1 ( S A ) f 1 ( S B ), (3) f 2 ( S A ) f 2 ( S B ), (4) f 3 ( S A ) f 3 ( S B ), (5) ad at least oe of the followig ieualities holds: f 1 ( S A ) < f 1 ( S B ), (6) f 2 ( S A ) > f 2 ( S B ), (7) f S ) > f ( S ). (8) 3 ( A 3 B The first coditio (i.e., all the three ieualities i (3)- (5)) meas that o objective of S B is worse tha S A (i.e., S B is ot worse tha S A ). The secod coditio (i.e., oe of the three ieualities i (6)-(8)) meas that at least oe objective of S B is better tha S A. Whe a rule set S is ot domiated by ay other rule sets, S is said to be a Pareto-optimal solutio of our rule selectio problem i (2). I may cases, it is impractical to try to fid true Pareto-optimal solutios of our rule selectio problem whose search space is huge (i.e., the search space is the power set of 15 fuzzy rules). Thus we try to fid ear Pareto-optimal solutios. More specifically, first we decrease the search space by prescreeig cadidate fuzzy rules. The we search for ear Pareto-optimal solutios by a three-objective geetic algorithm. 3. CANDIDATE RULE PRESCREENING 3.1 FUZZIFICATION OF ASSOCIATION RULES As we have already explaied, the total umber of combiatios of atecedet fuzzy sets is 15 for our - dimesioal patter classificatio problem. Whe is small (e.g., 4 ), we ca examie all combiatios of atecedet fuzzy sets for geeratig fuzzy rules ad use all the geerated fuzzy rules as cadidate rules i our geetic algorithm-based rule selectio method. That is, o prescreeig of cadidate rules is ecessary. O the other had, we eed a prescreeig procedure whe is large. It is time-cosumig to examie all the 15 combiatios whe is large (e.g., = 13 i wie data used i computer simulatios of this paper). I this case, it is also impractical to use all the geerated fuzzy rules as cadidate rules i our geetic algorithm-based rule selectio method. Our idea is to use rule evaluatio criteria i data miig for decreasig the umber of cadidate rules. I the area of data miig, two criteria called cofidece ad support have ofte bee used for evaluatig associatio rules (Agrawal et al. 1996). Our fuzzy rule i (1) ca be viewed as a associatio rule of the form A C. We use the two criteria for prescreeig cadidate rules. I this subsectio, we show how the defiitios of these two criteria ca be exteded to the case of the fuzzy associatio rule A C (Ishibuchi, Yamamoto & Nakashima, 2001). Similar extesios of the two criteria to fuzzy associatio rules were also proposed i Hog et al. (2001). Let D be the set of the give m traiig patters x p = ( x p1,..., x p ), p = 1, 2,..., m. The cardiality of D is m (i.e., D = m ). The cofidece of A C is defied as follows (Agrawal et al. 1996): c ( A D ( A ) D ( C C ) =, (9) D ( A where the deomiator D ( A is the umber of traiig patters compatible with the atecedet part A, ad the umerator D ( A ) D ( C is the umber of traiig patters compatible with both the atecedet part A ad the coseuet class C. The cofidece c idicates the grade of the validity of A C. That is, c ( 100%) of traiig patters compatible with A are also compatible with C. I the case of stadard associatio rules, either A or C is fuzzy. Thus the calculatios of D ( A ad D ( A ) D ( C ca be performed by simply coutig compatible traiig patters. O the other had, each traiig patter has a differet compatibility grade µ A ( x p ) with the atecedet part A whe A C is a fuzzy associatio rule. Thus such a compatibility grade should

4 be take ito accout. Sice the coseuet class C is ot fuzzy, the cofidece i (9) ca be rewritte as follows (Ishibuchi, Yamamoto & Nakashima 2001): c ( A C ) = = D ( A p= 1 ) D ( A p Class C m µ µ D ( C A ( x p ) A ( x p ). (10) The compatibility grade µ A ( x p ) is usually defied by the product or miimum operator. I this paper, we use the product operator as µ A ( x p ) = µ A ( x 1 ) ( ) 1 p µ A x p, (11) where µ A ( x pi ) is the membership fuctio of the i atecedet fuzzy set A i (i.e., each triagle i Fig. 3). O the other had, the support of A C is defied as follows (Agrawal et al. 1996): D ( A ) D ( C s ( A C ) =. (12) D The support s idicates the grade of the coverage by A C. That is, s ( 100%) of all the traiig patters are compatible with the associatio rule A C (i.e., compatible with both A ad C ). I the same maer as the cofidece i (10), the support i (12) ca be rewritte as follows (Ishibuchi, Yamamoto & Nakashima 2001): s ( A C ) = = D ( A ) D D ( C µ A p Class C m ( x p ) 3.2 CONSEQUENT CLASS AND RULE WEIGHT. (13) The coseuet class C of the fuzzy rule R with the atecedet part A is determied as c ( A C ) = max{ c ( A Class 1),..., c ( A Class M )}. (14) That is, the coseuet class has the maximum cofidece amog the M alterative classes. It should be oted that the same class C is obtaied for A whe we use the support s istead of the cofidece c. This is because the followig relatio holds betwee the cofidece c ad the support s from their defiitios: D ( A s ( A Class h ) = c ( A Class h ), D t = 1, 2,...,M. (15) Sice the secod term (i.e., D ( A / D ) of the righthad side is idepedet of the coseuet class, the class with the maximum cofidece is the same as the class with the maximum support. The same class also has the maximum product of these two criteria. Usually we ca uiuely specify the coseuet class C for each combiatio A of atecedet fuzzy sets. Oly whe multiple classes have the same maximum cofidece (icludig the case of o compatible traiig patter with the atecedet part A : c ( A Class h ) = 0 for all classes), we caot specify the coseuet class C for A. I this case, we do ot geerate the correspodig fuzzy rule R. The cofidece of R ca be directly used as its rule weight as i Cordo et al. (1999). Our prelimiary simulatio results showed that better results were obtaied from the followig defiitio of the rule weight tha the direct use of the cofidece: CF = c ( A C ) csecod, (16) where c Secod is the secod largest cofidece for the atecedet part A : csecod = max{ c ( A Class h h C }. (17) h Our prelimiary computer simulatios also showed that better results were obtaied from the defiitio i (16) tha the followig defiitio used i some studies o fuzzy rule-based classificatio systems (e.g., Ishibuchi, Yamamoto & Nakashima 2001): CF = c ( A C ) c Average, (18) where c Average is the average cofidece over fuzzy rules with the same atecedet part A but differet coseuet classes: 1 c Average = c( A Class h). (19) M 1 h C 3.3 PRESCREENING PROCEDURE The geerated fuzzy rules are divided ito M groups accordig to their coseuet classes. Fuzzy rules i each group are sorted i a descedig order of the product of the cofidece ad the support (i.e., s c ). For selectig N cadidate rules, the first N / M rules are chose from each of the M groups. I this maer, we ca choose a

5 pre-specified umber of cadidate rules as cadidate rules i our geetic algorithm-based rule selectio method. I our prelimiary computer simulatios, we also examied the cofidece ad the support as rule prescreeig criteria. The best result amog the three criteria for rule prescreeig (i.e., cofidece, support, ad their product) was obtaied whe we used the product of the cofidece ad the support. As we have already metioed, the total umber of combiatios of atecedet fuzzy sets is 15 for our - dimesioal patter classificatio problem. Thus it is impractical to examie all combiatios whe is large. I this case, we examie oly short fuzzy rules with oly a few atecedet coditios (i.e., with may do t care coditios). The umber of fuzzy rules of the legth L is L calculated as C L 14 because we have 14 atecedet fuzzy sets for each iput (excludig do t care). Eve L whe is large, C L 14 is ot so large for a small value of L. This meas that the umber of short fuzzy rules is ot so large eve whe the total umber of fuzzy rules is huge. 4. GENETIC ALGORITHM May geetic algorithms for multi-objective optimizatio problems have bee proposed i the literature (Zitzler & Thiele 1999, ad Zitzler et al. 2000). Sice each rule set ca be represeted by a biary strig, we ca apply those algorithms to our three-objective rule selectio problem i Sectio 2. I this paper, we use a slightly modified versio of a three-objective geetic algorithm for rule selectio i Ishibuchi, Nakashima & Murata (2001). This algorithm has two characteristic features. Oe is to use a scalar fitess fuctio with variable radom weights for evaluatig each strig (i.e., each rule set). Wheever a pair of paret solutios is selected for crossover, weights are radomly updated. That is, each selectio is govered by a differet weight vector. Geetic search i various directios i the three-dimesioal objective space is realized by this radom weightig scheme. The other characteristic feature is to store all o-domiated solutios as a secodary populatio separately from a curret populatio. The secodary populatio is updated at every geeratio. A small umber of o-domiated solutios are radomly chose from the secodary populatio ad their copies are added to the curret populatio as elite solutios. The covergece speed of the curret populatio to Pareto-optimal solutios is improved by the elitist strategy. Other parts of our threeobjective geetic algorithm are the same as stadard sigle-objective geetic algorithms. Note that our task is to fid multiple o-domiated solutios while the task of stadard geetic algorithms is to fid a sigle optimal solutio. Of course, we ca use other multi-objective geetic algorithms proposed i the literature. A arbitrary subset S of N cadidate fuzzy rules ca be represeted by a biary strig of the legth N as S = s1 s 2 s N, (20) where s = 0 meas that the -th rule R is ot icluded i S while s = 1 meas that R is icluded i S. A iitial populatio is costructed by radomly geeratig a pre-specified umber of biary strigs of the legth N. The first objective f 1 ( S ) of each strig S is calculated by classifyig all the give traiig patters by S. We use a fuzzy reasoig method based o a sigle wier rule as i Ishibuchi, Nakashima & Murata (2001). I this fuzzy reasoig method, the classificatio of each patter by the rule set S is performed by fidig a sigle wier rule with the maximum product of the rule weight ad the compatibility grade with that patter. There are may cases where some fuzzy rules i S are ot chose as wier rules for ay patters. We ca remove those fuzzy rules from S without degradig the classificatio accuracy of S. At the same time, the secod ad third objectives are improved by removig uecessary fuzzy rules. Thus we remove all fuzzy rules that are ot selected as wier rules of ay patters from the rule set S. The removal of those rules is performed for each strig i the curret populatio by chagig the correspodig 1 s to 0 s before the secod ad third objectives are calculated. After the three objectives of each strig (i.e., each rule set) i the curret populatio are calculated, the secodary populatio of o-domiated rule sets is updated. That is, each rule set i the curret populatio is examied whether it is domiated by other rule sets i the curret ad secodary populatios. If it is ot domiated by ay other rule sets, its copy is added to the secodary populatio. The all rule sets domiated by the ewly added oe are removed from the secodary populatio. I this maer, the secodary populatio is updated at every geeratio. The fitess value of each rule set S i the curret populatio is defied by the three objectives as fitess ( S ) = w1 f 1 ( S ) w 2 f 2 ( S ) w 3 f 3 ( S ), (21) where w 1, w 2 ad w 3 are weights satisfyig the followig coditios: w 1, w2, w3 0, (22) w 1 + w2 + w3 = 1. (23) Wheever a pair of paret strigs is selected from the curret populatio, these weights are radomly updated. The radom specificatio of the rule weights is to search for a variety of o-domiated rule sets i the threedimesioal objective space. Biary touramet selectio with replacemet is used for selectig a pair of paret

6 strigs usig the scalar fitess fuctio i (21) with the radomly specified weights. That is, two strigs are radomly selected from the curret populatio ad the better oe is chose as a paret strig. The the two strigs are retured to the curret populatio. The other paret strig is also selected i the same maer usig the same weight values. Whe aother pair of paret strigs is selected, the weight values are radomly updated. Uiform crossover is applied to each pair of paret strigs to geerate a ew strig. The biased mutatio is applied to the geerated strig for efficietly decreasig the umber of fuzzy rules icluded i the strig. I the biased mutatio operatio, a larger probability is assiged to the mutatio from 1 to 0 (i.e., mutatio for decreasig the umber of fuzzy rules) tha the mutatio from 0 to 1 (i.e., mutatio for icreasig the umber of fuzzy rules). The ext populatio cosists of the ewly geerated strigs by the geetic operatios. Some o-domiated strigs i the secodary populatio are radomly selected as elite solutios ad their copies are added to the ew populatio. The outlie of the three-objective geetic algorithm for rule selectio is writte as follows: Step 0: Parameter Specificatio. Specify the populatio size N pop, the umber of elite solutios N elite that are radomly selected from the secodary populatio ad added to the curret populatio, the crossover probability p c, two mutatio probabilities p m ( 1 0) ad p m ( 0 1), ad the stoppig coditio. Step 1: Iitializatio. Radomly geerate N pop biary strigs of the legth N as a iitial populatio. Calculate the three objectives of each strig. I this calculatio, uecessary rules are removed from each strig. Fid o-domiated strigs (i.e., o-domiated rule sets) i the iitial populatio. A secodary populatio cosists of copies of those odomiated strigs. Step 2: Geetic Operatios. Geerate ( N pop N elite ) strigs usig geetic operatios (i.e., biary touramet selectio, uiform crossover, ad biased mutatio) from the curret populatio. Step 3: Evaluatio. Calculate the three objectives of each of the ewly geerated ( N pop N elite ) strigs. I this calculatio, uecessary rules are removed from each strig. The curret populatio cosists of the modified strigs. Step 4: Secodary Populatio Update. Update the secodary populatio by examiig each strig i the curret populatio as metioed above. Step 5: Elitist Strategy. Radomly select N elite strigs from the secodary populatio ad add their copies to the curret populatio. Step 6: Termiatio Test. If the stoppig coditio is ot satisfied, retur to Step 2. Otherwise termiate the executio of the algorithm. All the o-domiated strigs amog examied oes i the executio of the algorithm are stored i the secodary populatio. 5. COMPUTER SIMULATIONS We apply the proposed rule selectio method to wie data available from the UCI Machie Learig Repository ( The wie data set cosists of 178 samples with 13 cotiuous attributes from three classes. We ormalized each attribute value ito a real umber i the uit iterval [0, 1]. Thus the wie data set was hadled as a three-class patter classificatio problem i the 13-dimesioal uit 13 hypercube [ 0, 1]. The total umber of possible 13 combiatios of atecedet fuzzy sets is 15. First we geerated fuzzy rules of the legth three or less usig all the 178 samples as traiig patters. The umber of geerated fuzzy rules of each legth is summarized i Table 1. The fuzzy rule of the legth zero has o atecedet coditios, Class 2 coseuet, ad a very small certaity grade (i.e., rule weight). This fuzzy rule ca be geerated because the umber of Class 2 samples is the largest amog the three classes i the wie data. Table 1: The umber of geerated fuzzy rules of each legth. Legth of rules Total Number of rules , , ,716 The geerated 711,716 fuzzy rules were divided ito three groups accordig to their coseuet classes. Fuzzy rules i each class were sorted i a descedig order of the product of the cofidece ad the support. From each group, the first 300 fuzzy rules were selected as cadidate rules ( N = 900 : 900 cadidate rules i total). The the three-objective geetic algorithm was applied to the 900 cadidate rules usig the followig parameter specificatios. Populatio size: N pop = 50, Number of elite solutios: N elite = 5, Crossover probability: p c = 0. 9, Mutatio probability: p m ( 1 0) = 0. 1, p m ( 0 1) = 1/ N, Stoppig coditio: 10,000 geeratios. Our computer simulatios were iterated 20 times. Nodomiated rule sets obtaied from those 20 trials are summarized i Table 2. Examples of the obtaied rule

7 sets i Table 2 are show i Fig. 4 ad Fig. 5. Fig. 4 shows three fuzzy rules with oly a sigle atecedet coditio, which correspod to the secod rule set with a 94.9% classificatio rate i Table 2. Fig. 5 shows three fuzzy rules with a few atecedet coditios, which correspod to the sixth rule set with a 100% classificatio rate i Table 2. Table 2: No-domiated rule sets obtaied from 20 trials of the proposed method with 900 cadidate rules. Number of rules Average rule legth Classificatio rate (%) selected 900 cadidate rules from the geerated 711,716 fuzzy rules. Simulatio results are summarized i Table 3. From the compariso betwee Table 2 ad Table 3, we ca see that the classificatio ability ad/or the iterpretability of obtaied rule sets were deteriorated by the use of radomly selected cadidate rules. We also performed the same computer simulatio usig o prescreeig procedure. I this case, all the geerated 711,716 fuzzy rules were used as cadidate rules. Thus the strig legth was 711,716. As we ca expect, the executio of the three-objective geetic algorithm with such a log strig reuired large memory storage ad log CPU time. Table 4 shows o-domiated rule sets obtaied from te trials of the three-objective geetic algorithm. Sice the search space was too large, good rule sets could ot be obtaied withi a reasoable computatio time (especially with respect to the umber of fuzzy rules as show i Table 4). The average CPU time for each trial was about 11 hours i Table 4 while it was about four miutes i Table 2 with 900 cadidate rules selected by the proposed prescreeig procedure. R 1 R 2 R 3 x 1 x7 x13 Coseuet Class 1 (0.39) Class 2 (0.31) Class 3 (0.29) Figure 4: Three fuzzy rules with a 94.9% classificatio rate. R 1 R 2 R 3 x 1 x 5 x7 x10 x11 x13 Coseuet Class 1 (0.25) Class 2 (0.77) Class 3 (0.89) Figure 5: Three fuzzy rules with a 100% classificatio rate. From Table 2, we ca see that our rule selectio method foud various rule sets with differet classificatio rates ad differet sizes. The selected rule sets have high iterpretability as show i Fig. 4 ad Fig. 5. From the compariso betwee Fig. 4 ad Fig. 5, we ca observe the existece of a tradeoff betwee classificatio accuracy ad iterpretability (i.e., the three fuzzy rules i Fig. 5 have a higher classificatio rate but less iterpretable). For examiig the usefuless of the proposed prescreeig procedure of cadidate rules, the same computer simulatio was performed usig radomly Table 3: Simulatio results with radomly selected 900 cadidate rules. Number of rules Average rule legth Classificatio rate (%) Table 4: Simulatio results with 711,716 cadidate rules. Number of rules Average rule legth Classificatio rate (%) Fially we examied the effect of usig various fuzzy partitios for each iput o the classificatio performace of fuzzy rule-based classificatio systems. I the same maer as the computer simulatio for Table 2, we applied our rule selectio method to the wie data set usig oly the fiest fuzzy partitio with five liguistic labels i Fig. 3 (i.e., the bottom-right fuzzy partitio i

8 Fig. 3). Table 5 shows o-domiated rule sets obtaied from 20 trials. From the compariso betwee Table 2 ad Table 5, we ca see that smaller rule sets with higher classificatio rates were obtaied i Table 2 tha Table 5. This result was expected from the fact that the three fuzzy rules with a 100% classificatio rate i Fig. 5 use various fuzzy partitios with differet graularities. Table 5: No-domiated rule sets obtaied from 20 trials usig oly a sigle fuzzy partitio with five fuzzy sets. Number of rules 6. CONCLUSIONS Average rule legth Classificatio rate (%) I this paper, we exteded the geetic algorithm-based rule selectio method i Ishibuchi, Nakashima & Murata (2001) to the case where various fuzzy partitios with differet graularities are used for each iput. This extesio leads to the icrease i the umber of cadidate rules. Thus we proposed a prescreeig procedure for decreasig the umber of cadidate rules. The proposed prescreeig procedure is based o two rule evaluatio criteria of associatio rules i the field of data miig. Through computer simulatios, we demostrated the ecessity of cadidate rule prescreeig i geetic algorithm-based rule selectio. The three-objective geetic algorithm could ot fid good rule sets whe cadidate rules were radomly chose. I the case of o prescreeig, the CPU time was very log (i.e., about 11 hours) while it was a few miutes i the case with the proposed prescreeig procedure. REFERENCES R. Agrawal et al. (1996) Fast discovery of associatio rules, i U. M. Fayyad et al. (eds.) Advaces i Kowledge Discovery & Data Miig, , AAAI Press, Melo Park. J. Casillas, O. Cordó, F. Herrera, ad L. Magdalea (2002) Trade-off betwee Accuracy ad Iterpretability i Fuzzy Rule-Based Modelig, Physica-Verlag. L. Castillo, A. Gozalez, ad P. Perez (2001) Icludig a simplicity criterio i the selectio of the best rule i a geetic fuzzy learig algorithm, Fuzzy Sets ad Systems 120, O. Cordo, M. J. del Jesus, ad F. Herrera (1999) A proposal o reasoig methods i fuzzy rule-based classificatio systems, Iteratioal Joural of Approximate Reasoig 20, U. M. Fayyad ad K. B. Irai (1993) Multi-iterval discretizatio of cotiuous-valued attributes for classificatio learig, Proc. of 13th Iteratioal Joit Coferece o Artificial Itelligece, T. -P. Hog, C. -S. Kuo, ad S. -C. Chi (2001) Trade-off betwee computatio time ad umber of rules for fuzzy miig from uatitative data, Iteratioal Joural of Ucertaity, Fuzziess ad Kowledge-Based Systems 9, H. Ishibuchi, T. Nakashima, ad T. Murata (2001) Three-objective geetics-based machie learig for liguistic rule extractio, Iformatio Scieces 136, H. Ishibuchi, T. Yamamoto, ad T. Nakashima (2001) Fuzzy data miig: Effect of fuzzy discretizatio, Proc. of 1st IEEE Iteratioal Coferece o Data Miig, C. T. Leodes (1999) Fuzzy Theory Systems: Techiues ad Applicatios (Vols. 1-4), Academic Press, Sa Diego. C. A. Pee-Reyes ad M. Sipper (1999) Desigig brest cacer diagostic systems via a hybrid fuzzy-geetic methodology, Proc. of IEEE Iteratioal Coferece o Fuzzy Systems 1, J. R. Quila (1993) C4.5: Programs for Machie Learig, Morga Kaufma, Sa Mateo. H. Roubos ad M Setes (2001) Compact ad trasparet fuzzy models ad classifiers through iterative complexity reductio, IEEE Tras. o Fuzzy Systems 9, T. Suzuki ad T. Furuhashi (2001) Evolutioary algorithm based fuzzy modelig usig cociseess measure, Proc. of Joit IFSA-NAFIPS Iteratioal Coferece, E. Zitzler, K. Deb, ad L. Thiele (2000) Compariso of Multiobjective Evolutioary Algorithms: Empirical Results, Evolutioary Computatio 8, E. Zitzler ad L. Thiele (1999) Multiobjective evolutioary algorithms: A comparative case study ad the stregth Pareto approach, IEEE Tras. o Evolutioary Computatio 3,

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences Miig from Quatitative Data with Liguistic Miimum Supports ad Cofideces Tzug-Pei Hog, Mig-Jer Chiag ad Shyue-Liag Wag Departmet of Electrical Egieerig Natioal Uiversity of Kaohsiug Kaohsiug, 8, Taiwa, R.O.C.

More information

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible

More information

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5 Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:

More information

Designing a learning system

Designing a learning system CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try

More information

Optimization of Multiple Input Single Output Fuzzy Membership Functions Using Clonal Selection Algorithm

Optimization of Multiple Input Single Output Fuzzy Membership Functions Using Clonal Selection Algorithm Optimizatio of Multiple Iput Sigle Output Fuzzy Membership Fuctios Usig Cloal Selectio Algorithm AYŞE MERVE ACILAR, AHMET ARSLAN Computer Egieerig Departmet Selcuk Uiversity Selcuk Uiversity, Eg.-Arch.

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

ISSN (Print) Research Article. *Corresponding author Nengfa Hu

ISSN (Print) Research Article. *Corresponding author Nengfa Hu Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Heuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP)

Heuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP) Heuristic Approaches for Solvig the Multidimesioal Kapsack Problem (MKP) R. PARRA-HERNANDEZ N. DIMOPOULOS Departmet of Electrical ad Computer Eg. Uiversity of Victoria Victoria, B.C. CANADA Abstract: -

More information

New HSL Distance Based Colour Clustering Algorithm

New HSL Distance Based Colour Clustering Algorithm The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

Performance Comparisons of PSO based Clustering

Performance Comparisons of PSO based Clustering Performace Comparisos of PSO based Clusterig Suresh Chadra Satapathy, 2 Guaidhi Pradha, 3 Sabyasachi Pattai, 4 JVR Murthy, 5 PVGD Prasad Reddy Ail Neeruoda Istitute of Techology ad Scieces, Sagivalas,Vishaapatam

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

Variance as a Stopping Criterion for Genetic Algorithms with Elitist Model

Variance as a Stopping Criterion for Genetic Algorithms with Elitist Model Fudameta Iformaticae 120 (2012) 145 164 145 DOI 10.3233/FI-2012-754 IOS Press Variace as a Stoppig Criterio for Geetic Algorithms with Elitist Model Diabadhu Bhadari, C. A. Murthy, Sakar K. Pal Ceter for

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

More information

The golden search method: Question 1

The golden search method: Question 1 1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

More information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

Fuzzy Linear Regression Analysis

Fuzzy Linear Regression Analysis 12th IFAC Coferece o Programmable Devices ad Embedded Systems The Iteratioal Federatio of Automatic Cotrol September 25-27, 2013. Fuzzy Liear Regressio Aalysis Jaa Nowaková Miroslav Pokorý VŠB-Techical

More information

Li Zheng2 School of Management Fujian University of Technology Fujian Province, , China

Li Zheng2 School of Management Fujian University of Technology Fujian Province, , China Iteratioal Coferece of Orgaizatioal Iovatio (ICOI 07) Usig Fuzzy FP-Growth for Miig Associatio Rules Chie-Hua Wag* * Correspodig author: wagthuck@gmail.com Li Zheg zzheglimail@gmail.com Xuelia Yu Yuxuelia_00@6.com

More information

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms

More information

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19 CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.

More information

An Estimation of Distribution Algorithm for solving the Knapsack problem

An Estimation of Distribution Algorithm for solving the Knapsack problem Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,

More information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

More information

Data-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps

Data-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps Data-Drive Noliear Hebbia Learig Method for Fuzzy Cogitive Maps Wociech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy Cogitive Maps (FCMs) are a coveiet tool for modelig of dyamic systems by meas

More information

Mathematical Stat I: solutions of homework 1

Mathematical Stat I: solutions of homework 1 Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

Designing a learning system

Designing a learning system CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please

More information

Parallel Learning of Large Fuzzy Cognitive Maps

Parallel Learning of Large Fuzzy Cognitive Maps g Proceedigs of Iteratioal Joit Coferece o Neural Networks, Orlado, Florida, USA, August 2-7, 07 Parallel Learig of Large Fuzzy Cogitive Maps Wojciech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy

More information

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System Evaluatio of Differet Fitess Fuctios for the Evolutioary Testig of a Autoomous Parkig System Joachim Wegeer 1 ad Oliver Bühler 2 1 DaimlerChrysler AG, Research ad Techology, Alt-Moabit 96 a, D-10559 Berli,

More information

On Computing the Fuzzy Weighted Average Using the KM Algorithms

On Computing the Fuzzy Weighted Average Using the KM Algorithms O Computig the Fuzzy Weighted Average Usig the KM Algorithms Feilog iu ad Jerry M Medel Sigal ad Image Processig Istitute, Departmet of Electrical Egieerig Uiversity of Souther Califoria, 3740 McClitock

More information

Normal Distributions

Normal Distributions Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13 CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis

More information

Optimal Mapped Mesh on the Circle

Optimal Mapped Mesh on the Circle Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:

More information

Assignment Problems with fuzzy costs using Ones Assignment Method

Assignment Problems with fuzzy costs using Ones Assignment Method IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha

More information

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu

More information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New Fuzzy Color Clustering Algorithm Based on hsl Similarity IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper

More information

Continuous Ant Colony System and Tabu Search Algorithms Hybridized for Global Minimization of Continuous Multi-minima Functions

Continuous Ant Colony System and Tabu Search Algorithms Hybridized for Global Minimization of Continuous Multi-minima Functions Cotiuous At Coloy System ad Tabu Search Algorithms Hybridized for Global Miimizatio of Cotiuous Multi-miima Fuctios Akbar Karimi Departmet of Aerospace Egieerig, Sharif Uiversity of Techology, P.O. Box:

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

Our second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.

Our second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees. Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for

More information

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a 4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

A New Bit Wise Technique for 3-Partitioning Algorithm

A New Bit Wise Technique for 3-Partitioning Algorithm Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015. Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative

More information

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4

More information

THE reconstruction of the AND-OR expression of a

THE reconstruction of the AND-OR expression of a IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 23, NO. 1, JANUARY 2011 37 Couplig Logical Aalysis of Data ad Shadow Clusterig for Partially Defied Positive Boolea Fuctio Recostructio Marco Muselli,

More information

Counting the Number of Minimum Roman Dominating Functions of a Graph

Counting the Number of Minimum Roman Dominating Functions of a Graph Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph

More information

CSCI 5090/7090- Machine Learning. Spring Mehdi Allahyari Georgia Southern University

CSCI 5090/7090- Machine Learning. Spring Mehdi Allahyari Georgia Southern University CSCI 5090/7090- Machie Learig Sprig 018 Mehdi Allahyari Georgia Souther Uiversity Clusterig (slides borrowed from Tom Mitchell, Maria Floria Balca, Ali Borji, Ke Che) 1 Clusterig, Iformal Goals Goal: Automatically

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

A Study on the Performance of Cholesky-Factorization using MPI

A Study on the Performance of Cholesky-Factorization using MPI A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio

More information

Feature classification for multi-focus image fusion

Feature classification for multi-focus image fusion Iteratioal Joural of the Physical Scieces Vol. 6(0), pp. 4838-4847, 3 September, 0 Available olie at http://www.academicjourals.org/ijps DOI: 0.5897/IJPS.73 ISSN 99-950 0 Academic Jourals Full Legth Research

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

Lecture 17: Feature Subset Selection II

Lecture 17: Feature Subset Selection II Lecture 17: Feature Subset Selectio II Expoetial search methods Brach ad Boud Approximate Mootoicity with Brach ad Boud Beam Search Radomized alorithms Radom Geeratio plus Sequetial Selectio Simulated

More information

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1 COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,

More information

Criterion in selecting the clustering algorithm in Radial Basis Functional Link Nets

Criterion in selecting the clustering algorithm in Radial Basis Functional Link Nets WSEAS TRANSACTIONS o SYSTEMS Ag Sau Loog, Og Hog Choo, Low Heg Chi Criterio i selectig the clusterig algorithm i Radial Basis Fuctioal Lik Nets ANG SAU LOONG 1, ONG HONG CHOON 2 & LOW HENG CHIN 3 Departmet

More information

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,

More information

Classification of binary vectors by using DSC distance to minimize stochastic complexity

Classification of binary vectors by using DSC distance to minimize stochastic complexity Patter Recogitio Letters 24 (2003) 65 73 www.elsevier.com/locate/patrec Classificatio of biary vectors by usig DSC distace to miimize stochastic complexity Pasi Fr ati *, Matao Xu, Ismo K arkk aie Departmet

More information

DATA MINING II - 1DL460

DATA MINING II - 1DL460 DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

More information

The Impact of Feature Selection on Web Spam Detection

The Impact of Feature Selection on Web Spam Detection I.J. Itelliget Systems ad Applicatios, 2012, 9, 61-67 Published Olie August 2012 i MECS (http://www.mecs -press.org/) DOI: 10.5815/ijisa.2012.09.08 The Impact of Feature Selectio o Web Spam Detectio Jaber

More information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

Solving Fuzzy Assignment Problem Using Fourier Elimination Method Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio

More information

Appendix D. Controller Implementation

Appendix D. Controller Implementation COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);

More information

Data diverse software fault tolerance techniques

Data diverse software fault tolerance techniques Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the

More information

Security of Bluetooth: An overview of Bluetooth Security

Security of Bluetooth: An overview of Bluetooth Security Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give

More information

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used

More information

Evolutionary Hybrid Genetic-Firefly Algorithm for Global Optimization

Evolutionary Hybrid Genetic-Firefly Algorithm for Global Optimization Iteratioal Joural of Computatioal Egieerig & Maagemet, Vol. 6 Issue, May ISSN (Olie): -789 www..org Evolutioary Hybrid Geetic-Firefly Algorithm for Global Optimizatio 7 Shaik Farook, P. Sagameswara Raju

More information

Multiobjective Formulations of Fuzzy Rule-Based Classification System Design

Multiobjective Formulations of Fuzzy Rule-Based Classification System Design Multiobjective Formulations of Fuzzy Rule-Based Classification System Design Hisao Ishibuchi and Yusuke Nojima Graduate School of Engineering, Osaka Prefecture University, - Gakuen-cho, Sakai, Osaka 599-853,

More information

Analysis of Documents Clustering Using Sampled Agglomerative Technique

Analysis of Documents Clustering Using Sampled Agglomerative Technique Aalysis of Documets Clusterig Usig Sampled Agglomerative Techique Omar H. Karam, Ahmed M. Hamad, ad Sheri M. Moussa Abstract I this paper a clusterig algorithm for documets is proposed that adapts a samplig-based

More information

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

A METHOD OF GENERATING RULES FOR A KERNEL FUZZY CLASSIFIER

A METHOD OF GENERATING RULES FOR A KERNEL FUZZY CLASSIFIER Proceedigs of the Sixth Iteratioal Coferece o Machie Learig ad Cyberetics, Hog Kog, 9- August 7 A METHOD OF GENERATING RULES FOR A KERNEL FUZZY CLASSIFIER AI-MIN YANG,, XIN-GUANG LI, LING-MIN JIANG,YONG-MEI

More information

Data Structures Week #9. Sorting

Data Structures Week #9. Sorting Data Structures Week #9 Sortig Outlie Motivatio Types of Sortig Elemetary (O( 2 )) Sortig Techiques Other (O(*log())) Sortig Techiques 21.Aralık.2010 Boraha Tümer, Ph.D. 2 Sortig 21.Aralık.2010 Boraha

More information

A Boolean Query Processing with a Result Cache in Mediator Systems

A Boolean Query Processing with a Result Cache in Mediator Systems A Boolea Query Processig with a Result Cache i Mediator Systems Jae-heo Cheog ad Sag-goo Lee * Departmet of Computer Sciece Seoul Natioal Uiversity Sa 56-1 Shillim-dog Kwaak-gu, Seoul Korea {cjh, sglee}cygus.su.ac.kr

More information

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article Available olie www.jocpr.com Joural of Chemical ad Pharmaceutical Research, 2013, 5(12):745-749 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 K-meas algorithm i the optimal iitial cetroids based

More information

Małgorzata Sterna. Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak

Małgorzata Sterna. Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak Małgorzata Stera Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak Istitute of Computig Sciece Pozań Uiversity of Techology Pozań - Polad Scope of the Talk Problem defiitio MP Formulatio

More information

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,

More information

Chapter 8. Strings and Vectors. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 8. Strings and Vectors. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 8 Strigs ad Vectors Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Slide 8-3 8.1 A Array Type for Strigs A Array Type for Strigs C-strigs ca be used to represet strigs

More information

Optimization on Retrieving Containers Based on Multi-phase Hybrid Dynamic Programming

Optimization on Retrieving Containers Based on Multi-phase Hybrid Dynamic Programming Available olie at www.sciecedirect.com ScieceDirect Procedia - Social ad Behavioral Scie ce s 96 ( 2013 ) 844 855 Abstract 13th COTA Iteratioal Coferece of Trasportatio Professioals (CICTP 2013) Optimizatio

More information