SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS
|
|
- Fay Powell
- 5 years ago
- Views:
Transcription
1 SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS J.H.Guan, F.B.Zhu, F.L.Ban a School of Computer, Spatal Informaton & Dgtal Engneerng Center, Wuhan Unversty, Wuhan, , Chnajhguan@wtusm.edu.cn TS, WG II/6 KEY WORDS: GIS, Analyss, Data Mnng, Vsualzaton, Algorthms, Dynamc, Mult-resoluton, Spatal. ABSTRACT: Clusterng can be appled to many felds ncludng data mnng, statstcal data analyss, pattern recognton, mage processng etc. In the past decade, a lot of effcent and effectve new clusterng algorthms have been proposed, n whch famous algorthms contrbuted from the database communty are CLARANS, BIRCH, DBSCAN, CURE, STING, CLIGUE and WaveCluster. All these algorthms try to challenge the problem of handlng huge amount of data n large-scale databases. In ths paper, we propose a scalable and vsualzaton-orented clusterng algorthm for exploratory spatal analyss (CAESA). The context of our research s 2D spatal data analyss, but the method can be extended to hgher dmensonal space. Here, Scalable means our algorthm can run focus-changng clusterng n an effcent way, and Vsualzaton-orented ndcates that our algorthm s adaptable to the vsualzaton stuaton, that s, choosng approprate clusterng granularty automatcally accordng to current vsualzaton resoluton. Expermental results show that our algorthm s effectve and effcent. 1. INTRODUCTION Clusterng, whch s the task of groupng the data of a database nto meanngful subclasses n such a way that mnmzes the ntra-dfferences and maxmzes the nter-dfferences of these subclasses, s one of the most wdely studed problems n data mnng feld. There are a lot of applcaton areas for clusterng technques, such as spatal analyss, pattern recognton, mage processng, and other busness applcatons, to name a few. In the past decade, a lot of effcent and effectve clusterng algorthms have been proposed, n whch famous algorthms contrbuted from the database communty nclude CLARANS, BIRCH, DBSCAN, CURE, STING, CLIGUE and WaveCluster. All these algorthms try to challenge the clusterng problem of handlng huge amount of data n large-scale databases. However, current clusterng algorthms are desgned to cluster a certan dataset n the fashon of once and for all. We can refer to ths knd of clusterng as global clusterng. In realty, take exploratory data analyss for example, the user may frst want to see the global vew of the processed dataset, then her/hs nterest may shft to a smaller part of the dataset, and so on. Ths process mples a seres of consecutve clusterng operatons: frst on the whole dataset, then on a smaller part of the dataset, and so on. Certanly, ths process can be drected n an nverse way, that s, user s focusng scope shfts from smaller area to larger area. We refer to ths knd of clusterng operaton as focus-changng clusterng. In mplementaton of focuschangng clusterng, the nave approach s to cluster the focused data each tme from scratch n the fashon of global clusterng. Obvously, such approach s tme-consumng and low effcent. The better soluton s to desgn a clusterng algorthm that carres out focus-changng clusterng n an ntegrated framework. On the other hand, although vsualzaton has been recognzed as an effectve tool for exploratory data analyss and some vsual clusterng approaches were reported n the lterature, these researches has focused on proposng new methods of vsualzng clusterng results so that the users can have a vew of the processed dataset s nternal structure more concretely and drectly. However, seldom concern has been put on the mpact of vsualzaton on the clusterng process. To make ths dea clear, let us take 2-dmensonal spatal data clusterng for example. In fact, clusterng can be seen as a process of data generalzaton on bass of certan lower data granularty. The lowest clusterng granularty of a certan dataset s the ndvdual data objects n the dataset. If we dvde the dataset space nto rectangular cells of smlar sze, then a larger clusterng granularty s the data objects enclosed n the rectangular cells. More reasonably, we defne clusterng granularty as the sze of the dvded rectangular cell n horzontal or vertcal drecton, and defne relatve clusterng granularty as the rato of clusterng granularty over the scope of focused dataset n the same drecton. Vsualzaton of clusterng results s also based on clusterng granularty. However, vsualzaton effect reles on the resoluton of dsplay devce. For comparson, we defne relatve vsualzaton resoluton as the nverson of the sze (takng pxel as measurement unt) of vsualzaton wndow for clusterng results n the same drecton as the defnton of clusterng granularty. Obvously, a reasonable choce s that the relatve clusterng granularty s close to, but not lower than the relatve vsualzaton resoluton of vsualzaton wndow. Otherwse, the clusterng results can t be vsualzed completely, whch means we do a lot but only part of ts effect s shown up n vsualzaton.
2 In ths paper, we propose a scalable and vsualzaton-orented clusterng algorthm for exploratory spatal analyss (CAESA), n whch we adopt the dea of combnng DBSCAN and STING. We bult a prototype to demonstrate the feasblty of the proposed algorthm. Expermental results ndcate that our algorthm s effectve and effcent. CAESA needs less regon queres than DBSCAN does, and s more flexble than STING. 2. RELATED WORK In recent years, a number of clusterng algorthms for large databases or data warehouses have been proposed. Bascally, there are four types of clusterng algorthms: parttonng algorthms, herarchcal algorthms, densty based algorthms and grd based algorthms. Parttonng algorthms construct a partton of a database D of n objects nto a set of k clusters, where k s an nput parameter for these algorthms. Herarchcal algorthms create a herarchcal decomposton s represented by a dendrogram, a tree that teratvely splts D nto smaller subsets untl each subset conssts of only one object. In such a herarchy, each node of the tree represents a cluster of D. The dendrogram can ether be created from the leaves up to the root (agglomeratve approach) or from the root down to the leaves (dvsve approach) by mergng or dvdng clusters at each step. Ester et al. (1996) developed a clusterng algorthm DBSCAN based on a densty-based noton of clusters. It s desgned to dscover clusters of arbtrary shape. The key dea n DBSCAN s that for each pont of a cluster, the neghborhood of a gven radus has to contan at least a mnmum number of ponts. DBSCAN can effectvely handle the nose ponts (outlers). CLIQUE clusterng algorthm (Agrawal et al., 1998) dentfes dense clusters n subspace of maxmum dmensonalty. It parttons the data space nto cells. To approxmate the densty of the data ponts, t counts the number of ponts n each cell. The clusters are unons of connected hgh-densty cells wth n a subspace. CLIQUE generates cluster descrpton n the form of DNF expressons. Shekholeslam et al. (1998), usng mult-resoluton property of wavelets, proposed the WaveCluster method whch parttons the data space nto cells and app les wavelet transform on them. Furthermore, WaveCluster can detect arbtrary shape clusters at dfferent degrees of detal. Wang et al. (1997, 1999) proposed a statstcal nformaton grd-based method (STING, STING+) for spatal data mnng. It dvdes the spatal area nto rectangular cells usng a herarchcal structure and stores the statstcal parameters of all numercal attrbutes of objects wth n cells. STING uses a mult-resoluton to perform cluster analyss, and the qualty of STING clusterng depends on the granularty of the lowest level of the grd structure. If the granularty s very fne, the cost of processng wll ncrease substantally. However, f the bottom level of the grd structure s too coarse, t may reduce the qualty of cluster analyss. Moreover, STING does not consder the spatal relatonshp between the chldren and ther neghborng cells for constructon of a parent cell. As a result, the shapes of the resultng clusters are sothetc, that s, all of the cluster boundares are ether horzontal or vertcal, and no dagonal boundary s detected. Ths may lower the qualty and accuracy of the clusters despte of the fast processng tme of the technque. However, all algorthms descrbed above have the common drawback that they are all desgned to cluster a certan dataset n the fashon of once and for all. Although methods has been proposed to focus on vsualzng clusterng results so that the users can have a vew of the processed dataset s nternal structure more concretely and drectly, however, seldom concern has been put on the mpact of vsualzaton on the clusterng process. Dfferent from the algorthms abovementoned, the proposed CAESA algorthm n ths paper s a scalable and vsualzatonorented clusterng algorthm for exploratory spatal analyss. Here, scalable means our algorthm can run focus-changng clusterng n an effectve and effcent way, and vsualzatonorented ndcates that our algorthm s adaptable to vsualzaton stuaton, that s, choosng approprate relatve clusterng granularty automatcally accordng to current relatve vsualzaton resoluton. 3. SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING ALGORITHM 3.1 CAESA OVERVIEW Lke STING, CAESA s also a grd-based mult-resoluton approach n whch the spatal area s dvded nto rectangular cells. There usually several levels of such rectangular cells correspondng to dfferent levels of resoluton, and these cells form a herarchcal structure: each cell at a hgh level s parttoned to form a number of cells at the next lower level. Statstcal nformaton assocated wth the attrbutes of each grd cell (such as the mean, standard devaton, dstrbuton) s calculated and stored beforehand and s used to answer the user s queres. Level 1 Level 2 Level 3 Fgure 1: Herarchcal structure Fgure 1 shows a herarchcal structure for CAESA clusterng. Statstcal parameters of hgher-level cells can easly be computed form the parameters of the lower-level cells. For each cell, there are attrbuted-dependent and attrbute-ndependent parameters. The attrbute-ndependent parameter s: n number of objects(ponts) n ths cell cellno number of ths cell, t s calculated when the tree structure s establshng layerno layer number of ths cell The attrbute-dependent parameters are: m mean of all values n ths cell, where value s the dstance of two objects n ths cell s standard devaton of all values of the attrbute n ths cell d densty of all values n ths cell mn the mnmum value of the attrbute n ths cell max the maxmum value of the attrbute n ths cell
3 dstrbuton the type of dstrbuton that the attrbute value n ths cell follows(such as normal, unform, exponental, etc. NONE s assgned f the dstrbuton type s unknown) cellloc the locaton of ths cell, t record the coordnate nformaton assocated to the objects n data set. relevant coeffcent of ths cell relevant to gven query In our algorthm, parameters of hgher-level cells can be easly calculated from parameters of lower level cell. Let n, m, s, d, mn, max, cellloc, layerno, and dst be parameters of correspondng lower level cells, respectvely. The parameters n current cell n -1, m -1, s -1, d -1, mn -1, max -1, cellloc -1, layerno -1, and dst -1 can be calculated as follows. = n 1 (1) d n m d n 1 = (2) n m n 1 = (3) n ( s + m ) n s 1 = m 1 n 1 (4) mn 1 = mn(mn ) (5) max 1 = max(max ) (6) layerno 1= layerno 1 (7) cellloc = mn ( cellloc ) 1 (8) cellno 1 The calculaton of dst -1 s much more complcated, here we adopt the calculatng method desgned by Wang et al.(1997) n ther algorthm of STING n m d s mn max layerno cellno cellloc (80,60) (90,60) (90,60) (90,60) dst NORMAL NONE NORMAL NORAML Table 1: Parameters of lower cells Accordng to the formula present above, we can easly to calculate the parameters n current cell: n -1 = 240 m -1 = s -1 = d -1 = 0.6 mn -1 = 1.2 max -1 = 62.8 cellloc -1 = (80,60) layerno -1 = 4 dst -1 = NORMAL The advantages of ths approach are: 1. It s a query-ndependent approach snce the statstcal nformaton stored n each cell represents the summary nformaton of the data n the cell, whch s ndependent of the query. 2. The computatonal complexty s O(k), where k s the number of cells at the lowest level. Usually, k<<n, where N s the number of objects. 3. The cell structure facltates parallel processng and ncremental updatng. 3.2 Focus-changng Clusterng Focus-changng clusterng means that CAESA can provde user the correspondng nformaton when hs nterested dataset s changed. Take exploratory data analyss for example, the user may frst want to see the global vew of the processed dataset, then her/hs nterest may turn to a smaller part of the dataset to see some detals, and so on. To fulfl focus-changng clusterng, a smple method s to cluster focused data each tme from scratch n the fashon of current clusterng algorthm. Obvously, such approach s tme-consumng and of low effcent. The better soluton s to desgn a clusterng algorthm that carres out focus-changng clusterng n an ntegrated framework. Thus clusterng tme and I/O cost s reduced, and the clusterng flexblty s enhanced. For example, the user wants to select the maxmal regons that have at least 100 houses per unt area and at least 70% of the house prces are above $200,000 and wth total area at least 100 unts wth 90% confdence. We can descrbe ths query usng SQL lke ths: SELECT REGION FROM house-map WHERE DENSITY IN (100, ) AND prce RANGE (200000, ) WITH PERCENT (0.7, 1) AND AREA (100, ) AND WITH CONFIDENCE 0.9; After gettng ths nformaton, perhaps she/he wants to see more detaled nformaton, e.g., the maxmal sub-regons that have at least 50 houses per unt area and at least 85% of the house prces are above $350,000 and wth total area at least 80 unts wth 80% confdence. By the followng SQL, we can get nformaton we need from the orgnal dataset. Here, we needn t scan all the orgnal dataset agan. SELECT SUB-REGION FROM house-map WHERE DENSITY IN (50, ) AND prce RANGE (350000, ) WITH PERCENT (0.85, 1)
4 AND AREA (80, ) AND WITH CONFIDENCE 0.85; To complete ths task, we should frstly recalculate the clusterng granularty accordng to data objects dstrbuton n the assocated dataset, then dvde the data space nto rectangular cells of sze equal to the mnmum clusterng granularty; count data objects densty for each cell and store densty value wth each cell. 3.3 Vsualzaton of Clusterng Process Although vsualzaton has been recognzed as an effectve tool for exploratory data analyss and some vsual clusterng approaches were reported n the lterature, these researches has focused on proposng new methods of vsualzng clusterng results so that the users can have a vew of the processed dataset s nternal structure more concretely and drectly. However, seldom concern has been put on the mpact of vsualzaton on the clusterng process. To make ths dea clear, let us take 2-dmensonal spatal data clusterng for example. In fact, clusterng can be seen as a process of data generalzaton on bass of certan lower data granularty. The lowest clusterng granularty of a certan dataset s the ndvdual data objects n the dataset. If we dvde the dataset space nto rectangular cells of smlar sze, then a larger clusterng granularty s the data objects enclosed n the rectangular cells. Fgure 3: CAESA s result Noses are random dsturbance that reduces the clarty of clusters. In our algorthm, we can easly fnd noses and wpe off them by fndng the cells wth very low densty and elmnate the data ponts n them precsely. Ths method can reduce the nfluence of the noses both on effcency and on tme. Unlke the noses, outlers are not well proportoned. Outlers are data ponts that are away from the clusters and have smaller scale compared to clusters. So outlers wll not be merged to any cluster. When the algorthm fnshes, the subclusters that have rather small scale are outlers. Fgure 2: Expected result More reasonably, we defne clusterng granularty as the sze of the dvded rectangular cell n horzontal or vertcal drecton, and defne relatve clusterng granularty as the rato of clusterng granularty over the scope of focused dataset n the same drecton. Vsualzaton of clusterng results s also based on clusterng granularty. However, vsualzaton effect reles on the resoluton of dsplay devce. For comparson, we defne relatve vsualzaton resoluton as the nverson of the sze (takng pxel as measurement unt) of vsualzaton wndow for clusterng results n the same drecton as the defnton of clusterng granularty. Obvously, a reasonable choce s that the relatve clusterng granularty s close to, but not lower than the relatve vsualzaton resoluton of vsualzaton wndow. Otherwse, the clusterng results can t be vsualzed completely, whch means we do a lot but only part of ts effect s shown up n vsualzaton. Fgure 4: CAESA s result after user s focus changed 4. ALGORITHM In ths secton we ntroduce the CAESA algorthm. Frst, we set the mnmum clusterng granularty accordng to data objects dstrbuton n the whole concerned dataset; then dvde the data space nto rectangular cells of sze equal to the mnmum clusterng granularty; after that, we count data objects densty for each cell and store densty value wth each cell. Here, we adopt the cluster defnton alke to grd-based clusterng algorthms. It takes CASEA two steps to complete a gven query, that s, calculate the statstcal nformaton and stores to the quad-tree, then get user s query and output the result. Frst we should create a tree structure to keep the nformaton of the dataset, there are two parameters must be nput to setup the
5 tree. One parameter s dataset to be placed n the herarchcal structure; the other parameter s the number of desred cells at the lowest level. It needs two step to buld the quad-tree: calculate the bottom layer cell statstcal nformaton drectly by the gven dataset, then calculate the hgher layer cells statstcal nformaton accordng to the lower layer cells. We only need to go through the dataset once n order to calculate the parameters assocated wth the grd cells at the bottom level, the overall computaton tme s nearly proportonal to the number of cells. That s, query processng complexty s O(k) rather than O(n), here k means the number of cells. We wll analyze performance n more detal n later sectons. The process of creatng the tree structure goes lke ths: Input: D //Data to be placed n the herarchcal structure k //Number of desred cells at the lowest level Output: T //Tree CAESA BUILD Algorthm // Create the empty tree from top to down T = root node wth data values ntalzed; //Intally only root node = 1; repeat for each node n level do create 4 chldren nodes wth ntal values; end for = + 1; untl 4 = k; // Populate tree from bottom up for each tem n D do determne leaf node j assocated wth the poston of D; update values of j based on attrbute values n tem; end for = log4(k); repeat = - 1; for each node j n level do update values of j based on attrbute values n ts 4 chldren; untl = 1; End of CAESA BUILD Algorthm Fgure 5: CAESA BUILD algorthm Once the user changes her/hs focus scope, adjust clusterng granularty based on the crteron that relatve clusterng granularty s close to, but not lower than the relatve vsualzaton resoluton of vsualzaton wndow. Wth the new clusterng granularty, re-dvde the focused data space; then resort to grd-based clusterng algorthm to cluster the focused data. Note that new clusterng granularty must be n tmes of the mnmum clusterng granularty where n s a postve nature number. Due to the suffcent nformaton (such as locaton of coordnate, relevant coeffcent etc.), we can easly use the formal result to answer the new query. The process of query answerng s as follows: Input: T //Tree Q //Query Output: R //Regons of relevant cells CAESA QUERY Algorthm QUEUE q; = 1; repeat For each node n level do f cell j s relevant to Q mark ths cell as such; q.add( j );//cell j add to queue so as to calculate ts neghbor end f = + 1; //go on wth the next level untl all layers n the tree have been vsted; for each neghbor cell of cells n q AND doesn t n q do f (densty( ) > M_DENSITY) Identfy neghborng cells of relevant cells to create regons of cells; end f end for D1=R.data(); calculate the new clusterng granularty k1 call CAESA BUILD Algorthm wth parameter D1, k1 End of CAESA QUERY Algorthm Fgure 6: CAESA QUERY algorthm To handle very large databases, the algorthm constructs unts nstead of orgnal data objects. To obtan these unts, frst, parttonng s done to allocate data ponts nto cells. Statstcs nformaton s also obtaned for each cell. Then we test to see f a cell s qualfed as a unt. The defnton of unt s as follows: The densty of a unt s greater than a certan predefned threshold. Therefore, we determne f a cell s a unt by ts densty. If the densty of a cell s M (M1) tmes of the average densty of all data ponts, we regard such a cell as a unt. There may be some cells of low densty but are n fact part of a fnal cluster, they may not be ncluded nto unts. We treat such data ponts as separated sub-clusters. Ths method wll greatly reduce the tme complexty, as wll be shown n the experments. The clusters dentfed n ths algorthm are denoted by the representatve ponts. Usually, user may want to know the detaled nformaton about the clusters and the data ponts they nclude. For each data pont, we need not test whch cluster t belongs to. Instead, we need only fnd the cluster a cell belongng to, and all data ponts n the cell belong to such cluster. Ths process can also mprove the speed of the whole clusterng process. 5. PERFORMANCE EVALUATION We conduct several experments to evaluate the performance of the proposed algorthm. The followng experments are run on a PC machne wth Wn2000 operatng system (256M memory). In CAESA, we only need to go through the data set once n order to calculate the parameters assocated wth the grd cells at the bottom level, the overhead of CAESA s lnearly proportonal to the number of objects wth a small constant factor.
6 Tmes(sec) STING CAESA Number of cells at bottom layer 8000 Fgure 7: Overhead comparson between STING and CAESA when user change her/hs focus Hnneburg, A., Kem, D. and Wawrynuk, M., Usng projectons to vsually cluster hgh-dmensonal data. IEEE Computatonal Scence and Engneerng], 5(2), pp Hu, B. and Marek-Sadowska, M., Fne Granularty Clusterng-Based Placement. IEEE Transactons on Computer- Aded Desgn of Integrated Crcuts and Systems. 23(4), pp Jawe Han, Mchelne Kamber. Data Mnng: Concepts and Technques. Morgan Kaufmann Publshers, Matsushta, M. and Kato, T., Interactve vsualzaton method for exploratory data analyss. In Proc. of 15th Intl. Conf. on Informaton Vsualzaton, pp To obtan performance of CAESA, we mplemented the houseprce example dscussed n Secton 3.2. We generated 2400 data ponts(houses), the herarchcal structure has 6 layers n ths test. Fgure 2 shows the expected result, Fgure 3 shows the result of our algorthm, and Fgure 4 shows the result when user change her/hs focus accordng to the last query. From the expermental result we can see apparently that our algorthm s vald and has a hgh performance. 6. CONCLUSION In ths paper, we proposed a scalable and vsualzaton-orented clusterng algorthm for exploratory spatal analyss. It s of hgh performance and low computng cost, and t can run focuschangng clusterng effcently, can be adaptable to vsualzaton stuaton, that s, choosng approprate relatve clusterng granularty automatcally accordng to current relatve vsualzaton resoluton. We bult a prototype to demonstrate the practcablty of the proposed algorthm. Expermental results show our algorthm s effectve and effcent. REFERENCES Agrawal R., Gehrke J., Gunopulos D. et al., Automatc subspace clusterng of hgh dmensonal data for data mnng applcatons. In Proc. of the ACM SIGMOD, pp Davd Hand, Hekk Mannla and Padhrac Smyth., Prncples of Data Mnng. Massachusetts Insttute of Technolology Press. Ester,M., Kregel, H. P., Sander,J. et al., A densty-based algorthm for dscoverng clusters n large spatal databases wth nose. In Proc.of 2nd Int. Conf. Knowledge Dscovery and Data Mnng, pp Memarsadegh, N. and O'Leary, D.P., Classfed nformaton: the data clusterng problem. IEEE Computatonal Scence and Engneerng. 5(5), pp Ng Ka Ka. E. and Ada Wa-chee Fu., Effcent algorthm for projected clusterng. In Proc.of ICDE, pp Shekholeslam G., Chatterjee, S. and Zhang, A., WaveCluster: a mult-resoluton clusterng app roach for very large spatal databases. In Proc. of 24th VLDB, pp Tn Kam Ho., Exploratory analyss of pont proxmty n subspaces. In Proc. of 16th Intl. Conf. on Pattern Recognton. Vol. 2, pp Wang Lan, Cheung, W.W., Mamouls, N., et al., An effcent and scalable algorthm for clusterng XML documents by structure. IEEE Transactons on Knowledge and Data Engneerng, 16(1), pp Wang, W., Yang, J. and Muntz, R., Stng: a statstcal nformaton grd approach to spatal data mnng. In Proc. of VLDB, pp Wang, W., Yang, J. and Muntz, R., Stng+: An Approach to Actve Spatal Data Mnng. In Proc. of ICDE, pp ACKNOWLEDGEMENTS The work s supported by H-Tech Research and Development Program of Chna under grant No. 2002AA135340, and Open Researches Fund Program of SKLSE under grant No. SKL(4)003, and IBM Research Award, and Open Researches Fund Program of LIESMARS under grant No. SKL(01)0303. Guha S., Rastog R. and Shm K., CURE: an effcent clusterng algorthm for large databases. In: Proc. of the ACM SIGMOD, pp Halkd, M., Batstaks, Y. and Vazrganns, M., Clusterng algorthms and valdty measures. In Proc of 13th Intl. Conf. on Scentfc and Statstcal Database Management, pp
A 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 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 informationAnalyzing Popular Clustering Algorithms from Different Viewpoints
1000-9825/2002/13(08)1382-13 2002 Journal of Software Vol.13, No.8 Analyzng Popular Clusterng Algorthms from Dfferent Vewponts QIAN We-nng, ZHOU Ao-yng (Department of Computer Scence, Fudan Unversty, Shangha
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 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 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 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 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 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 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 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 informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Supervsed vs. Unsupervsed Learnng Up to now we consdered supervsed learnng scenaro, where we are gven 1. samples 1,, n 2. class labels for all samples 1,, n Ths s also
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 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 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 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 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 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 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 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 informationFace Recognition Method Based on Within-class Clustering SVM
Face Recognton Method Based on Wthn-class Clusterng SVM Yan Wu, Xao Yao and Yng Xa Department of Computer Scence and Engneerng Tong Unversty Shangha, Chna Abstract - A face recognton method based on Wthn-class
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15
CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc
More informationClustering is a discovery process in data mining.
Cover Feature Chameleon: Herarchcal Clusterng Usng Dynamc Modelng Many advanced algorthms have dffculty dealng wth hghly varable clusters that do not follow a preconceved model. By basng ts selectons on
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 informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
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 Clustering Algorithm for Key Frame Extraction Based on Density Peak
Journal of Computer and Communcatons, 2018, 6, 118-128 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 A Clusterng Algorthm for Key Frame Extracton Based on Densty Peak Hong Zhao
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 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 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 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 informationSurvey of Cluster Analysis and its Various Aspects
Harmnder Kaur et al, Internatonal Journal of Computer Scence and Moble Computng, Vol.4 Issue.0, October- 05, pg. 353-363 Avalable Onlne at www.csmc.com Internatonal Journal of Computer Scence and Moble
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 informationLocal Quaternary Patterns and Feature Local Quaternary Patterns
Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationK-means and Hierarchical Clustering
Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your
More informationA Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures
A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School
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 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 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 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 informationBackground Removal in Image indexing and Retrieval
Background Removal n Image ndexng and Retreval Y Lu and Hong Guo Department of Electrcal and Computer Engneerng The Unversty of Mchgan-Dearborn Dearborn Mchgan 4818-1491, U.S.A. Voce: 313-593-508, Fax:
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
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 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 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 informationA CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION
A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION 1 FENG YONG, DANG XIAO-WAN, 3 XU HONG-YAN School of Informaton, Laonng Unversty, Shenyang Laonng E-mal: 1 fyxuhy@163.com, dangxaowan@163.com, 3 xuhongyan_lndx@163.com
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 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 informationUsing Fuzzy Logic to Enhance the Large Size Remote Sensing Images
Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract
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 informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
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 informationBrushlet Features for Texture Image Retrieval
DICTA00: Dgtal Image Computng Technques and Applcatons, 1 January 00, Melbourne, Australa 1 Brushlet Features for Texture Image Retreval Chbao Chen and Kap Luk Chan Informaton System Research Lab, School
More information1. Introduction. Abstract
Image Retreval Usng a Herarchy of Clusters Danela Stan & Ishwar K. Seth Intellgent Informaton Engneerng Laboratory, Department of Computer Scence & Engneerng, Oaland Unversty, Rochester, Mchgan 48309-4478
More informationModular PCA Face Recognition Based on Weighted Average
odern Appled Scence odular PCA Face Recognton Based on Weghted Average Chengmao Han (Correspondng author) Department of athematcs, Lny Normal Unversty Lny 76005, Chna E-mal: hanchengmao@163.com Abstract
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 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 informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
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 informationStudy of Data Stream Clustering Based on Bio-inspired Model
, pp.412-418 http://dx.do.org/10.14257/astl.2014.53.86 Study of Data Stream lusterng Based on Bo-nspred Model Yngme L, Mn L, Jngbo Shao, Gaoyang Wang ollege of omputer Scence and Informaton Engneerng,
More informationClustering algorithms and validity measures
Clusterng algorthms and valdty measures M. Hald, Y. Batstas, M. Vazrganns Department of Informatcs Athens Unversty of Economcs & Busness Emal: {mhal, yanns, mvazrg}@aueb.gr Abstract Clusterng ams at dscoverng
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 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 informationGraph-based Clustering
Graphbased Clusterng Transform the data nto a graph representaton ertces are the data ponts to be clustered Edges are eghted based on smlarty beteen data ponts Graph parttonng Þ Each connected component
More informationA new segmentation algorithm for medical volume image based on K-means clustering
Avalable onlne www.jocpr.com Journal of Chemcal and harmaceutcal Research, 2013, 5(12):113-117 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCRC5 A new segmentaton algorthm for medcal volume mage based
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationA Comparative Study for Outlier Detection Techniques in Data Mining
A Comparatve Study for Outler Detecton Technques n Data Mnng Zurana Abu Bakar, Rosmayat Mohemad, Akbar Ahmad Department of Computer Scence Faculty of Scence and Technology Unversty College of Scence and
More informationAn Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 97-735 Volume Issue 9 BoTechnology An Indan Journal FULL PAPER BTAIJ, (9), [333-3] Matlab mult-dmensonal model-based - 3 Chnese football assocaton super league
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 informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationClustering. A. Bellaachia Page: 1
Clusterng. Obectves.. Clusterng.... Defntons... General Applcatons.3. What s a good clusterng?. 3.4. Requrements 3 3. Data Structures 4 4. Smlarty Measures. 4 4.. Standardze data.. 5 4.. Bnary varables..
More informationFast Feature Value Searching for Face Detection
Vol., No. 2 Computer and Informaton Scence Fast Feature Value Searchng for Face Detecton Yunyang Yan Department of Computer Engneerng Huayn Insttute of Technology Hua an 22300, Chna E-mal: areyyyke@63.com
More informationMaximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation
Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn
More informationClustering Algorithm of Similarity Segmentation based on Point Sorting
Internatonal onference on Logstcs Engneerng, Management and omputer Scence (LEMS 2015) lusterng Algorthm of Smlarty Segmentaton based on Pont Sortng Hanbng L, Yan Wang*, Lan Huang, Mngda L, Yng Sun, Hanyuan
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
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 informationHybrid Non-Blind Color Image Watermarking
Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,
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 informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationOutline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:
Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 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 informationAn Image Compression Algorithm based on Wavelet Transform and LZW
An Image Compresson Algorthm based on Wavelet Transform and LZW Png Luo a, Janyong Yu b School of Chongqng Unversty of Posts and Telecommuncatons, Chongqng, 400065, Chna Abstract a cylpng@63.com, b y27769864@sna.cn
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 information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
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 informationObject-Based Techniques for Image Retrieval
54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the
More informationImage Alignment CSC 767
Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances
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 informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
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 informationSpatial Data Dynamic Balancing Distribution Method Based on the Minimum Spatial Proximity for Parallel Spatial Database
JOURNAL OF SOFTWARE, VOL. 6, NO. 7, JULY 211 1337 Spatal Data Dynamc Balancng Dstrbuton Method Based on the Mnmum Spatal Proxmty for Parallel Spatal Database Yan Zhou College of Automaton Unversty of Electrc
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
More informationQuerying by sketch geographical databases. Yu Han 1, a *
4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,
More informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
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 informationReal-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution
Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,
More informationShape-adaptive DCT and Its Application in Region-based Image Coding
Internatonal Journal of Sgnal Processng, Image Processng and Pattern Recognton, pp.99-108 http://dx.do.org/10.14257/sp.2014.7.1.10 Shape-adaptve DCT and Its Applcaton n Regon-based Image Codng Yamn Zheng,
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 information