Complex System Reliability Evaluation using Support Vector Machine for Incomplete Data-set
|
|
- Clyde Norman Atkins
- 5 years ago
- Views:
Transcription
1 Internatonal Journal of Performablty Engneerng, Vol. 7, No. 1, January 2010, pp RAMS Consultants Prnted n Inda Complex System Relablty Evaluaton usng Support Vector Machne for Incomplete Data-set YUAN FUQING *1, UDAY KUMAR 1 and K. B. MISRA 2 1 Dvson of Operaton and Mantenance Engneerng, Luleå Unversty of Technology, SE Luleå, Sweden 2 RAMS Consultants, 71 Vrndaban Vhar, Amer Road, Japur , Raasthan, Inda (Receved on March 16, 2010, revsed on July 6, 2010) Abstract: Support Vector Machne (SVM) s an artfcal ntellgence technque that has been successfully used n data classfcaton problems, takng advantage of ts learnng capacty. In systems modelled as networks, SVM has been used to classfy the state of a network as faled or operatng to approxmate the network relablty. Due to the lack of nformaton, or hgh computatonal complexty, the complete analytcal expresson of system states may be mpossble to obtan, that s to say, only ncomplete data-set can be obtaned. Usng these ncomplete data-sets, dependng on amount of mssed data-set, ths paper proposes two dfferent approaches named rough approxmaton method and smulaton based method to evaluate system relablty. SVM s used to make the ncomplete data-set complete. Smulaton technque s also employed n the so called smulaton based approxmaton method. Several examples are presented to llustrate the approaches. Keywords: Relablty Evaluaton, SVM, ncomplete data-set, Smulaton 1. Introducton Complex system relablty modelled as a network can facltate system relablty evaluaton. Usng a network, the relablty dependency between the system operatng (or faled) and that of the success (or falure) of ts subsystems and consttuent components or unts are observable. Furthermore, the system relablty evaluaton problem can be transformed nto a network problem. Network relablty evaluaton has been dealt wth extensvely n the lterature [1, 2, 3] usng varous technques. For a smple network, a smple method to evaluate network relablty s to enumerate all possble states of consttuent elements and the correspondng system states. Thereafter, sum up the probabltes of system beng n operatng state to obtan system relablty and the probabltes of system beng n faled to obtan system unrelablty. However, for more complex network, ths method s tme consumng or and sometmes nfeasble. Therefore, some other methods are requred to calculate system relablty and unrelablty. In ths paper, these subsystems, components or unts for the sake of ease can be desgnated as elements smply. The element s state vector and ts correspondng system state are named data sets. Also, t s assumed elements relabltes have been known. As mentoned before, enumeratng all data sets sometmes may not be possble or t may not be feasble to obtan the complete data set due to lack of nformaton or s hghly tme consumng, or structure of system may not be known at all. Ths paper nvestgates the problem of to evaluatng system relablty usng such an ncomplete data-set. * Correspondng author s emal: yuan.fuqng@ltu.se 32
2 Complex System Relablty Evaluaton usng Support Vector Machne for Incomplete Data-set 33 Support Vector Machne (SVM) s used n ths paper. As a artfcal ntellgence technque, support vector machne was ntally developed as a classfer for pattern recognton [4,5]. Currently, ts applcaton covers varous areas such as: data mnng, fnancal forecastng [6], fault dagnoss [7], and so on. The applcaton of SVM on system relablty evaluaton had been proposed by Rocco [8, 9]. In [8], Monte Carlo technque was employed to smulate states of each element and SVM s used as a bnary classfer to predct the system state. Ths synergy produces an estmaton of system relablty. Ths paper proposes two approaches, namely an approxmaton method and smulaton based approxmaton method respectvely. In the remanng secton of ths paper, the prncple of SVM classfer and dscusson on selecton of kernel functon are presented n Secton 2. Secton 3 descrbes the learnng capacty of SVM. Secton 4 descrbes an approxmaton approach, where a smple example s presented. Secton 5 descrbes the smulaton approxmaton approach. An example to llustrate the smulaton approxmaton approach s presented n Secton 5 as well. 2. Basc of Support Vector Machne Classfer 2.1 Support Vector Machne Classfer Regardless of support vectors regresson or classfer, support vector machne s desred to fnd a separator whch can partton data-set as far as possble. Let us take a bnary support vector machne as example, as shown n Fgure 1, the obectve of ths SVM s to separate the dark dots(e.g., represents falure state of system) from whte(e.g., represents operatng state of system). Evdently, any set of lnes (L1, L2,,) located between them dots can separate them. Among these lnes, the most reasonable separator should be the lne located n mddle of the two group dots. Fgure 1: Lnear SVM Ths optmal separator can obtaned from a constraned optmsaton formulaton [10,11]: 1 2 m n w (1) w h, b R 2 s. t. y ( w, x + b ) 1, = 1, 2,..., m. where w denotes the regularsed normal lne, b denotes the ntercept, x denotes the vector (representng a dot) and y denotes ts group label (for bnary classfer, represented by 1 and -1 respectvely). Each dot n Fgures 1 corresponds to a constrant n Formulaton (1). However, n practce, t may be mpossble to separate the mentoned dots lnearly. That means there s no lnear lne exstng to separate these dots. To deal wth ths problem, slack varables ξ are ntroduced to tolerate msclassfcaton. The above formulaton can be deduced as follows:
3 34 Yuan Fuqng, Uday Kumar and K. B. Msra mn s. t. 1 2 w y ( < 2 + C ξ w, x m = 1 > + b ) 1 ξ ζ 0, = 1,2,..., m. Formulaton (2) s called prmal problem n SVM. However, SVM usually uses ts dual problem to obtan optmal soluton. By ntroducng Lagrangan multplers, Formulaton (2) s rewrtten to: m m m 1 max α α y y < x, x > + α k 2 = 1 = 1 k = 1 (3) s. t. 0 α C, = 1,2,3..., m m = 0 α y = 0 where α represents Lagrangan multpler whch corresponds x. C s penalty parameter whch trade-offs classfcaton accuracy and computaton complexty, and x, x > can be < rewrtten to K < x, x >, whch s called the Kernel Functon. After the optmal soluton has been obtaned, the decson functon to determne the group for new x s as follows m (4) f ( x ) = sgn( α y K ( x, x ) + b ) = 1 The process to obtan optmal soluton to Formulaton (3) s called tranng. An nterestng property of the optmal soluton s the fact that (2) α 0 defnes the so-called Support Vector (SV), a sub set of the tranng data set. That means only the SVs can nfluence the decson functon. Hence, the problem can be smplfed snce only part of data sets takng effect. Notably, the set of SVs vares wth kernel functon. [12]. 2.2 Selecton of Kernel Functon The most successful part of SVM s ts Kernel functon. Kernel functon plays a key role n support vector machne. It defnes and measures the smlarty of two data-set, and Kernel functon determnes the SVM classfcaton capacty. By tunng kernel functon s parameter, SVM can control ts classfcaton accuracy. Currently, varous kernel functons, e.g., Gaussan functon, polynomal functon, wavelet functon, mult-layer perceptron functon, have been developed for specfed applcaton areas [10]. Among them, the commonest are Gaussan functon and polynomal functon. Gaussan and polynomal functons dffer n ther prncples to measure smlarty. Gaussan measures t by subtracton of the two vectors (x, x ). Polynomal functon does t by usng nner product. Both Gaussan functon and polynomal functon can perform equally for most applcatons. The form of Gaussan functon s: ' x x ' K( x, x ) = exp( ) (5) 2 2σ where σ s a varable parameter, t s a real contnuous value. The form of the polynomal functon s: ' ' d K ( x, x ) = ( < x, x > + 1) (6) where d s a varable parameter, d s usually a nteger. As mentoned above, parameterσ of Gaussan functon has a real contnuous value, whle d n polynomal functon s usually dscrete. In practce, contnuous parameter s
4 Complex System Relablty Evaluaton usng Support Vector Machne for Incomplete Data-set 35 easer to be tuned n order to control the accuracy of classfcaton than the dscrete one. As a consequence, ths paper selects Gaussan functon for the kernel functon. 3. Proposed Approaches usng SVM The tranng process of SVM s essentally a learnng process, whch means absorbng knowledge from tranng data nto the SVM model. In order to llustrate the learnng process, we take a smple example of a 3-component system as shown n Fgure 2. Fgure 2: A 3-component system Table 1 tabulates all the 8 systems states, whch have been used as the tranng set. Durng tranng, the logcal structure of the system s beng learned nto SVM. After tranng, the learned knowledge s comprsed n ts decson functon. The last column n Table 1 lsted out all the system states generated from decson functon. It found they are all dentcal to the real system state. Hence, we can smply use ts decson functon to decde system states nstead of the data gven n Table 1. That shows the learnng capacty of SVM. Table 1: Tranng set and predcted result for Fgure 2 x 1 x 2 x 3 y Pred Our approach s usng the learnng capacty of SVM when full data sets are not avalable. For a network shown n Fgure 2, all ts system states can be enumerated. However, for some more complex system, the logc structure of the system may not been known, or the number of consttuent components n the system s too large to enumerate. The enumeraton of all system states s hence unavalable. We call t ncomplete data-set n ths paper. Snce the traned SVM buld the system s confguraton nformaton nto ts decson functon, straghtforwardly, we can use the decson functon to predct system state for mssed data-set. Thereafter, a complete data-set can be obtaned and ts system relablty can be evaluated. Dependng on the amount of mssed data-set, the paper proposes two approaches to evaluate system relablty: Approach I: For a case where a small amount of data mssed (e.g., only several data sets mssed out of decades data sets), we use an approach named rough approxmaton method to approxmate system relablty. Ths approach frst traned the SVM usng ncomplete data-set. Then use the traned SVM to approxmate the system state for mssed data sets. After that an approxmate full data-set s obtaned. Based on the approxmate full data-set, we evaluate the system relablty. Ths approach s sutable for a less complex system where number of system states s small. Approach II: For a complex system where all system states are not possble to be enumerated, a large amount of data-set are hence mssed. We use smulaton approach as an
5 36 Yuan Fuqng, Uday Kumar and K. B. Msra approxmaton method to evaluate system relablty. An example of ths approach s provded n Secton 5. In ths example, only part of the data set s actually used. 4. Approxmaton Method Ths secton frstly defnes an upper bound of relablty approxmate error so that relablty accuracy s controllable. Then a SVM based approach wll be dscussed to mprove the approxmate relablty. 4.1 Upper Bound of Relablty Approxmate Error Usng the ncomplete data-set, we can obtan a rough system relablty. It smply calculates the probablty of each system state (operatng or faled) based on probabltes of respectve element states. Later on sum up the probabltes of system beng n operatng state to obtan system relablty R, and sum up all the probabltes beng n ' faled state to obtan system unrelablty R unrel. It can also use mnmal cut set and mnmal cut sets approaches proposed by Msra and Rao [15] to compute relablty and ' unrelablty. Evdently, the real relablty and unrelablty s larger than R rel and R ' unrel. Hence an upper bound of evaluaton approxmate error s: ' ' E = R R (7) rel ' rel 1 rel unrel 4.2 Procedure of Rough Approxmaton Method We uses followng step to approxmate system relablty when a small amount data sets mssed. ) Intaton. Select a proper ntal parameter value σ for Gaussan kernel functon. ) Tran the SVM. Tran the SVM usng ncomplete data. Use those ncomplete data-set as nput of SVM, ts system states as correspondng output of SVM. ) Tune SVM parameter σ. Check f the tranng data set has been classfed successfully, where a tolerable msclassfcaton rato (Number of msclassfcaton dvded by number of tranng data sets) s defned as follows. N msclassfcaton r = (8) error NT When r error excesses to the predefned value, tune kernel functon parameter σ untl r error s less than the predefned value. v) Make up all mssed data set. Enumerate out all the mssed element state vectors. v) Approxmate system state. Approxmate system state for the mssed data usng the traned SVM decson functon (Formulaton 4). Therefore, the mssed data sets have been compensated and the data set has become complete. v) Compute system relablty and unrelablty. Usng the approxmate complete dataset, sum up all the probabltes of system beng operatng state to obtan relablty, sum up all the probabltes of system beng faled state to obtan unrelablty. Ths smple method can only be appled to small amount of data-set mssed case. When large data-set mssed, the approxmate error wll be too large to be accepted. 4.3 An Example of Smple Brdge System Let us take as an example, the relablty network as presented by Yoo and Deo [13]. The confguraton of the network s shown n Fgure 3.
6 Complex System Relablty Evaluaton usng Support Vector Machne for Incomplete Data-set 37 Fgure 3: A Smple Brdge System All path relablty are r = 0.9. The exact network relablty s The complete data set, part of whch wll be used as tranng data sets for SVM, s shown n Table 2. Select Gaussan functon as kernel functon. Suppose the data sets (4 data sets) shown n talc (n Table 2) are mssed, the remanng 28 data sets are as tranng data sets. Gaussan functon parameter σ =0.3. After tranng, the data sets can be classfed successfully. Therefore the Step 3 (Tune SVM parameter) mentoned n prevous secton can be omtted. Thereafter we use the traned SVM to approxmate system state for the 4 mssed data sets. The approxmate result s lsted out on last column n Table 2(n talc). Table 2: Tranng set for Fgure 1 x 1 x 2 x 3 x 4 x 5 y y app x 1 x 2 x 3 x 4 x 5 y y app After approxmatng, t s found 1 out of 4 s msclassfed (No.22). Usng the approxmate data sets, we calculated out ther correspondng relablty and unrelablty are and respectvely. To facltate comparson, we provde n Table 3, the relablty and unrelablty, whch are calculated from ncomplete data set, real complete data set and approxmate complete data set, respectvely. Table 3: Comparson of Exact and Approxmate relablty Relablty Unrelablty Complete data set Incomplete data set Approxmate complete data set
7 38 Yuan Fuqng, Uday Kumar and K. B. Msra After approxmatng, the relablty has been mproved from to Ths approach can compensate the ncomplete data for complete data set. However, t s only sutable for small amount of mssed data set. The next secton presents another approach to evaluate system relablty, when large amount of data set s mssed. 5. Smulaton Based Approxmate Method When large amount of data sets have been mssed, or the complete data sets are mpossble to be obtaned due to hgh computaton complexty, the approxmaton approach presented n the prevous secton s not sutable. In graph theory, the problems such as fndng shortest path, longest path are NP hard. That s, computaton complexty s ncreasng exponentally wth the number of nodes or adacent edges [14]. The approach n ths secton s tryng to evaluate system relablty by usng part of those data-sets. 5.1 Relablty Approxmaton Procedure Element state vector (comprsng 1 or -1) s obtaned va smulaton, where each element state s generated randomly by ts relablty one by one. Thereafter, we use an algorthm descrbed n Secton 5.2 to fnd ts system state (1 or -1). After a certan number of smulaton teratons, t s found there are some vectors are most frequent, whle some others seldom occur. We select the most frequent vectors as tranng data-set, snce the most frequent vectors s also the most sgnfcant (mportant) contrbutng to system relablty. The tranng data-set generated va such procedure s better than those selected arbtrarly. The detaled procedure to evaluate system relablty s as follows: ) Generate tranng data sets. After certan number of smulaton teratons, we select the most frequent vector as tranng data-set. Then use the algorthm developed by Secton 5.2 to fnd ts correspondng system state. ) Tran SVM. Select Gaussan functon as kernel functon. Set parameter value σ arbtrarly. Tran the SVM. After tranng, check f all tranng data-set can be separated successfully. Because the classfcaton performance of SVM s hgh, normally, for a data-set sze wthn thousands, SVM can separate them successfully. Nevertheless, a tolerable msclassfcaton rate s defned, see Formulaton (8). When the msclassfcaton rate exceeded the predefned value, tune parameter σ untl msclassfcaton rate satsfed. Actually, σ s tuned by grd search method. ) Compute relablty and unrelablty. Dependng on the number of nodes or adacent edges, two approaches can be used to evaluate relablty and unrelablty. For a smaller scale network, we employ followng steps to evaluate system relablty: a. Enumerate all element states; Fnd ther correspondng system states usng decson functon of the traned SVM to obtan an approxmate complete data-set. b. Compute the relablty by summng up all probabltes beng operatng system states and compute unrelablty by summng up all probabltes beng faled system states. For a larger scale network where enumeraton s mpossble, we employ followng approach to compute system relablty and unrelablty: a. Generate a large number of element states, regardless of replcaton. Fnd ther correspondng system states usng decson functon of the traned SVM. b. Compute system relablty usng followng formulaton. The unrelablty s 1- R rel.
8 Complex System Relablty Evaluaton usng Support Vector Machne for Incomplete Data-set 39 N succ R rel = (9) NTotal where N succ denotes number of operatng system states, whch s determned from decson functon, N total denotes number of total smulaton teratons. The latter approach (smulaton) s an approxmate approach to the former (enumeraton), whle the computaton complexty of smulaton approach s much less than the enumeraton approach. 5.2 An Algorthm to fnd System State After element states vectors have been generated by smulaton, an algorthm s developed to fnd system state. As s known, n network relablty, when there exsts a path from the start termnal to the end termnal, the correspondng system state s then beng operatng state(normally denoted by 1); otherwse, system state s beng faled state (-1). Some network has a addtonal mnmal flow lmt, that s, unless the flow cost from start termnal to end termnal s greater than a predefned mnmal flow, the system state s beng operatng state; otherwse, t s beng faled state. Ths s a so called constrant network problem. The paper uses followng procedure to fnd feasble path (system state) for such a constrant problem. The correspondng flow dagram s shown n Fgure 4. ) Preparaton. Suppose start termnal s s, end termnal s e. Set ntal total flow cost 0. Specfy one stack to store vsted paths. ) Intaton. Check f there exst path from s to all other nodes. If paths exst, push those paths nto stack. ) Search path further. If stack s empty, go to step (v); otherwse, pop up one path (p ) from stack f stack s nonempty. Take out the last node (n l ) from p. Fnd all the adacent nodes (whch have not been n p ) wth n l. v) Check the termnaton crtera. If the adacent node of n l s e, calculate the path cost. If t exceeds predefned mnmal flow, stop the search. The system state has been found 1; otherwse, push the new path nto stack and go to step (). v) Check Result. Check f the stack s empty. If t s empty and a feasble path has not been found, the system state s then -1, that s, no path exstng or flow s less than the predefned mnmal flow. 5.3 An Example of Complex Network Let us now take a classcal brdge network adopted by some papers to demonstrate ther algorthms as s gven n Yoo and Deo [14]. It s a confguraton of 21 adacent edges as shown n Fgure 5. In ths case, enumeratng all system states s computatonally tedous.
9 40 Yuan Fuqng, Uday Kumar and K. B. Msra Preparaton Fnd all adacent nodes of s and put the path nto Stack Yes Stack s empty? No Pop up one path p Take out the last node nl from path p Does nl have adacent node? Yes No Delete p Fnd all adacent nodes of nl Put new path {p, the new adacent node} Select one node adacent to n l Is ths adacent node e? No Yes t exceeds predefned mnmal flow? Delete path {p, the new adacent node} Yes System state -1 System state 1 End Fgure 4: Flow Dagram The network sown n Fgure 5 has 2 21 elements states (around 2 mllons). Here we use the smulaton based approach to approxmate system relablty. Further, we know that elements have the followng relabltes: r 7 = 0.81, r 4 =r 12 =r 13 =r 19 = 0.981, and all other r = 0.9. s Fgure 5: A complex network After smulaton, sze of 200, 500, 1000 sgnfcant non-replcated tranng data-set are generated respectvely. The SVM parameter value s set asσ = 2.3, C= After tranng, t s found no msclassfcaton. Therefore, the tunng parameter σ can be omtted. Then we use the approach descrbed n Secton 5.1 to approxmate system relablty (The number of smulaton s 200,000 n (9)). The number of smulaton to fnd non-replcated data sets s far less than the full number of combnatons of element states (full data sets). Therefore, the computatonal complexty of ths proposed approach s e
10 Complex System Relablty Evaluaton usng Support Vector Machne for Incomplete Data-set 41 reduced greatly compared wth some approaches based on full data sets. The results are tabulated n Table 4. The last column n Table 4 lsts the (relablty + unrelablty) evaluated from the ncomplete tranng data sets. The result of the last column (Raw Cut/Path Set) s calculated usng the mnmal path sets and cut sets approach orgnally proposed by Msra and Rao [15]. Table 4: Comparson of Several Approaches Sample Sze Enumeraton Smulaton Raw Cut/Path Set Approach Approach (Relablty+Unrelablty) When data sets sze s 200, the relablty calculated by path set and cut set s very low. It means the evaluaton error wll be hgh and therefore the sample sze s too small. We mprove the sample sze from 200 to Then the evaluatng error s reduced consderably. By usng the approach descrbed n Secton 5.1, the approxmate relablty s then mproved from to further (The actual relablty R actual = ). Another concluson s that the enumeraton approach and smulaton approach descrbed n Secton 5.2 are almost equvalent when number of smulaton teratons s large. However, the tme consumed by smulaton aapproach s much less. Therefore, obvously, the smulaton approach s preferable over the enumeraton approach. 6. Concluson For system modelled as network relablty, when complete data-set s mpossble to be obtaned, ths paper proposes two approaches to evaluate ts relablty dependng amount of mssed data-set. When a small amount of data-set mssed, the paper uses Support Vector Machne (SVM) to make up the mssed data set. Thereafter, compute the system relablty approxmately usng the approxmate complete data-set; when large data set mssed, for example, a complex network where all system states can not possbly be enumerated, the paper employs SVM, combnng smulaton to evaluate relablty. From the llustrated examples, t s found the evaluatng error can be reduced by usng these approaches. References [1] Msra, K.B. Relablty Analyss and Predcton. Elsever: Amsterdam; [2] Msra, K.B. (Edtor). New Trends n System Relablty Evaluaton. Elsever: Amsterdam; [3] Msra, K.B. (Edtor). Handbook of Performablty Engneerng. Sprnger Verlag:London; [4] Vapnk, V.N. The Nature of Statstcal Learnng Theory. Sprnger: New York; [5] Vapnk, V.N. Statstcal Learnng Theory. John Wley and Sons, Inc: New York; [6] Francs, E.H.T. and L. Cao Applcaton of Support Vector Machnes n Fnancal Tme Seres Forecastng. Internatonal Journal of Management Scence 2001; 29(4): [7] Haozhong,C., Z. Habao and D. Lxn. Fault Dagnoss of Power Transformer based on Mult- Layer SVM Classfer. Electrc Power Systems Research 2005; 75: [8] Rocco, C.M. and J.A.Moreno. Fast Monte Carlo Relablty Evaluaton usng Support Vector Machne, Relablty Engneerng and System Safety 2002; 76: [9] Rocco,C.M., and M. Mussel. Emprcal Models based on Machne Learnng Technques for Determnng Approxmate Relablty Expressons. Relablty Engneerng and System Safety 2004; 83:
11 42 Yuan Fuqng, Uday Kumar and K. B. Msra [10] Scholkopf, B. and A.J. Smola. Learnng wth Kernels. London: The MIT Press; [11]. Gunn,S.R. Support Vector Machnes for Classfcaton and Regresson. Techncal report, School of Electroncs and Computer Scence, Unversty of Southampton, [12] Lng, Z. and Bo,Z. Relatonshp between Support Vector Set and Kernel Functon n SVM. J. Comput.Sc.and Technol 2002; 17(5): [13] Yoo, Y.B. and N. Deo. A Comparson of Algorthms for Termnal-par Relablty. IEEE Transactons on Relablty 1988; 37(2): [14] Ahmad,R.S. and R.M.Omd. All-Termnal Network Relablty Usng Recursve Truncaton Algorthm. IEEE Transacton on Relablty 2009; 58(2): [15] Msra, K.B. and T.S.M.Rao. Relablty Analyss of Redundant Networks usng Flow Graphs. IEEE Transactons on Relablty 1970; 19(1): Yuan Fuqng obtaned hs master s degree n System Engneerng at Beng Unversty of Aeronautcs and Astronautcs, Chna, n the year He oned the Dvson of Operaton and Mantenance engneerng, Luleå Unversty of Technology, Sweden n September 2007 for Ph.D. degree programme. Hs area of research deals wth relablty data analyss and statstcal learnng theory. Uday Kumar obtaned hs B. Tech from Inda n the year After workng for 6 years n Indan mnng ndustres, he oned the postgraduate program of Luleå Unversty of Technology, Luleå, Sweden and obtaned a Ph.D. degree n feld of Relablty and Mantenance n Afterwards, he worked as a Senor Lecturer, Assocate Professor at Luleå Unversty and n 1997, he was apponted as a Professor of Mechancal Engneerng (Mantenance) at Unversty of Stavanger, Stavanger, Norway. Presently, he s Professor of Operaton and Mantenance Engneerng at Luleå Unversty of Technology. Hs research nterests are equpment mantenance, equpment selecton, relablty and mantanablty analyss, system analyss, etc. He has publshed more than 170 papers n Internatonal Journals and Conference Proceedngs. For K.B.Msra s bography, refer to:
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 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 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 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 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 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 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 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 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 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 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 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 informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More 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 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 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 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 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 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 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 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 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 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 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 informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More 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 informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
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 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 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 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 informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationConditional Speculative Decimal Addition*
Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant
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 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 informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More 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 informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More 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 informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
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 informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationAssociative Based Classification Algorithm For Diabetes Disease Prediction
Internatonal Journal of Engneerng Trends and Technology (IJETT) Volume-41 Number-3 - November 016 Assocatve Based Classfcaton Algorthm For Dabetes Dsease Predcton 1 N. Gnana Deepka, Y.surekha, 3 G.Laltha
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationCracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm
Crackng of the Merkle Hellman Cryptosystem Usng Genetc Algorthm Zurab Kochladze 1 * & Lal Besela 2 1 Ivane Javakhshvl Tbls State Unversty, 1, I.Chavchavadze av 1, 0128, Tbls, Georga 2 Sokhum State 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 informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationA fault tree analysis strategy using binary decision diagrams
Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:
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 informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More 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 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 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 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 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 informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More 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 informationA HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS
Kumar Pardeep and Chaturved D.K., Pahua G.L. - A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS Kumar
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 informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationDiscrete and Continuous Time High-Order Markov Models for Software Reliability Assessment
Dscrete and Contnuous Tme Hgh-Order Markov Models for Software Relablty Assessment Vtaly Yakovyna and Oksana Nytrebych Software Department, Lvv Polytechnc Natonal Unversty, Lvv, Ukrane vtaly.s.yakovyna@lpnu.ua,
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 informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationAn efficient iterative source routing algorithm
An effcent teratve source routng algorthm Gang Cheng Ye Tan Nrwan Ansar Advanced Networng Lab Department of Electrcal Computer Engneerng New Jersey Insttute of Technology Newar NJ 7 {gc yt Ansar}@ntedu
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 informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationA classification scheme for applications with ambiguous data
A classfcaton scheme for applcatons wth ambguous data Thomas P. Trappenberg Centre for Cogntve Neuroscence Department of Psychology Unversty of Oxford Oxford OX1 3UD, England Thomas.Trappenberg@psy.ox.ac.uk
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 informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More 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 informationEvolutionary Support Vector Regression based on Multi-Scale Radial Basis Function Kernel
Eolutonary Support Vector Regresson based on Mult-Scale Radal Bass Functon Kernel Tanasanee Phenthrakul and Boonserm Kjsrkul Abstract Kernel functons are used n support ector regresson (SVR) to compute
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 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 informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationRouting on Switch Matrix Multi-FPGA Systems
Routng on Swtch Matrx Mult-FPGA Systems Abdel Enou and N. Ranganathan Center for Mcroelectroncs Research Department of Computer Scence and Engneerng Unversty of South Florda Tampa, FL 33620 Abstract In
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 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 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 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 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 informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationClassification Based Mode Decisions for Video over Networks
Classfcaton Based Mode Decsons for Vdeo over Networks Deepak S. Turaga and Tsuhan Chen Advanced Multmeda Processng Lab Tranng data for Inter-Intra Decson Inter-Intra Decson Regons pdf 6 5 6 5 Energy 4
More informationA User Selection Method in Advertising System
Int. J. Communcatons, etwork and System Scences, 2010, 3, 54-58 do:10.4236/jcns.2010.31007 Publshed Onlne January 2010 (http://www.scrp.org/journal/jcns/). A User Selecton Method n Advertsng System Shy
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 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 informationPerformance Evaluation of an ANFIS Based Power System Stabilizer Applied in Multi-Machine Power Systems
Performance Evaluaton of an ANFIS Based Power System Stablzer Appled n Mult-Machne Power Systems A. A GHARAVEISI 1,2 A.DARABI 3 M. MONADI 4 A. KHAJEH-ZADEH 5 M. RASHIDI-NEJAD 1,2,5 1. Shahd Bahonar Unversty
More informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
More informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
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 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 informationRelevance Assignment and Fusion of Multiple Learning Methods Applied to Remote Sensing Image Analysis
Assgnment and Fuson of Multple Learnng Methods Appled to Remote Sensng Image Analyss Peter Bajcsy, We-Wen Feng and Praveen Kumar Natonal Center for Supercomputng Applcaton (NCSA), Unversty of Illnos at
More informationAnalysis of Non-coherent Fault Trees Using Ternary Decision Diagrams
Analyss of Non-coherent Fault Trees Usng Ternary Decson Dagrams Rasa Remenyte-Prescott Dep. of Aeronautcal and Automotve Engneerng Loughborough Unversty, Loughborough, LE11 3TU, England R.Remenyte-Prescott@lboro.ac.uk
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 informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More information