ÇUKUROVA UNIVERSITY INSTITUTE OF NATURAL AND APPLIED SCIENCES. Dissertation.com
|
|
- Alvin Franklin
- 5 years ago
- Views:
Transcription
1 Predctng the Admsson Decson of a Partcpant to the School of Physcal Educaton and Sports at Çukurova Unversty by Usng Dfferent Machne Learnng Methods Combned wth Feature Selecton Gözde Özsert Yğt Mehmet Fath Akay (advsor) DISSERTATION.COM Irvne, Calforna Boca Raton, Florda
2 Predctng the Admsson Decson of a Partcpant to the School of Physcal Educaton and Sports at Çukurova Unversty by Usng Dfferent Machne Learnng Methods Combned wth Feature Selecton Copyrght 2016 Gözde Özsert Yğt All rghts reserved. No part of ths book may be reproduced or transmtted n any form or by any means, electronc or mechancal, ncludng photocopyng, recordng, or by any nformaton storage and retreval system, wthout wrtten permsson from the publsher. Boca Raton, Florda Irvne, Calforna USA 2017 ISBN-10: X (ebk.) ISBN-13: (ebk.)
3 ÇUKUROVA UNIVERSITY INSTITUTE OF NATURAL AND APPLIED SCIENCES Gözde ÖZSERT YİĞİT MSc THESIS PREDICTING THE ADMISSION DECISION OF A PARTICIPANT TO THE SCHOOL OF PHYSICAL EDUCATION AND SPORTS AT CUKUROVA UNIVERSITY BY USING DIFFERENT MACHINE LEARNING METHODS COMBINED WITH FEATURE SELECTION ADANA, 2016 DEPARTMENT OF COMPUTER ENGINEERING I
4 ABSTRACT The purpose of ths thess s to develop new hybrd admsson decson predcton models by usng dfferent machne learnng methods ncludng Support Vector Machnes (SVM), Multlayer Perceptron (MLP), Radal Bass Functon (RBF) Network, TreeBoost (TB) and K-Means Clusterng (KMC) combned wth feature selecton algorthms to nvestgate the effect of the predctor varables on the admsson decson of a canddate to the School of Physcal Educaton and Sports at Cukurova Unversty. Three feature selecton algorthms ncludng Relef-F, F-Score and Correlaton-based Feature Selecton (CFS) have been consdered. Experments have been conducted on the datasets, whch contan data of partcpants who appled to the School n 2006 and The datasets have been randomly splt nto tranng and test sets usng 10-fold cross valdaton as well as dfferent percentage ratos. The performance of the predcton models for the datasets has been assessed usng classfcaton accuracy, specfcty, senstvty, postve predctve value (PPV) and negatve predctve value (NPV). The results show that a decrease n the number of predctor varables n the predcton models usually leads to a parallel decrease n classfcaton accuracy. Key Words: Machne learnng, feature selecton, physcal ablty test II
5 ACKNOWLEDGMENTS Foremost, I would lke to express my sncere grattude to my advsor Assoc. Prof. Dr. M. Fath AKAY, for hs supervson gudance, encouragements, patence, motvaton, useful suggestons and hs valuable tme for ths work. I would lke to thank members of the MSc thess jury, Assoc. Prof. Dr. Ramazan ÇOBAN and Asst. Prof. Dr. Şule ÇOLAK, for ther suggestons and correctons. I would also lke to thank Cukurova Unversty Scentfc Research Projects Center for supportng ths work (Project no: FYL ). Last but not the least, I would lke to thank my husband Talat Yğt and my famly for ther endless support and encouragements for my lfe and career. III
6 Contents PAGE l. INTRODUCTION The Vertcal Jump Test The Coordnaton and Skll Test meter Dash Test meter ShuttleRun Test Determnng Pont of Partcpant Admsson Prevous Works Feature Selecton Motvaton, Purpose and Contrbutons of Ths Thess Overvew of Dataset OVERVIEW OF METHODS Support Vector Machnes Mult-Layer Perceptrons Radal Bass Functon Network TreeBoost K-Means Clusterng Feature Selecton Algorthms DEVELOPMENT OF PREDICTION MODELS SVM Model for Predctng Admsson Decson MLP Model for Predctng Admsson Decson RBF Network Model for Predctng Admsson Decson TB Model for Predctng Admsson Decson KMC Model for Predctng Admsson Decson Performance Metrcs RESULTS AND DISCUSSION General Dscusson on the Results Dscusson for Classfcaton Accuracy on the 2006 Dataset Dscusson for Classfcaton Accuracy on the 2007 Dataset IV
7 4.4. Dscusson on Other Performance Crtera CONCLUSION REFERENCES V
8 1. Introducton In order to admt a partcpant to the School of Physcal Educaton and Sports at Cukurova Unversty, the canddate has to be succesful n the physcal test appled at the School. There are two parts n the physcal ablty test. Each of these parts contans two sub tests. The vertcal jump test as well as the coordnaton and skll tests are appled n the frst porton of the test. The second porton of the test comprses of the 30-meter dash test and 20-meter shuttle run test (Çukurova Ünverstes Beden Eğtm ve Spor Yüksekokulu, 2015). The detals of each test s gven Secton 1.1 through Secton The Vertcal Jump Test In ths test, the partcpant wats for resettng of tmng mat wth weght equally balanced on both feet. After the mat s arranged, partcpant jumps vertcally to reach the hghest pont he can and then he steps back on the mat. The score of the vertcal jump test s calculated consderng the tme spent n the ar. [Çukurova Ünverstes Beden Eğtm ve Spor Yüksekokulu, 2015). Fgure 1.1 shows the vertcal jump test. Fgure 1.1.The vertcal jump test 1
9 1.2. The Coordnaton and Skll Test The coordnaton and skll test has several steps. Ths test starts wth a front somersault. The partcpant gathers a ball, throws the ball up n the ar and gets hold of the ball after passng across the horzontal barrer. After ths step, he jumps over the balance tool and tres to keep stablty whle movng. Back somersault follows these steps. The other two steps are related wth the partcpant s movement capabltes. The last part of the ths test conssts of sldng down and jumpng over the obstacles. The setup of the coordnaton and skll test s shown n Fgure m. 1.5 m. 3m 3.8 m. 2 m. 24 m. 3.8 m. 1.5 m. 5.5 m. 3.5 m. 1.7 m. 3.5 m. 2 m. 7.5 m. 1.2 m. 2 m. 5 m. Fgure 1.2.Structure of the coordnaton and skll test. 2
10 Each partcpant has two opportuntes for the two tests of the frst part. A partcpant s fnal score s calculated usng the hghest scores he acheves. Partcpants who are successful n these two tests are allowed to take part n the second secton of the physcal ablty test (Çukurova Ünverstes Beden Eğtm ve Spor Yüksekokulu, 2015) meter Dash Test 30-meter dash test evaluates the ablty of partcpant's to quckly gan speed on 30 meters. The test contans runnng one maxmum sprnt over 30 meters. At the begnnng of the test, one foot should be one step ahead. The front foot has to be on the startng lne. The partcpant should hold on to ths poston for two seconds and movng snot permtted. The nstructor should provde nformaton for the acceleraton of the partcpant and motvate to contnue runnng hard through the fnsh lne. The tme starts wth the frst movement of partcpant or f there exsts tme system when t s trggered, and fnshes when the partcpant reaches the fnsh lne or the fnshng system s trggered (TopendSports, 2015). Each partcpant has two trals and the lowest completon tme of the partcpant s recorded. Illustraton of the 30-meter dash s gven n Fgure 1.3. Fgure meter dash test 3
11 meter Shuttle Run Test The shuttle run test s performed at a ptch whch has a dstance of 20 meters between the two end ponts. Ths testsalso called the 'beep' test. The partcpant stands behnd the startng lne and starts runnng when nstructed. In the begnng, the speed of partcpant s comparatvely slow. Runnng between the two lnes should be contnued n accordance wth the recorded beeps. As the test progresses, speed of the partcpant s ncreased wth every beep sound and the frequency of beeps s gradually ncreased. If the partcpant arrves the lne before the beep sounds, he must hold up untl the beep sounds before contnung. If the partcpant can not arrve before the beep sounds, he s gven a warnng and must keep on runnng to the lne, then turns and attempts to get up to speed wth the pace wthn two more beeps. The test s completed when partcpant gets two falures n consecutve (TopendSports, 2015). Illustraton of 20-meter shuttle run test s shown n Fgure 1.4. Fgure meter shuttle run test 1.5. Determnng a Partcpant's Admsson Decson A partcpant s admsson decson s related wth the partcpant s total scores from the physcal ablty test together wth hs Natonal Student Selecton Examnaton (NSSE) and Natonal Student Placement Examnaton (NSPE) scores and Grade Pont Average (GPA) at hgh school. The overall score of a partcpant who graduated from a sports branch at hgh school s calculated by Equaton (1.1). 4
12 OVERALL SCORE PATS X GPA X NSPE (1.1.) The overall score of a partcpant who graduated from another area at hgh school s calculated by Equaton (2) OVERALL SCORE PATS X GPA X NSPE (1.2.) In Equaton (1) and Equaton (2), PATS s the physcal ablty test score. After the overall scores are calculated for all partcpants, the scores are sorted n descendng order for each partcpant and a pre-defned number of partcpants are accepted to the School Prevous Work Developng admsson decson predcton models has been an actve reserach area for several years. In ths regard, there exst a few studes n lterature whch have attempted to predct the admsson decson of a canddate to the School of Physcal Educaton and Sports of Cukurova Unversty by usng dfferent machne learnng methods. The frst study n ths feld was carred out by (Ackkar and Akay, 2008). Multlayer Perceptron (MLP) has been used to develop admsson decson predcton models. Two datasets consstng of the real test results of partcpants n the years of 2006 and 2007 have been used. Several performance metrcs ncludng classfcaton accuracy, senstvty, specfcty, postve predctve value (PPV) and negatve predctve value (NPV) have been reported for the developed predcton models. The authors concluded that MLP was a feasble tool n ths applcaton doman. In a follow-up work by (Ackkar and Akay, 2009), Support Vector Machnes (SVM) based admsson decson predcton models have been developed. The same datasets were used to develop the admsson decson predcton models. It was shown that SVM-based predcton models perform slghtly better than MLP-based 5
13 predcton models. It was concluded that the SVM classfcaton can be a useful tool for ths applcaton area. Detaled results of the SVM and MLP predcton models on the 2006 and 2007 datasets for (Açıkkar and Akay, 2009; Açıkkar and Akay, 2008) are gven n Table 1.1 and Table 1.2, respectvely. Table 1.1 Results of the SVM and MLP predcton models for the 2006 dataset Study Accuracy (%) Senstvty (%) Specfcty (%) PPV (%) NPV(%) Açıkkar and Akay, 2009 Açıkkar and Akay, Table 1.2 Results of the SVM and MLP predcton models for the 2007 dataset Study Accuracy (%) Senstvty (%) Specfcty (%) PPV (%) NPV (%) Açıkkar and Akay, 2009 Açıkkar and Akay, In (Akay et al., 2014) the authors used MLP on the same datasets to develop admsson decson predcton models. Each dataset has been splt nto tran and test sets usng dfferent ratos. More specfcally, the datasets are proportonally grouped n 90-10%, 80-20%, 70-30%, 60-40% and 50-50% portons. For the 2006 dataset, the hghest classfcaton accuracy (.e %) has been obtaned for the case of 80-20% splt whereas for the 2007 dataset, the hghest classfcaton accuracy (.e %) has been obtaned for the case of 80-20% splt. There are also other studes n lterature whch developed admsson decson predcton models by usng dfferent machne learnng methods. In (Abut et al., 2015), the authors used four classfcaton methods ncludng SVM, Logstc Regresson, RBF Network and K-Means Clusterng (KMC) on the 2006 dataset by 6
14 employng dfferent valdaton technques. The results have shown that the performance of SVM employng 10-fold cross valdaton s superor compared to the performance of other methods. The reported value for the hghest classfcaton accuracy was 97.90%. In (Turhan, 2015), the author used dfferent machne learnng algorthms ncludng SVM, MLP, Logstc Regresson, RBF Network, Sngle Decson Tree and KMC on the 2006 and 2007 datasets. Classfcaton accuracy and several other performance metrcs have been used to assess the performance of the machne learnng methods on the datasets. SVM usng 10-fold cross valdaton acheves the hghest accuracy wth 97.90% and 91.45% for the 2006 and 2007 datasets, respectvely. The rankng among the sx classfers n terms of acheved classfcaton accuracy has been determned as SVM, Logstc Regresson, MLP, RBF Network, Sngle Decson Tree and KMC Feature Selecton Feature selecton s helpful n locatng the dscrmnatve features that are the most approprate to predct the class. Feature selecton s used n data mnng and statstcs. The basc approach of feature selecton s to choose a subset of nput varables by removng non-relevant features. In theory, f one knew the full statstcal dstrbuton, the use of more features can yeld better results. On the other hand, snce usng a large number of features consume memory and tme, dong so may lead the algorthms become wasteful. Therefore, n the preprocessng step, t may be advantageous to pck the relevant and necessary features. Obvously, the favorable crcumstances of utlzng feature selecton may be enhancng comprehensblty and brngng down cost of data acquston and handlng. As a result of all the advantages, feature selecton has 7
15 nterested much consderaton nsde the machne learnng, artfcal ntellgent and data mnng communtes (Sun et al., 2011) Motvaton, Purpose and Contrbutons of Ths Thess There s only one study (Açıkkar et al., 2014) n lterature that uses machne learnng methods combned wth a feature selecton algorthm to develop hybrd admsson decson predcton models for the School of Physcal Educaton and Sports at Cukurova Unversty. In (Açıkkar et al., 2014), MLP combned wth a feature selecton algorthm has been used to develop a predcton model to predct the admsson decson. As a feature selecton algorthm, Relef-F has been selected. Predctor varables are gender, NSSE and NSPE scores, GPA, area at hgh school and scores from coordnaton and skll test, vertcal jump test, 30-meter dash test and 20- meter shuttle run test. The results have shown that the model ncludng all the predctor varables yelds the best classfcaton accuraces, ndependent of whch actvaton functon has been used at the output layer. Among the results obtaned by usng dfferent actvaton functons, the double layered MLP model usng the lnear actvaton functon has specalzaton yelded the best classfcaton accuracy (.e %). Apparently, more research s requred wth the help of several dfferent machne learnng methods combned wth dfferent feature selecton algorthms n order to dentfy the effect of the predctor varables on the admsson decson. The purpose of ths thess s to develop new hybrd admsson decson predcton models by usng dfferent machne learnng methods ncludng SVM, MLP, RBF Network, TB and KMC combned wth feature selecton algorthms to nvestgate the effect of the predctor varables on the admsson decson of a canddate to the School of Physcal Educaton and Sports at Cukurova Unversty. Wth the help of the predcton models that have been developed n ths thess, the partcpant can have an 8
16 dea about the mportance of each predctor varable and hence prepare for the physcal test usng an approprte tranng program. In ths thess, two datasets, namely 2006 dataset and 2007 dataset, have been utlzed. By usng the Relef-F and F-score feature selecton algorthms, rankng of the attrbutes has been calculated. Then, based on these rankng scores, several models have been developed by removng the attrbute wth the lowest score at a tme. In contrast to Relef-F and F-score algorthms, the CFS algorthm gves a set of selected varables to develop a sngle model. The models have been evaluated usng dfferent machne learnng methods ncludng SVM, MLP, RBF, TB and KMC. For model testng, 10-fold cross valdaton and percentage splts of data have been used. The performances of the machne learnng methods for two datasets have been assessed utlzng classfcaton accuracy, specfcty, senstvty, PPV and NPV. Ths thess has two man contrbutons when compared to the studes n lterature. Frst of all, ths s the frst thess n lterature that develops hybrd admsson decson predcton models to the School of Physcal Educaton and Sports at Cukurova Unversty usng several machne learnng methods combned wth dfferent feature selecton algorthms. Secondly, by ntegratng feature selecton algorthms nto machne learnng methods, ths thess yelds dscrmnatng the useful and redundant features for admsson decson predcton Overvew of Datasets Two dfferent datasetshave been used n ths thess. The datasets were provded by the School of Physcal Educaton and Sports of Cukurova Unversty. These datasets nclude data of partcpants who performed the physcal ablty tests n the years of 2006 and They contan nne attrbutes ncludng gender, the scores from the NSSE and NSPE, GPA, the specalzaton area at hgh school, the scores from the vertcal jump test, coordnaton and skll test, 30-meter dash test and 20-9
17 meter shuttle run test. The datasets also nclude two classes. These classes are represented wth the values 0 and 1, where 0 means reject and 1 means admt. There are 143 subjects (87 males and 56 females) and 117 subjects (73 males and 44 females) n the datasets of 2006 and 2007, respectvely. The predctor varables and ther statstcs for each dataset are gven n Table 1.3. and Table 1.4., respectvely. Table 1.3. Statstcal analyss of each predctor varable for the 2006 dataset Standard Predctor Varable Mnmum Maxmum Mean Devaton Gender NSSE NSPE GPA Specalzaton area Vertcal jump test score Coordnaton and skll test score meter dash test score Table 1.4. Statstcal analyss of each predctor varable for the 2007 dataset Standard Predctor Varable Mnmum Maxmum Mean Devaton Gender NSSE NSPE GPA Specalzaton area Vertcal jump test score Coordnaton and skll test score meter dash test score
18 2. Overvew of Methods 2.1. Support Vector Machnes SVM s related to statstcal learnng theory (Vapnk, 1999), whch was ntroduced n 1992 (Boser, 1992). The SVM solves classfcaton problems by utlzng an adaptable representaton of the class lmts by executng automatc complexty control. Wth the help of ths feature, the problem of overfttng s reduced. A. Lnear SVM Assume a tranng set of N data ponts, S { x, y } k k where x R n k s an nput vector and y R k s an output vector. The SVM problems are related wth hyperplanes whch separate the data. The equaton of the hyperplanes are determned by a vector t w and a bas b. Decson functon for the hyperplaness w. x b 0. The margn of separaton can be made maxmum by constructng the optmal hyperplane. The support vector method technque ams at buldng a classfer t f ( x) sgn( w. x b). (2.1.) The w and b parameters are lmted wth mn w. x b 1. (2.2.) After the vectors are dvded wthout any problem, and as a result of ths dvdng process, f the space between the nearest vector and the hyperplane s 11
19 maxmum, t s called to be dvded by a hyperplane. Consequently, a dvdng hyperplane n standard form has to fulfll the constrants gven n (2.3), y w. x b 1, 1,2,..., n. (2.3.) A pont x havng the dstance d from the hyperplane w,b s, y( x. w b) 1 d(( w, b), x) (2.4.) w w can be calculated as 2. (2.5.) w Hence, SVM searches for a separatng hyperplane by mnmzng w prncple, 1 2 w w. w. (2.6.) n (2.6) can be mnmzed by performng the structural rsk mnmzaton 2 w c. (2.7.) h s the seres of standard hyperplanes n space that has n-dmenson and s lmted by, 12
20 2 h mn R c, d 1, (2.8.) n whch R s a hypersphere s radus surroundng all tranng vectors. As a result of ths, mnmzng (2.6) s equal to mnmzaton of the upper bound. The lmtatons of (2.3) can be reduced by presentng slack varables 0, 1,2,..., n, therefore (2.3) can be rewrtten as y. w. x b 1, 1,2,..., n. (2.9.) Under these crcumstances, the problem of optmzaton becomes 1 2 n w, w. w C. (2.10.) 1 In (2.10.)C s a user specfed postve fxed constant. The saddle pont of Lagrangan functon s utlzed n the soluton of the problem gven n (2.10). n n n 1 Lw, b,,, w. w C y w. x b 1 2 (2.11.) In (2.11), 0, 0, 1,2,..., n are Lagrange multplers. (2.11) must be solved n terms of w, b, and. Classcal Lagrangan dualty empowers the frst ssue, turnng (2.11) nto a dual problem of t and ths makes the soluton easer. (2.12) shows the dual problem to be solved 1 max. 1 2, j1 n n j y y j x x j (2.12.) 13
21 wth constrants n y 0, 0 C, 1,2,..., n. (2.13.) 1 There s a unque soluton for ths classc quadratc optmzaton problem. In respect of the Kuhn-Tucker theorem of optmzaton theory (2.16.), y w. x b 1 0, 1,2,..., n. (2.14.) If x satsfy (2.15), then (2.14) wll have non-zero Lagrange multplers y wx. b 1. (2.15.) The ponts n (2.15.) are called support vectors (SV s). Small subset of the tranng vectors of the SV s determnes the hyperplane. Therefore, f the optmal * soluton does not take a value of zero, the classfer functon can be represented as n f x y x x b 1 sgn *. *. (2.16.) * * In (2.16.) b s the soluton of (14) for any non-zero. B. Non-lnear SVM 14
22 The majorty of the datasets can not be decently dvded by a lnear separatng hyperplane. However, they can be lnearly dvded f mapped nto a hgher dmensonal feld by utlzng a nonlnear mappng. Therefore, z () x that converts the nput vector x havng a dmenson d nto a vector z havng a dmenson d s defned and () s selected so that { ( x, y)} (new tranng data) s dvsble wth a hyperplane. The data ponts from the nput space nto some space of hgher dmenson are mapped by usng the functon n nh.: R R. (2.17.) Optmal functon (2.9) transforms (2.18) usng the same constrants, where 1 max, 1 2, j1 n n j y y jk x xj (2.18.) x, x j x. x j K (2.19.) s the kernel functon. The exponental kernel functon s gven by (2.20) K x, xj exp x x j, (2.20.) 15
23 whereas the polynomal kernel functon s gven by (2.21) K x x j x x j q,. 1, q 1,2,... (2.21.) where the parameters and q n (2.20) and (2.21) have to be prearranged. V W X 1 Then, the classfer functon s specfed as n f yk b 1 x sgn * x, x * (2.22.) and b * * s the soluton of (2.22) for any non-zero Mult-Layer Perceptron An MLP s a type of artfcal neural network model and also feed-forward process. Ths model maps a set of nput data over a set of convenent outputs. An MLP ncludes multple layers of nodes n a coordnated graph and each layer s completely connected to the followng one. Each node s a neuron wth a nonlnear actvaton functon except the nput nodes. Ths method uses a handled learnng technque. Ths technque s named as back propagaton n order to tran the network. MLP s an alteraton of the standard lnear perceptron and can recognze nseparable data (Imre and Durucan, 2000). An MLP has a form as gven Fgure 2.1. v j w jk O 1 X 2 O X. 16 O k H j
24 Fgure 2.1. A typcal MLP Structure A data model consstng of the x values used n the nput layer th s transmtted through the network towards j n the frst hdden layer. The weghted outputs w x j are receved of the prevous layer s unts per hdden unt. The outputs from ths process are summed. After that, these values are to be turned nto an output value usng an actvaton functon. ( n Actvaton functon s f ) () x at layer n. The output unt of has two-layer. w k (2.23.) out f ( out. w ) f ( f ( n w ). w ) (2) (2) (1) (2) (2) (1) (1) (2) k j jk j jk j j If the actvatons at hdden layer are lnear, (2.23.) s reduced to. (2.24.) out f out w f f n w 2 (2) (1) (2) (2) (1) (2) k ( j. jk ) ( ( j ) j j Nevertheless, (2.24) s equal to a network havng one layer wth weght j w w (1) (2) j jk. Ths network can not be used on non-lnearly separable problems. A. Non-Lnear Actvaton/Transfer Functon The values of the logstc sgmod functon range from 0 to 1. The standard sgmod s bascally used wth the hyperbolc tangent. It has the feature, f ( x) tanh( x) 2 Sgmod (2 x) 1 f ( x) f ( x), (2.25.) and ts dervatve s gven by (2.26.) 2 ( ) 1 ( ). (2.26.) f x f x 17
25 B. Learnng The same steps are used for tranng N layer neural networks as the networks ( n) havng a sngle layer. The network weghts w are set to make the output cost functon gven n (2.27) mnmum, or E 1 SSE 2 CE p ( N ) p 2 ( t arg j out j ), (2.27.) p j p ( n) p p ( N ) p [ arg j.log( j ) (1 arg j ).log(1 j )] (2.28.) p j E t out t out and once agan ths can be done by a seres of gradent descent weght changes out ( N ) j E w ( m) kl ( n) ({ wj }) ( m) wkl. (2.29.) s the only output of the last layer. Ths becomes apparent n the error functon E of the output. However, outputs of the fnal layer are related wth all the weghts of ( n) the prevous layers. Ths learnng algorthm automatcally sets out of the prevous layers. C. Tranng j j Tranng for mult-layer networks performs n same way wth networks havng a sngle layer: 18
Support Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
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 informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More informationMachine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)
Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
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 informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationCHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION
48 CHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION 3.1 INTRODUCTION The raw mcroarray data s bascally an mage wth dfferent colors ndcatng hybrdzaton (Xue
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 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 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 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 informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
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 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 informationOutline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:
Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS46: Mnng Massve Datasets Jure Leskovec, Stanford Unversty http://cs46.stanford.edu /19/013 Jure Leskovec, Stanford CS46: Mnng Massve Datasets, http://cs46.stanford.edu Perceptron: y = sgn( x Ho to fnd
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 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 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 informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More 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 informationUsing Neural Networks and Support Vector Machines in Data Mining
Usng eural etworks and Support Vector Machnes n Data Mnng RICHARD A. WASIOWSKI Computer Scence Department Calforna State Unversty Domnguez Hlls Carson, CA 90747 USA Abstract: - Multvarate data analyss
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 informationFace Recognition Method Based on Within-class Clustering SVM
Face Recognton Method Based on Wthn-class Clusterng SVM Yan Wu, Xao Yao and Yng Xa Department of Computer Scence and Engneerng Tong Unversty Shangha, Chna Abstract - A face recognton method based on Wthn-class
More 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 informationTaxonomy of Large Margin Principle Algorithms for Ordinal Regression Problems
Taxonomy of Large Margn Prncple Algorthms for Ordnal Regresson Problems Amnon Shashua Computer Scence Department Stanford Unversty Stanford, CA 94305 emal: shashua@cs.stanford.edu Anat Levn School of Computer
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 informationArtificial Intelligence (AI) methods are concerned with. Artificial Intelligence Techniques for Steam Generator Modelling
Artfcal Intellgence Technques for Steam Generator Modellng Sarah Wrght and Tshldz Marwala Abstract Ths paper nvestgates the use of dfferent Artfcal Intellgence methods to predct the values of several contnuous
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 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 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 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 informationSUMMARY... I TABLE OF CONTENTS...II INTRODUCTION...
Summary A follow-the-leader robot system s mplemented usng Dscrete-Event Supervsory Control methods. The system conssts of three robots, a leader and two followers. The dea s to get the two followers to
More informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
More informationCLASSIFICATION OF ULTRASONIC SIGNALS
The 8 th Internatonal Conference of the Slovenan Socety for Non-Destructve Testng»Applcaton of Contemporary Non-Destructve Testng n Engneerng«September -3, 5, Portorož, Slovena, pp. 7-33 CLASSIFICATION
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 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 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 informationStatistical Methods in functional MRI. Classification and Prediction. Data Processing Pipeline. Machine Learning. Machine Learning
Statstcal Methods n functonal MRI Lecture 10: Predcton and Bran Decodng 05/0/13 Martn Lndqust Department of Bostatstcs Johns Hopkns Unversty Data Processng Ppelne Classfcaton and Predcton Expermental Desgn
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 informationRECOGNIZING GENDER THROUGH FACIAL IMAGE USING SUPPORT VECTOR MACHINE
Journal of Theoretcal and Appled Informaton Technology 30 th June 06. Vol.88. No.3 005-06 JATIT & LLS. All rghts reserved. ISSN: 99-8645 www.jatt.org E-ISSN: 87-395 RECOGNIZING GENDER THROUGH FACIAL IMAGE
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 informationUSING GRAPHING SKILLS
Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp
More informationEmpirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap
Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*
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 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 informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More 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 informationKeywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines
(IJCSIS) Internatonal Journal of Computer Scence and Informaton Securty, Herarchcal Web Page Classfcaton Based on a Topc Model and Neghborng Pages Integraton Wongkot Srura Phayung Meesad Choochart Haruechayasak
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 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 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 informationResearch of Image Recognition Algorithm Based on Depth Learning
208 4th World Conference on Control, Electroncs and Computer Engneerng (WCCECE 208) Research of Image Recognton Algorthm Based on Depth Learnng Zhang Jan, J Xnhao Zhejang Busness College, Hangzhou, Chna,
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 informationClassification algorithms on the cell processor
Rochester Insttute of Technology RIT Scholar Works Theses Thess/Dssertaton Collectons 8-1-2008 Classfcaton algorthms on the cell processor Mateusz Wyganowsk Follow ths and addtonal works at: http://scholarworks.rt.edu/theses
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationDiscriminative classifiers for object classification. Last time
Dscrmnatve classfers for object classfcaton Thursday, Nov 12 Krsten Grauman UT Austn Last tme Supervsed classfcaton Loss and rsk, kbayes rule Skn color detecton example Sldng ndo detecton Classfers, boostng
More informationA Statistical Model Selection Strategy Applied to Neural Networks
A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationGeneral Vector Machine. Hong Zhao Department of Physics, Xiamen University
General Vector Machne Hong Zhao (zhaoh@xmu.edu.cn) Department of Physcs, Xamen Unversty The support vector machne (SVM) s an mportant class of learnng machnes for functon approach, pattern recognton, and
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 informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationAdaptive Virtual Support Vector Machine for the Reliability Analysis of High-Dimensional Problems
Proceedngs of the ASME 2 Internatonal Desgn Engneerng Techncal Conferences & Computers and Informaton n Engneerng Conference IDETC/CIE 2 August 29-3, 2, Washngton, D.C., USA DETC2-47538 Adaptve Vrtual
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 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 informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
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 informationClassification and clustering using SVM
Lucan Blaga Unversty of Sbu Hermann Oberth Engneerng Faculty Computer Scence Department Classfcaton and clusterng usng SVM nd PhD Report Thess Ttle: Data Mnng for Unstructured Data Author: Danel MORARIU,
More informationApplication of Artificial Neural Networks for Rainfall Forecasting in Fuzhou City
Applcaton of Artfcal Neural Networks for Ranfall Forecastng n Fuzhou Cty GONG Zhenbn MEE09203 Supervsor: Prof. A. W. Jayawardena ABSTRACT Accurate ranfall predcton s of great nterest for water management
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 informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More 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 informationElliptical Rule Extraction from a Trained Radial Basis Function Neural Network
Ellptcal Rule Extracton from a Traned Radal Bass Functon Neural Network Andrey Bondarenko, Arkady Borsov DITF, Rga Techncal Unversty, Meza ¼, Rga, LV-1658, Latva Andrejs.bondarenko@gmal.com, arkadjs.borsovs@cs.rtu.lv
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationSupport Vector classifiers for Land Cover Classification
Map Inda 2003 Image Processng & Interpretaton Support Vector classfers for Land Cover Classfcaton Mahesh Pal Paul M. Mather Lecturer, department of Cvl engneerng Prof., School of geography Natonal Insttute
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationA Multivariate Analysis of Static Code Attributes for Defect Prediction
Research Paper) A Multvarate Analyss of Statc Code Attrbutes for Defect Predcton Burak Turhan, Ayşe Bener Department of Computer Engneerng, Bogazc Unversty 3434, Bebek, Istanbul, Turkey {turhanb, bener}@boun.edu.tr
More informationSupport Vector Machine for Remote Sensing image classification
Support Vector Machne for Remote Sensng mage classfcaton Hela Elmanna #*, Mohamed Ans Loghmar #, Mohamed Saber Naceur #3 # Laboratore de Teledetecton et Systeme d nformatons a Reference spatale, Unversty
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More 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 informationImproving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky
Improvng Low Densty Party Check Codes Over the Erasure Channel The Nelder Mead Downhll Smplex Method Scott Stransky Programmng n conjuncton wth: Bors Cukalovc 18.413 Fnal Project Sprng 2004 Page 1 Abstract
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More 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 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 informationJournal of Process Control
Journal of Process Control (0) 738 750 Contents lsts avalable at ScVerse ScenceDrect Journal of Process Control j ourna l ho me pag e: wwwelsevercom/locate/jprocont Decentralzed fault detecton and dagnoss
More informationLOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit
LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE
More informationAnnouncements. Supervised Learning
Announcements See Chapter 5 of Duda, Hart, and Stork. Tutoral by Burge lnked to on web page. Supervsed Learnng Classfcaton wth labeled eamples. Images vectors n hgh-d space. Supervsed Learnng Labeled eamples
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
More informationSVM-based Learning for Multiple Model Estimation
SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More 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 informationImproving anti-spam filtering, based on Naive Bayesian and neural networks in multi-agent filters
J. Appl. Envron. Bol. Sc., 5(7S)381-386, 2015 2015, TextRoad Publcaton ISSN: 2090-4274 Journal of Appled Envronmental and Bologcal Scences www.textroad.com Improvng ant-spam flterng, based on Nave Bayesan
More informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
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 information