Multiway pruning for efficient iceberg cubing
|
|
- May Young
- 6 years ago
- Views:
Transcription
1 Multway prunng for effcent ceberg cubng Xuzhen Zhang & Paulne Lenhua Chou School of CS & IT, RMIT Unversty, Melbourne, VIC 3001, Australa Abstract. Effectve prunng s essental for effcent ceberg cube computaton. Prevous studes have focused on exclusve prunng: regons of a search space that do not satsfy some condton are excluded from computaton. In ths paper we propose nclusve and ant-prunng. Wth nclusve prunng, necessary condtons that solutons must satsfy are dentfed and regons that can not be reached by such condtons are pruned from computaton. Wth ant-prunng, regons of solutons are dentfed and prunng s not appled. We propose the multway prunng strategy combnng exclusve, nclusve and ant-prunng wth boundng aggregate functons n ceberg cube computaton. Prelmnary experments demonstrate that the multway-prunng strategy mproves the effcency of ceberg cubng algorthms wth only exclusve prunng. 1 Introducton Snce the ntroducton of the CUBE operator [6], the computaton of data cubes has attracted much research [3, 7, 10]. Data cubes consst of aggregates for parttons produced by group-by s of all subsets of a gven set of groupng attrbutes called dmensons. Gven an aggregaton constrant, aggregates n a data cube that satsfy the constrant form an ceberg cube [3]. Prunng s crtcal to the effcency of ceberg cube computaton, as the cube sze grows exponentally wth the number of dmensons. Wth tradtonal prunng strateges [1, 3, 4, 7, 9, 10] regons of the search space that do not satsfy a constrant are dentfed and then pruned from computaton. In ths paper, we propose two new prunng technques. (1) Inclusve prunng dentfes condtons that the solutons must meet, and unts under search that do not meet any of these condtons can not be solutons and thus are pruned. (2) Ant-prunng dentfes regons where all unts n the regons are solutons and testng for prunng s saved. We also propose nclusve and ant-prunng strateges wth boundng aggregate functons for effcent ceberg cubng. Our ntal experments confrm that multway-prunng mproves the effcency of cubng. Wth tradtonal prunng, condtons are dentfed that warrant non-solutons. In ths sense, t s termed exclusve prunng. Wth tradtonal exclusve prunng, the larger the soluton set, the more tests for the prunng condton result n frutless effort and become extra unnecessary cost. To the contrary of exclusve prunng, the cost for nclusve prunng does not ncrease and ant-prunng becomes better wth larger soluton set. Exclusve, nclusve and ant-prunng are
2 collectvely called the multway prunng strategy. Wthout nclusve prunng and ant-prunng, tradtonal exclusve prunng stll compute the complete solutons and prunes correctly. However, t ncurs extra cost. Inclusve and ant-prunng can not replace exclusve prunng, but complement exclusve prunng and n many cases greatly reduce the cost for prunng. 1.1 Related work Studes n the ceberg cubng lterature have all focused on exclusve prunng strateges n ceberg cube computaton [3, 7, 10, 12]. Another related area s constrant data mnng. Several types of constrants have been proposed and ther propertes are used for prunng [1, 8, 9]. All these work focus on exclusve prunng, expect n Reference [8]. The succnct constrants n Reference [8] are conceptually smlar to nclusve prunng, however they are constrants orthogonal to the constrants for exclusve prunng. Our nclusve prunng does not rely on extra constrants and t s used to enhance exclusve prunng. The term nclusve prunng was coned by Webb [11] n the area of machne learnng. Specfc prunng rules were developed for classfcaton learnng. We ntroduce nclusve prunng nto ceberg cube mnng and develop nclusve prunng strateges for aggregaton constrants based on boundng. The concept of border was used n data mnng to represent large spaces [2, 5]. Rather than computng borders, we focus on usng borders for more effectve prunng and to compute all solutons n the space represented by borders. 2 Prelmnares on data cubes Dmensonal datasets are defned by dmensons and measures. In Table 1, there are 4 dmensons Month, Product, SalesMan (Man) and Cty, and Sale (aggregated as Sum(Sale)) s the measure. Throughout ths paper we use upper-case letters to denote dmensons and lower-case letters to denote dmenson-values. For example (A,B,C) denotes a group-by and (a,b,c) denotes a partton of tuples from the (A,B,C) group-by, and s called a group. We also use an upper case letter for a measure attrbute to represent the set of values for the measure. The group-bys n a data cube form a lattce structure called the cube lattce. Fg. 1 shows an example 4-dmensonal cube lattce, where each node denotes a group-by lst. The empty group-by that aggregates all tuples n a dataset s at the bottom of the lattce and the group-by wth all dmensons s at the top of the lattce. Group-bys form subset/superset relatonshps. Groups from dfferent group-bys also form super-group/sub-group relatonshps. A specal value * s assumed n the doman of all dmensons, whch can match any value of the dmenson. Wth the Sales dataset, the (Jan,,, ) group denotes the partton of tuples wth Month = January and no restrcton on values for the other dmensons. For smplcty, (Jan,,, ) s also wrtten as (Jan).
3 Table 2. The bounds of some aggregate functons ({X = 1..n} are MSPs) Table 1. A sales dataset, partally aggregated Month Prod Man Cty Cnt(*) Sum(Sale) Jan Toy John Perth Mar TV Peter Perth Mar TV John Perth Mar TV John Syd Apr TV Peter Perth Apr Toy Peter Syd F Cnt Sum Max Max Mn Max Avg Max Sum upper bound; lower bound Cnt(X ); Mn Cnt(X ) Max(X ); Mn Max(X ) Mn(X ); Mn Mn(X ) Avg(X ); Mn Avg(X ) f there exsts Sum(X ) > 0, Sum Sum(X), Sum(X )>0 otherwse Max Sum(X ); f there exsts Sum(X ) < 0, Sum Sum(X )<0 Sum(X), otherwse Mn Sum(X ) The 3-dmensonal group (Jan, TV, Perth) s a sub-group of the 2-dmensonal groups (Jan, TV), (Jan, Perth) and (TV, Perth). Gven a dataset S of n dmensons A 1,..., A n wth the measure X, the data cube of applyng F on S can be expressed n two ways: (1) Cube(A 1,...,A n ) can be vewed as the set of possble group-bys, or the set of possble groups for all group-bys. (2) Cube(X) = {X = {t[x] t g } g s a partton of the cube}; that s, a data cube s expressed as parttons of mult-set of measure values followng the groupng of tuples. 3 Boundng aggregate functons Boundng was proposed as a technque to prune for complex aggregaton constrants [12]. The dea of boundng s to estmate the upper and lower bounds for data cubes from the most specfc parttons (MSPs) of data. The Sales dataset comprses 6 MSPs, as shown n Table 1. Each MSPs has been aggregated wth functons Count(*) (denoted as Cnt(*)) and Sum(Sale). We generalze the orgnal defnton of data cubes [6]. Fg. 1 shows Cube (ABCD), and t can be decomposed nto two lattce structures: The nodes n the rght polygon form Cube (BCD). For each partton of data wth a doman(a), the nodes n the left polygon form a data cube on dmensons {B, C, D} condtoned on a doman(a). In later dscussons we use the term data cube to refer to both uncondtonal data cubes and condtonal data cubes. The concept of data cube core was coned by Gray et al. [6] t was generalzed to condtonal data cubes. Gven Cube(A 1,...,A n ) over measure X, all n- dmensonal parttons {(a 1,...,a n ) a,a doman(a ),1 n} comprse the core of the data cube and each partton g n the core s a Most Specfc Partton (MSP). The mult-set of measure values for tuples n an MSP g, namely {t[x] t g }, s an MSP of the measure. All aggregates n a data cube can be
4 ABCD ABC ACD ABD BCD AB AC AD BC CD BD A B C D All Fg. 1. Cube(ABCD) decomposton BC BCD BCE (a 1 ) BD (a 1 ) BE (a 1 ) CD (a 1 ) CE (a 1) DE (a 1 ) B (a 1 ) C (a 1 ) D (a 1) E L B BCDE ALL BDE U B CDE Fg. 2. An ant-prunng border on the lattce condtoned on (a 1). computed from ts MSPs. In Fg. 1, any group n Cube(BCD) a 1 can be computed from some (a 1,b,c j,d k ) groups and any group n Cube(BCD) can be computed from some (b,c j,d k ) groups, where, j and k terates over values n the doman of B, C and D respectvely. Gven an aggregate functon F, and a mult-dmensonal dataset wth measure X, the upper (lower) bound for a data cube s a real number such that for any partton X Cube(X), F(X ) s no larger (smaller) than the upper (lower) bound. An aggregate functon F s boundable for a data cube f the upper and lower bounds for the data cube can be determned wth a sngle scan of the local aggregate values of the MSPs. The bounds for some commonly seen aggregate functons are lsted n Table 2. We use Count(*) as an example to explan. The Count(*) for any group n a data cube s no larger than Sum Cnt(X ), the sum of Count(*) all MSPs. The Count(*) for any group n a data cube s no smaller than Mn Cnt(X ), the smallest Count(*) among all MSPs. Moreover, these bounds are the tghtest bounds for Count(*). Indeed arthmetc expressons of base functons Sum, Count, Mn, and Max are boundable. Detals of boundng algorthms are dscussed n Reference [12]. 4 Inclusve prunng wth boundng Inclusve prunng s appled before computng the bounds of data cubes for exclusve prunng. Dmenson values that solutons n a lattce must have are called nclusve dmenson values. Groups that are defned by only non-nclusve dmenson-values are defntely not solutons and should be pruned. Defnton 1. Gven a data cube to be computed wth some constrant, the nclusve dmenson values are those that defne groups that are solutons. From ths defnton, dmenson values that do not nvolve any solutons are non-nclusve dmenson values. Theorem 1. (Inclusve prunng) Gven a cube lattce L, an aggregaton constrant, and a set of nclusve dmenson values, groups n L that are defned by only non-nclusve dmenson values are not solutons and can be pruned.
5 Proof. All soluton groups n L must be grouped by at least one nclusve dmenson value. A group n L whose groupng dmenson values are solely defned by non-nclusve dmensons can not be a soluton and so can be pruned. The queston to answer now s how to dentfy the nclusve dmenson values n a cube lattce before t s computed. As wll be seen n Secton 6, the nclusve dmenson values for a cube are decded n the prevous computaton of ts supercubes: all dmensons-values whose bounds have non-empty ntersecton wth the nterval defned by thresholds of the gven constrant are nclusve dmenson values for the cube. Importantly these bounds can be computed by a sngle traversal of the MSPs. As a result we have the beneft of prunng wth lttle extra cost. Inclusve prunng s acheved by removng branches that contan only non-nclusve dmenson-values. Note that these branches are pruned from all sub-trees that are to be computed. 5 Ant-prunng wth boundng When the selectvty of an aggregaton constrant s hgh, a large number of groups are qualfed as ceberg groups. When the data s skewed, the ceberg groups resde n a few regons of the cube. In both cases, examnng the prunng condtons on these groups does not result n any prunng. We ntroduce the noton of the Ant-prunng border to mark regons where all groups are solutons. Defnton 1 (Ant-prunng regon) In ceberg-cubng, gven a lattce L an ant-prunng regon s a convex space of groups that are all solutons. An antprunng regon B can be denoted as B L, B U : B L s the lower border where none of ther supergroups are n B. B U s the upper border consstng of groups n B where none of ther subgroups are n B. Example 1 An example ant-prunng border on the lattce of B, C, D, and E condtoned on (a 1 ) s shown n Fg. 2. The upper border conssts of the (a 1 BC), (a 1 BDE), and (a 1 CDE) group-bys and the lower border conssts of the (a 1 BC), (a 1 D), and (a 1 E) group-bys. The ant-prunng regon contans groups that are supergroups of some group n the (a 1 BC), (a 1 BDE), and (a 1 CDE) group-bys as well as subgroups of some group n the (a 1 BC), (a 1 D), and (a 1 E) group-bys. An ant-prunng regon s a maxmum regon n a group-lattce where prunng s unnecessary. The groups wthn the regon covered by the ant-prunng borders are defntely solutons. We am to compute ant-prunng regons that are lattces wth lttle extra cost. We observe that lattces are convex spaces: Gven a lattce condtoned on a group g, the lattce s a convex space where all groups are subgroups of g and supergroups of some MSPs. We make use of boundng to detect ant-prunng regons that are lattces, as shown n the observaton below. Observaton 1 Gven a lattce condtoned on a group g, f both bounds satsfy a gven constrant, the MSPs are the upper ant-prunng border B U, and g s the lower ant-prunng border B L ; the lattce of g s an ant-prunng regon. All groups n the lattce satsfy the constrant.
6 For ceberg cubes wth complex aggregaton constrants, the cost of checkng for the prunng condtons s hgh. Detectng a group-lattce that s an antprunng regon supposedly mproves the effcency of cubng algorthms. 6 Multway Bound-Prune Cubng on G-trees The Group tree (G-tree) s our data structure for cubng. The G-tree for an n-dmensonal dataset s of depth n, where each level represents a dmenson. A common path startng from the root collapses the tuples wth common dmensonvalues. Each tree node keeps the local aggregates necessary to compute the ceberg cube for a gven aggregate functon. A G-tree s constructed by one scan of the nput data. The G-tree n Fg. 3 represents the Sales dataset. To compute the data cube wth aggregate functon Average, the local aggregates n each node are Sum(Sale) and Cnt( ). On the leftmost path node (March) shows that there are 70 tuples wth Sum(Sale) = 300 n the (March,,, ) group, whereas the node (Peter) shows that there are 40 tuples wth Sum(Sale) = 100 n the (March, TV, Peter, ) group. 6.1 Top-down aggregaton on G-trees Top-down aggregaton on G-trees s based on the followng observaton: Constructon of an n-dmensonal G-tree has computed n group-bys, namely the group-bys whose dmensons are prefxes of the gven lst of dmensons. Wth the G-tree n Fg. 3, the root node has the aggregate for the group (,,, ) wth Cnt ( ) = 88 and Sum (Sale) = 700; The nodes at level one compute the aggregates for groups n (Month,,, ), whch are (March,,,,70,300), (January,,,,5,200), and (Aprl,,,,13,200). The nodes at the next 3 levels compute the aggregates for (Month,Product), (Month,Product,Man), and (Month, Product, Man, Cty) respectvely. Let A, B, C and D denote the four dmensons of the Sales dataset. The groupbys that are not represented on the G-tree n Fg. 3 are computed by collapsng one dmenson at a tme to construct sub-g-trees. In Fg. 4, each node represents a G-tree and all group-bys that are smultaneously computed on the G-tree. The ABCD-tree representng the tree of Fg. 3 s at the top. The group-bys (A,B,C,D), (A,B,C), (A,B), (A) and () are computed on the (A,B,C,D)-tree. The sub-trees of the ABCD-tree, ( A)BCD, A( B)CD, and AB( C)D, are formed by collapsng on dmensons A, B, and C respectvely. 6.2 Multway prunng on G-trees In Fg. 3, the leaf nodes of the G-tree are the MSPs for Cube (Mon,Prod,Man,Cty). The dmensons after / n each node of Fg. 4 denote prefx dmensons for the tree at the node and all ts sub-trees. A s the prefx dmenson for the ACDtree and ts sub-trees. All group-bys that are computed on the ACD-tree and ts
7 March (70, 300) root (88, 700) January (5, 200) Aprl (13, 200) (ABCD, ABC, AB, A, All) 1 -A -B -C (BCD, BC, B) 2 (ACD, AC)/A 6 (ABD)/AB 8 Peter (40, 100) TV (70, 300) John (30, 200) Toy (5, 200) John (5, 200) TV (8, 100) Peter (8, 100) Toy (5, 100) Peter (5, 100) -B -C -C (CD,C) 3 (BD)/B 5 (AD)/A 7 -C (D) 4 Perth (40, 100) Perth (20, 100) Sydney (10, 100) Perth (5, 200) Fg. 3. A sample G-tree Perth (8, 100) Sydney (5, 100) Fg. 4. Top-down cubng of a 4 dmensonal data cube wth shared dmensons sub-trees form data cubes condtoned on some A-value, Cube(CD) a, where terates over the values of A. The leaf nodes orgnated from a are the MSPs for Cube(CD) a. The bounds for Cube(ACDE) a are obtaned by a traversal of the leaf nodes orgnated from a. Wth the G-tree over dmensons Month, Product, Man, and Cty n Fg. 3, before collapsng on Product, we calculate the bounds for the cube lattces condtoned on each dmenson value. Followng Fg. 2, the bounds for Cube(Product, Man, Cty) March are computed from the three leaf nodes orgnated from (March) of G: Avg(Cube (Man, Cty) Mar) = Max({100/40, 100/20, 100/10}) = 10; Avg(Cube (Man, Cty) Mar) = Mn({100/40, 100/20, 100/10}) = 2.5. Inclusve prunng s acheved by dentfyng I, the set of nclusve dmensonvalues for a cube lattce before ts aggregates are computed. Gven a G-tree G on dmensons A 1,..., A n, the bounds for Cube(A k+1,...,a n ) a 1,...,a k 1, 1 < k < n, are computed from the leaf nodes orgnated from the node a k. If the bound nterval does not volate the gven constrant, a k should be added to I. After I s obtaned, the G-tree s traversed agan n depth-frst order for nclusve prunng. At each node, f ts dmenson-value s from I, the traversal to ts chldren s termnated because the branch s not to be trmmed. If the traversal reaches a leaf node, the branch s trmmed. From the leaf upwards, the nodes on the branch that have no chldren are deleted. Observaton 2 (Inclusve prunng) Consder computng an ceberg cube wth the constrant F(X) n [δ 1,δ 2 ]. Gven a G-tree wth n dmensons A 1,..., A n, Suppose [b 1,b 2 ] are the bounds for Cube(A k+1,...,a n ) a 1,...,a k 1, the sub-cube by collapsng a k (1 < k < n), nclusve dmenson-values are those a k such that [b 1,b 2 ] [δ 1,δ 2 ] φ. Branches defned by only non-nclusve dmenson-values are pruned from computaton. After nclusve prunng branches on a G-tree that can not contan solutons have been pruned from computaton. Wth the bounds computed for each cube lattce, exclusve- and ant-prunng are then appled.
8 Algorthm 1 The MBPC Algorthm // Assume that an n-dmensonal G-tree T wth aggregate functon F s constructed. // The ceberg cube s computed by callng MBPC(T(A 1,..., A n), φ). Input: a) T s a G-tree wth condtonal base B. b) Aggregate constrant F(X) n [δ 1, δ 2] s assumed global. Output: The ceberg groups n the ceberg cube. MBPC(T(B 1,..., B m), B) (1) for each dmenson = 1..m 1 do (2) for each node b of dmenson B on T (3) Output the group g condtoned on B f F(g) n [δ 1, δ 2]; (4) Compute the bounds [b 1, b 2] and I for Cube(B +1,..., B m) B {b }; // nclusve prunng (5) Prune branches formed by only dmenson-values from I; (6) f ([b 1, b 2] [δ 1, δ 2] = φ) (7) break; // exclusve prunng (8) else f ([b 1, b 2] [δ 1, δ 2] = [b 1, b 2]) (9) compute all groups n Cube(B +1,..., B m) B {b }; (10) break; //ant-prunng (11) for j = + 1..m do (12) Construct the sub-tree T s by collapsng B j; (13) MBPC(T s, B {b }); Observaton 3 (Exclusve- and ant-prunng) Consder computng an ceberg cube wth the constrant F(X) n [δ 1,δ 2 ]. Gven a G-tree for dmensons A 1,..., A n, let [b 1,b 2 ] be the bounds for Cube(A k+1,...,a n ) a 1,...,a k 1, the cube by collapsng A k (1 < k < n). If [b 1,b 2 ] [δ 1,δ 2 ] = φ, the branches orgnated from the node (a 1,...,a k 1 ) can be pruned; otherwse f [b 1,b 2 ] [δ 1,δ 2 ] = [b 1,b 2 ], all groups n Cube(A k+1,...,a n ) are qualfed groups. 6.3 The MBPC algorthm We present the Multway Bound-Prune Cubng (MBPC) algorthm for computng ceberg cubes, wth nclusve- exclusve and ant-prunng strateges. The algorthm s shown as Algorthm 1. A G-tree s bult by one scan of the nput dataset and s the nput for MBPC. MBPC s a recursve procedure where wth each recurson, an addtonal dmenson-value s accumulated n g, the group to be computed. For the ease of presentaton, one group g s processed a tme n Algorthm 1. Indeed wth top-down cubng on the G-tree, multple groups are smultaneously processed. The steps nvolved n each group are the same. At lne 3 of the algorthm, the groups that are computed on an G-tree are condtoned on the condtonal base B of the tree. Intally the condtonal base s empty. The prefx dmenson-value before the collapsng dmenson s accumulated nto the condtonal base B wthn each recurson. The bounds are obtaned
9 Run Tme(sec) BPC MBPC (ant-prunng) Run Tme (sec) BPC MBPC (ant-prunng) 8 0 [1,10] [1,20] [1,30] [1,40] [1,50] [1,60] [1,70] [1,80] [1,90] [1,100] [500,10000] [500,20000] [500,15000] [500,25000] [500,30000] [500,40000] [500,35000] [500,50000] [500,45000] [500,60000] [500,55000] Average Range (a) Weather (100,000 tuples, 9 dmensons) Average Range (b) Census (88,443 tuples, 12 dmensons) Fg. 5. Performance comparson of MBPC (ant-prunng) and BPC when the branches under the prefx groups are amalgamated. No extra scan of the tree s requred. Inclusve prunng (lne 5) s appled before further aggregaton of subgroups. For the top-down ceberg cubng on the G-tree, a lst I s created when the G-tree s bult. The lst conssts of dmenson-values of the G-tree, each s assocated wth a bt-vector. When the G-tree s traversed n depth-frst order to obtan the bounds for the nodes on the G-tree, the bounds for the dmenson-values n the the lst are also obtaned; they determne whch branches can be trmmed. The test for ant-prunng (lne 8) can be combned wth that for exclusve prunng (lne 6) as a sngle test, where the ntersecton of the two ranges s performed only once. Ant-prunng (lne 9) s appled by aggregaton of groups wthout any boundng or boundng test beng performed. 7 Experments We conducted prelmnary experments to examne the performance of MBPC. We mplemented MBPC wth ant-prunng and compared ts performance wth that of BPC, that uses only exclusve bound prunng. Experments were conducted on a PC wth 686 processor runnng GNU/Lnux. Two datasets were used n our experments. The weather dataset 1 s the weather reports collected at varous weather statons globally n Nne of the attrbutes such as staton-d, longtude, and lattude are used as dmensons and the cardnaltes range from 2 to Numbers between 1 and 100 were randomly generated as the measure. The US census dataset 2 was collected from surveys about varous aspects of ndvduals n the households n US n The orgnal dataset has 61 dfferent attrbutes such as hrswork1(hours worked last week) and valueh(value of the house). We selected 12 dscrete attrbutes as dmensons and a numerc attrbute as the measure. Census s dense and skewed and Weather s very sparse ftp://ftp.pums.org/pums/data/p19001.z
10 The results of computng ceberg cubes wth the constrant Avg(X) n [δ 1,δ 2 ] are shown n Fg. 5. The tme reported does not nclude tme for output. Generally ant-prunng further mproves the effcency of the BPC algorthm. Moreover, as δ 2 get larger and the ceberg cube to compute get larger, more pronounced mprovement can be observed. MBPC shows sgnfcant mprovement n run tme over BPC on Weather. MBPC outperforms BPC consstently by about 13% for dfferent aggregaton constrant thresholds. MBPC shows modest mprovement over BPC on the Census dataset. 8 Conclusons We have proposed multway prunng strateges n ceberg cubng: exclusve, nclusve and ant-prunng. We have also presented an ceberg cubng algorthm wth the multway prunng strategy wth boundng. Our ntal experments wth ant-prunng has shown that the multway prunng strategy can sgnfcantly mprove effcency of cubng algorthms, especally on computng large cubes. More extensve experments are underway to examne the effectveness of nclusve prunng and the multway prunng strategy wth respect to general data characterstcs. References 1. R. Agrawal and R. Srkant. Fast algorthms for mnng assocaton rules. In Proc. of VLDB 94, pages , Santago, Chle. 2. R. J. Bayardo. Effcently mnng long patterns from databases. In Proc. of SIG- MOD 98, pages K Beyer and R Ramakrshnan. Bottom-up computaton of sparse and ceberg cubes. In Proc. of SIGMOD L. Chou and X. Zhang. Computng complex ceberg cubes by multway aggregaton and boundng. In Proc. of DaWak 04 (LNCS 3181), Zaragoza Span. 5. G. Dong and J. L. Effcent mnng of emergng patterns: Dscoverng trends and dfferences. In Proc. of KDD 99, pages 15 18, San Dego, USA. 6. J Gray et al. Data cube: a relatonal aggregaton operator generalzng group-by, cross-tab, and sub-totals. Data Mnng and Knowledge Dscovery, 1(1), J Han, J Pe, G Dong, and K Wang. Effcent computaton of ceberg cubes wth complex measures. In Proc. of SIGMOD R. Ng, L. V. S. Lakshmanan, J. Han, and A. Pang. Exploratory mnng and prunng optmzatons of constraned assocatons rules. In Proc. of SIGMOD J. Pe, J. Han, and L. V. S. Lakshmanan. Mnng frequent temsets wth convertble constrants. In Proc. of ICDE K. Wang et al. Dvde-and-approxmate: A novel constrant push strategy for ceberg cube mnng. IEEE TKDE, 17(3): , March G. I. Webb. Inclusve prunng: a new class of prunng rules for unordered search and ts applcaton to classfcaton learnng. In Proc. of ACSC X. Zhang, L. Chou and G. Dong. Effcent computaton of ceberg cubes by boundng aggregate functons. IEEE TKDE, In submsson.
WITH the multidimensional model for data warehouses,
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 19, NO. 7, JULY 2007 903 Effcent Computaton of Iceberg Cubes by Boundng Aggregate Functons Xuzhen Zhang, Paulne Lenhua Chou, and Guozhu Dong, Senor
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 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 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 informationComputing Complex Iceberg Cubes by Multiway Aggregation and Bounding
Computing Complex Iceberg Cubes by Multiway Aggregation and Bounding LienHua Pauline Chou and Xiuzhen Zhang School of Computer Science and Information Technology RMIT University, Melbourne, VIC., Australia,
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 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 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 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 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 informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationConditional Speculative Decimal Addition*
Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant
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 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 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 informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
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 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 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 informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
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 informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
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 informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
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 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 informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
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 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 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 informationLoop Transformations for Parallelism & Locality. Review. Scalar Expansion. Scalar Expansion: Motivation
Loop Transformatons for Parallelsm & Localty Last week Data dependences and loops Loop transformatons Parallelzaton Loop nterchange Today Scalar expanson for removng false dependences Loop nterchange Loop
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationUNIT 2 : INEQUALITIES AND CONVEX SETS
UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces
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 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 informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
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 informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
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 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 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 informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
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 informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
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 informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
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 informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
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 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 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 informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationMath Homotopy Theory Additional notes
Math 527 - Homotopy Theory Addtonal notes Martn Frankland February 4, 2013 The category Top s not Cartesan closed. problem. In these notes, we explan how to remedy that 1 Compactly generated spaces Ths
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 informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Bran Curless Sprng 2008 Announcements (5/14/08) Homework due at begnnng of class on Frday. Secton tomorrow: Graded homeworks returned More dscusson
More informationUSING GRAPHING SKILLS
Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp
More informationCSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the
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 informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
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 informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
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 informationBridges and cut-vertices of Intuitionistic Fuzzy Graph Structure
Internatonal Journal of Engneerng, Scence and Mathematcs (UGC Approved) Journal Homepage: http://www.jesm.co.n, Emal: jesmj@gmal.com Double-Blnd Peer Revewed Refereed Open Access Internatonal Journal -
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 informationCan We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search
Can We Beat the Prefx Flterng? An Adaptve Framework for Smlarty Jon and Search Jannan Wang Guolang L Janhua Feng Department of Computer Scence and Technology, Tsnghua Natonal Laboratory for Informaton
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 informationLoop Permutation. Loop Transformations for Parallelism & Locality. Legality of Loop Interchange. Loop Interchange (cont)
Loop Transformatons for Parallelsm & Localty Prevously Data dependences and loops Loop transformatons Parallelzaton Loop nterchange Today Loop nterchange Loop transformatons and transformaton frameworks
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 informationAn Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem
An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r
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 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 informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationCE 221 Data Structures and Algorithms
CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume
More informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
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 informationSTING : A Statistical Information Grid Approach to Spatial Data Mining
STING : A Statstcal Informaton Grd Approach to Spatal Data Mnng We Wang, Jong Yang, and Rchard Muntz Department of Computer Scence Unversty of Calforna, Los Angeles {wewang, jyang, muntz}@cs.ucla.edu February
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 informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
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 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 informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
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 informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
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 A mathematcal programmng approach to the analyss, desgn and
More informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
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 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 informationLoop Transformations, Dependences, and Parallelization
Loop Transformatons, Dependences, and Parallelzaton Announcements Mdterm s Frday from 3-4:15 n ths room Today Semester long project Data dependence recap Parallelsm and storage tradeoff Scalar expanson
More informationEfficient Processing of Ordered XML Twig Pattern
Effcent Processng of Ordered XML Twg Pattern Jaheng Lu, Tok Wang Lng, Tan Yu, Changqng L, and We N School of computng, Natonal Unversty of Sngapore {lujahen, lngtw, yutan, lchangq, nwe}@comp.nus.edu.sg
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 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 informationy and the total sum of
Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More information