An Internal Clustering Validation Index for Boolean Data

Size: px
Start display at page:

Download "An Internal Clustering Validation Index for Boolean Data"

Transcription

1 BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 6 Specal ssue wth selecton of extended papers from 6th Internatonal Conference on Logstc, Informatcs and Servce Scence LISS 2016 Sofa 2016 Prnt ISSN: ; Onlne ISSN: DOI: /cat An Internal Clusterng Valdaton Index for Boolean Data Lwe Fu, Sen Wu Donlnks School of Economcs and Management, Unversty of Scence and Technology Beng, Beng, Chna Emals: Tavon_Fu@outlook.com wusen@manage.ustb.edu.cn Abstract: Internal clusterng valdaton s recognzed as one of the vtal ssues essental to clusterng applcatons, especally when external nformaton s not avalable. Exstng measures have ther lmtatons n dfferent applcaton crcumstances. There are stll some defcences for Internal Valdaton of Boolean clusterng. Ths paper proposes a new Clusterng Valdaton ndex based on Type of Attrbutes for Boolean data (CVTAB). It evaluates the clusterng qualty n the lght of Dssmlarty of two clusters for Boolean Data (DBD). The attrbutes n the Boolean Data are categorzed nto three types: Type A, Type O and Type E representng respectvely the attrbute values 1,0 and not the same for all the obects n the set. When two clusters are composed nto one, DBD apples the numbers of attrbutes wth the types changed and the numbers of obects changed to measure dssmlarty of two clusters. CVTAB evaluates the clusterng qualty wthout respect to external nformaton Keywords: Clusterng Valdaton ndex based on Type of Attrbutes for Boolean data (CVTAB), Dssmlarty for Boolean Data (DBD), nternal clusterng valdaton ndex, Boolean data, hgh dmensonal data. 1. Introducton 1.1. Background Nowadays, data volume ncreases explosvely along wth the computer technology fully ntegrated nto the socal lfe. Internet applcatons, such as Mcro-Blog, Socal Network, and e-busness, produce a large amount of data partcularly n recent years. Data mnng s the core of knowledge dscovery n databases. Technologcally, t s a process, to get mplct pattern from the varous, ncomplete, 232

2 fuzzy, and random data. Wth abundant methods of data acquston, data normally has two characterstcs, hgh dmensonalty and no label. Specfcally, a great deal of research work has focused on unsupervsed hgh dmensonal data mnng. In fact, some clusterng algorthms, such as k-means [1, 2], are commonly used n practce. Cluster analyss, as a man task of data mnng, groups obects to clusters, so that obects n the same cluster are more smlar to each other than to those n other clusters. It s also a common technque for statstcal data analyss used n many felds, such as machne learnng, mage analyss, pattern recognton, nformaton retreval, bonformatcs and so on [3]. The result of cluster analyss depends on characterstcs of the data set, but no matter what the data dstrbuton pattern s the clusterng algorthm can always gve a result. So, the ndex evaluatng the qualty of clusterng result s very sgnfcant [4, 5], partcularly for hgh dmensonal and large n sze data, such as Tme-seres data [6]. The clusterng valdaton ndex falls nto three types [7]: External Index, Internal Index and Relatve Index. External Index focuses on comparng clusterng results wth the external nformaton; Internal Index focuses on evaluatng the goodness of a clusterng structure wthout respect to external nformaton; Relatve Index focuses on comparng the results of varous algorthms of clusterng. Among the 3 of them, only Internal Index can evaluate the clusterng results by the nteror nformaton of data set wthout the nformaton outsde of the data set such as orgnal category labels. So, Internal Index s more practcal [8]. In practce, Internal Index can also be used to select the sutable algorthm and parameter of algorthm obectvely. Categorcal data and Boolean data wdely exst [9]. The dfference between the Boolean data and categorcal data s that the attrbutes of the Boolean data are only 0 and 1, but those of the categorcal data are not. The multple category attrbutes can be converted nto bnary attrbutes by usng 0 and 1 to represent ether a category absent or present [10]. Ths paper focuses on the evaluaton of Boolean data clusterng. It s also applcable to categorcal data, whch can be transformed nto Boolean data harmonously Related work Clusterng valdaton measures can be affected by varous data characterstcs [11], such as data type and nose. Internal Index evaluates the clusterng result senstve to the propertes of data set and clusters. Specfcally, compactness nsde a cluster and separaton among the clusters are closely related wth Internal Index [12], and many researches focus on t. For a dataset X, n s the number of obects. The dataset s dvded nto nc subset; X=C 1 C 2 C nc; c s the centrod of X, and c s the centrod of C ; n s the number of obects n C ; d (x, x ) s dstance between x and x. But most of the Internal Indces lack pertnence to Boolean data. Some ndces are shown n Table

