Image Feature Selection Based on Ant Colony Optimization
|
|
- Dennis Blake
- 5 years ago
- Views:
Transcription
1 Image Feature Selecton Based on Ant Colony Optmzaton Lng Chen,2, Bolun Chen, Yxn Chen 3, Department of Computer Scence, Yangzhou Unversty,Yangzhou, Chna 2 State Key Lab of Novel Software Tech, Nanng Unversty, Nanng, Chna 3 Department of Computer Scence, Washngton Unversty n St Lous, USA lchen@yzu.edu.cn,chenbolun986@gmal.com,chen@cse.wustl.edu Abstract. Image feature selecton (FS) s an mportant tas whch can affect the performance of mage classfcaton and recognton. In ths paper, we present a feature selecton algorthm based on ant colony optmzaton (ACO). For n features, most ACO-based feature selecton methods use a complete graph wth O(n 2 ) edges. However, the artfcal ants n the proposed algorthm traverse on a dgraph wth only 2n arcs. The algorthm adopts classfer performance and the number of the selected features as heurstc nformaton, and selects the optmal feature subset n terms of feature set sze and classfcaton performance. Expermental results on varous mages show that our algorthm can obtan better classfcaton accuracy wth a smaller feature set comparng to other algorthms. Keywords: ant colony optmzaton; dmensonalty reducton; feature selecton; mage classfcaton Introducton Reducton of pattern dmensonalty va feature extracton s one of the most mportant tass for pattern recognton and classfcaton. Feature selecton has consderable mportance n areas such as bonformatcs[], sgnal processng[2], mage processng[3], text categorzaton [4], data mnng[5], pattern recognton [6], medcal dagnoss [7], remote sensor mage recognton [8]. The goal of feature selecton s to choose a subset of avalable features by elmnatng unnecessary features. To extract as much nformaton as possble from a gven mage set whle usng the smallest number of features, we should elmnate the features wth lttle or no predctve nformaton, and gnore the redundant features that are strongly correlated. Many feature selecton algorthms nvolve heurstc or random search strateges n order to reduce the computng tme. For a large number of features, heurstc search s often used to fnd the best subset of features. However, accuracy of the classfcaton results by the fnal feature subset s often decreased [6]. More recently, nature nspred algorthms are used for feature selecton. Populaton-based optmzaton algorthms for feature selecton such as genetc algorthm (GA) [3,9], ant colony optmzaton (ACO) [,4], partcle swarm optmzaton (PSO) [0] have been proposed. These
2 methods are stochastc optmzaton technques attemptng to acheve better solutons by referencng the feedbac and heurstc nformaton. Ant colony optmzaton (ACO) s an evoluton smulaton algorthm proposed by M. Dorgo et al. []. It has been successfully used for system fault detectng, obshop schedulng, networ load balancng, graph colorng, robotcs and other combnatonal optmzaton problems. In ths paper, we present an ACO-based feature selecton algorthm, ACOFS, to reduce the memory requrement and computaton tme. In ths algorthm, the artfcal ants traverse on a dgraph wth only 2n arcs. The algorthm adopts classfer performance and the number of the selected features as heurstc nformaton, and selects the optmal feature subset n terms of the feature set sze and classfer performance. Expermental results on mage data sets show that the proposed algorthm has superor performance. Comparng wth other exstng algorthms, our algorthm can obtan better classfcaton accuracy wth a smaller feature set from mages. 2 The ACO Algorthm for Image Feature Selecton Gven a feature set of sze n, the feature selecton problem s to fnd a mnmal feature subset of sze s (s< n) whle mantanng a farly hgh classfcaton accuracy n representng the orgnal features. Most of the ACO based algorthms for feature selectng uses a complete graph, on whch the ants try to construct a path wth part of the nodes. Snce the a soluton of feature selecton s a subset of those selected features, there s not any orderng among the components of the soluton. It s not necessary to use a path n a complete graph to represent such soluton. In the ACO on such complete graph, ant on one node (feature) selects an edge connectng another node (feature) based on the pheromone and heurstc nformaton assgned on ths edge between the two nodes (features). But n the feature selecton problem, one feature to be selected s ndependent wth the last feature added to the partal soluton. Therefore, t unnecessary to use a complete graph wth O(n 2 ) edges n the ACO algorthm. To effcently apply an ACO algorthm for feature selecton, we must redefne the way that the representaton graph s used. We proposed ant optmzaton algorthm on a dscrete search space represented by a dgraph wth only O(n) arcs as shown n Fgure, where the nodes represent features, and the arcs connectng two adacent nodes ndcatng the choce of the next feature. Fg.. The dgraph. Denote the n features as f,f 2,,f n, the th node v s used to represent feature f. An addtonal node v 0 s placed at the begnnng of the graph where each ant starts ts
3 search. As shown n Fgure, the ants travel on the dgraph from v 0 to v, and then to v 2, and so on. The ant termnates ts tour and outputs ths feature subset as t reaches the last node v n. When an ant completes the search from v 0 to v n, the arcs on ts trace form a soluton. 0 There are two arcs named C and C lnng two adacent nodes v - and v. If an artfcal ant at v selects arc C (or C ), the th feature s selected (or not 0 selected). On each arc C, vrtual pheromone value s assgned as the feedbac nformaton to drect the ants searchng on the graph. We ntalze pheromone matrx as = for all =,2,,n and =0,. The search for the optmal feature subset s the procedure of the ants traverse through the graph. Suppose an ant s currently at node v - and has to choose one path connectng v to pass through. A probablstc functon of transton, denotng the probablty of an ant at node v - to choose the path c to reach v s desgned by combnng the heurstc desrablty and pheromone densty of the arc. The probablty of an ant at node v - to choose the arc c at tme t s: p ( t) 0 0 [ ( )] ( ) [ ( )] ( t t ) [ ( t)] ( ) (=,2,,n; =0,) () Here, (t) s the pheromone on the arc whch reflects the potental tend for ants to follow arc c between nodes v - and v at tme t, c (=0,). s the heurstc nformaton reflectng the desrablty of choosng arc c. α and β are two parameters that determne the relatve mportance of the pheromone and the heurstc nformaton. From () we can see that the transton probablty used by ACO depends on the pheromone ntensty (t) and heurstc nformaton.to effectvely balance the nfluences of postve feedbac nformaton from prevous hgh-qualty solutons and the desrablty of the arc, we should chose proper values of the parameters α and β. When α= 0, no postve feedbac nformaton s used. Snce the prevous search experence s lost, the search degrades to a stochastc greedy search. When β=0, the potental beneft of arcs s neglected, and t becomes a entrely random search. The heurstc nformaton s the desrablty of choosng the arc c between nodes v- and v, whch means the preference of ant to choose the feature f.there are many ways to defne a sutable value of. It could be any evaluaton functon on the dscrmnaton ablty of a feature f,such as rough set dependency measure, or entropy-based measure. We set the value of usng F-score, whch s a easy measurement to evaluate the dscrmnaton ablty of feature f, defned as follows:
4 m m N x N x x x 2 (,..., n) (2) Here, m s the number of classes of the mage set; n s the number of features; N s the number of samples of the feature f n class, ( =,2,,m, =,2,,n), x s the th tranng sample for the x s the mean value of the feature f of all mages, feature f of the mages n class, (=,2,, N ), x s the mean of the feature f of the mages n class. In (2), the numerator ndcates the dscrmnaton between the classes of the mage set, and the denomnator specfes the dscrmnaton wthn each class. A larger value mples that the feature f has a greater dscrmnatve ablty. 0 For the value of, we smply set n, where ξ (0,) s a constant. 0 n 3 Implementaton of the Algorthm In an ACO based optmzaton method, the desgn of the pheromone update strategy, and the measurement of the qualty of the solutons are crtcal. 3. Pheromone updatng In each teraton, the algorthm ACOFS updates the pheromone value on each arc accordng to the pheromone and heurstc nformaton on the arc. Obvously, f an ant chooses the arc c, pheromone on ths arc should be assgned more ncrement, and ants should select arc c wth hgher probablty n the next teraton. Ths forms a postve feedbac of the pheromone system. In each teraton, the pheromone on each arc s updated accordng to formulas (3),(4) and (5). where ( t ) ( t) ( t) Q ( t) (3)
5 t ( ) f ( s S ) (4) s S and Q c sbest Q ( t) (5) 0 otherwse In (4), s s the set of solutons generated at the t-th teraton passng through c. In (5), S best s the best soluton found so far, and Q s a postve constant. To emphasze the nfluence of the best-so-far soluton, we add an extra pheromone ncrement on the arcs ncluded n S best. 3.2 The ftness functon Based on the ant s soluton, whch s a selected feature subset, the soluton qualty n terms of classfcaton accuracy s evaluated by classfyng the tranng data sets usng the selected features. The test accuracy measures the number of examples that are correctly classfed. In addton, the number of features n the set s also consdered n the qualty functon. The subset wth less features could get hgher qualty functon value. The qualty functon f(s) of a soluton s s defned as follows: f N N corr ( s) (6) feat where N corr the number of examples that are correctly classfed, N feat s the number of features selected n s, λ s a constant to adust the mportance of the accuracy and the number of features selected. The scheme obtanng hgher accuracy and wth less features wll get greater qualty functon value. 4 Expermental Results To test the effectveness and performance of our proposed feature selecton algorthm ACOFS, we test t by a seres of experments. All experments have been run on Pentum IV, Wndows XP, P.7G, usng VC , and the results are vsualzed on Matlab 6.0. A set of mages was tested to demonstrate the classfcatory accuracy and determne whether the proposed algorthm can correctly select the relevant features. The data set contans 80 mages n 4 classes. The data set has 9 features ncludng frst and second order orgn moment, frst and second order central moment, twst
6 degree, pea values, entropy of the moments, and the statstcal of the gray dfferental statstcs, such as contrast, angle second-order moment (ASM), mean value, entropy etc. On the mage set, the ACFS algorthm s appled to select the relevant features and s compared to GA-based approach GAs [2] and the modfed ACO algorthm for feature selecton presented n [26] whch s denoted as maco. For GA-based feature selector GAs, we set the length of chromosomes as the number of features. In a chromosome, each gene g corresponds to the th feature. If g =, ths means we select the th feature. Otherwse, g = 0, whch means the th feature s gnored. By teratons of producng chromosomes for the new generaton, crossover and mutaton, the algorthm tres to fnd a chromosome wth the smallest number of s and the classfer accuracy s maxmzed. In order to select the ndvduals for the next generaton, GA s roulette wheel selecton method was used. We set the parameters of GAs as: probabltes of crossover and mutaton are P croos =0.9 and P mutaton =0.25, the populaton sze s m=50, and the maxmum teratons = 50. For ACO-based algorthms ACOFS and maco, we have appled them wth the same populaton sze as GA based algorthm GAs. Varous parameters leadng to a better convergence are tested and the best parameters that are obtaned by smulatons are as follows: α=, β=0.5, evaporaton rate ρ =0.95, the ntal pheromone ntensty of each arc s equal to, the number of ant n each teraton m = 50 and the maxmum teratons = 50. These values are chosen to ustfy the comparson wth GAs. For each subset of the features obtaned, ts qualty s measured by classfyng the tranng mage sets usng SVM classfer. The number of the selected features and the qualty of the classfcaton results are consdered for performance evaluaton. To evaluate the average classfcaton accuracy of the selected feature subsets, 0- fold and 5-fold cross valdaton (CV) s used. For the three algorthms, the CV accuracy on the tranng and testng data of the best-so-far soluton at each teraton are computed and recorded. Table shows the number of features selected n the best soluton obtaned by the three algorthms. From the table we can see that ACOFS selects the smallest number of features whle mantan the hgh accuracy of classfcaton. Table. Number of features selected by the three algorthms Algorthm ACOFS GAs maco 5-fold CV fold CV We measure the qualty of the classfcaton results n two crterons, namely, recall and precson of each class. The average recall and the precson of the classfcaton of the th class are defned as follows: NTP() recall() N () c NTP() precson() N ( ) N ( ) Here, Nc() s the number of mages n the th class, N TP () s the number of mages correctly classfed nto the th class, N FP () s the number of mages ncorrectly classfed nto the th class. FP TP (7)
7 To obtan a more relable result, 0 runs were conducted by 0-fold and 5-fold cross-valdaton wth the mage set. Tables II to V present the average recall on the tranng and testng mage sets by 5-fold and 0-fols CV tests. Table 2. Recall of the results n 5-fold CV on tranng sets 00% 87.5% 93.75% 2 00% 00% 00% 3 00% 87.5% 8.25% % 8.25% 87.5% Average 96.88% 89.06% 90.63% Table 3. Recall of the results n 5-fold CV on testng sets 75% 75% 75% 2 00% 00% 00% 3 00% 00% 00% 4 00% 75% 75% Average 93.75% 87.5%s 87.5% Table 4. Recall of the results n 0-fold CV on tranng sets 00% 00% 94.44% 2 00% 00% 00% % 94.44% 00% % 88.89% 83.33% Average 95.83% 95.83% 94.44% Table 5. Recall of the results n 0-fold CV on testng sets 00% 00% 94.44% 2 00% 00% 00% 3 00% 50% 00% 4 00% 00% 00% Average 00% 87.5% 98.6% Comparng the crteron of recall and the number of features selected, we can see from the tables that proposed ACOFS algorthm outperforms the maco, GAs algorthms. The number of features selected by the ACOFS algorthm s 7 and 9 n the 5-fold and 0-fold CV test respectvely, whle 8 and 0 by the GAs, 0 and 2 by maco. Furthermore, whle usng less features, the ACOFS algorthm gets hgher recall than the maco, GAs algorthms. For nstance, n the 0-fold CV test on the testng data, the average recall of ACOFS s 00%, whle that s 87.5% for GAs and
8 98.6% for maco. Ths means the recall of the results by ACOFS are always better than those of maco, GAs algorthms. Tables VI to IX lst the average precson of the tranng and testng mage sets by 5-fold and 0-fols CV tests. Table 6. Precson of the results n 5-fold CV on tranng sets 88.89% 82.35% 78.95% 2 00% 94.2% 88.89% 3 00% 82.35% 00% 4 00% 00% 00% Average 97.22% 89.7% 9.96% Table 7. Precson of the results n 5-fold CV on testng sets 00% 75% 75% 2 00% 00% 00% 3 80% 80% 00% 4 00% 00% 75% Average 95% 88.75% 87.5% Table 8. Precson of the results n 0-fold CV on tranng sets 85.7% 85.7% 85% 2 00% 00% 00% 3 00% 00% 00% 4 00% 00% 93.75% Average 96.43% 96.43% 94.69% Table 9. Precson of the results n 0-fold CV on testng sets 00% 66.67% 00% 2 00% 00% 00% 3 00% 00% 00% 4 00% 00% 94.74% Average 00% 9.66% 98.69% We can see from the tables that the proposed ACOFS algorthm has better precson than the maco, GAs algorthms. Even usng fewer features, the ACOFS algorthm stll can obtan hgher precson than the maco, GAs algorthms. For nstance, n the 5-fold CV test on the testng sets, the average precson of ACOFS s 95%, whle that s 88.75% for GAs and 87.5% for maco. Ths means the precson of the results by ACOFS are always better than those of algorthms maco and GAs.
9 Percentage Percentage Comparson of the average recall and precson of the three algorthms are dsplayed n Fgure 2 and 3 respectvely. We can conclude from the fgures and tables that the proposed ACOFS algorthm can successfully select subset of features whch can obtan hgh classfcaton accuracy. Compared wth algorthms GAs and maco n the tests usng the same mage set, ACOFS can obtan better classfcaton accuracy but had a smaller feature set. ACOFS maco GAs Tranng accuracy Classfcaton accuracy Fg. 2. Comparson of the average recall and precson of the three algorthms n 5-fold CV ACOFS maco GAs Tranng accuracy Classfcaton accuracy Fg. 3. Comparson of the average recall and precson of three algorthms n 0-fold CV 5 Conclusons We proposed an ACO-based feature selectng algorthm ACOFS. The algorthm adopts classfer performance and the number of the selected features as heurstc
10 nformaton, and selects the optmal feature subset n terms of smallest feature number and the best performance of classfer. The expermental results on mage data sets show that the algorthm ACOFS can obtan better classfcaton accuracy but had a smaller feature set than other smlar methods. Acnowledgments. Ths research was supported n part by the Chnese Natonal Natural Scence Foundaton under grant No , and , Natural Scence Foundaton of Jangsu Provnce under contract BK20034, and Natural Scence Foundaton of Educaton Department of Jangsu Provnce under contract 08KJB52002 and 09KJB2003. References. Basr, M. E., Ghasem-Aghaee, N., & Aghdam, M. H. (2008). Usng ant colony optmzaton-based selected features for predctng post-synaptc actvty n protens, EvoBIO, LNCS 4973, Berln, Hedelberg, Italy: Sprnger-Verlag pp.2 23(2008) 2. Yun-Ch Yeh, Wen-June Wang, Che Wun Chou, Feature selecton algorthm for ECG sgnals usng Range-Overlaps Method, Expert Systems wth Applcatons, Volume 37, Issue 4, Aprl 200, Pages ,(200) 3. Janang Lu, Tanzhong Zhao, Yafe Zhang, Feature selecton based-on genetc algorthm for mage annotaton, Knowledge-Based Systems, Volume 2, Issue 8, December 2008, Pages ,(2008) 4. Aghdam, M. H., Ghasem-Aghaee, N., & Basr, M. E. Applcaton of ant colony optmzaton for feature selecton n text categorzaton. In Proc. CEC 2008, Proceedng of the ffth IEEE congress on evolutonary computaton, IEEE Press, Hong Kong,(2008) 5. A decson rule-based method for feature selecton n predctve data mnng, Expert Systems wth Applcatons, Volume 37, Issue, January 200, Pages , Patrca E.N. Lutu, Andres P. Engelbrecht,(200) 6. Jensen, R. Combnng rough and fuzzy sets for feature selecton. PhD thess, Unversty of Ednburgh.(2005) 7. Kemal Polat, Salh Güneş, Medcal decson support system based on artfcal mmune recognton mmune system (AIRS), fuzzy weghted pre-processng and feature selecton, Expert Systems wth Applcatons, Volume 33, Issue 2, August 2007, Pages (2007) 8. Satyanadh Gundmada, Vayan K. Asar, Neehara Gudur, Face recognton n mult-sensor mages based on a novel modular feature selecton technque, Informaton Fuson, Volume, Issue 2, Aprl 200, Pages 24-32,(200) 9. 9 L.S.Olvera, R. Sabourn, F.Bortolozz, C.Y. Suen, A methodology for feature selecton usng mult-obectve genetc algorthms for hand wrtten dgt strng recognton, Internatonal Journal of Pattern Recognton and Artfcal Intellgence 7(6) ,(2003) 0.Wang, X., Yang, J., Teng, X., Xa, W., & Jensen, R. Feature selecton based on rough sets and partcle swarm optmzaton. Pattern Recognton Letters, 28, (2007).Dorgo.M,Brattar.M,Stützle.T,Ant Colony Optmzaton:Artfcal Ants as a Computatonal Intellgence Technque,IEEE Computatonal Intellgence Magazne,();28-29.(2006)
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 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 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 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 informationJournal of Chemical and Pharmaceutical Research, 2014, 6(6): Research Article. A selective ensemble classification method on microarray data
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(6):2860-2866 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A selectve ensemble classfcaton method on mcroarray
More informationNetwork 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 informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationAn 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 informationA Notable Swarm Approach to Evolve Neural Network for Classification in Data Mining
A Notable Swarm Approach to Evolve Neural Network for Classfcaton n Data Mnng Satchdananda Dehur 1, Bjan Bhar Mshra 2 and Sung-Bae Cho 1 1 Soft Computng Laboratory, Department of Computer Scence, Yonse
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 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 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 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 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 informationFast Feature Value Searching for Face Detection
Vol., No. 2 Computer and Informaton Scence Fast Feature Value Searchng for Face Detecton Yunyang Yan Department of Computer Engneerng Huayn Insttute of Technology Hua an 22300, Chna E-mal: areyyyke@63.com
More informationMaximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation
Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn
More 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 informationData Mining: Model Evaluation
Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct
More informationResearch of Neural Network Classifier Based on FCM and PSO for Breast Cancer Classification
Research of Neural Network Classfer Based on FCM and PSO for Breast Cancer Classfcaton Le Zhang 1, Ln Wang 1, Xujewen Wang 2, Keke Lu 2, and Ajth Abraham 3 1 Shandong Provncal Key Laboratory of Network
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationFeature Subset Selection Based on Ant Colony Optimization and. Support Vector Machine
Proceedngs of the 7th WSEAS Int. Conf. on Sgnal Processng, Computatonal Geometry & Artfcal Vson, Athens, Greece, August 24-26, 27 182 Feature Subset Selecton Based on Ant Colony Optmzaton and Support Vector
More informationMulticlass Object Recognition based on Texture Linear Genetic Programming
Multclass Object Recognton based on Texture Lnear Genetc Programmng Gustavo Olague 1, Eva Romero 1 Leonardo Trujllo 1, and Br Bhanu 2 1 CICESE, Km. 107 carretera Tjuana-Ensenada, Mexco, olague@ccese.mx,
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 informationFeature Selection for Target Detection in SAR Images
Feature Selecton for Detecton n SAR Images Br Bhanu, Yngqang Ln and Shqn Wang Center for Research n Intellgent Systems Unversty of Calforna, Rversde, CA 95, USA Abstract A genetc algorthm (GA) approach
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 informationHuman Face Recognition Using Generalized. Kernel Fisher Discriminant
Human Face Recognton Usng Generalzed Kernel Fsher Dscrmnant ng-yu Sun,2 De-Shuang Huang Ln Guo. Insttute of Intellgent Machnes, Chnese Academy of Scences, P.O.ox 30, Hefe, Anhu, Chna. 2. Department of
More informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
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 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 informationRecommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm
Recommended Items Ratng Predcton based on RBF Neural Network Optmzed by PSO Algorthm Chengfang Tan, Cayn Wang, Yuln L and Xx Q Abstract In order to mtgate the data sparsty and cold-start problems of recommendaton
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 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 informationAnt Colony Optimization to Discover the Concealed Pattern in the Recruitment Process of an Industry
N. Svaram et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Ant Colony Optmzaton to Dscover the Concealed Pattern n the Recrutment Process of an Industry N. Svaram Research Scholar,
More informationAN EFFICIENT AND ROBUST GENETIC ALGORITHM APPROACH FOR AUTOMATED MAP LABELING
AN EFFICIENT AND ROBUST GENETIC ALGORITHM APPROACH FOR AUTOMATED MAP LABELING Fan Hong * Lu Kaun 2 Zhang Zuxun Natonal Laboratory of Informaton Engneerng n Surveyng Mappng and Remote Sensng of Wuhan Unversty
More informationEVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS
Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay
More informationThree supervised learning methods on pen digits character recognition dataset
Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru
More informationNGPM -- A NSGA-II Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...
More informationClassifier Ensemble Design using Artificial Bee Colony based Feature Selection
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 3, No 2, May 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 522 Classfer Ensemble Desgn usng Artfcal Bee Colony based Feature Selecton Shunmugaprya
More informationAn Improved Particle Swarm Optimization for Feature Selection
Journal of Bonc Engneerng 8 (20)?????? An Improved Partcle Swarm Optmzaton for Feature Selecton Yuannng Lu,2, Gang Wang,2, Hulng Chen,2, Hao Dong,2, Xaodong Zhu,2, Sujng Wang,2 Abstract. College of Computer
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More informationAnalysis of Particle Swarm Optimization and Genetic Algorithm based on Task Scheduling in Cloud Computing Environment
Analyss of Partcle Swarm Optmzaton and Genetc Algorthm based on Tas Schedulng n Cloud Computng Envronment Frederc Nzanywayngoma School of Computer and Communcaton Engneerng Unversty of Scence and Technology
More informationSimulation 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 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 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 informationFrom Comparing Clusterings to Combining Clusterings
Proceedngs of the Twenty-Thrd AAAI Conference on Artfcal Intellgence (008 From Comparng Clusterngs to Combnng Clusterngs Zhwu Lu and Yuxn Peng and Janguo Xao Insttute of Computer Scence and Technology,
More informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationParameters Optimization of SVM Based on Improved FOA and Its Application in Fault Diagnosis
Parameters Optmzaton of SVM Based on Improved FOA and Its Applcaton n Fault Dagnoss Qantu Zhang1*, Lqng Fang1, Sca Su, Yan Lv1 1 Frst Department, Mechancal Engneerng College, Shjazhuang, Hebe Provnce,
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationCHAPTER 4 OPTIMIZATION TECHNIQUES
48 CHAPTER 4 OPTIMIZATION TECHNIQUES 4.1 INTRODUCTION Unfortunately no sngle optmzaton algorthm exsts that can be appled effcently to all types of problems. The method chosen for any partcular case wll
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationFeature Selection as an Improving Step for Decision Tree Construction
2009 Internatonal Conference on Machne Learnng and Computng IPCSIT vol.3 (2011) (2011) IACSIT Press, Sngapore Feature Selecton as an Improvng Step for Decson Tree Constructon Mahd Esmael 1, Fazekas Gabor
More informationClassifier Swarms for Human Detection in Infrared Imagery
Classfer Swarms for Human Detecton n Infrared Imagery Yur Owechko, Swarup Medasan, and Narayan Srnvasa HRL Laboratores, LLC 3011 Malbu Canyon Road, Malbu, CA 90265 {owechko, smedasan, nsrnvasa}@hrl.com
More informationSURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB
SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB V. Hotař, A. Hotař Techncal Unversty of Lberec, Department of Glass Producng Machnes and Robotcs, Department of Materal
More informationAnt Colony Algorithm for Clustering through of Cliques
Ant Colony Algorthm for Clusterng through of Clques Julo Cesar Ponce Gallegos a, Felpe Padlla Díaz a, Carlos Alberto Ochoa Ortz Zezzatt b, Alejandro Padlla Díaz a, Eunce Esther Ponce de León a y Fatma
More informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More 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 informationA Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines
A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría
More informationPARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/1 KNAPSACK PROBLEM
PARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/ KNAPSACK PROBLEM Josef Schwarz Jří Očenáše Brno Unversty of Technology Faculty of Engneerng and Computer Scence Department of Computer Scence
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 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 informationexpermental results on NRP nstances. Secton V dscusses some related wor and Secton VI concludes ths paper. II. PRELIMINARIES Ths secton gves the defnt
A Hybrd ACO Algorthm for the Next Release Problem He Jang School of Software Dalan Unversty of Technology Dalan 116621, Chna janghe@dlut.edu.cn Jngyuan Zhang School of Software Dalan Unversty of Technology
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 informationConcurrent Apriori Data Mining Algorithms
Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng
More informationAn Efficient Genetic Algorithm Based Approach for the Minimum Graph Bisection Problem
118 An Effcent Genetc Algorthm Based Approach for the Mnmum Graph Bsecton Problem Zh-Qang Chen, Rong-Long WAG and Kozo OKAZAKI Faculty of Engneerng, Unversty of Fuku, Bunkyo 3-9-1,Fuku-sh, Japan 910-8507
More informationExtraction of Fuzzy Rules from Trained Neural Network Using Evolutionary Algorithm *
Extracton of Fuzzy Rules from Traned Neural Network Usng Evolutonary Algorthm * Urszula Markowska-Kaczmar, Wojcech Trelak Wrocław Unversty of Technology, Poland kaczmar@c.pwr.wroc.pl, trelak@c.pwr.wroc.pl
More informationLocal Quaternary Patterns and Feature Local Quaternary Patterns
Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents
More informationExperiments in Text Categorization Using Term Selection by Distance to Transition Point
Experments n Text Categorzaton Usng Term Selecton by Dstance to Transton Pont Edgar Moyotl-Hernández, Héctor Jménez-Salazar Facultad de Cencas de la Computacón, B. Unversdad Autónoma de Puebla, 14 Sur
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 informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More 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 informationMulti-objective Optimization Using Self-adaptive Differential Evolution Algorithm
Mult-objectve Optmzaton Usng Self-adaptve Dfferental Evoluton Algorthm V. L. Huang, S. Z. Zhao, R. Mallpedd and P. N. Suganthan Abstract - In ths paper, we propose a Multobjectve Self-adaptve Dfferental
More informationCorrelative 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 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 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 informationOPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM
Proceedng of the Frst Internatonal Conference on Modelng, Smulaton and Appled Optmzaton, Sharah, U.A.E. February -3, 005 OPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM Had Nobahar
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationSpam Filtering Based on Support Vector Machines with Taguchi Method for Parameter Selection
E-mal Spam Flterng Based on Support Vector Machnes wth Taguch Method for Parameter Selecton We-Chh Hsu, Tsan-Yng Yu E-mal Spam Flterng Based on Support Vector Machnes wth Taguch Method for Parameter Selecton
More informationDiscrete Cosine Transform Optimization in Image Compression Based on Genetic Algorithm
015 8th Internatonal Congress on Image and Sgnal Processng (CISP 015) Dscrete Cosne Transform Optmzaton n Image Compresson Based on Genetc Algorthm LIU Yuan-yuan 1 CHE He-xn 1 College of Communcaton Engneerng,
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More informationGA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks
Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member
More 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 informationBackpropagation: In Search of Performance Parameters
Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,
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 informationStraight Line Detection Based on Particle Swarm Optimization
Sensors & ransducers 013 b IFSA http://www.sensorsportal.com Straght Lne Detecton Based on Partcle Swarm Optmzaton Shengzhou XU, Jun IE College of computer scence, South-Central Unverst for Natonaltes,
More informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
More informationFeature selection for classification using an ant colony system
Bond Unversty epublcatons@bond Informaton Technology papers School of Informaton Technology 12-7-2010 Feature selecton for classfcaton usng an ant colony system Nada Abd-Alsabour Bond Unversty Marcus Randall
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationFace Recognition Based on SVM and 2DPCA
Vol. 4, o. 3, September, 2011 Face Recognton Based on SVM and 2DPCA Tha Hoang Le, Len Bu Faculty of Informaton Technology, HCMC Unversty of Scence Faculty of Informaton Scences and Engneerng, Unversty
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationA GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING
A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING M. Nkravan and M. H. Kashan Department of Electrcal Computer Islamc Azad Unversty, Shahrar Shahreqods
More informationEfficient Text Classification by Weighted Proximal SVM *
Effcent ext Classfcaton by Weghted Proxmal SVM * Dong Zhuang 1, Benyu Zhang, Qang Yang 3, Jun Yan 4, Zheng Chen, Yng Chen 1 1 Computer Scence and Engneerng, Bejng Insttute of echnology, Bejng 100081, Chna
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 informationA Novel Term_Class Relevance Measure for Text Categorization
A Novel Term_Class Relevance Measure for Text Categorzaton D S Guru, Mahamad Suhl Department of Studes n Computer Scence, Unversty of Mysore, Mysore, Inda Abstract: In ths paper, we ntroduce a new measure
More informationDegree-Constrained Minimum Spanning Tree Problem Using Genetic Algorithm
Degree-Constraned Mnmum Spannng Tree Problem Usng Genetc Algorthm Keke Lu, Zhenxang Chen, Ath Abraham *, Wene Cao and Shan Jng Shandong Provncal Key Laboratory of Network Based Intellgent Computng Unversty
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 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 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 information