From Comparing Clusterings to Combining Clusterings
|
|
- Kristin Lynch
- 6 years ago
- Views:
Transcription
1 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, Pekng Unversty, Beng 0087, Chna Abstract Ths paper presents a fast smulated annealng framework for combnng multple clusterngs (.e. clusterng ensemble based on some measures of agreement between parttons, whch are orgnally used to compare two clusterngs (the obtaned clusterng vs. a ground truth clusterng for the evaluaton of a clusterng algorthm. Though we can follow a greedy strategy to optmze these measures as obectve functons of clusterng ensemble, some local optma may be obtaned and smultaneously the computatonal cost s too large. To avod the local optma, we then consder a smulated annealng optmzaton scheme that operates through sngle label changes. Moreover, for these measures between parttons based on the relatonshp (oned or separated of pars of obects such as Rand ndex, we can update them ncrementally for each label change, whch makes sure the smulated annealng optmzaton scheme s computatonally feasble. The smulaton and real-lfe experments then demonstrate that the proposed framework can acheve superor results. Introducton Comparng clusterngs plays an mportant role n the evaluaton of clusterng algorthms. A number of crtera have been proposed to measure how close the obtaned clusterng s to a ground truth clusterng, such as mutual nformaton (MI (Strehl and Ghosh 00, Rand ndex (Rand 97; Hubert and Arabe 985, Jaccard ndex (Denoeud and Guénoche 006, and Wallace ndex (Wallace 983. One mportant applcaton of these measures s to make obectve evaluaton of mage segmentaton algorthms (Unnkrshnan, Pantofaru, and Hebert 007, snce mage segmentaton can be consdered as a clusterng problem. Snce the maor dffculty of clusterng combnaton s ust n fndng a consensus partton from the ensemble of parttons, these measures for comparng clusterngs can further be used as the obectve functons of clusterng ensemble. Here, t s only dfferent n that the consensus partton has to be compared to multple parttons. Such consensus functons have been developed n (Strehl and Ghosh 00 based Correspondng author. Copyrght c 008, Assocaton for the Advancement of Artfcal Intellgence ( All rghts reserved. on MI. Though a greedy strategy can be used to maxmze normalzed MI va sngle label change, the computatonal cost s too large. Hence, we resort to those measures between parttons based on the relatonshp (oned or separated of pars of obects such as Rand ndex, Jaccard ndex, and Wallace ndex, whch can be updated ncrementally for each sngle label change. Moreover, to resolve the local convergence problem, we follow a smulated annealng optmzaton scheme, whch s computatonally feasble due to the ncremental update of obectve functon. We have actually proposed a fast smulated annealng framework for clusterng ensemble based on measures for comparng clusterngs. There are three man advantages to the proposed framework: developng a seres of consensus functons for clusterng ensemble, not ust one; avodng the local optma problem; 3 low computatonal complexty of our consensus functons - O(nkr for n obects, k clusters n the target partton, and r clusterngs n the ensemble. Our framework s readly applcable to large data sets, as opposed to other consensus functons whch are based on the co-assocaton of obects n clusters from an ensemble wth quadratc complexty O(n kr. Moreover, unlke those algorthms that search for a consensus partton va re-labelng and subsequent votng, ths framework can operate wth arbtrary parttons wth varyng numbers of clusters, not constraned to a predetermned number of clusters n the ensemble parttons. The rest of ths paper s organzed as follows. Secton descrbes relevant research on clusterng combnaton. In secton 3, we brefly ntroduce some measures for comparng clusterngs and especally gve three of them n detal. Secton 4 then presents the smulated annealng framework for clusterng ensemble based on the three measures. The expermental results on several data sets are presented n secton 5, followed by the conclusons n secton 6. Motvaton and Related Work Approaches to combnaton of clusterngs dffer n two man respects, namely the way n whch the contrbutng component clusterngs are obtaned and the method by whch they are combned. One mportant consensus functon s proposed by (Fred and Jan 005 to summarze varous clusterng results n a co-assocaton matrx. Co-assocaton values represent the strength of assocaton between obects by an- 665
2 alyzng how often each par of obects appears n the same cluster. Then the co-assocaton matrx serves as a smlarty matrx for the data tems. The fnal clusterng s formed from the co-assocaton matrx by lnkng the obects whose co-assocaton value exceeds a certan threshold. One drawback of the co-assocaton consensus functon s ts quadratc computatonal complexty n the number of obects O(n. Moreover, experments n (Topchy, Jan, and Punch 005 show co-assocaton methods are usually unrelable wth the number of clusterngs r<50. Some hypergraph-based consensus functons have also been developed n (Strehl and Ghosh 00. All the clusters n the ensemble parttons can be represented as hyperedges on a graph wth n vertces. Each hyperedge descrbes a set of obects belongng to the same cluster. A consensus functon can be formulated as a soluton to k-way mn-cut hypergraph parttonng problem. One hypergraph-based method s the meta-clusterng algorthm (MCLA, whch also uses hyperedge collapsng operatons to determne soft cluster membershp values for each obect. Hypergraph methods seem to work best for nearly balanced clusters. A dfferent consensus functon has been developed n (Topchy, Jan, and Punch 003 based on nformatontheoretc prncples. An elegant soluton can be obtaned from a generalzed defnton of MI, namely Quadratc MI (QMI, whch can be effectvely maxmzed by the k-means algorthm n the space of specally transformed cluster labels of the gven ensemble. However, t s senstve to ntalzaton due to the local optmzaton scheme of k-means. In (Dudot and Frdlyand 003; Fscher and Buhmann 003, a combnaton of parttons by re-labelng and votng s mplemented. Ther works pursue drect re-labelng approaches to the correspondence problem. A re-labelng can be done optmally between two clusterngs usng the Hungaran algorthm. After an overall consstent re-labelng, votng can be appled to determne cluster membershp for each obect. However, ths votng method needs a very large number of clusterngs to obtan a relable result. A probablstc model of consensus s offered by (Topchy, Jan, and Punch 005 usng a fnte mxture of multnomal dstrbutons n the space of cluster labels. A combned partton s found as a soluton to the correspondng maxmum lkelhood problem usng the EM algorthm. Snce the EM consensus functon needs to estmate too many parameters, accuracy degradaton wll nevtably occur wth ncreasng number of parttons when sample sze s fxed. To summarze, exstng consensus functons suffer from a number of drawbacks that nclude complexty, heurstc character of obectve functon, and uncertan statstcal status of the consensus soluton. Ths paper ust ams to overcome these drawbacks through developng a fast smulated annealng framework for combnng multple clusterngs based on those measures for comparng clusterngs. Measures for Comparng Clusterngs Ths secton frst presents the basc notatons for comparng two clusterngs, and then ntroduces three measures of agreement between parttons whch wll be used for combnng multple clusterngs n the rest of the paper. Notatons and Problem Statement Let λ a and λ b be two clusterngs of the sample data set X = {x t } n t=, wth k a and k b groups respectvely. To compare these two clusterngs, we have to frst gve a quanttatve measure of agreement between them. In the case of evaluatng a clusterng algorthm, t means that we have to show how close the obtaned clusterng s to a ground truth clusterng. Snce these measures wll further be used as obectve functons of clusterng ensemble, t s mportant that we can update them ncrementally for sngle label change. The computaton of the new obectve functon n ths way can lead to much less computatonal cost. Hence, we focus on these measures whch can be specfed as: S(λ a,λ b =f({n a } ka =, {nb } k b =, {n }, ( where n a s the number of obects n cluster C accordng to λ a, n b s the number of obects n cluster C accordng to λ b, and n denotes the number of obects that are n cluster C accordng to λ a as well as n group C accordng to λ b. When an obect (whch s n C accordng to λ b moves from cluster C to cluster C accordng to λ a, only the followng updates arse for ths sngle label change: ˆn a = n a, ˆn a = na +, ( ˆn = n, ˆn = n +. (3 Accordng to (, S(λ a,λ b may then be updated ncrementally. Though many measures for comparng clusterngs can be represented as (, we wll focus on one specal type of measures based on the relatonshp (oned or separated of pars of obects such as Rand ndex, Jaccard ndex, and Wallace ndex n the followng. The comparson of parttons for ths type of measures s ust based on the pars of obects of X. Two parttons λ a and λ b agree on a par of obects x and x f these obects are smultaneously oned or separated n them. On the other hand, there s a dsagreement f x and x are oned n one of them and separated n the other. Let n A be the number of pars smultaneously oned together, n B the number of pars oned n λ a and separated n λ b, n C the number of pars separated n λ a and oned n λ b, and n D the number of pars smultaneously separated. Accordng to (Hubert and Arabe 985, we have n A =,, nb = a na, b and n C = n D = na n B n C. na. Moreover, we can easly obtan Rand Index Rand ndex s a popular nonparametrc measure n statstcs lterature and works by countng pars of obects that have compatble label relatonshps n the two clusterngs to be compared. More formally, the Rand ndex (Rand 97 can be computed as the rato of the number of pars of obects havng the same label relatonshp n λ a and λ b as: ( n R(λ a,λ b =(n A + n D /, (4 where n A + n D = +, a b. 666
3 A problem wth the Rand ndex s that the expected value of the Rand ndex of two random parttons does not take a constant value. The corrected Rand ndex proposed by (Hubert and Arabe 985 assumes the generalzed hypergeometrc dstrbuton as the model of randomness,.e., the two parttons λ a and λ b are pcked at random such that the number of obects n the clusters are fxed. Under ths model, the corrected Rand ndex can be gven as: CR(λ a,λ b =, h a h b /, (5 (ha + h b h a h b / where h a = a and h b = b. In the followng, we actually use ths verson of Rand ndex for combnng multple clusterngs. Jaccard Index In the Rand ndex, the pars smultaneously oned or separated are counted n the same way. However, parttons are often nterpreted as classes of oned obects, the separatons beng the consequences of ths clusterng. We then use the Jaccard ndex (Denoeud and Guénoche 006, noted J, whch does not consder the n D smultaneous separatons: J(λ a,λ b = n A nd =, h a + h b,, (6 where nd = n A + n B + n C = h a + h b n A. Wallace Index Ths ndex s very natural, and t s the number of oned pars common to two parttons λ a and λ b dvded by the number of possble pars (Wallace 983: W (λ a,λ b = n A ha h b =, ha h. (7 b Ths last quantty depends on the partton of reference and, f we do not want to favor nether λ a nor λ b, the geometrcal average s used. The Proposed Framework The above measures of agreement between parttons for comparng clusterngs are further used as obectve functons of clusterng ensemble. In ths secton, we frst gve detals about the clusterng ensemble problem, and then present a fast smulated annealng framework for combnng multple clusterngs that operates through sngle label changes to optmze these measure-based obectve functons. The Clusterng Ensemble Problem Gven a set of r parttons Λ={λ q q =,..., r}, wth the q-th partton λ q havng k q clusters, the consensus functon Γ for combnng multple clusterngs can be defned ust as (Strehl and Ghosh 00: Γ:Λ λ, N n r N n, (8 whch maps a set of clusterngs to an ntegrated clusterng. If there s no pror nformaton about the relatve mportance of the ndvdual groupngs, then a reasonable goal for the consensus answer s to seek a clusterng that shares the most nformaton wth the orgnal clusterngs. More precsely, based on the measure of agreement (.e. shared nformaton between parttons, we can now defne a measure between a set of r parttons Λ and a sngle partton λ as the average shared nformaton: S(λ, Λ = r S(λ, λ q. (9 r q= Hence, the problem of clusterng ensemble s ust to fnd a consensus partton λ of the data set X that maxmzes the obectve functon S(λ, Λ from the gathered parttons Λ: λ =argmax λ r r S(λ, λ q. (0 q= The desred number of clusters k n the consensus clusterng λ deserves a separate dscusson that s beyond the scope of ths paper. Here, we smply assume that the target number of clusters s predetermned for the consensus clusterng. More detals about ths model selecton problem can be found n (Fgueredo and Jan 00. To update the obectve functon of clusterng ensemble ncrementally, we have to consder those measures whch take the form of (. Though many measures for comparng clusterngs can be represented as (, we wll focus on one specal type of measures based on the relatonshp (oned or separated of pars of obects n the followng. Actually, only three measures,.e. the Rand ndex, Jaccard ndex, and Wallace ndex, are used as the obecton functons of clusterng ensemble. Moreover, to resolve the local convergence problem of the greedy optmzaton strategy, we further take nto account the smulated annealng scheme. Note that our clusterng ensemble algorthms developed n the followng can be modfed slghtly when other types of measures specfed as ( are used as obectve functons. Hence, we have actually presented a smulated annealng framework for combnng multple clusterngs. Clusterng Ensemble va Smulated Annealng Gven a set of r parttons Λ={λ q q =,..., r}, the obectve functon of clusterng ensemble can ust be set as the measure between a sngle partton λ and Λ n (9. The measure S(λ, λ q between λ and λ q can be Rand ndex, Jaccard ndex, or Wallace ndex. Accordng to (5 (7, we can set S(λ, λ q as any of the followng three measures: S(λ, λ q h q 0 = h h q /( n (h + h q h h q /, ( S(λ, λ q = h q 0 /(h + h q hq 0, ( S(λ, λ q = h q 0 h / h q, (3 where h q 0 = q, h =, and h q = q., Here, the frequency counts are denoted a lttle dfferently 667
4 from (: n s the number of obects n cluster C accordng to λ, n q s the number of obects n cluster C accordng to λ q, and n q s the number of obects that are n cluster C accordng to λ and n cluster C accordng to λ q. Note that the correspondng algorthms based on these three measures whch follow the smulated annealng optmzaton scheme are denoted as SA-RI, SA-JI, and SA-WI, respectvely. To fnd the consensus partton from the multple clusterngs Λ, we can maxmze the obectve functon S(λ, Λ by sngle label change. That s, we randomly select an obect x t from the data set X = {x t } n t=, and then change the label of t λ(x t = to another randomly selected label accordng to λ,.e., move t from the current cluster C to another cluster C. Such sngle label change only leads to the followng updates: ˆn = n, ˆn = n +, (4 ˆn q = nq, ˆnq = nq +, (5 where = λ q (x t (q =,..., r. For each λ q Λ, to update S(λ, λ q, we can frst calculate h and h q 0 ncrementally: ĥ = h + n n +, (6 ĥ q 0 = h q 0 + nq nq +. (7 Note that h q keeps fxed for each label change. Hence, we can obtan the new Ŝ(λ, λq accordng to ( (3, and the new obectve functon Ŝ(λ, Λ s ust the mean of {Ŝ(λ, λq } r q=. Here, t s worth pontng out that the update of the obectve functon has only lnear tme complexty O(r for sngle label change, whch makes sure that the smulated annealng scheme s computatonally feasble for the maxmum of S(λ, Λ. We further take nto account a smplfed smulated annealng scheme to determne whether to select the sngle label change λ(x t :. At a temperature T, the probablty of selectng the sngle label change λ(x t : can be calculated as follows: { P (λ(x t : f ΔS >0 = e ΔS T otherwse, (8 where ΔS = Ŝ(λ, Λ S(λ, Λ. We actually select the sngle label change f P (λ(x t : s hgher than a threshold P 0 (0 <P 0 < ; otherwse, we wll dscard t and begn to try the next sngle label change. The complete descrpton of our smulated annealng framework for clusterng ensemble s fnally summarzed n Table. The tme complexty s O(nk r. Expermental Results The experments are conducted wth artfcal and real-lfe data sets, where true natural clusters are known, to valdate both accuracy and robustness of consensus va our smulated annealng framework. We also explore the data sets usng seven dfferent consensus functons. Table : Clusterng Ensemble va Smulated Annealng Input:. A set of r parttons Λ={λ q q =,..., r}. The desred number of clusters k 3. The threshold for selectng label change P 0 4. The coolng rato c (0 <c< Output: The consensus clusterng λ Process:. Select a canddate clusterng λ by some combnaton methods, and set the temperature T = T 0.. Start a loop wth all obects set unvsted (v(t = 0, t =,..., n. Randomly select an unvsted obect x t from X, and change the label λ(x t to the other k labels. If a label change s selected accordng to (8, we mmedately set v(t = and try a new unvsted obect. If there s no label change for x t,wealsosetv(t =and go to a new obect. The loop s stopped untl all obects are vsted. 3. Set T = c T, and go to step. If there s no label change durng two successve loops, stop the algorthm and output λ = λ. Data Sets The detals of the four data sets used n the experments are summarzed n Table. Two artfcal data sets, -sprals and half-rngs, are shown n Fgure, whch are dffcult for any centrod based clusterng algorthms. We also use two real-lfe data sets, rs and wne data, from UCI benchmark repostory. Snce the last feature of wne data s far larger than the others, we frst regularze them nto an nterval of [0, 0]. Note that the other three data sets keep unchanged. Table : Detals of the four data sets. The average clusterng error s obtaned by the k-means algorthm. Data sets #features k n Avg. error (% -sprals half-rngs rs wne The average clusterng errors by the k-means algorthm for 0 ndependent runs on the four data sets are lsted n Table, whch are consdered as baselnes for those consensus functons. As for the regularzaton of wne data, the average error by the k-means algorthm can be decreased from 36.3% to 8.4% for 0 ndependent runs. Here, we evaluate the performance of a clusterng algorthm by matchng the detected and the known parttons of the data sets ust as (Topchy, Jan, and Punch 005. The best possble matchng of clusters provdes a measure of perfor- 668
5 (a Fgure : Two artfcal data sets dffcult for any centrod based clusterng algorthms: (a -sprals; (b half-rngs. (b Table 3: Average error rate (% on the -sprals data set. The k-means algorthm randomly selects k [4, 7] to generate r parttons for dfferent combnaton methods mance expressed as the msassgnment rate. To determne the clusterng error, one needs to solve the correspondence problem between the labels of known and derved clusters. The optmal correspondence can be obtaned usng the Hungaran method for mnmal weght bpartte matchng problem wth O(k 3 complexty for k clusters. Selecton of Parameters and Algorthms To mplement our smulated annealng framework for clusterng ensemble, we have to select two mportant parameters,.e., the threshold P 0 for selectng label change and the coolng rato c (0 <c<. When the coolng rato c takes a larger value, we may obtan a better soluton but the algorthm may converge slower. Meanwhle, when the threshold P 0 s larger, the algorthm may converge faster but the local optma may be avoded at a lower probablty. To acheve a tradeoff between the clusterng accuracy and speed, we smply set P 0 =0.85 and c =0.99 n all the experments. Moreover, the temperature T s ntalzed by T =0.S 0 where S 0 s the ntal value of obectve functon. Our three smulated annealng methods (.e. SA-RI, SA- JI, and SA-WI for clusterng combnaton are also compared to four other consensus functons:. k-modes algorthm for consensus clusterng n ths paper, whch s orgnally developed to make categorcal clusterng (Huang EM algorthm for consensus clusterng va the mxture model (Topchy, Jan, and Punch QMI approach descrbed n (Topchy, Jan, and Punch 003, whch s actually mplemented by the k-means algorthm n the space of specally transformed cluster labels of the gven ensemble. 4. MCLA whch s a hypergraph method ntroduced n (Strehl and Ghosh 00. Note that our methods are ntalzed by k-modes ust because ths algorthm runs very fast, and other consensus functons can be used as ntalzatons smlarly. Snce the co-assocaton methods have O(n complexty and may lead to severe computatonal lmtatons, our methods are not compared to these algorthms. The performance of the co-assocaton methods has been already analyzed n (Topchy, Jan, and Punch 003. The code s avalable at Table 4: Average error rate (% on the half-rngs data set. The k-means algorthm randomly selects k [3, 5] to generate r parttons for dfferent combnaton methods The k-means algorthm s used as a method of generatng the parttons for the combnaton. Dversty of the parttons s ensured by: ( ntalzng the algorthm randomly; ( selectng the number of clusters k randomly. In the experments, we actually gve k a random value around the number of true natural clusters k (k k. We have found that ths method of generatng parttons leads to better results than that only by random ntalzaton. Moreover, we vary the number of combned clusterngs r n the range [0, 50]. Comparson wth Other Consensus Functons Only man results for each of the four data sets are presented n Tables 3 6 due to space lmtatons. Actually, we have ntalzed our smulated annealng methods by other consensus functons besdes k-modes, and some smlar results can be obtaned. Here, the tables report the average error rate (% of clusterng combnaton from 0 ndependent runs. Frst observaton s that our smulated annealng methods (especally SA-RI perform generally better than other consensus functons. Snce our methods only lead to slghtly hgher clusterng errors n a few cases as compared wth MCLA, we can thnk our methods preferred by overall eval- Table 5: Average error rate (% on the rs data set. The k- means algorthm randomly selects k [3, 5] to generate r parttons for dfferent combnaton methods
6 Table 6: Average error rate (% on the wne data set. The k-means algorthm randomly selects k [4, 6] to generate r parttons for dfferent combnaton methods Corrected Rand Index Number of Loops Number of Loops (a (b Fgure : The ascent of corrected Rand ndex on two reallfe data sets (only SA-RI consdered: (a rs; (b wne. uaton. Among our three methods, SA-RI performs the best generally. All co-assocaton methods are usually unrelable wth r<50 and ths s where our methods are postoned. The k-modes, EM, and QMI consensus functons all have the local convergence problem. Snce our methods are ust ntalzed by k-modes, we can fnd that local optma are successfully avoded due to the smulated annealng optmzaton scheme. Fgure further shows the ascent of corrected Rand ndex on two real-lfe data sets (only SA-RI wth r =30consdered durng optmzaton. Moreover, t s also nterestng to note that, as expected, the average error of consensus clusterng by our smulated annealng methods s lower than average error of the k- means clusterngs n the ensemble (Table when k s chosen to be equal to the true number of clusters k. Fnally, the average tme taken by our three methods (Matlab code s less than 30 seconds per run on a GHz PC n all cases. As reported n (Strehl and Ghosh 00, experments wth n = 400, k =0, r =8average one hour usng the greedy algorthm based on normalzed MI (smlar to our methods. However, our methods only take about 0 seconds n ths case,.e., our methods are computatonally feasble n spte of the costly annealng procedure. Corrected Rand Index Conclusons We have proposed a fast smulated annealng framework for combnng multple clusterngs based on some measures for comparng clusterngs. When the obectve functons of clusterng ensemble are specfed as those measures based on the relatonshp of pars of obects n the data set, we can then update them ncrementally for each sngle label change, whch makes sure that the proposed smulated annealng optmzaton scheme s computatonally feasble. The smulaton and real-lfe experments then demonstrate that the proposed framework can acheve superor results. Snce clusterng ensemble s actually equvalent to categorcal clusterng, our methods wll further be evaluated n ths applcaton n the future work. Acknowledgements Ths work was fully supported by the Natonal Natural Scence Foundaton of Chna under Grant No , the Beng Natural Scence Foundaton of Chna under Grant No , and the Program for New Century Excellent Talents n Unversty under Grant No. NCET References Denoeud, L., and Guénoche, A Comparson of dstance ndces between parttons. In Proceedngs of the IFCS 006: Data Scence and Classfcaton, 8. Dudot, S., and Frdlyand, J Baggng to mprove the accuracy of a clusterng procedure. Bonformatcs 9(9: Fgueredo, M. A. T., and Jan, A. K. 00. Unsupervsed learnng of fnte mxture models. IEEE Trans. on Pattern Analyss and Machne Intellgence 4(3: Fscher, R. B., and Buhmann, J. M Path-based clusterng for groupng of smooth curves and texture segmentaton. IEEE Trans. on Pattern Analyss and Machne Intellgence 5(4: Fred, A. L. N., and Jan, A. K Combnng multple clusterngs usng evdence accumulaton. IEEE Trans. on Pattern Analyss and Machne Intellgence 7(6: Huang, Z Extensons to the k-means algorthm for clusterng large data sets wth categorcal values. Data Mnng and Knowledge Dscovery : Hubert, L., and Arabe, P Comparng parttons. Journal of Classfcaton :93 8. Rand, W. M. 97. Obectve crtera for the evaluaton of clusterng methods. Journal of the Amercan Statstcal Assocaton 66: Strehl, A., and Ghosh, J. 00. Cluster ensembles - a knowledge reuse framework for combnng parttonngs. In Proceedngs of Conference on Artfcal Intellgence (AAAI, Topchy, A.; Jan, A. K.; and Punch, W Combnng multple weak clusterngs. In Proceedngs of IEEE Internatonal Conference on Data Mnng, Topchy, A.; Jan, A. K.; and Punch, W Clusterng ensembles: models of consensus and weak parttons. IEEE Trans. on Pattern Analyss and Machne Intellgence 7(: Unnkrshnan, R.; Pantofaru, C.; and Hebert, M Toward obectve evaluaton of mage segmentaton algorthms. IEEE Trans. on Pattern Analyss and Machne Intellgence 9(6: Wallace, D. L Comment on a method for comparng two herarchcal clusterngs. Journal of the Amercan Statstcal Assocaton 78:
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 informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More 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 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 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 informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More 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 informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationDetermining Fuzzy Sets for Quantitative Attributes in Data Mining Problems
Determnng Fuzzy Sets for Quanttatve Attrbutes n Data Mnng Problems ATTILA GYENESEI Turku Centre for Computer Scence (TUCS) Unversty of Turku, Department of Computer Scence Lemmnkäsenkatu 4A, FIN-5 Turku
More 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 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 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 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 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 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 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 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 informationClustering Algorithm Combining CPSO with K-Means Chunqin Gu 1, a, Qian Tao 2, b
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) Clusterng Algorthm Combnng CPSO wth K-Means Chunqn Gu, a, Qan Tao, b Department of Informaton Scence, Zhongka
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 informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationA new selection strategy for selective cluster ensemble based on Diversity and Independency
A new selecton strategy for selectve cluster ensemble based on Dversty and Independency Muhammad Yousefnezhad a, Al Rehanan b, Daoqang Zhang a and Behrouz Mnae-Bdgol c a Department of Computer Scence,
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More 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 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 informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More 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 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 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 informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
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 informationIncremental Learning with Support Vector Machines and Fuzzy Set Theory
The 25th Workshop on Combnatoral Mathematcs and Computaton Theory Incremental Learnng wth Support Vector Machnes and Fuzzy Set Theory Yu-Mng Chuang 1 and Cha-Hwa Ln 2* 1 Department of Computer Scence and
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 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 informationEVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS
Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationA Simple Methodology for Database Clustering. Hao Tang 12 Guangdong University of Technology, Guangdong, , China
for Database Clusterng Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal: 6085@qq.com Me Zhang Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal:64605455@qq.com Database clusterng
More 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 informationBAYESIAN 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 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 informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More informationOptimizing 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 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 informationA Combined Approach for Mining Fuzzy Frequent Itemset
A Combned Approach for Mnng Fuzzy Frequent Itemset R. Prabamaneswar Department of Computer Scence Govndammal Adtanar College for Women Truchendur 628 215 ABSTRACT Frequent Itemset Mnng s an mportant approach
More informationEXTENDED BIC CRITERION FOR MODEL SELECTION
IDIAP RESEARCH REPORT EXTEDED BIC CRITERIO FOR ODEL SELECTIO Itshak Lapdot Andrew orrs IDIAP-RR-0-4 Dalle olle Insttute for Perceptual Artfcal Intellgence P.O.Box 59 artgny Valas Swtzerland phone +4 7
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 informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationA 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 informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More 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 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 informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More informationLearning from Multiple Related Data Streams with Asynchronous Flowing Speeds
Learnng from Multple Related Data Streams wth Asynchronous Flowng Speeds Zh Qao, Peng Zhang, Jng He, Jnghua Yan, L Guo Insttute of Computng Technology, Chnese Academy of Scences, Bejng, 100190, Chna. School
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More 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 informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationEECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science
EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty
More informationA 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 informationIntelligent Information Acquisition for Improved Clustering
Intellgent Informaton Acquston for Improved Clusterng Duy Vu Unversty of Texas at Austn duyvu@cs.utexas.edu Mkhal Blenko Mcrosoft Research mblenko@mcrosoft.com Prem Melvlle IBM T.J. Watson Research Center
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More 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 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 informationTPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints
TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More 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 informationComparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,
More informationA 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 information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationCHAPTER 2 DECOMPOSITION OF GRAPHS
CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More 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 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 informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
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 5417 Information Retrieval Systems Jim Martin!
CSCI 5417 Informaton Retreval Systems Jm Martn! Lecture 11 9/29/2011 Today 9/29 Classfcaton Naïve Bayes classfcaton Ungram LM 1 Where we are... Bascs of ad hoc retreval Indexng Term weghtng/scorng Cosne
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 informationFuzzy 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 informationLife Tables (Times) Summary. Sample StatFolio: lifetable times.sgp
Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationJournal of Chemical and Pharmaceutical Research, 2014, 6(6): Research Article
Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(6):2512-2520 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 Communty detecton model based on ncremental EM clusterng
More informationParameter estimation for incomplete bivariate longitudinal data in clinical trials
Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationRelevance Assignment and Fusion of Multiple Learning Methods Applied to Remote Sensing Image Analysis
Assgnment and Fuson of Multple Learnng Methods Appled to Remote Sensng Image Analyss Peter Bajcsy, We-Wen Feng and Praveen Kumar Natonal Center for Supercomputng Applcaton (NCSA), Unversty of Illnos at
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 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 informationEfficient Segmentation and Classification of Remote Sensing Image Using Local Self Similarity
ISSN(Onlne): 2320-9801 ISSN (Prnt): 2320-9798 Internatonal Journal of Innovatve Research n Computer and Communcaton Engneerng (An ISO 3297: 2007 Certfed Organzaton) Vol.2, Specal Issue 1, March 2014 Proceedngs
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 informationMulti-objective Virtual Machine Placement for Load Balancing
Mult-obectve Vrtual Machne Placement for Load Balancng Feng FANG and Bn-Bn Qu,a School of Computer Scence & Technology, Huazhong Unversty Of Scence And Technology, Wuhan, Chna Abstract. The vrtual machne
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 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 informationBOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET
1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School
More informationA 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 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 informationAPPLICATION 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 informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationTOWARDS FUZZY-HARD CLUSTERING MAPPING PROCESSES. MINYAR SASSI National Engineering School of Tunis BP. 37, Le Belvédère, 1002 Tunis, Tunisia
TOWARDS FUZZY-HARD CLUSTERING MAPPING PROCESSES MINYAR SASSI Natonal Engneerng School of Tuns BP. 37, Le Belvédère, 00 Tuns, Tunsa Although the valdaton step can appear crucal n the case of clusterng adoptng
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 informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More information