3 Table 1. Some of nternal ndces Index Calnsk-Harabasz ndex (CH) [13] Dunn ndex (Dunn) [14] I ndex (I) [15] Slhouette ndex (S) [16] Equaton of Defnton nc 1 2 nd c, c nc 1 1 CH nc 1 2 d c, x n nc 1 xc mn x C,, y C d x y Dunn mn mn max max x, yc d x, y p 1 I nc nc 1 nc 1 xc d x, c d c, x max d c, c ax nc 1 1 b x S nc 1 n xc max a x, b x q 1 1 In Table 1, ax dx, y, bx mn dx y n 1 x, yc, x y n,,, xc, yc and,, p = 1, 2,, nc; q s a parameter of I ndex, and q = 2 n ths paper. Besdes, dssmlarty, as an essental element of the Internal Index, s often used n many algorthms for Boolean data. In k-modes [17], the dssmlarty measure between two obects s defned by the total msmatches of the correspondng attrbute. Formally, m 1 d X, Y x, y, N 1 0 x y, x, y 1 x y, where X and Y denote the categorcal obects, x and y denote the attrbutes of X and Y, = 1, 2,, m; N denotes the coeffcent. If d(x, Y) gves equal mportance to each category of an attrbute, N = 1. But f the frequences of categores n the data set are taken nto account, N s half of the harmonc average of n x and n y, where n x and n y are the numbers of obects n X and Y respectvely. The smaller the number of msmatches s, the more smlar the two obects are. Ths measure can only evaluate the dssmlarty of the obects, not that of categores or clusters. In CABOSFV [18], whch s a clusterng algorthm for hgh dmensonal sparse data, the measure named Sparse Feature Dssmlarty (SFD) s proposed to represent the dssmlarty of the obects n a set, and t s defned as: 234

4 e SFD, X a where a denotes the number of attrbutes that equal 1 for all obects, e denotes the number of attrbutes that equal 1 for some obects and equal 0 for other obects. X ndcates the number of obects n set X. The smaller the SFD s, the more smlar the obects are. However, SFD can only measure the dssmlarty of the obects n a set or cluster rather than that between two sets or clusters. Boolean data clusterng s mpacted negatvely by lackng Internal Index whch has pertnence to data wth bnary attrbutes. Ths paper proposes a new ndex to evaluate the effectveness of the Boolean data clusterng. 2. Concepts and defntons To evaluate the dssmlarty of two clusters, the new ndex s proposed to measure the valdaton of clusterng. Let A 1, A 2,, A m be m attrbutes of the dataset X, descrbng a space Ω; Ω s a Boolean space f all A 1, A 2,, A m are Boolean. A, whose acceptable values are only 1 and 0, s called a Boolean attrbute, for =1, 2,, m The defnton of attrbute types Let X = {x 1, x 2,, x n} be a set of n obects wth Boolean values and X. For the Boolean dataset, the attrbutes can be categorzed nto three types. Type A s defned for attrbutes whch values are 1 for all the obects n X; Type O s defned for attrbutes whose values are all 0; Type E s defned for attrbutes that have not the same value for all the obects n X. Then the space Ω would be dvded nto three subsets, J A, J O and J E. For dataset X, f the attrbute A belongs to Type A attrbutes, A J A; f the attrbute A belongs to Type O attrbutes, A J O; and f the attrbute A belongs to Type E attrbutes, A J E, for 1 m. Apparently, set J E shows the dfferences and J A J O shows the smlarty Dssmlarty of two Boolean sets For Boolean data, to compare the dssmlarty of two clusters C and C, C and C can merge nto one cluster C U, and C U = C C. For C U, J A, J O and J E can be calculated as (1), (2) and (3): (1) JAU = JA JA, (2) JOU = JO JO, (3) JEU = C U (JAU JOU ), where J A denotes the set J A n C ; J O denotes the set J O n C ; J A denotes the set J A n C ; J O denotes the set J O n C ; J AU denotes the set J A n C U; J OU denotes the set J O n C U; C U ( ) denotes calculatng the complementary set. Composng C and C wll 235

