Fuzzy Weighted Association Rule Mining with Weighted Support and Confidence Framework
|
|
- Phillip Paul
- 6 years ago
- Views:
Transcription
1 Fuzzy Weghted Assocaton Rule Mnng wth Weghted Support and Confdence Framework M. Sulaman Khan, Maybn Muyeba, Frans Coenen 2 Lverpool Hope Unversty, School of Computng, Lverpool, UK 2 The Unversty of Lverpool, Department of Computer Scence, Lverpool, UK khanm@hope.ac.uk, muyebam@hope.ac.uk, frans@csc.lv.ac.uk} Abstract. In ths paper we extend the problem of mnng weghted assocaton rules. A classcal model of boolean and fuzzy quanttatve assocaton rule mnng s adopted to address the ssue of nvaldaton of downward closure property (DCP) n weghted assocaton rule mnng where each tem s assgned a weght accordng to ts sgnfcance w.r.t some user defned crtera. Most works on DCP so far struggle wth nvald downward closure property and some assumptons are made to valdate the property. We generalze the problem of downward closure property and propose a fuzzy weghted support and confdence framework for boolean and quanttatve tems wth weghted settngs. The problem of nvaldaton of the DCP s solved usng an mproved model of weghted support and confdence framework for classcal and fuzzy assocaton rule mnng. Our methodology follows an Apror algorthm approach and avods pre and post processng as opposed to most weghted ARM algorthms, thus elmnatng the extra steps durng rules generaton. The paper concludes wth expermental results and dscusson on evaluatng the proposed framework. Keywords: Assocaton rules, fuzzy, weghted support, weghted confdence, downward closure. Introducton Assocaton rules (ARs) [] have been wdely used to determne customer buyng patterns from market basket data. The task of mnng assocaton rules s manly to dscover assocaton rules (wth strong support and hgh confdence) n large databases. Classcal Assocaton Rule Mnng (ARM) deals wth the relatonshps among the tems present n transactonal databases [9, 0]. The typcal approach s to frst generate all large (frequent) temsets (attrbute sets) from whch the set of ARs s derved. A large temset s defned as one that occurs more frequently n the gven data set than a user suppled support threshold. To lmt the number of ARs generated a confdence threshold s used. The number of ARs generated can therefore be nfluence by careful selecton of the support and confdence thresholds, however great
2 care must be taken to ensure that temsets wth low support, but from whch hgh confdence rules may be generated, are not omtted. Gven a set of tems I,,... } and a database of transactons 2 m 2 p D t, t2,... t n} where t I, I,... I }, p m and I, f X I wth K X s called a k-temset or smply an temset. Let a database D be a mult-set of subsets of I as shown. Each An assocaton rule s an expresson X > Y, where X, Y are tem sets and X Y holds. Number of transactons T supportng an tem X w.r.t D s called support of X, Supp( X ) T D X T}/ D. The strength or confdence (c) for an assocaton rule X > Y s the rato of the number of transactons that contan X U Y to the number of transactons that contan X, Conf (X Y) Supp (X U Y)/ Supp (X). For non-boolean tems fuzzy assocaton rule mnng was proposed usng fuzzy sets such that quanttatve and categorcal attrbutes can be handled [2]. A fuzzy quanttatve rule represents each tem as (tem, value) par. Fuzzy assocaton rules are expressed n the followng form: I j T D supports an temset X I f X T holds. If X s A satsfes Y s B For example, f (age s young) > (salary s low) Gven a database T, attrbutes I wth temsets X I, Y I and X x, x2,... xn} and Y y, y2,... yn} and X Y fuzzy sets A fx, fx2,..., fxn} and B fx, fx2,..., fxn} Y respectvely. For example (, Y ), we can defne assocated to X and X could be (age, young), (age, old), (salary, hgh) etc. The semantcs of the rule s that when the antecedent X s A s satsfed, we can mply that Y s B s also satsfed, whch means there are suffcent records that contrbute ther votes to the attrbute fuzzy set pars and the sum of these votes s greater than the user specfed threshold. However, the above ARM framework assumes that all tems have the same sgnfcance of mportance.e. ther weght wthn a transacton or record s the same (weght) whch s not always the case. For example, [wne salmon, %, 80%] may be more mportant than [bread mlk, 3%, 80%] even though the former holds a lower support of %. Ths s because those tems n the frst rule usually come wth more proft per unt sale, but the standard ARM smply gnores ths dfference. Table. Wegted Items Database ID Item Proft Weght Scanner Prnter Montor Computer Table 2. Transactons TID Items,2,4 2 2,3 3,2,3,4 4 2,3,4
3 Weghted ARM deals wth the mportance of ndvdual tems n a database [2, 3, 4]. For example, some products are more proftable or may be under promoton, therefore more nterestng as compared to others, and hence rules concernng them are of greater value. Items are assgned weghts (w) accordng to ther sgnfcance as shown n table. These weghts may be set accordng to an tem s proft margn. Ths generalzed verson of ARM s called Weghted Assocaton Rule Mnng (WARM). From table, we can see that the rule Computer Prnter s more nterestng than Computer Scanner because the proft of a prnter s greater than that of a scanner. The man challenge n weghted ARM s that downward closure property whch s crucal for effcent teratve process of generatng and prunng frequent temsets from subsets. In ths paper we address the ssue of downward closure property n WARM. We generalze and solve the problem of downward closure property and propose a weghted support and confdence framework for both boolean and quanttatve tems for classcal and fuzzy WARM (FWARM). We evaluate our proposed framework wth expermental results. The paper s organsed as follows: secton 2 presents background and related work; secton 3 gves problem defnton one; secton 4 gves problem defnton 2; secton 5 detals weghted downward closure property; secton 6 revews expermental results and secton 7 concludes the paper wth drectons for future work. 2 Background and Related Work Classcal ARM data tems are vewed as havng equal mportance but recently some approaches generalze ths where tems are gven weghts to reflect ther sgnfcance to the user [4]. The weghts may correspond to specal promotons on some products or the proftablty of dfferent tems etc. Currently, two approaches exst: pre- and post-processng. Post processng solves frst the non-weghted problem (weghts per tem) and then prunes the rules later. Pre -processng prunes the nonfrequent temsets earler usng weghts after every teraton. The ssue post-processed weghted ARM s that frst, tems are scanned wthout consderng ther weghts. Fnally, the rule base s checked for frequent weghted ARs. Ths gves us a very lmted temset pool to check weghted ARs and may mss many potental temsets. In pre-processng, classcal ARM prunes temsets by checkng frequent ones aganst weghted support after every scan. In pre-processng, less rules are obtaned as compared to post processng because many potental frequent super sets are mssed. In [2] a post-processng model s proposed. Two algorthms were proposed to mne temsets wth normalzed and un-normalzed weghts. The K-support bound metrc was used to ensure valdty of the downward closure property. Even that ddn t guarantee every subset of a frequent set beng frequent unless the k-support bound value of (K-) subset was hgher than (K). Effcent mnng methodology for Weghted Assocaton Rules (WAR) s proposed n [3]. A Numercal attrbute was assgned for each tem where the weght of the tem was defned as part of a partcular weght doman. For example, soda[4,6] snack[3,5] means that f a customer purchases soda n the quantty between 4 and 6
4 bottles, he s lkely to purchase 3 to 5 bags of snacks. WAR uses a post-processng approach by dervng the maxmum weghted rules from frequent temsets. Post WAR doesn t nterfere wth the process of generatng frequent temsets but focuses on how weghted assocaton rules can be generated by examnng the weghtng factors of the tems ncluded n generated frequent temsets. Smlar technques for weghted fuzzy quanttatve assocaton rule mnng [5, 7, 8]. In [6], a two-fold pre processng approach s used where frstly, quanttatve attrbutes are dscretsed nto dfferent fuzzy lngustc ntervals and weghts assgned to each lngustc label. A mnng algorthm s appled then on the resultng dataset by applyng two support measures for normalzed and un-normalzed cases. The closure property s addressed by usng the z-potental frequent subset for each canddate set. An arthmetc mean s used to fnd the possblty of frequent k+temset, whch s not guaranteed to valdate the vald downward closure property. Another sgnfcance framework, WARM, that handles the DCP problem, s proposed []. Weghtng spaces were ntroduced as nner-transacton space, tem space and transacton space, n whch tems can be weghted dependng on dfferent scenaros and mnng focus. However, support s calculated by only consderng the transactons that contrbute to the temset. Further, no dscussons were made on the confdence or nterestngness ssue of the rules produced In ths paper we present a fuzzy weghted support and confdence framework to mne weghted boolean and quanttatve data (by fuzzy means) to address the ssue of nvaldaton of downward closure property. We then show that usng the proposed framework, rules can be generated effcently wth a vald downward closure property wthout bases made by pre- or post-processng approaches. 3 Problem Defnton One (Boolean) Let the nput data D have transactons T t, t, t, L, tn} wth a set of tems 2 3 I,,, L, } and a set of non-negatve, real number weghts 2 3 I W w, w2, w3, L, w I } assocated wth each tem. Each th transacton some subset of I and a weght w s attached to each tem ] the th transacton). [ j t s t (the jth tem n Table 3. Transactonal Database T Items I t t t t t Table 4. Items wth weghts Items Weghts (IW)
5 Thus each tem.e. a par ) j wll have assocated wth t a weght correspondng to the set W, (, w s called a weghted tem where I. Weght for the jth tem n the th transacton s gven by t [ [ j. We llustrate the concept and defntons usng tables 3 and 4. Table 3 contans transactons for 5 tems. Table 4 has correspondng weghts assocated to each tem n T. In our defntons, we use sum of votes for each temset by multplyng weght occurrence per tem as a standard approach. Defnton Item Weght IW s a real value gven to each tem wth some degree of mportance, a weght j [w]. j rangng [0..] Defnton 2 Itemset Transacton Weght ITW s the product of weghts of all the tems n the temset present n a sngle transacton. Itemset transacton weght for an temset X can calculated as: vote for t satsfyng X X ( [ [ X ) t[ k [ k Itemset transacton weght ITW of temset (2, 4) s calculated as: ITW ( 2,4) Defnton 3 Weghted Support WS s the sum of temset transacton weght ITW of all the transactons n whch temset s present, dvded by the total number of transactons. It s denoted as: WS ( X ) Sum of votes satsfyng X Number of records n T n X k ( [ [ X ) t [ k[ Let s take an example of temset (2, 4), and fnd ts temset transacton weght, weghted support and weghted confdence. Weghted Support WS of temset (2, 4) s calculated as: Sum of votes satsfyng (2,4) 2,4) Number of records n T n () (2) (.7.3) + (.7.3) + (.7.3) 5 Defnton 4 Weghted Confdence WC s the rato of sum of votes satsfyng both X Y to the sum of votes satsfyng X. It s formulated (wth Z X Y ) as:
6 WC( X Z) Y) X ) n k X Z k ( [ z[ Z) ( [ [ X ) t [ z [ k t [ x [ k (3) Weghted Confdence WC of temset (2, 4) s calculated as: Z ) X Y) 0.26 WC ( 2,4) WC(2,4) WC(2,4) 0.9 X ) X ) Problem Defnton Two (Quanttatve/Fuzzy) Let a dataset D conssts of a set of transactons T t, t, t, L, tn} wth a set of tems I,,, L, } 2 3 I 2 3. A fuzzy dataset D conssts of fuzzy transactons T t, t, t,..., t } wth fuzzy sets assocated wth each tem n I, whch s 2 3 n dentfed by a set of lngustc labels l, l, l,..., l } example L small, medum, l arg e} L (for 2 3 L ). We assgn a weght w to each l n L assocated wth. Each attrbute t ] s assocated (to some degree) wth [ j several fuzzy sets. The degree of assocaton s gven by a membershp degree n the range [ 0..], whch ndcates the correspondence between the value of a gven t [ j ] and the set of fuzzy lngustc labels. The kth weghted fuzzy set for the jth tem n the th fuzzy transacton s gven by t [ [ l [ ]. Thus each label l k for tem a weghted tem where would have assocated wth t a weght,.e. a par ([ [ l]], w) j weght assocated wth label l. j k s called [ [ l]] L s a label assocated wth tem and w W s the Table 5. Fuzzy Transactonal Database TID X Y Small Medum Small Medum Table 6. Fuzzy Items wth weghts Fuzzy Items [l] Weghts (IW) (X, Small).9 (X, Medum).7 (Y, Small).5 (Y, Medum).3
7 We llustrate the fuzzy weghted ARM concept and defntons usng tables 5 and 6. Table 5 contans transactons for 2 quanttatve tems further dscretsed nto two overlapped ntervals wth fuzzy vales. Table 4 has correspondng weghts assocated to each fuzzy tem [l] n T. Defnton 5 Fuzzy Item Weght FIW s a value attached wth each fuzzy set. It s a real number value range [ 0..] w.r.t some degree of mportance (table 6). Weght of a fuzzy set for an tem s denoted as [ l [ j j k. Defnton 6 Fuzzy Itemset Transacton Weght FITW s the product of weghts of all the fuzzy sets assocated to tems n the temset present n a sngle transacton. Fuzzy Itemset transacton weght for an temset (X, A) can be calculated as: vote for t satsfyng X L ( [ [ l[ ] X ) t [ j[ lk[ ] k Let s take an examp le of temset <(X, Medum), (Y, Small)> denoted by (X, Medum) as A and (Y, Small) as B. Fuzzy Itemset transacton weght FITW of temset (A, B) n transacton s calculated as FITW ( A, B) (.5.7) (.2.5) (.35) (.). 035 Defnton 7 Fuzzy Weghted Support FWS s the sum of weght FITW of all the transactons n whch temset s present, dvded by the total number of transactons. It s denoted as: FWS ( X ) Sum of votes satsfyng X Number of records n T n L k ( [ [ l[ ] X ) t[ j[ lk[ w n (4) (5) Weghted Support FWS of temset (A, B) s calculated as: Sum of votes satsfyng (A, B) F A, B) Number of records n T (.5.7)(.2.5) + (..7)(.4.5) + (.0.7)(..5) + (.7.7)(.5.5) Defnton 8 Fuzzy Weghted Confdence FWC s the rato of sum of votes satsfyng both X Y to the sum of votes satsfyng X wth Z X Y. It s formulated as:
8 FWC( X Y ) FWS ( Z ) FWS ( X ) n k X Z ( [ z[ Z ) ( [ [ X) k t [ z k t [ x k [ [ Fuzzy Weghted Confdence ( FWC ) of temset (A, B) s calculated as: Z) X Y) FWC ( A, B) X ) X ) Downward Closure Property (DCP) In a classcal Apror algorthm t s assumed that f the temset s large, then all ts subsets should also be large and s called Downward Closure Property (DCP). Ths helps algorthm to generate large temsets of ncreasng sze by addng tems to temsets that are already large. In the weghted ARM case where each tem s assgned weght, the DCP does not hold. Because of the weghted support, an temset may be large even though some of ts subsets are not large. Ths volates DCP (see table 7). Table 7. Frequent temsets wth nvald DCP T Items t A B C D E t 2 A C E t 3 B D t 4 A D E A B C D t 5 Items Weghts (IW) mn_supp40% weghted_supp0.4 Large Itemsets Support Large? Weghted Support Large AB 40% Yes 0.6 No AC 60% Yes 0.42 Yes ABC 40% Yes 0.4 Yes BC 40% Yes 0.36 No BD 60% Yes 0.72 Yes BCD 40% Yes 0.72 Yes Table 7 shows four large temsets of sze 2 (AB, AC, BC, BD) and two large temsets of sze 3 (ABC, BCD, whch are a combnaton of two large temsets. In classcal ARM, when the weghts are not consdered, all of the sx temsets are large. But f we consder tem weghts and calculate the weghted support of temsets accordng to defnton 3 and 7, a new set of support values are obtaned. In table 7, although the
9 classcal support of all temsets s large, f ABC and BCD are frequent then ther subsets wll also be large accordng to classcal ARM. But weghted support of AB and BC are no longer frequent. In classcal ARM usng DCP, we assume that f AB and BC are not frequent, then ABC and BCD cannot be frequent so we don t consder generatng the supersets that contan non-frequent temsets. 5. Weghted Downward Closure Property (DCP) We now argue that the DCP wth boolean and quanttatve data can be valdated by usng ths new weghted framework. We gve a proof and an example to llustrate ths. Consder fgure, where tems n the transacton are assgned weghts wth supports above a user threshold. In fgure, for each temset, weghted support WS (the number above each temset) s calculated by usng defnton 3 and weghted confdence WC (the number on top of each temset) s calculated by usng defnton 4. If an temset s weghted support s above the threshold, the temset s frequent and we mark t wth colour background and compared to the whte background, meanng that t s not large. Fg.. The lattce of frequent temsets It can be noted that f an temset s wth whte background.e. not frequent, then any of ts supersets n the upper layer of the lattce can not be frequent. Thus weghted downward closure property, s vald under the weghted support framework. It justfes the effcent mechansm of generatng and prunng sgnfcance teratvely.
10 We also brefly prove that the DCP s always vald n the proposed framework. The followng lemma apples to both boolean and fuzzy (quanttatve) data and s stated as: Lemma If an temset s not frequent them ts superset cannot be frequent and WS ( subset ) sueprset ) s always true. Proof Gven an temset X not frequent.e. ws( X ) < mn_ ws. For any temset Y, X Y.e. superset of X, f a transacton t has all the tems n Y,.e. Y t, then X t. We use tx to denote a that transacton must also have all the tems n X,.e. set of transactons each of whch has all the tems n X,.e. tx tx T, ( t tx, X t)}. Smlarly we have ty ty T,( t ty, Y t)}. Snce X Y, we havetx ty. Therefore WS ( tx) ty). Accordng to the defnton of weghted n X ( [ [ w ]] X ) t[ k[ support, k X ) the denomnator stays the same, therefore n we have WS ( X ) WS ( Y ). Becausews( X ) < mn_ ws, we get ws( Y ) < mn_ ws. Ths then proves that Y s not frequent f ts subset s not frequent. Fgure 2 llustrates a concrete example. Itemset AC appears n transacton, 5 and 8, therefore the WS (AC) ( )/ Intutvely, the occurrence of ts superset ACE s only possble when AC appears n that transacton. But temset set ACE only appears n transactons and 8, thus WS (ACE) / , where WS (ACE) <WS (AC). Summatvely, f AC s not frequent, t s superset ACE s mpossble to be frequent; hence there s no need to calculate ts weghted support. 6 Expermental Results For fuzzy weghted assocaton rule mnng standard ARM algorthms can be used or at least adopted after some modfcatons. An effcent algorthm s requred because a sgnfcant amount of processng s undertaken to the applcaton of fuzzy weghted assocaton rule mnng. The proposed Weghted ARM (WARM) and Fuzzy Weghted ARM (FWARM) algorthms belong to the breadth frst traversal famly of ARM algorthms, developed usng tree data structures [3] and works n a fashon smlar to the Apror algorthm [0]. We performed several experments usng a T0I4N0KD00k (average of 0 tems per transacton, average of 4 tems per nterestng set, 000 attrbutes and 00,000 transactons/records) artfcal data set. The data set was actually generated usng the IBM Quest data generator. The data s a transactonal database contanng 00K records and 0K tems. Two sets of experments were undertaken wth four dfferent
11 algorthms namely Weghted ARM, Fuzzy WARM, Classcal Apror ARM and Classcal WARM shown n the results below:. In the frst experment we tested usng both boolean and fuzzy datasets and compared the outcome wth classcal ARFM and WARM algorthms. The results show qute smlar behavour to classcal ARM. Results are better than WARM because we consder the whole temset space (pool) to generate frequent tems unlke the pre- or post-processng WARM approaches. Experments show () the number of frequent sets generated (usng four algorthms ), () the number of rules generated (usng weghted confdence) and () executon tme usng all four algorthms. 2. Comparson of executon tmes usng dfferent weghted supports and data szes. 6.. Experment One: (Qualty Measures) For experment one, the T0I4D00K dataset descrbed above was used wth 50 weghted attrbutes. Each tem s assgned a weght range between [ 0..]. Wth fuzzy dataset each attrbute s dvded nto fve dfferent fuzzy sets. Fgure 3 shows the number of frequent temsets generated usng () weghted boolean dataset and () wth weghted quanttatve attrbutes wth fuzzy parttons () classcal ARM wth boolean dataset and (v) and WARM wth weghted boolean datasets. A range of support thresholds was used. As expected the number of frequent temsets ncreases as the mnmum support decreases n all cases. In fgure 2, Weghted ARM shows the number of frequent temsets generated usng weghted boolean datasets. Fuzzy WARM shows the number of frequent temsets usng attrbutes wth fuzzy lngustc values, Classcal Apror shows the number of frequent temset usng boolean dataset and classcal WARM shows number of frequent temsets generated usng weghted boolean datasets wth dfferent weghted support thresholds. More frequent temsets and rules are generated because of the large temset pool. Frequent Itemsets Weghted ARM Fuzzy WARM Classcal ARM WARM Number of Rules Weghted ARM Fuzzy WARM Classcal ARM WARM Weghted Support (%) Weghted Confdence (%) Fg. 2. No. of frequent Itemsets Fg. 3. No. of Interestng Rules usng Confdence We do not use Apror ARM to frst fnd frequent temsets and then re-prune them usng weghted support measures. Instead all the potental temsets are consdered from begnnng for prunng usng Apror approach n order to valdatng the DCP. In
12 contrast classcal WARM only consders frequent temsets and prunes them (usng pre or post processng). Ths generates less frequent temsets and msses potental ones. Fgures 3 shows the number of nterestng rules generated usng weghted confdence, fuzzy weghted confdence and classcal confdence values respectvely. In all cases, the number of nterestng rules s less as compared to fgure 2. Ths s because the nterestngness measure generates fewer rules. Fgure 4 shows the executon tme of four algorthms. Executon Tme (sec) Weghted ARM Fuzzy WARM Classcal ARM WARM Weghted Support (%) Fg. 4. Executon tme to generate frequent temsets The experments show that the proposed framework produces better results as t uses all the possble temsets and generates rules usng the DCP. Further, the novelty s the ablty to analyse both boolean and fuzzy datasets wth weghted settngs Experment Two: (Performance Measures) Experment two nvestgated the effect on executon tme caused by varyng the weghted support and sze of data (number of records). Executon Tme (sec) 80 Weghted Support % 70 Weghted Support 2% Weghted Support 3% 60 Weghted Support 4% 50 Weghted Support 5% Weghted Support 6% Performance measures: Number of records (*k) Executon Tme (sec) 00 Fuzzy_WS % 90 Fuzzy_WS 2% 80 Fuzzy_WS 3% 70 Fuzzy_WS 4% 60 Fuzzy_WS 5% Fuzzy_WS 6% Performance measures: Number of records (*k) Fg. 5. Performance: weghted support (WS) Fg. 6. Performance: fuzzy WS A support threshold from 0. to 0.6 and confdence 0.5 was used. Fgures 5 and 6 show the effect of ncreasng the weghted support and number of records. To obtan dfferent data szes, we parttoned T0I4D00K nto 0 equal parttons labeled 0K,
13 20K,..,00K. Dfferent weghted support thresholds were used wth dfferent datasets. Smlarly from fgure 6, the algorthm scales lnearly wth ncreasng fuzzy weghted support threshold and number of records, smlar behavour to Classcal ARM. 7 Concluson and future work In ths paper, we have presented a weghted support and confdence framework for mnng weghted assocaton rules (Boolean and quanttatve data) by valdatng the downward closure property (DCP). We used classcal and fuzzy ARM to solve the ssue of nvaldaton of DCP n weghted ARM. We generalzed the DCP and proposed a fuzzy weghted ARM framework. The problem of nvaldaton of downward closure property s solved usng mproved model of weghted support and confdence framework for classcal and fuzzy assocaton rule mnng. There are stll some ssues wth dfferent measures for valdatng DCP, normalzaton of values etc whch are worth nvestgatng. References. Tao, F., Murtagh, F., Fard, M.: Weghted Assocaton Rule Mnng Usng Weghted Support and Sgnfcance Framework. In: Proceedngs of 9th ACM SIGKDD Conference on Knowledge Dscovery and Data Mnng, pp , Washngton DC (2003). 2. Ca, C.H., Fu, A.W-C., Cheng, C. H., Kwong, W.W.: Mnng Assocaton Rules wth Weghted Items. In: Proceedngs of 998 Intl. Database Engneerng and Applcatons Symposum (IDEAS'98), pages , Cardff, Wales, UK, July Wang, W., Yang, J., Yu, P. S.: Effcent Mnng of Weghted Assocaton Rules (WAR). In: Proceedngs of the KDD, Boston, MA, August 2000, pp Lu, S., Hu, H., L, F.: Mnng Weghted Assocaton Rules, Intellgent data Analyss Journal, 5(3), (200) 5. Wang, B-Y., Zhang, S-M.: A Mnng Algorthm for Fuzzy Weghted Assocaton Rules. In: IEEE Conference on Machne Learnng and Cybernetcs, 4, pp (2003) 6. Gyenese, A.: Mnng Weghted Assocaton Rules for Fuzzy Quanttatve Items, Proceedngs of PKDD Conference pp (2000). 7. Shu, Y. J., Tsang, E., Yeung, Damng, S.: Mnng Fuzzy Assocaton Rules wth Weghted Items, IEEE Internatonal Conference on Systems, Man, and Cybernetcs, (2000). 8. Lu, J-J.: Mnng Boolean and General Fuzzy Weghted Assocaton Rules n Databases, Systems Engneerng-Theory & Practce, 2, (2002) 9. Agrawal, R., Srkant, R.: Fast Algorthms for Mnng Assocaton Rules. In: 20 th VLDB Conference, pp (994) 0. Bodon, F.: A Fast Apror mplementaton. In: ICDM Workshop on Frequent Itemset Mnng Implementatons, vol. 90, Melbourne, Florda, USA (2003). Agrawal, R., Imelnsk, T., Swam, A.: Mnng Assocaton Rules Between Sets of Items n Large Databases. In: 2th ACM SIGMOD on Management of Data, pp (993) 2. Kuok, C.M., Fu, A., Wong, M.H.: Mnng Fuzzy Assocaton Rules n Databases. SIGMOD Record, 27, (), (998) 3. Coenen, F., Leng, P., Goulbourne, G.: Tree Structures for Mnng Assocaton Rules. Data Mnng and Knowledge Dscovery, 8() (2004)
Weighted Association Rule Mining from Binary and Fuzzy Data
Weighted Association Rule Mining from Binary and Fuzzy Data M. Sulaiman Khan 1, Maybin Muyeba 1, and Frans Coenen 2 1 School of Computing, Liverpool Hope University, Liverpool, L16 9JD, UK 2 Department
More informationDetermining Fuzzy Sets for Quantitative Attributes in Data Mining Problems
Determnng Fuzzy Sets for Quanttatve Attrbutes n Data Mnng Problems ATTILA GYENESEI Turku Centre for Computer Scence (TUCS) Unversty of Turku, Department of Computer Scence Lemmnkäsenkatu 4A, FIN-5 Turku
More informationA Combined Approach for Mining Fuzzy Frequent Itemset
A Combned Approach for Mnng Fuzzy Frequent Itemset R. Prabamaneswar Department of Computer Scence Govndammal Adtanar College for Women Truchendur 628 215 ABSTRACT Frequent Itemset Mnng s an mportant approach
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationConcurrent Apriori Data Mining Algorithms
Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationTF 2 P-growth: An Efficient Algorithm for Mining Frequent Patterns without any Thresholds
TF 2 P-growth: An Effcent Algorthm for Mnng Frequent Patterns wthout any Thresholds Yu HIRATE, Ego IWAHASHI, and Hayato YAMANA Graduate School of Scence and Engneerng, Waseda Unversty {hrate, ego, yamana}@yama.nfo.waseda.ac.jp
More informationParallel and Distributed Association Rule Mining - Dr. Giuseppe Di Fatta. San Vigilio,
Parallel and Dstrbuted Assocaton Rule Mnng - Dr. Guseppe D Fatta fatta@nf.un-konstanz.de San Vglo, 18-09-2004 1 Overvew Assocaton Rule Mnng (ARM) Apror algorthm Hgh Performance Parallel and Dstrbuted Computng
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationWireless Sensor Networks Fault Identification Using Data Association
Journal of Computer Scence 8 (9): 1501-1505, 2012 ISSN 1549-3636 2012 Scence Publcatons Wreless Sensor Networks Fault Identfcaton Usng Data Assocaton 1 Abram Kongu, T., 2 P. Thangaraj and 1 P. Prakanth
More informationQuery Clustering Using a Hybrid Query Similarity Measure
Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationA Heuristic for Mining Association Rules In Polynomial Time*
Complete reference nformaton: Ylmaz, E., E. Trantaphyllou, J. Chen, and T.W. Lao, (3), A Heurstc for Mnng Assocaton Rules In Polynomal Tme, Computer and Mathematcal Modellng, No. 37, pp. 9-33. A Heurstc
More informationKeywords: classifier, Association rules, data mining, healthcare, Associative Classifiers, CBA, CMAR, CPAR, MCAR
Mrs. Suwarna Gothane, Dr. G.R.Bamnote / Internatonal Journal of Engneerng Research and Applcatons (IJERA) ISSN: 2248-9622 www.era.com An Automated Weghted Support Approach Based Assocatve Classfcaton Wth
More informationMaintaining temporal validity of real-time data on non-continuously executing resources
Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationA NOTE ON FUZZY CLOSURE OF A FUZZY SET
(JPMNT) Journal of Process Management New Technologes, Internatonal A NOTE ON FUZZY CLOSURE OF A FUZZY SET Bhmraj Basumatary Department of Mathematcal Scences, Bodoland Unversty, Kokrajhar, Assam, Inda,
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationInnovation Typology. Collaborative Authoritativeness. Focused Web Mining. Text and Data Mining In Innovation. Generational Models
Text and Data Mnng In Innovaton Joseph Engler Innovaton Typology Generatonal Models 1. Lnear or Push (Baroque) 2. Pull (Romantc) 3. Cyclc (Classcal) 4. Strategc (New Age) 5. Collaboratve (Polyphonc) Collaboratve
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationA Heuristic for Mining Association Rules In Polynomial Time
A Heurstc for Mnng Assocaton Rules In Polynomal Tme E. YILMAZ General Electrc Card Servces, Inc. A unt of General Electrc Captal Corporaton 6 Summer Street, MS -39C, Stamford, CT, 697, U.S.A. egemen.ylmaz@gecaptal.com
More informationA Simple Methodology for Database Clustering. Hao Tang 12 Guangdong University of Technology, Guangdong, , China
for Database Clusterng Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal: 6085@qq.com Me Zhang Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal:64605455@qq.com Database clusterng
More informationA METHOD FOR FACTOR SCREENING OF SIMULATION EXPERIMENTS BASED ON ASSOCIATION RULE MINING
A METHOD FOR FACTOR SCREENING OF SIMULATION EXPERIMENTS BASED ON ASSOCIATION RULE MINING Lngyun Lu (a), We L (b), Png Ma (c), Mng Yang (d) Control and Smulaton Center, Harbn Insttute of Technology, Harbn
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationFINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK
FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationASSOCIATION RULE MINING BASED ON IMAGE CONTENT
Internatonal Journal of Informaton Technology and Knowledge Management January-June 011, Volume 4, No. 1, pp. 143-146 ASSOCIATION RULE MINING BASED ON IMAGE CONTENT Deepa S. Deshpande Image mnng s concerned
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationLinkSelector: A Web Mining Approach to. Hyperlink Selection for Web Portals
nkselector: A Web Mnng Approach to Hyperlnk Selecton for Web Portals Xao Fang and Olva R. u Sheng Department of Management Informaton Systems Unversty of Arzona, AZ 8572 {xfang,sheng}@bpa.arzona.edu Submtted
More informationA User Selection Method in Advertising System
Int. J. Communcatons, etwork and System Scences, 2010, 3, 54-58 do:10.4236/jcns.2010.31007 Publshed Onlne January 2010 (http://www.scrp.org/journal/jcns/). A User Selecton Method n Advertsng System Shy
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationData Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach
Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationSome material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier
Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
More informationFrom Comparing Clusterings to Combining Clusterings
Proceedngs of the Twenty-Thrd AAAI Conference on Artfcal Intellgence (008 From Comparng Clusterngs to Combnng Clusterngs Zhwu Lu and Yuxn Peng and Janguo Xao Insttute of Computer Scence and Technology,
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationTPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints
TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More informationABSTRACT. WEIQING, JIN. Fuzzy Classification Based On Fuzzy Association Rule Mining (Under the direction of Dr. Robert E. Young).
ABSTRACT WEIQING, JIN. Fuzzy Classfcaton Based On Fuzzy Assocaton Rule Mnng (Under the drecton of Dr. Robert E. Young). In fuzzy classfcaton of hgh-dmensonal datasets, the number of fuzzy rules ncreases
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationDistributed Resource Scheduling in Grid Computing Using Fuzzy Approach
Dstrbuted Resource Schedulng n Grd Computng Usng Fuzzy Approach Shahram Amn, Mohammad Ahmad Computer Engneerng Department Islamc Azad Unversty branch Mahallat, Iran Islamc Azad Unversty branch khomen,
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationEffective Page Recommendation Algorithms Based on. Distributed Learning Automata and Weighted Association. Rules
Effectve Page Recommendaton Algorthms Based on Dstrbuted Learnng Automata and Weghted Assocaton Rules R. Forsat 1*, M. R. Meybod 2 1 Department of Computer Engneerng, Islamc Azad Unversty, Karaj Branch,
More informationGA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks
Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member
More informationMultiway pruning for efficient iceberg cubing
Multway prunng for effcent ceberg cubng Xuzhen Zhang & Paulne Lenhua Chou School of CS & IT, RMIT Unversty, Melbourne, VIC 3001, Australa {zhang,lchou}@cs.rmt.edu.au Abstract. Effectve prunng s essental
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationAssociation Analysis for an Online Education System
Assocaton Analyss for an Onlne Educaton System Behrouz Mnae-Bdgol, Gerd Kortemeyer, and Wllam Punch Computer Scence Department, Mchgan State Unversty, East Lansng, MI, 4884, USA {mnaeb, punch}@cse.msu.edu
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationOutline. CHARM: An Efficient Algorithm for Closed Itemset Mining. Introductions. Introductions
CHARM: An Effcent Algorthm for Closed Itemset Mnng Authors: Mohammed J. Zak and Chng-Ju Hsao Presenter: Junfeng Wu Outlne Introductons Itemset-Tdset tree CHARM algorthm Performance study Concluson Comments
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationCircuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)
Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,
More informationStudy on Fuzzy Models of Wind Turbine Power Curve
Proceedngs of the 006 IASME/WSEAS Internatonal Conference on Energy & Envronmental Systems, Chalkda, Greece, May 8-0, 006 (pp-7) Study on Fuzzy Models of Wnd Turbne Power Curve SHU-CHEN WANG PEI-HWA HUANG
More informationDiscovering Relational Patterns across Multiple Databases
Dscoverng Relatonal Patterns across Multple Databases Xngquan Zhu, 3 and Xndong Wu Dept. of Computer Scence & Eng., Florda Atlantc Unversty, Boca Raton, FL 3343, USA Dept. of Computer Scence, Unversty
More informationEVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS
Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay
More informationPruning Training Corpus to Speedup Text Classification 1
Prunng Tranng Corpus to Speedup Text Classfcaton Jhong Guan and Shugeng Zhou School of Computer Scence, Wuhan Unversty, Wuhan, 430079, Chna hguan@wtusm.edu.cn State Key Lab of Software Engneerng, Wuhan
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More information