An Anomaly Detection Method Based On Deep Learning
|
|
- Lee Sherman
- 5 years ago
- Views:
Transcription
1 Sed Orders for Reprits to 734 The Ope Automatio ad Cotrol Systems Joural, 05, 7, A Aomaly Detectio Method Based O Deep Learig Ope Access Hog-li Deg *, Tao yag ad Jiag-i Gao Chia West ormal Uiversity, achog Sichua, Chia Abstract: I order to overcome the difficulty of extractig features from ad improve the accuracy of aomaly detectio system, this paper proposes a ovel aomaly detectio method based o deep learig. We build a deep eural etwork with multiple hidde layers to automatically lear features of before detectig aomaly behaviors. The leared features from this etwork ca ehace the discrimiatio of differet behaviors. Moreover, a exactly auto-ecoder (ESAE) is proposed to achieve the pre-traiig of this etwork. This method does ot require maual extractio of features, ad is usupervised, avoidig the difficulty of providig labeled. Experimetal results show that the proposed method could sigificatly improve the detectio accuracy. Keywords: Deep learig, Aomaly detectio, Feature represetatio, Sparse auto-ecoder.. ITRODUCTIO Itrusio detectio techology [] is to prevet or reduce the threat of cyber-attacks, uder the coditio that the etwork performace is ot affected. It ca be divided ito misuse detectio ad aomaly detectio techology. Compared to misuse detectio, aomaly detectio ca detect ukow attacks, so researches get more attetios o that. At preset, most aomaly detectio methods ca be summarized as follows: all the istaces are represeted as poits accordig to their features (attributes), ad the the classic patter classificatio algorithms such as eural etwork, decisio tree, cluster aalysis ad Bayesia theory, support vector machie (SVM), K earest eighbor algorithm (K) are used to classify these poits [-4]. We ca see that these features are the raw materials of the classificatio system. Good features play a key role for improvig the accuracy of various aomaly detectio algorithms. Geoffrey Hito, professor of uiversity of Toroto, ad a leader i the field of machie learig, has published a paper i sciece [5] about deep learig, which poits out that deep has outstadig advatages o learig good features. The features leared by this ca represet with richer iformatio. The basic idea of this [6] is to stack multiple oliear fuctios, combiig low-level features to form more abstract ad more useful high-level features. It maps all the samples from their origial space ito a ew feature space which ca facilitate the classificatio. Therefore, i order to improve the performace of various aomaly detectio algorithms, we proposed to use deep to lear better ad richer features of before iputtig them ito aomaly detectio system. By buildig deep eural etwork with more hidde layers, the *Address correspodece to this author at the Shida Road, achog, Chia. Postcard: 63700; Tel: ; @qq.com features of origial are extracted automatically from the bottom to the top layer. Ad the these features are used as the iput of ay existig aomaly detectio algorithms. Good feature represetatio of origial will help improve the performace of most algorithms. Moreover, these represetatios are leared completely usupervised, overcomig the difficulty of lack of labeled. I order to validate the effectiveess of our method, two aomaly detectio algorithms based o this method were give. Experimetal results show that the features leared by deep ca sigificatly improve the detectio accuracy compared to origial aomaly detectio algorithms.. AOMALY DETECTIO ARCHITECUTRE BASED O DEEP LEARIG I this paper, we propose to lear the features of based o deep eural etworks. Istead of the attributes desiged artificially, these features leared from these etworks will be iput ito the classificatio to detect abormal behaviors. As show i Fig. (), this aomaly detectio method icludes two stages. Oe is the traiig phase (Fig. A), which icludes the traiig tasks for feature learig ad classificatio. The traiig of feature learig is carried out by usupervised method, while classificatio is traied with labeled. Well traied feature learig ca be directly applied to lear feature of ew. The classificatio here ca be ay aomaly detectio algorithm that ca be used for the classificatio, such as K, eural etwork ad SVM, ad so o. Data preprocessig i this phase is to execute stadardizatio ad ormalizatio of iput, as well as type coversio. Aother phase is aomaly detectio usig the well traied s before. As show i Fig. (B), whe we detect abormal behaviors, we first preprocess the iput, ad the the traied feature learig i first stage is used to lear the features of. Fially, these /5 05 Betham Ope
2 A Aomaly Detectio Method Based O Deep Learig The Ope Automatio ad Cotrol Systems Joural, 05, Volume features are iput to the classifier to predict ormal or abormal iformatio. frequetly-used pre-traiig method ad our improvemet o it. ulabeled preprocessig Feature learig traiig Ulabelled for classifyig Classifcatio result trai the feature learig classificatio traiig (A) Model traiig phase preprocessig Classificatio (B) Aomaly detectio phase labelled traiig set ad test set preprocessig feature learig features of traiig set ad test set trai ad test the classificatio classificatio Feature learig features Fig. (). Aomaly detectio process based o deep learig 3. RESEARCH METHOD From the sectio, we ca see that the mai task of our is how to trai a good feature learig. However, it is well kow that, the traiig of deep eural etwork has bee very difficult before 006. The obective fuctio, which has may local optimal values [5], is very hard to optimize. Whether or ot the etwork ca achieve the optimal solutio, the iitial parameter has a pivotal role. If the iitial value is ot good, eural etwork is easy to fall ito local optimum. Util 006, Geoffrey Hito put forward that the difficulty of traiig eural etwork ca be effectively overcome by "layer-wise traiig" [4]. Iitialize etwork oe layer after oe layer, ad fially form the iitial value of the etire etwork. This iitializatio will help the gradiet descet begi at a better iitial search poit, so as to coverge to better local optima. The process to get this iitializatio is the pre-traiig of the etwork. Therefore, most importat task of our work is to pretrai our deep eural etwork, so as to get oe better iitializatio. I this sectio, we will first itroduce the whole process of etwork traiig. The we will focus o oe 3.. Traiig Process The basic rule for traiig deep eural etwork is as follows: first pre-trai etwork by a usupervised traiig method (i.e., layer-wise traiig for iitializatio); the stack multiple layers that has bee iitialized to form a deep etwork; fially fie-tue this pre-traied deep etwork to get the feature learig. This paper follows the same priciple. The first step, also the most importat step, is to use ulabeled (labeled ca also be used) for pre-traiig etwork. This process of pre-traiig ca be described as follows: Algorithm : Startig from the layer (i = ) () Use the feature i layer i - (that value of layer is the origial ) as the iput to trai preset layer i, so as to lear the ecodig parameters at this layer W b, which are applied to get the features i the layer i ( h ). () Iput h to the ext layer, followed by the traiig of the ext layer. (3) Repeat () ad () to trai each layer i the etwork, util the last layer. The of layer is the iput of etire deep etwork, amely the origial. The features obtaied for the last layer are the output of deep feature learig, ad the W iput of the followig classifier. ad weight ad bias values of layer i respectively. 3.. Auto-ecoder () b i represet Existig pre-traiig methods iclude auto-ecoder (AE), restricted Boltzma machie (RBM), codig ad deep belief etwork (DB). I this paper, we use autoecoder, which is simple but useful for pre-traiig our deep feature learig. Auto-ecoder [8-0] usually cosists of two parts: ecoder ad decoder. Ecoder uses oliear mappig fuctio f to map iput ( ( h R m x R ) ito the represetatio i hidde layer ). The mappig is represeted as follows: h= f( x) = s ( Wx+ b) f The parameters of ecoder cotai a weight matrix (W) m of size m, ad a bias vector ( b R ). Decoder applies oliear mappig fuctio g to recostruct iput from the represetatio i hidde layer m ( h R ) to form r R. ()
3 736 The Ope Automatio ad Cotrol Systems Joural, 05, Volume 7 Deg et al. ' ' r = g( h) = sg ( W h+ b) () W is the weight matrix of decoder with size m b R s,, ad s are oliear ac- is its bias vector. The f g tivatio fuctios, which usually adopt sigmoid or tah fuctio. () etwork architecture Suppose that we have a ulabeled traiig set () () ( ) {,,, ( k) X = x x L x } of examples, x R represets a sample. Fig. () gives the structure of covetioal auto-ecoder eural etwork. $!!! $! %&!! # + + & ' ($ ) %! % $ % %&! % # L L L 3 Fig. (). etwork Architecture. i Here, circle represets euros. The euro with + is a bias uit. There are three layers i the etwork: the iput layer o the left, the output layer o the right ad oe hidde layer. Let l deotes the umber of layers, for example l =3, as show i Fig. (). We label l-th layer as L l. 3 3 The parameters of the etwork are θ = ( W, b, W, b ), l where w deotes the weight associated with the coectio betwee -th uit i layer l ad i-th uit i layer l+. l Also, b i is the bias associated with i-th uit i layer l+. The otatio r ( x ) θ is the activatio of euros at the output layer whe x is give as iput. This etwork tries to lear a approximatio of the idetity fuctio, i other words to make rθ ( x ) similar to x. The mappig from the iput of etwork to the value i hidde layer is to ecode iput, amely learig feature of that. Ad the the recostructio process from hidde layer to the output is to decode from the feature. Our goal is to make the output after decodig approach, the origial iput. The ecoded result (activatio vector of hidde layer) is the feature expressio of the iput. () Cost fuctio Usually, auto-ecoder eural etwork [8-0] is traied by usupervised learig algorithm, which uses the back propagatio algorithm to make the output (recostructio of iput) approach the iput. That is to say the traiig ob- r ( x ) x ective is makig θ. The traiig process is to search the best parameters of etwork to miimize the recostructio error o the traiig set ( D ). Therefore, the cost fuctio ca be simply represeted as: λ l JAE ( θ) = ( L( x, g( f( x)))) + ( Wi ) x D The first item is the recostructio error, which usually is squared-error fuctio: Lxr (,) ( x r) i (3) = (4) or the cross etropy cost fuctio Lxr (,) = xlog( r) + ( x)log( r) = I this paper, oe-half squared-error fuctio is used for traiig. I detail, for a traiig example x, we defie the cost fuctio with respect to this example to be: L( θ ; x ) = r ( x ) x i θ Give a traiig set of m examples, the overall cost fuctio is: λ J( θ; X) = L( ; x ) + ( W ) l sl sl+ ( k) l θ i k= l= i= = = + l sl sl ( k) ( k) λ l rθ ( x ) x + ( Wi) k= l= i= = The first item is the average squared-errors of all examples. The secod item is weight decay to decrease the magitude of the weights, so as to help prevet over fittig. λ is weight decay parameter used to cotrol the relative importace of the two items. θ is the parameters of etwork, icludig the weights ad biases i all the layers The Improved Pre-traiig Method I this paper, a exactly auto-ecoder (ESAE) eural etwork is proposed to pre-trai deep eural etworks. ESAE is similar to covetioal autoecoder except that ESAE will force the euros whose activatio approximates zero to exact zero, achievig exact sparsity of leared features Exactly Sparse Auto-ecoder Based o covetioal auto-ecoder, i this paper we try to lear exact feature of. It udermies that most of the hidde layer euros are exact zero, which is differet from the approximate zero i traditioal auto-ecoder. That makes some of hidde euros (5) (6) (7)
4 A Aomaly Detectio Method Based O Deep Learig The Ope Automatio ad Cotrol Systems Joural, 05, Volume are activated, while the activatio of other hidde euros equals zero, so as to make the average activatio of hidde euros i a small rage. I this paper, the activatio fuctio of euros is the sigmoid fuctio. () We use h ( x ) to deote the activatio of the -th euro at hidde layer give the iput sample x. The average values of that over all the samples i traiig set is defied to be: i= ( ) () ˆ ρ = h x Sparse auto-ecoder is to add oe sparsity pealty item to the overall cost fuctio to help lear more features. These features ca improve the discrimiatio of differet, so that the accuracy of classifier is icreased. This sparsity pealty item is represeted as: s = ρ ρ ρlog + ( ρ) log ˆ ρ ˆ ρ Where ρ is a sparsity parameter, usually a small value close to zero? The sparsity pealty item makes ˆ ρ close to ρ, so as to make the average activatio of euros eough. The the overall cost fuctio after addig sparsity pealty item is as follows: λ J ( θ; X) = r ( x ) x + ( W ) l sl sl+ ( k) ( k) l θ i k= l= i= = s ρ ρ + β ρlog + ( ρ) log = ˆ ρ ˆ ρ (8) (9) (0) This sparsity pealty item results i the activatio of part of euros i hidde layer approximatig zero, but they are still more tha zero. I order to achieve exact sparsity of leared feature, we set a threshold s for () ( ) h x. It forces the activatio of euros i hidde layer, which approximate zero, to equal to zero. We defie a threshold fuctio to be: thred h ( x ) () ( ) ( x ) ( x ) () 0, h < s = (), h s The, the fial activatio of hidde euros is: i ( ) ( x ) = ( x ) ( x ) ( ) ( ) h h thred( h ) () () Learig algorithm () () The learig algorithm is to fid the fial activatio of hidde euros (oe feature expressio of iput) through searchig the miimal J ( θ ; X). I this paper, we adopt the batch gradiet descet algorithm as follows: Algorithm : ) Compute the overall cost fuctio J ( θ ; X) Step : forward propagatio. Compute the activatios of every layer ( l) ( ) ( ) ( ) l l l l z = W a + b (3) ( ) ( l) ( l) = (4) a f z a deotes the activatio of layer l. of layer l. ( l) z is the et iput Step : compute the average activatio of every hidde euro usig formula (8) Step 3: apply formula (0) to compute the overall cost fuctio J ( θ ; X) ) Compute the gradiet of J ( ; X) every parameter ( ) ( θ l ; ) ad ( l) J ( θ; X) J X W 3) Update all the parameters ( l) ( l) W θ with respect to b ( l) ( θ) W = W α J (5) ( l) ( l) b = b α J (6) Where α is learig rate. ( l) ( θ) b 4) Repeat ) - 3) util our cost fuctio J ( ; X) small eough. θ is 5) Compute the iitial activatios of hidde euros through forward propagatio with the traied parameters of etwork 6) Compute the fial activatio of hidde euros accordig to formula () Usig this algorithm, we ca obtai oe feature expressio of iput. It becomes the iput sigal of the secod ESAE. Through miimizig the loss fuctio of secod ESAE, we ca get the secod expressio of the origial iput iformatio. Repeatig the above steps, we obtai several ESAR etworks. Stackig them will form a multilayer etwork, which is our feature learig. The parameters of each layer are the feature expressio extractors of raw iput at differet levels. They ca be used to obtai the feature of ew.
5 738 The Ope Automatio ad Cotrol Systems Joural, 05, Volume 7 Deg et al. 4. EXPERIMETS AD AALYSES 4.. Dataset We use Breast Cacer Wiscosi Data Set (BCW) [] to verify the effectiveess of this method. It icludes 699 istaces. Each istace has oe of possible classes: beig or maligat, deoted by its class label ad 4. There are totally 458 ad 4 istaces for each class respectively. Ad each istace is described by 9 differet attributes. Therefore, we represet oe istace as a poit i 9- dimesio space, ad all the poits belogig to class beig as self-set, others as oself set. This paper focuses o improvig the detectio accuracy for oself set. So we used all the i self-set ad 00 poits i oself as the traiig set, ad the remaiig 4 samples i oself as test set. 4.. Experimetal Setup I our experimets, the feature learig i this paper cotais two feature learig layers. It meas that we will lear two feature represetatios at differet levels. So i our experimets two ESAE eural etworks were pretraied to iitialize parameters of the two feature learig layers. Each ESAE eural etwork cotais three layers: the iput layer, hidde layer ad output layer. For the first ESAE, the size of iput layer (deoted ass ) is equal to the dimesio of the iput, that iss = 9. We set its hidde layer sizes = 0. Ad the output layer size equals the s = s = 9, because the umber of iput layer euros 3 represetatio at output layer is the recostructio of iput. The iput of secod ESAE is the feature leared from the first ESAE (amely the represetatio i hidde layer of the first ESAE). Therefore, the iput layer size of the secod etwork equals hidde layer size of first ESAE s = s = 0). The size of its hidde layer ad output ( ' layer is both set to 0. Other parameters are = 0.003, β = 3, ρ = 0.5, ad the threshold s=0.00. These parameters are chose because they worked well i our experimets. Features leared by well-traied feature learig are iput to other regular aomaly detectio algorithms. We have validated the effectiveess of these features o two algorithms: K algorithm ad multi-layer eural etwork (MLP) algorithm. Set the earest eighbor size K from to 00 for K algorithm. MLP etwork icludes three layers, the iput layer, oe hidde layer ad the output layer. The size of iput ad output layer is 9 ad respectively. Ad the hidde layer size chages from 0 to The Experimetal Results Aalyses All the experimetal results are average values of 0 repeated tests. Fig. (3) gives the variace of detectio rates for K ad improved K based o DL (DL_K) with differet eighbor sizes. It shows that almost all the detectio rates usig DL_K method are higher tha that of K algorithm. The best detectio rate of K method is 90.7 whe K equals 6, while that of DL_K algorithm is up to 97.6% (K = 0). Moreover, we foud that whe K approached 00, the detectio rate declied quickly. That is because, whe K is close to 00, the umber of samples belogig to oself (oly 00 istaces of this class i traiig set) is less tha or equal to that belogig to self-set i the collectio of K eighbors. Therefore, most of the istaces i test set were predicted to be self-set. But eve i this situatio, our method still achieved better results. For example whe K equals 00, K detectio rate is.3%, while our detectio rate is 3.48%. However, whe K is larger tha 00, samples of self-set are always more tha oself samples i earest eighbors. At this time the detectio rate of both equals to zero. Fig. (4) shows the results of compariso betwee MLP ad DL_MLP method. We ca see that the detectio rates of DL_MLP method are all higher tha that of MLP method. All the experimetal results show that the features leared by deep learig ca improve the detectio rates of various detectio algorithms sigificatly. Fig. (3). Compariso betwee K ad DL_K method. Fig. (4). Compariso betwee MLP ad DL_MLP method.
6 A Aomaly Detectio Method Based O Deep Learig The Ope Automatio ad Cotrol Systems Joural, 05, Volume COCLUSIO Aimig at overcomig the problems of learig good feature ad improvig the detectio accuracy i aomaly detectio system, this paper proposed a ew aomaly detectio algorithm. This method applied a improved deep feature learig based o exactly autoecoder to lear more useful features. These features help the traditioal aomaly detectio algorithm to obtai better detectio accuracy. To our kowledge, it is the first time to use the deep learig to extract the features of aomaly detectio. This method proposed i this paper overcomes some limitatios of classical aomaly detectio methods. The mai advatages of this method are: () It does ot eed artificial feature extractio. Artificial eural etwork with much more hidde layers has outstadig advatages i terms of feature learig. It ca automatically lear with full use of big to get useful features; () The deep trasforms from oe expressio to aother, which implemets the mappig of the samples from the origial space to the ew feature space. This trasformatio keeps richer iformatio of the origial, at the same time ehaces the ability to distiguish differet samples, ad accordigly improves the accuracy of aomaly detectio; (3) The feature learig is a completely usupervised traiig process, which makes full use of huge amouts of ulabeled that are easy to access, overcomig the difficulty to obtai labeled. COFLICT OF ITEREST The authors cofirm that this article cotet has o coflict of iterest. REFERECES [] Zhag Zhao, Zhag Ru-lia ad Jiag Xiao-ge, Aomaly detectio method based o feature selectio ad support vector machie, Computer egieerig ad desig, vol. 34 o. 9 pp , 36, 03. [] Guo Xiao-fag, Li Feg ad Wag Wei-dog, Local outlier detectio algorithm of multivariate time series based o k-earest eighbor, Joural of Jiagsu Uiversity of Sciece ad Techology, vol. 6, o. 5, pp , 0. [3] Hou Di-bo, Che Yue ad Zhao Hai-feg, Water quality aomaly detectio method based o RBF eural etwork ad wavelet aalysis, Trasducer ad Microsystem Techologies, vol. 3, o., pp. 38-4, 03. [4] Qua Liag-liag ad WU Wei-dog, Aomaly detectio based o support vector machie ad Bayesia classificatio, Joural of Computer Applicatios vol. 3, o. 6, pp [5] Hito G ad Salakhutdiov R, Reducig the dimesioality of with eural etwork Sciece, vol. 33, o. 5786, pp , 006. [6] Yu Kai, Jia Lei ad Che Yuqiag, Deep Learig: Yesterday, Today, ad Tomorrowvol. 50, o. 9, pp , 03. [7] Begio Y. Learig deep architectures for AI, Foudatios ad treds i Machie Learig, vol., o., pp. -7, 009. [8] Rifai S, Vicet P ad Muller X. Cotractive auto-ecoders: Explicit ivariace durig feature extractio. Proceedigs of the 8th Iteratioal Coferece o Machie Learig (ICML-), 0: [9] Begio Y. Deep learig of represetatios: Lookig forward, Statistical Laguage ad Speech Processig. Spriger Berli Heidelberg, 03: pp [0] Begio Y, Courville A ad Vicet P, Represetatio learig: A review ad ew perspectives, Patter Aalysis ad Machie Itelligece, IEEE Trasactios o, vol. 35, o. 8, pp , 03. [] cosi+%8origial%9 ACKOWLEDGEMETS This study was supported by the proect grat from the Sciece ad Techology Departmet of SiChua Provice, Chia. o. 5ZB047 ad o. 5ZB04. Received: May 6, 05 Revised: July 4, 05 Accepted: August 0, 05 Deg et al.; Licesee Betham Ope. This is a ope access articles licesed uder the terms of the Creative Commos Attributio-o-Commercial 4.0 Iteratioal Public Licese (CC BY-C 4.0) ( which permits urestricted, o-commercial use, distributio ad reproductio i ay medium, provided that the work is properly cited.
ANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationStudy on effective detection method for specific data of large database LI Jin-feng
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 205) Study o effective detectio method for specific data of large database LI Ji-feg (Vocatioal College of DogYig, Shadog
More informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationIntrusion Detection using Fuzzy Clustering and Artificial Neural Network
Itrusio Detectio usig Fuzzy Clusterig ad Artificial Neural Network Shraddha Suraa Research Scholar, Departmet of Computer Egieerig, Vishwakarma Istitute of Techology, Pue Idia shraddha.suraa@gmail.com
More informationDesigning a learning system
CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please
More informationJournal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article
Available olie www.jocpr.com Joural of Chemical ad Pharmaceutical Research, 2013, 5(12):745-749 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 K-meas algorithm i the optimal iitial cetroids based
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationx x 2 x Iput layer = quatity of classificatio mode X T = traspositio matrix The core of such coditioal probability estimatig method is calculatig the
COMPARATIVE RESEARCHES ON PROBABILISTIC NEURAL NETWORKS AND MULTI-LAYER PERCEPTRON NETWORKS FOR REMOTE SENSING IMAGE SEGMENTATION Liu Gag a, b, * a School of Electroic Iformatio, Wuha Uiversity, 430079,
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationEuclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process
Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig
More informationAn improved support vector machine based on particle swarm optimization in laser ultrasonic defect detection
A improved support vector machie based o particle swarm optimizatio i laser ultrasoic defect detectio School of Sciece, North Uiversity of Chia, aiyua, Shaxi 35, Chia xut98@63.com,hhp9@63.com,xywag@6.com,43497@qq.com
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationAdministrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today
Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationA new algorithm to build feed forward neural networks.
A ew algorithm to build feed forward eural etworks. Amit Thombre Cetre of Excellece, Software Techologies ad Kowledge Maagemet, Tech Mahidra, Pue, Idia Abstract The paper presets a ew algorithm to build
More informationInvestigating methods for improving Bagged k-nn classifiers
Ivestigatig methods for improvig Bagged k-nn classifiers Fuad M. Alkoot Telecommuicatio & Navigatio Istitute, P.A.A.E.T. P.O.Box 4575, Alsalmia, 22046 Kuwait Abstract- We experimet with baggig knn classifiers
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationThe Research Based on Fuzzy Sliding Mode Control for Linear Double. Inverted Pendulum
Advaced Materials Research Olie: 04-05-3 ISSN: 66-8985, Vols. 96-930, pp 463-467 doi:0.408/www.scietific.et/amr.96-930.463 04 Tras Tech Publicatios, Switzerlad The Research Based o Fuzzy Slidig Mode Cotrol
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationEvaluation of Support Vector Machine Kernels for Detecting Network Anomalies
Evaluatio of Support Vector Machie Kerels for Detectig Network Aomalies Prera Batta, Maider Sigh, Zhida Li, Qigye Dig, ad Ljiljaa Trajković Commuicatio Networks Laboratory http://www.esc.sfu.ca/~ljilja/cl/
More informationLecture 13: Validation
Lecture 3: Validatio Resampli methods Holdout Cross Validatio Radom Subsampli -Fold Cross-Validatio Leave-oe-out The Bootstrap Bias ad variace estimatio Three-way data partitioi Itroductio to Patter Recoitio
More informationPruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c
Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationThe identification of key quality characteristics based on FAHP
Iteratioal Joural of Research i Egieerig ad Sciece (IJRES ISSN (Olie: 2320-9364, ISSN (Prit: 2320-9356 Volume 3 Issue 6 ǁ Jue 2015 ǁ PP.01-07 The idetificatio of ey quality characteristics based o FAHP
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationA Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System
A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality
More informationWe are IntechOpen, the first native scientific publisher of Open Access books. International authors and editors. Our authors are among the TOP 1%
We are ItechOpe, the first ative scietific publisher of Ope Access books 3,350 108,000 1.7 M Ope access books available Iteratioal authors ad editors Dowloads Our authors are amog the 151 Coutries delivered
More informationCriterion in selecting the clustering algorithm in Radial Basis Functional Link Nets
WSEAS TRANSACTIONS o SYSTEMS Ag Sau Loog, Og Hog Choo, Low Heg Chi Criterio i selectig the clusterig algorithm i Radial Basis Fuctioal Lik Nets ANG SAU LOONG 1, ONG HONG CHOON 2 & LOW HENG CHIN 3 Departmet
More informationLip Contour Extraction Based on Support Vector Machine
Lip Cotour Extractio Based o Support Vector Machie Author Pa, Xiaosheg, Kog, Jiagpig, Liew, Ala Wee-Chug Published 008 Coferece Title CISP 008 : Proceedigs, First Iteratioal Cogress o Image ad Sigal Processig
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationAnalysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve
Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao
More informationImage based Cats and Possums Identification for Intelligent Trapping Systems
Volume 159 No, February 017 Image based Cats ad Possums Idetificatio for Itelliget Trappig Systems T. A. S. Achala Perera School of Egieerig Aucklad Uiversity of Techology New Zealad Joh Collis School
More informationA Comparative Study on Modeling Methods for Switched Reluctance Machines
Computer ad Iformatio Sciece Vol. 3, No. 2; May 21 A Comparative Study o Modelig Methods for Switched Reluctace Machies Shouju Sog & Weiguo iu School of Automatio, Northwester Polytechical Uiversity PO
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More informationDeep Joint Discriminative Learning for Vehicle Re-identification and Retrieval
Deep Joit Discrimiative Learig for Vehicle Re-idetificatio ad Retrieval Yuqi Li, Yaghao Li, Hogfei Ya, Jiayig Liu Pekig Uiversity 2017.09.18 Deep Joit Discrimiative Learig for Vehicle Re-idetificatio ad
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationarxiv: v1 [cs.cv] 18 Jan 2019
Geerative Adversarial Classifer for Hadwritig Characters Super-Resolutio Zhuag QA Kaizhu HUAG Qiufeg WAG Jimi XAO Rui ZHAG arxiv:1901.06199v1 [cs.cv] 18 Ja 2019 Abstract Geerative Adversarial etworks GA)
More informationMOTIF XF Extension Owner s Manual
MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationText Feature Selection based on Feature Dispersion Degree and Feature Concentration Degree
Available olie at www.ijpe-olie.com vol. 13, o. 7, November 017, pp. 1159-1164 DOI: 10.3940/ijpe.17.07.p19.11591164 Text Feature Selectio based o Feature Dispersio Degree ad Feature Cocetratio Degree Zhifeg
More informationCSCI 5090/7090- Machine Learning. Spring Mehdi Allahyari Georgia Southern University
CSCI 5090/7090- Machie Learig Sprig 018 Mehdi Allahyari Georgia Souther Uiversity Clusterig (slides borrowed from Tom Mitchell, Maria Floria Balca, Ali Borji, Ke Che) 1 Clusterig, Iformal Goals Goal: Automatically
More informationData-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps
Data-Drive Noliear Hebbia Learig Method for Fuzzy Cogitive Maps Wociech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy Cogitive Maps (FCMs) are a coveiet tool for modelig of dyamic systems by meas
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationSearching a Russian Document Collection Using English, Chinese and Japanese Queries
Searchig a Russia Documet Collectio Usig Eglish, Chiese ad Japaese Queries Fredric C. Gey (gey@ucdata.berkeley.edu) UC Data Archive & Techical Assistace Uiversity of Califoria, Berkeley, CA 94720 USA ABSTRACT.
More informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
More informationText Summarization using Neural Network Theory
Iteratioal Joural of Computer Systems (ISSN: 2394-065), Volume 03 Issue 07, July, 206 Available at http://www.ijcsolie.com/ Simra Kaur Jolly, Wg Cdr Ail Chopra 2 Departmet of CSE, Ligayas Uiversity, Faridabad
More informationApplication of Decision Tree and Support Vector Machine for Inspecting Bubble Defects on LED Sealing Glue Images
66 Applicatio of Decisio Tree ad Support Vector Machie for Ispectig Bubble Defects o LED Sealig Glue Images * Chua-Yu Chag ad Yi-Feg Li Abstract Bubble defect ispectio is a importat step i light-emittig
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationSectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work
200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval
More informationA Method of Malicious Application Detection
5th Iteratioal Coferece o Educatio, Maagemet, Iformatio ad Medicie (EMIM 2015) A Method of Malicious Applicatio Detectio Xiao Cheg 1,a, Ya Hui Guo 2,b, Qi Li 3,c 1 Xiao Cheg, Beijig Uiv Posts & Telecommu,
More informationThe Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationStone Images Retrieval Based on Color Histogram
Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose
More informationBayesian Network Structure Learning from Attribute Uncertain Data
Bayesia Network Structure Learig from Attribute Ucertai Data Wetig Sog 1,2, Jeffrey Xu Yu 3, Hog Cheg 3, Hogya Liu 4, Ju He 1,2,*, ad Xiaoyog Du 1,2 1 Key Labs of Data Egieerig ad Kowledge Egieerig, Miistry
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationOur Learning Problem, Again
Noparametric Desity Estimatio Matthew Stoe CS 520, Sprig 2000 Lecture 6 Our Learig Problem, Agai Use traiig data to estimate ukow probabilities ad probability desity fuctios So far, we have depeded o describig
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationDATA MINING II - 1DL460
DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,
More informationOur second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.
Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationNormal Distributions
Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,
More informationISSN (Print) Research Article. *Corresponding author Nengfa Hu
Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More informationRESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE
RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE Z.G. Zhou, S. Zhao, ad Z.G. A School of Mechaical Egieerig ad Automatio, Beijig Uiversity of Aeroautics ad Astroautics,
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationLow Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 6 Special Issue o Logistics, Iformatics ad Service Sciece Sofia 2015 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI:
More informationProbabilistic Fuzzy Time Series Method Based on Artificial Neural Network
America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag
More informationResearch Article An Improved Metric Learning Approach for Degraded Face Recognition
Mathematical Problems i Egieerig, Article ID 74978, 10 pages http://dxdoiorg/101155/014/74978 Research Article A Improved Metric Learig Approach for Degraded Face Recogitio Guofeg Zou, 1 Yuayua Zhag, 1
More informationA METHOD OF GENERATING RULES FOR A KERNEL FUZZY CLASSIFIER
Proceedigs of the Sixth Iteratioal Coferece o Machie Learig ad Cyberetics, Hog Kog, 9- August 7 A METHOD OF GENERATING RULES FOR A KERNEL FUZZY CLASSIFIER AI-MIN YANG,, XIN-GUANG LI, LING-MIN JIANG,YONG-MEI
More informationWeb Text Feature Extraction with Particle Swarm Optimization
32 IJCSNS Iteratioal Joural of Computer Sciece ad Network Security, VOL.7 No.6, Jue 2007 Web Text Feature Extractio with Particle Swarm Optimizatio Sog Liagtu,, Zhag Xiaomig Istitute of Itelliget Machies,
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationFuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter
Fuzzy Membership Fuctio Optimizatio for System Idetificatio Usig a Eteded Kalma Filter Srikira Kosaam ad Da Simo Clevelad State Uiversity NAFIPS Coferece Jue 4, 2006 Embedded Cotrol Systems Research Lab
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More information(3) The denominator is ineffective for making decisions. Because C is the same for all values.on the other hand due to our independent feature set
ORIGINAL ARTICLE Received 17 Ja. 2014 Accepted 30 Ja. 2014 2014, Sciecelie Publicatio www.sciece-lie.com 2322-5114 Joural of World s Electrical Egieerig ad Techology J. World. Elect. Eg. Tech. 3(1): 01-05,
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationLearning to Shoot a Goal Lecture 8: Learning Models and Skills
Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.
More informationWavelet Transform. CSE 490 G Introduction to Data Compression Winter Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual)
Wavelet Trasform CSE 49 G Itroductio to Data Compressio Witer 6 Wavelet Trasform Codig PACW Wavelet Trasform A family of atios that filters the data ito low resolutio data plus detail data high pass filter
More informationLDA-based Non-negative Matrix Factorization for Supervised Face Recognition
1294 JOURNAL OF SOFTWARE, VOL. 9, NO. 5, MAY 2014 LDA-based No-egative Matrix Factorizatio for Supervised Face Recogitio Yu Xue a, Chog Sze Tog b, Jig Yu Yua c a School of Physics ad Telecommuicatio Egieerig,
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationFace Anti-spoofing based on Deep Stack Generalization Networks
Xi Nig,, Weiju Li,, Meili Wei, Liju Su, ad Xiaoli Dog, Istitute of Semicoductors, Chiese Academy of Scieces, 00083, Beijig, Chia Cogitive Computig Techology Wave Joit Lab, 00083, Beijig, Chia Keywords:
More information