5 result n some attrbutes of Type A or O altered to E, but Type E attrbutes n C or C cannot be changed n C U obvously. Fg. 1 shows ths process. 236 Fg. 1. The alterng process of attrbutes Accordng to Fg. 1, the attrbute of Type A or Type O meetng the attrbute of Type E before composng wll be altered nto Type E n C U. Ths means that when two dfferent clusters are put nto one, the dfferences wll be more, but smlarty wll be less wthout consderng the number of the obects n clusters. Therefore, the stuaton Type A meetng Type O should be focused on, and that s marked by the bold arrows n Fg. 1. and the number of the Type A attrbutes meetng Type O attrbutes s used to measure the dssmlarty from the attrbutes altered as (4) AlterAO = JA JO, where AlterA O denotes attrbutes altered to E by Type A n C meetng Type O n C ; J A denotes the set J A n C ; J O denotes the set J O n C ; J A denotes the set J A n C ; J O denotes the set J O n C. Furthermore, 1 s usually pad more attenton than 0, partcularly for sparse data, and the dssmlarty from attrbutes alterng can be ndcated by DFAA (Dssmlarty From Altered Attrbutes) as

6 n n (5) DFAA AlterAO AlterA O, n n n n where denotes the number of elements n the set; n denotes the number of obects n C ; n denotes the number of obects n C. Accordng to (5), AlterA O denotes the Type A attrbutes n C alterng to Type E by meetng Type O n C, and AlterA O n n n n n are the weghts. In symmetrc denotes that n C ; n and varables, 0 and 1 are equally mportant. So the weghts n (5) wll not be taken nto consderaton, and DFAA s the number of Type A meetng Type O, and t s (6) DFAA AlterA O AlterA O On the other hand, the number of obects n C and C respectvely can also effect the dssmlarty of the two clusters. The value of ths dssmlarty s the number of obects n C U mnus the harmonc average of those n C and C, and t s 2 DFN n, (7) 1 1 n n where DFN (Dssmlarty From Number) denotes the dssmlarty from the number of obects n cluster; n denotes the number of obects n C U, and n = n +n. Thus the Dssmlarty for Boolean Data (DBD) between C and C s composed by DFAA and DFN, and t s shown as (8) DBD DFAA DFN. In ths paper, DBD (C, C ) ndcates the DBD of the cluster C and C CVTAB for clusterng valdaton CVTAB (Clusterng Valdaton ndex based on Type of Attrbutes for Boolean data) based on DBD can evaluate the valdaton of clusterng for Boolean data. CVTAB s the average of the DBD between each two clusters. Let X = {x 1, x 2,, x n} be a set of n obects and A 1, A 2,, A m be m attrbutes of the dataset, then X. After clusterng, X s parttoned nto k subsets, and X = C 1 C 2 C k. In C, there are n obects for 1 n k, and CVTAB s (9) k k DBD C, 1 1, C CVTAB, k k 1 CVTAB s postvely assocated wth the effects of the clusterng. The hgher CVTAB, the better effects of clusterng. Because hgher CVTAB denotes more dfferences between each two clusters and more smlartes n each cluster. The bgger value of CVTAB means the better effect of clusterng. 237

7 3. Steps and examples Let X = {x 1, x 2, x 7}, and X s a Boolean dataset. x 1, x 2,, x 7 are seven obects n a dataset, and A 1, A 2,, A 16 are the attrbutes. Let s assume that C 1 = {x 1, x 2}, C 2 = {x 3, x 4, x 5}, C 3 = {x 6, x 7}. The dataset X s as gven n Table 2. Table 2. The dataset X Cluster C1 Obect Sequence of attrbutes X X X C2 X X C3 X X Example of DBD Accordng to Fg. 1, after C 1 and C 2 merged to C U, the types of attrbutes are transformed as gven n Table 3. Further on, the sets J A, J O and J E of cluster C 1, cluster C 2, and the composed cluster C U are shown n Table 4. Based on Table 4, the AlterAO, DFAA, DFN, and CVTAB can also be calculated, and ths process can be ndcated wth Venn dagram, shown on Fg. 2. Table 3. The types of attrbutes n C1, C2 and CU Sequence of attrbutes Cluster C1 O A E E O E O O O E O O E O E O C2 A A E E E A O O E O E A E O O E CU E A E E E E O O E E E E E O E E Table 4. The sets of JA, JO and JE Cluster Type of sets Sequence of attrbutes JA1 2, 13, 15 C1 JO1 1, 5, 7, 8, 9, 11, 12, 14, 16 JE1 3, 4, 6, 10 JA2 1, 2, 6, 12 C2 JO2 7, 8, 10, 14, 15 JE2 3, 4, 5, 9, 11, 13, 16 JAU 2 CU JOU 7, 8, 14 JEU 1, 3, 4, 5, 6, 9, 10, 11, 12, 13, 15,

8 (a) JA1, JA2, JAU (b) JO1, JO2, JOU (c) JE1, JE2 (d) JE1, JE2, JEU (e) Type A altered to E n JA1 (f) Type A altered to E n JA2 Fg. 2. Venn dagram of composng C1 and C2 Accordng to Table 4 and Fg. 2, there are 12 elements n set J EU, and 9 of them are from J E1 and J E2 whch are not transformed, but three of them are from J A1 and J A2. Specally, Attrbute 15 s n the ntersecton of J A1 and J O2. Attrbute 1 and attrbute12 are n ntersecton of J O1 and J A2. Accordng to (5), (7) and (8), DBD s calculated as: AlterA O 15 1, 1 2 AlterA O 1,12 2, DFAA , DFN , DBD DFAA DFN In ths example, DBD of C 1 and C 2 s Smlarly, DBD of C 1 and C 3 s 7.00, and DBD of C 2 and C 3 s

9 3.2. Example of CVTAB As above, DBD of each two clusters can be calculated, and the results wll be a symmetrc matrx as gven n Table 5, and there are 6 values n t. The average of these values s CVTAB. Accordng to (9), the CVTAB s calculated as: CVTAB Table 5. Symmetrc matrx of DBD Cluster C1 C2 C3 C C C Experments 4.1. Experment desgn In ths experment, k-modes algorthm on two UCI data sets (Table 6) are mplemented n Matlab R2015b to measure the effectveness of clusterng. To compare the effectveness of varous clusterng valdaton measures, the selected data set has external nformaton, orgnal clusterng label. For data of zoo, after elmnatng the repeated obects, there are 59 obects n t. Another 6 ndces Calnsk-Harabasz ndex (CH), Dunn ndex (D), I ndex (I), Slhouette ndex (S), Normalzed Mutual Informaton (NMI) [19], and Accuracy Index(ACC) wll also be used as comparatve ndces to evaluate the valdaton propertes and performances of CATAB. Among these ndces, CH, Dunn, I, and S are nternal clusterng valdaton measures, focusng on the data set, but NMI and ACC are external clusterng valdaton measures. Table 6. Data sets for experments Data set Instances Attrbutes Categores Zoo Small Soybean Tests of k-modes would be carred out 100 tmes to elmnate the effects of randomness, and each tme nvolves dfferent parameters of k whose range s Results and analyss Table 7 and Table 8 show averages of 100 tmes clusterng results by k-modes. There are some null values n ACC column because ACC cannot evaluate the result whle calculated number of clusters s larger than that of actual clusters. 240

10 Table 7. Results of data Zoo by k-modes k CVTAB CH D ( 10 1 ) S ( 10 3 ) I ( 10 1 ) NMI ACC Table 8. Results of data Small Soybean by k-modes k CVTAB CH D ( 10 1 ) S ( 10 2 ) I ( 10 1 ) NMI ACC Accordng to Table 7 and Table 8, the Fg. 3 shows the trends of the results under varous numbers of clusters (k) to compare these ndces after data standardzaton. ACC s gnored on Fg. 3 consderng the null values. In fact, determnng the number of clusters s one of the most mportant clusterng valdaton problems [20]. Accordng to Fg. 3a and b show the results of nternal valdaton ndces. CH, S, and I have a sgnfcant monotonc relatonshp wth k. Among them, CH and S show monotonc ncrease, but ndex of I shows monotone decrease. Ths means that obvously, CH, S, and I are affected by k on Boolean data. Because of beng senstve to k, they cannot evaluate the results of clusterng obectvely and valdly. As for Dunn ndex, t shows statonarty both n (a) and (b) for beng senstve to nose. And ths wll add the uncertanty to evaluaton. So, CH, I, S and D are not sutable for Boolean data, and all of them cannot determne the best k for k-modes algorthm. However, on data Zoo, CVTAB ncreases rapdly from k=2 to k=5, and ncreases smoothly from k=5 to k=9, then decreases. On data Small Soybean, CVTAB shoots up untl k=3, and ncreases smoothly from k=3 to k=4, then falls rapdly. In summary, CVTAB has the obvous peak value as the ncrease of k values, and t suggests the recent, even correct, cluster number on Boolean data, whle CH, I, S and D cannot do t. 241

11 (a) Internal ndces on data Zoo (b) Internal ndces on data Small Soybean (c) CVTAB and NMI on data Zoo Fg. 3. Clusterng results by k-modes (d) CATAB and NMI on data Small Soybean On Fg. 3c and d s shown the trend of CVTAB and NMI as the ncrease of k values. As an nternal evaluaton ndex, CVTAB shows consstency wth the external clusterng valdaton measures, and the normalzed value of CVTAB s near that of NMI. NMI s more accurate than CVTAB on data Zoo, but on data Small Soybean, both of them show the same superorty. Apparently, snce NMI s an external valdaton measure, t knows the true cluster number n advance and usually s more precse than an nternal measure. However, nternal valdaton measures are the only opton for cluster valdaton wthout external nformaton, and the condtons when the external nformaton s not avalable are more common n practce. From ths perspectve, CVTAB s more applcable. 5. Concluson CVTAB s an effectve nternal clusterng valdaton measure for hgh dmensonal Boolean data. It s also sutable for categorcal data whch can be translated nto Boolean data. Expermental results show that compared wth some nternal valdaton ndces (CH ndex, I ndex and S ndex), CVTAB shows consstency wth 242

12 the external clusterng valdaton measure (NMI); CVTAB can pont the best clusterng result nstead of showng monotoncty wth the parameter of algorthm. Meanwhle, CVTAB s not as senstve to nose as Dunn ndex (nternal valdaton ndex). Compared wth NMI whch s external valdaton ndex, CVTAB evaluates the clusterng valdaton wthout external nformaton. From ths perspectve, CVTAB s more applcable. In addton, CVTAB can optmze clusterng algorthm by determnng the parameter of the clusterng algorthm, or by selectng optmal results from many experments to avod the negatve mpacts from randomness. Acknowledgments: Ths work s supported by Natonal Natural Scence Foundaton of Chna (NSFC) under Grant No , and the Research Fund for the Doctoral Program of Hgher Educaton under Grant No R e f e r e n c e s 1. E l a n g a s n g h e, M. A., N. S n g h a l, K. N. D r k s et al. Complex Tme Seres Analyss of PM 10, and PM 2.5, for a Coastal Ste Usng Artfcal Neural Network Modellng and k-means Clusterng. Atmospherc Envronment, Vol. 94, 2014, pp F e r r a n d e z, S. M., T. H a r b s o n, T. W e b e r et al. Optmzaton of a Truck-Drone n Tandem Delvery Network Usng k-means and Genetc Algorthm. Journal of Industral Engneerng & Management, Vol. 9, 2016, No 2, pp G u a n, N., D. Tao, Z. L u o et al. NeNMF: An Optmal Gradent Method for Nonnegatve Matrx Factorzaton. IEEE Transactons on Sgnal Processng, Vol. 60, 2012, No 6, pp N e n n a t t r a k u l, V., C. A. R a t a n a m a h a t a n a. On Clusterng Multmeda Tme Seres Data Usng k-means and Dynamc Tme Warpng. Internatonal Conference on Multmeda and Ubqutous Engneerng, IEEE, 2007, pp N e n n a t t r a k u l, V., C. A. R a t a n a m a h a t a n a. On Clusterng Multmeda Tme Seres Data Usng k-means and Dynamc Tme Warpng. Internatonal Conference on Multmeda and Ubqutous Engneerng, IEEE, 2007, pp R a n, S., G. S k k a. Recent Technques of Clusterng of Tme Seres Data: A Survey. Internatonal Journal of Computer Applcatons, Vol. 52, 2012, No 15, pp Lu, Y. Research on Internal Clusterng Valdaton Measures. Unversty of Scence and Technology Beng, 2012, pp K r e m e r, H., P. K r a n e n, T. J a n s e n et al. An Effectve Evaluaton Measure for Clusterng on Evolvng Data Streams. In: Proc. of 17th ACM SIGKDD Internatonal Conference on Knowledge Dscovery and Data Mnng, ACM, 2011, pp F e n g, X., S. W u, Y. Lu. Imputng Mssng Values for Mxed Numerc and Categorcal Attrbutes Based on Incomplete Data Herarchcal Clusterng. In: Proc. of Internatonal Conference on Knowledge Scence, Engneerng and Management, Sprnger Verlag, 2011, pp R a l a m b o n d r a n y, H. A Conceptual Verson of the k-means Algorthm. Pattern Recognton Letters, Vol. 16, 1995, No 11, pp Lu, Y., Z. L, H. X o n g et al. Understandng and Enhancement of Internal Clusterng Valdaton Measures. IEEE Transactons on Systems Man & Cybernetcs Part B. Cybernetcs A Publcaton of the IEEE Systems Man & Cybernetcs Socety, Vol. 43, 2012, No 3, pp K r a u s, J. M., C. M ü s s e l, G. P a l m et al. Mult-Obectve Selecton for Collectng Cluster Alternatves. Computatonal Statstcs, Vol. 26, 2011, No 2, pp Z h a n g, G. X., L. Q. P a n. School of Electrcal Engneerng, Unversty S. J., Chengdu. A Survey of Membrane Computng as a New Branch of Natural Computng. Chnese Journal of Computers, Vol. 33, 2010, No 2, pp

13 14. B u s, N. Usng Well-Structured Transton Systems to Decde Dvergence for Catalytc P Systems. Theoretcal Computer Scence, Vol. 372, 2007, No 2-3, pp N s h d a, T. Y. An Approxmate Algorthm for NP-Complete Optmzaton Problems Explotng P Systems. In: Proc. of 8th World Mult-Conference on Systems, Cybernetcs and Informaton, 2004, pp H u a n g, L. Research on Membrane Computng Optmzaton Methods. Zheang Unversty, H u a n g, Z. A Fast Clusterng Algorthm to Cluster Very Large Categorcal Data Sets n Data Mnng. Research Issues on Data Mnng & Knowledge Dscovery, 1998, pp W u, S., X. Gao. CABOSFV Algorthm for Hgh Dmensonal Sparse Data Clusterng. Journal of Unversty Scence & Technology Beng, Vol. 11, 2004, No 3, pp K n o p s, Z. F., J. B. M a n t z, M. A. V e r g e v e r et al. Normalzed Mutual Informaton Based Regstraton Usng k-means Clusterng and Shadng Correcton. Medcal Image Analyss, Vol. 10, 2006, No 3, pp C h e n, L. F., Q. S. J a n g, S. R. W a n g. A Herarchcal Method for Determnng the Number of Clusters. Journal of Software, Vol. 19, 2008, No 1, pp

Cluster Analysis of Electrical Behavior

Cluster 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 information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace 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 information

Machine Learning: Algorithms and Applications

Machine 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 information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning 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 information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content 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 information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. 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 information

The Research of Support Vector Machine in Agricultural Data Classification

The 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 information

Module Management Tool in Software Development Organizations

Module 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 information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining 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 information

Solving two-person zero-sum game by Matlab

Solving 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 information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE 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 information

Hierarchical clustering for gene expression data analysis

Hierarchical 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 information

Unsupervised Learning

Unsupervised 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 information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A 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 information

Smoothing Spline ANOVA for variable screening

Smoothing 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 information

TN348: Openlab Module - Colocalization

TN348: 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 information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. 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 information

An Improved Image Segmentation Algorithm Based on the Otsu Method

An 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 information

A New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1

A New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1 A New Feature of Unformty of Image Texture Drectons Concdng wth the Human Eyes Percepton Xng-Jan He, De-Shuang Huang, Yue Zhang, Tat-Mng Lo 2, and Mchael R. Lyu 3 Intellgent Computng Lab, Insttute of Intellgent

More information

Available online at Available online at Advanced in Control Engineering and Information Science

Available 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 information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

X- Chart Using ANOM Approach

X- 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 information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL 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 information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki 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 information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A 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 information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua 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 information

Wishing you all a Total Quality New Year!

Wishing 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 information

A Similarity Measure Method for Symbolization Time Series

A Similarity Measure Method for Symbolization Time Series Research Journal of Appled Scences, Engneerng and Technology 5(5): 1726-1730, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scentfc Organzaton, 2013 Submtted: July 27, 2012 Accepted: September 03, 2012

More information

A Clustering Algorithm for Key Frame Extraction Based on Density Peak

A 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 information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement 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 information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem 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 information

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1

Outline. 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 information

THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY

THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY Proceedngs of the 20 Internatonal Conference on Machne Learnng and Cybernetcs, Guln, 0-3 July, 20 THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY JUN-HAI ZHAI, NA LI, MENG-YAO

More information

Adjustment methods for differential measurement errors in multimode surveys

Adjustment methods for differential measurement errors in multimode surveys Adjustment methods for dfferental measurement errors n multmode surveys Salah Merad UK Offce for Natonal Statstcs ESSnet MM DCSS, Fnal Meetng Wesbaden, Germany, 4-5 September 2014 Outlne Introducton Stablsng

More information

An Image Fusion Approach Based on Segmentation Region

An 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 information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A 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 information

REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES

REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES Laser dffracton s one of the most wdely used methods for partcle sze analyss of mcron and submcron sze powders and dspersons. It s quck and easy and provdes

More information

The Comparison of Calibration Method of Binocular Stereo Vision System Ke Zhang a *, Zhao Gao b

The Comparison of Calibration Method of Binocular Stereo Vision System Ke Zhang a *, Zhao Gao b 3rd Internatonal Conference on Materal, Mechancal and Manufacturng Engneerng (IC3ME 2015) The Comparson of Calbraton Method of Bnocular Stereo Vson System Ke Zhang a *, Zhao Gao b College of Engneerng,

More information

An Optimal Algorithm for Prufer Codes *

An 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 information

S1 Note. Basis functions.

S1 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 information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

APPLICATION OF IMPROVED K-MEANS ALGORITHM IN THE DELIVERY LOCATION

APPLICATION OF IMPROVED K-MEANS ALGORITHM IN THE DELIVERY LOCATION An Open Access, Onlne Internatonal Journal Avalable at http://www.cbtech.org/pms.htm 2016 Vol. 6 (2) Aprl-June, pp. 11-17/Sh Research Artcle APPLICATION OF IMPROVED K-MEANS ALGORITHM IN THE DELIVERY LOCATION

More information

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures

A 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 information

Unsupervised Neural Network Adaptive Resonance Theory 2 for Clustering

Unsupervised Neural Network Adaptive Resonance Theory 2 for Clustering 3 rd Internatonal G raduate Conference on Engneerng, Scence and Humantes (IGCESH) School of Graduate Studes Unverst Teknolog Malaysa 4 November 00 Unsupervsed Neural Network Adaptve Resonance Theory for

More information

Study of Data Stream Clustering Based on Bio-inspired Model

Study 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 information

A Webpage Similarity Measure for Web Sessions Clustering Using Sequence Alignment

A Webpage Similarity Measure for Web Sessions Clustering Using Sequence Alignment A Webpage Smlarty Measure for Web Sessons Clusterng Usng Sequence Algnment Mozhgan Azmpour-Kv School of Engneerng and Scence Sharf Unversty of Technology, Internatonal Campus Ksh Island, Iran mogan_az@ksh.sharf.edu

More information

Classifier Selection Based on Data Complexity Measures *

Classifier 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 information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For 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 information

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks 2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng

More information

Support Vector Machines

Support 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 information

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem

An 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 information

Detection of an Object by using Principal Component Analysis

Detection 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 information

Unsupervised Learning and Clustering

Unsupervised 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 information

Document Representation and Clustering with WordNet Based Similarity Rough Set Model

Document Representation and Clustering with WordNet Based Similarity Rough Set Model IJCSI Internatonal Journal of Computer Scence Issues, Vol. 8, Issue 5, No 3, September 20 ISSN (Onlne): 694-084 www.ijcsi.org Document Representaton and Clusterng wth WordNet Based Smlarty Rough Set Model

More information

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.

An 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 information

From Comparing Clusterings to Combining Clusterings

From Comparing Clusterings to Combining Clusterings Proceedngs of the Twenty-Thrd AAAI Conference on Artfcal Intellgence (008 From Comparng Clusterngs to Combnng Clusterngs Zhwu Lu and Yuxn Peng and Janguo Xao Insttute of Computer Scence and Technology,

More information

A Post Randomization Framework for Privacy-Preserving Bayesian. Network Parameter Learning

A Post Randomization Framework for Privacy-Preserving Bayesian. Network Parameter Learning A Post Randomzaton Framework for Prvacy-Preservng Bayesan Network Parameter Learnng JIANJIE MA K.SIVAKUMAR School Electrcal Engneerng and Computer Scence, Washngton State Unversty Pullman, WA. 9964-75

More information

Evaluation of the application of BIM technology based on PCA - Q Clustering Algorithm and Choquet Integral

Evaluation of the application of BIM technology based on PCA - Q Clustering Algorithm and Choquet Integral IETI Transactons on Busness and Management Scences, 2016, Volume 1, Issue 1, 47-55. http://www.et.net/tc An Internatonal Open Access Journal Evaluaton of the applcaton of BIM technology based on PCA -

More information

Fuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval

Fuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,

More information

Unsupervised Learning and Clustering

Unsupervised 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 information

Query Clustering Using a Hybrid Query Similarity Measure

Query 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

Research on Categorization of Animation Effect Based on Data Mining

Research on Categorization of Animation Effect Based on Data Mining MATEC Web of Conferences 22, 0102 0 ( 2015) DOI: 10.1051/ matecconf/ 2015220102 0 C Owned by the authors, publshed by EDP Scences, 2015 Research on Categorzaton of Anmaton Effect Based on Data Mnng Na

More information

Optimal Fuzzy Clustering in Overlapping Clusters

Optimal Fuzzy Clustering in Overlapping Clusters 46 The Internatonal Arab Journal of Informaton Technology, Vol. 5, No. 4, October 008 Optmal Fuzzy Clusterng n Overlappng Clusters Ouafa Ammor, Abdelmoname Lachar, Khada Slaou 3, and Noureddne Ras Department

More information

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION 1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

A new segmentation algorithm for medical volume image based on K-means clustering

A 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 information

Support Vector Machines

Support 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 information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A 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 information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps 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 information

Professional competences training path for an e-commerce major, based on the ISM method

Professional competences training path for an e-commerce major, based on the ISM method World Transactons on Engneerng and Technology Educaton Vol.14, No.4, 2016 2016 WIETE Professonal competences tranng path for an e-commerce maor, based on the ISM method Ru Wang, Pn Peng, L-gang Lu & Lng

More information

A Clustering Algorithm Solution to the Collaborative Filtering

A Clustering Algorithm Solution to the Collaborative Filtering Internatonal Journal of Scence Vol.4 No.8 017 ISSN: 1813-4890 A Clusterng Algorthm Soluton to the Collaboratve Flterng Yongl Yang 1, a, Fe Xue, b, Yongquan Ca 1, c Zhenhu Nng 1, d,* Hafeng Lu 3, e 1 Faculty

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

More information

Network Intrusion Detection Based on PSO-SVM

Network Intrusion Detection Based on PSO-SVM TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*

More information

Brushlet Features for Texture Image Retrieval

Brushlet 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 information

Correlative features for the classification of textural images

Correlative features for the classification of textural images Correlatve features for the classfcaton of textural mages M A Turkova 1 and A V Gadel 1, 1 Samara Natonal Research Unversty, Moskovskoe Shosse 34, Samara, Russa, 443086 Image Processng Systems Insttute

More information

A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION

A 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 information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION

BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION SHI-LIANG SUN, HONG-LEI SHI Department of Computer Scence and Technology, East Chna Normal Unversty 500 Dongchuan Road, Shangha 200241, P. R. Chna E-MAIL: slsun@cs.ecnu.edu.cn,

More information

EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS

EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS P.G. Demdov Yaroslavl State Unversty Anatoly Ntn, Vladmr Khryashchev, Olga Stepanova, Igor Kostern EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS Yaroslavl, 2015 Eye

More information

Associative Based Classification Algorithm For Diabetes Disease Prediction

Associative Based Classification Algorithm For Diabetes Disease Prediction Internatonal Journal of Engneerng Trends and Technology (IJETT) Volume-41 Number-3 - November 016 Assocatve Based Classfcaton Algorthm For Dabetes Dsease Predcton 1 N. Gnana Deepka, Y.surekha, 3 G.Laltha

More information

A fast algorithm for color image segmentation

A fast algorithm for color image segmentation Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au

More information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-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 information

Improved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment

Improved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment JOURNAL OF COMPUTERS, VOL. 4, NO. 9, SEPTEMBER 2009 873 Improved Resource Allocaton Algorthms for Practcal Image Encodng n a Ubqutous Computng Envronment Manxong Dong, Long Zheng, Kaoru Ota, Song Guo School

More information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg

More information

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15

CS434a/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 information

BIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING

BIN 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 information

A Clustering Algorithm for Chinese Adjectives and Nouns 1

A Clustering Algorithm for Chinese Adjectives and Nouns 1 Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,

More information

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

More information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection 2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,

More information

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Pruning Training Corpus to Speedup Text Classification 1

Pruning Training Corpus to Speedup Text Classification 1 Prunng Tranng Corpus to Speedup Text Classfcaton Jhong Guan and Shugeng Zhou School of Computer Scence, Wuhan Unversty, Wuhan, 430079, Chna hguan@wtusm.edu.cn State Key Lab of Software Engneerng, Wuhan

More information

Machine Learning. Topic 6: Clustering

Machine 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 information

An Improved Spectral Clustering Algorithm Based on Local Neighbors in Kernel Space 1

An Improved Spectral Clustering Algorithm Based on Local Neighbors in Kernel Space 1 DOI: 10.98/CSIS110415064L An Improved Spectral Clusterng Algorthm Based on Local Neghbors n Kernel Space 1 Xnyue Lu 1,, Xng Yong and Hongfe Ln 1 1 School of Computer Scence and Technology, Dalan Unversty

More information

Implementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status

Implementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status Internatonal Journal of Appled Busness and Informaton Systems ISSN: 2597-8993 Vol 1, No 2, September 2017, pp. 6-12 6 Implementaton Naïve Bayes Algorthm for Student Classfcaton Based on Graduaton Status

More information

Object-Based Techniques for Image Retrieval

Object-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 information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R 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 information