Parallel Implementation of Classification Algorithms Based on Cloud Computing Environment
|
|
- Ruth Robertson
- 5 years ago
- Views:
Transcription
1 TELKOMNIKA, Vol.10, No.5, September 2012, pp. 1087~1092 e-issn: X accredted by DGHE (DIKTI), Decree No: 51/Dkt/Kep/ Parallel Implementaton of Classfcaton Algorthms Based on Cloud Computng Envronment Ljuan Zhou, Hu Wang, Wenbo Wang Captal Normal Unversty, Informaton Engneerng College, Bejng, Chna, e-mal: Abstract As an mportant task of data mnng, Classfcaton has been receved consderable attenton n many applcatons, such as nformaton retreval, web searchng, etc. The enlargng volumes of nformaton emergng by the progress of technology and the growng ndvdual needs of data mnng, makes classfyng of very large scale of data a challengng task. In order to deal wth the problem, many researchers try to desgn effcent parallel classfcaton algorthms. Ths paper ntroduces the classfcaton algorthms and cloud computng brefly, based on t analyses the bad ponts of the present parallel classfcaton algorthms, then addresses a new model of parallel classfyng algorthms. And t manly ntroduces a parallel Naïve Bayes classfcaton algorthm based on MapReduce, whch s a smple yet powerful parallel programmng technque. The expermental results demonstrate that the proposed algorthm mproves the orgnal algorthm performance, and t can process large datasets effcently on commodty hardware. Keywords: Naïve Bayes, Classfcaton, MapReduce, Hadoop Copyrght 2012 Unverstas Ahmad Dahlan. All rghts reserved. 1. Introducton Now, the rapd growth of the Internet and World Wde Web has led to vast amounts of nformaton avalable onlne consdered as Bg Data. The storng, managng, accessng, and processng of ths vast amount of data represents a fundamental need and an mmense challenge n order to satsfy needs to search, analyse, mne, and vsualze ths data as nformaton. Effcent parallel classfcaton algorthms and mplementaton technques are the key to meetng the scalablty and performancerequrements entaled n such scentfc data analyses. So far, several researchers have proposed some parallel classfcaton algorthms. All these parallel classfcaton algorthms have the followng flaws [1]: a) they all assume that all objects can bde n memory smultaneously; b) The parallel systems have offered restrcted programmng models and used the restrctons to parallelze the computaton automatcally. Both assumptons are prohbtve for the datasets composed wth mllons of objects. Therefore, dataset orented parallel classfyng algorthms should be developed. And the parallel algorthms should run on tens, hundreds, or even thousands of servers. For the emergence of cloud computng, parallel technques are able to solve more challengng problems, such as heterogenety and frequent falures. Cloud computng archtectures whch can support data parallel applcatons are a potental soluton to the terabyte and petabyte scale data processng requrements of Bg Data computng [2]. And several solutons have emerged ncludng the MapReduce archtecture poneered by Google and now avalable n an open-source mplementaton called Hadoop used by Yahoo, Facebook, and others. In ths paper, we adapt classfcaton algorthms n MapReduce framework whch s mplemented by Hadoop to make the classfyng method applcable to large scale data. We conduct comprehensve experments to evaluate the proposed algorthm by actual datasets. The results demonstrate that the effcency of the proposed algorthm s hgher than the ntal algorthm. The rest of the paper s organzed as follows. Secton 2 ntroduces MapReduce. Secton 3 presents the parallel Naïve Bayes algorthm based on MapReduce framework. Secton 4 shows expermental results and evaluatons. Fnally, the conclusons and future work are presented n Secton 5. Receved June 7, 2012; Revsed September 2, 2012; Accepted September 11, 2012
2 1088 e-issn: X 2. MapReduce Overvew MapReduce s a software framework ntroduced by Google n 2004 to support dstrbuted computng on large data sets on clusters of computers. The MapReduce programmng mode s desgned to compute large volumes of data n a parallel fashon [3]. The model dvdes the workload across the cluster. It dvdes the nput nto nput splts. When clents submt a job to the framework, a sngle map processes an nput splt. And each splt s dvded nto records; the map processes each record n turn. The clent does not need to deal wth InputSplts drectly, because they are created by an InputFormat. An InputFormat s responsble for creatng the nput splts and dvdng them nto records. The framework assgns one splt to each map functon. The JobTracker pushes work out to avalable TaskTracker nodes n the cluster, strvng to keep the work as close to the data as possble by the rack-aware fle system. The TaskTracker wll process records n turn. The MapReduce framework makes the guarantee that the nput to every reducer s sorted by key. The process performs the sort and transfers the map outputs to the reducers as nputs known as the shuffle. The map functon not smply wrtes ts output to dsk. The process takes advantage of bufferng wrtten n memory and dong some pre-sortng for effcency reasons. Fgure 1 shows what happens. Input HDF S Map Task Splt Map Splt 0 Splt 1 Splt 2 Map Splt 3 Splt 4 Map Buffer n memory Partton sort and splt to dsk Merge on dsk Other maps Reduce Task Other reduce merge Reduce Out put merge Reduce Fgure 1. The framework of MapReduce 3. Parallel Nave Bayes Algorthm Based on MapReduce In ths secton we present the man desgn for Parallel Naïve Bayes based on MapReduce. Frstly, we gve a bref overvew of Naïve Bayes algorthm and analyse the parallel parts and seral parts n the algorthms. Then we explan how the necessary computatons can be formalzed as map and reduce operatons n detal Naïve Bayes Algorthm Naïve Bayes s a statstcal classfcaton method. It s a well-studed probablstc algorthm whch often used n classfcatons. It uses the knowledge of probablty and statstcs for classfcaton. Studes comparng classfcaton algorthms have found Naïve Bayes s comparable n performance wth decson tree and selected neural network classfers. Naïve Bayes have also exhbted hgh accuracy and speed when appled to large databases. The Naïve Bayes classfer assumes that the presence of a partcular feature of a class s unrelated TELKOMNIKA Vol. 10, No. 5, September 2012:
3 TELKOMNIKA e-issn: X 1089 to the presence of any other features on a gven the class varable. Ths assumpton s called class condtonal ndependence. To demonstrate the concept of Naïve Bayes Classfcaton, consder the knowledge of statstcs. Let Y be the classfcaton attrbute and X{x1,x2,,xk} be the vector valued array of nput attrbutes, the classfcaton problem smplfes to estmatng the condtonal probablty P( Y X ) from a set of tranng patterns. P( Y X ) s the posteror probablty, and P( Y ) s the pror probablty. Suppose that there are m classes, Y1, Y2 Ym. Gven a tuple X, the classfer wll predct that X belongs to the class havng the hghest posteror probablty. The Naïve Bayes classfer predcts that tuple X belongs to the class Y f and only f P( Y X ) P( Y X ) j The Bayes rule states that ths probablty can be expressed as the formulaton (1) P( Y X ) P( X Y ) P( Y ) P( X ) = (2) As P( X ) s constant for all classes, only P( X Y ) P( Y ) needs be maxmzed. The pror probabltes are estmated by the probablty of Y n the tranng set. In order to reduce computaton n evaluatng P( X Y ), the Naïve Bayes assumpton of class condtonal ndependence s made. So the equaton can be wrtten nto the form of n P( X Y ) P( x Y ) = (3) k k = 1 and we easly estmate the probabltes P( X1 Y ), P( X 2 Y ),, P( X k Y ) from the tranng tuples. The predcted class label s the class Y for whch P( X Y ) P( Y ) s the maxmum Naïve Bayes Based on MapReduce Cloud Computng can be defned as a provson through the Internet of all computng servces. It s the most advanced verson of the clent-server archtecture and takes the system to a very hgh level of resource whch s sharng and scalng. The resource pools composed of a large number of computng resources whch are used to create hghly vrtualzed resources dynamcally for users. But for the analyss task of massve data, the cloud platform lack parallel mplementaton of massve data mnng and analyss algorthms [4]. Therefore, a new cloud computng model of massve data mnng ncludes the pre-processng for huge amounts of data, cloud computng for massve parallel data mnng algorthms, the new massve data mnng methods and so on [5]. The crtcal problem of the massve data mnng s the algorthm parallelzaton of data mnng. Cloud computng uses the new computng model known as MapReduce, whch means that the exstng data mnng algorthms and parallel strateges cannot be appled drectly to cloud computng platform for massve data mnng, so some transformaton must be done. Based on ths, for the characterstcs of massve data mnng algorthms, the cloud computng model has been optmzed and expanded to make t more sutable for massve data mnng [6]. Therefore, ths paper adopts the Hadoop dstrbuted system nfrastructure, whch provdes the storage capacty of HDFS and the computng capablty of MapReduce to mplement parallel classfcaton algorthms. The mplementaton of the parallel Naïve Bayes s MapReduce model s dvded nto tranng and predcton stages Tranng Stage The dstrbuted computng of Hadoop s dvded nto two phases whch are called Map and Reduce. Frst, the InputFormat whch s belonged to the Hadoop framework loads the nput data nto small data blocks known as data fragmentaton, and the sze of each data Parallel Implementaon of Classfcaton Algorhtms based on Computng (Ljuan Zhou)
4 1090 e-issn: X fragmentaton s 5M, and the length of all of them s equal, and each splt s dvded nto records. Each map processes a sngle splt, and the map task passes the splt to the get RecordReader() method on InputFormat to gan a RecordReader for that splt. The RecordReader s terators of the records. Then the map task uses a RecordReader to generate record key-value pars, whch passes to the map functon. Secondly, the map functon statstcs the categores and propertes of the nput data, ncludng the values of categores and propertes. The attrbutes and categores of the nput records are separated by a comma, and the fnal attrbute s the property of classfcaton. Fnally, the reduce functon aggregates the number of each attrbute and category value, whch results n the form of (category, Index1:count1, Index2:count2, Index3:count3,, Indexn:countn), and then output the tranng model. Its mplementaton s descrbed as follows. Algorthm Produce Tranng: map(key, value) Input: the tranng dataset Output: <key, value > par, where key s the category, and value the frequency of attrbute value 1 FOR each sample DO BEGIN 2 Parse the category and the value of each attrbute 3 count thefrequence of the attrbutes 4 FOR each attrbute value DO BEGIN Take the label as key, andattrbute ndex: the frequence 5 of the attrbute value as value 6 Output<key, value > 7 END 8 END Algorthm Produce Tranng: reduce(key, value) Input: the key and value output by map functon Output: <key,value > par, where key s the lable, and value the result of frequency of attrbute values 1 sum 0 2 FOR each attrbute value DO BEGIN 3 sum+=value.next.get() 4 END 5 Take key as key, and sum as value 6 output<key, value > Predcton Stage Predcate the data record wth the output of the tranng model. The mplementaton of the algorthm s stated as follows: frst, use the statstcal values of attrbute values and category values to tran the unlabeled record. In addton, use the dstrbuted cache to mprove the effcency of the algorthm n the processon of the algorthm mplementaton. Its mplementaton s descrbed as follows. Algorthm Produce Testng: map (key,value) Input: the test dataset and the Nave Bayes Model Output: the labels of the samples 1 modeltype newmodeltype() 2 categores modeltype.getcategorys() 3 FOR each attrbute value not NULL DO BEGIN 4 Obtan one category from categores 5 END FOR 6 FOR each attrbute value DO BEGIN 7 FOR each category value DO BEGIN 8 pct counter(attrbute,category)/counter(category) 9 result result*pct 10 END FOR 11 END FOR 12 Take the category of the max result as key, and the max result as value 13 output<key,value > TELKOMNIKA Vol. 10, No. 5, September 2012:
5 TELKOMNIKA e-issn: X Expermental Results In ths secton, we perform some preparatory experments to test the effcency and scalablty of parallel Naïve Bayes algorthm proposed n ths paper. We buld a small cluster wth 3 busness machnes (1 master and 2 slaves) on Lnux, and each machne has two cores wth 3.10GHz, 4GB memory, and 500GB dsk. We use the Hadoop verson and java verson 1.6.0_26. We use the UCI data sets to verfy the results. Expermental data sets are shown n Table one. Table 1. The expermental data sets Data sets Number of samples Dmenson Numbers of categores 1 Wne Vertebral Bank-data Car Abalone Adult PokerHand Frst, the pre-treatment over the above data sets must be done, all property types normalzed to nomnal attrbutes. Then, the Naïve Bayes classfer mplemented by the MapReduce trans the tranng data sets to generate the classfy model, and then use the model to classfy the removed category samples. The experment s run on the cluster composed wth three machnes, and the results s shown n Fgure 2, compared wth the general method of test results. Fgure 2. Executng tme wth dfferent szes The comparng experment shows that the performance of the mproved algorthms s hgher than the general methods wth large data set. And ths verfes the Bayesan algorthm runs on the cloud envronment s more effcent than the tradtonal Bayesan algorthm. However, due to the sze of data szes, attrbutes, and the number of dfferent categores, the tme that the algorthm spent s not appear a lnear relatonshp. Snce runnng Hadoop jobs, start the cluster frst whch takes a lttle of tme, so when the sze of data set s smaller, the data processng tme s relatvely longer. And ths also verfed the Hadoop s perfect to process huge amounts of data. Parallel Implementaon of Classfcaton Algorhtms based on Computng (Ljuan Zhou)
6 1092 e-issn: X 5. Conclusons As data classfyng has attracted a sgnfcant amount of research attenton, many classfcaton algorthms have been proposed n the past decades. However, the enlargng data n applcatons makes classfyng of very large scale of data a challengng task. In ths paper, we propose a fast parallel Naïve Bayes algorthm based on MapReduce, whch has been wdely embraced by both academa and ndustry. Preparatory experments show that the parallel algorthms can not only process large datasets, but also enhance the effcency of the algorthm. In the future work, we wll further mplement other classfcaton algorthms and conduct the experments and consummate the parallel algorthms to mprove usage effcency of computng resources. Acknowledgements Ths research was supported by Chna Natonal Key Technology R&D Program (2012BAH20B03), Natonal Nature Scence Foundaton ( ), Bejng Nature Scence Foundaton ( ), Bejng Nature Scence Foundaton ( ), and Bejng Educatonal Commttee scence and technology development plan project (KM ), "The computer applcaton technology" Bejng muncpal key constructon of the dscplne. References [1] Wezhong Zhao, Hufang Ma and Qng He. Parallel K-Means Clusterng Based on MapReduce. Lecture Notes n Computer Scence. 2009; 5931: [2] A Pavlo, E Paulson. A Comparson of Approaches to Large-Scale Data Analyss. Proc. ACM SIGMOD. 2009: [3] Jeffrey Dean and Sanjay Ghemawar. MapReduce: Smplfed Data Processng on Large Clusters. In OSDI. 2004: [4] Jalya Ekanayake and Shrdeep Pallckara. MapReduce for Data Intensve Scentfc Analyss. IEEE escence, 2008: [5] C. Chu, S. Km, et, al. Map-reduce for Machne Learnng on Multcore. In NIPS 07: Proceedngs of Twenty-Frst Annual Conference on Neural Informaton Processng Systems. [6] Qng He, FuzhenZhuang, Jncheng L and Zhongzh Sh, Parallel Implementaton of Classfcaton Algorthms Based on MapReduce, Lecture Notes n Computer Scence. 2010; 6401: TELKOMNIKA Vol. 10, No. 5, September 2012:
The 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 informationImplementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status
Internatonal Journal of Appled Busness and Informaton Systems ISSN: 2597-8993 Vol 1, No 2, September 2017, pp. 6-12 6 Implementaton Naïve Bayes Algorthm for Student Classfcaton Based on Graduaton Status
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 informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More 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 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 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 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 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 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 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 informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
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 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 informationParallelization of a Series of Extreme Learning Machine Algorithms Based on Spark
Parallelzaton of a Seres of Extreme Machne Algorthms Based on Spark Tantan Lu, Zhy Fang, Chen Zhao, Yngmn Zhou College of Computer Scence and Technology Jln Unversty, JLU Changchun, Chna e-mal: lutt1992x@sna.com
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More 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 informationAssociation Rule Mining with Parallel Frequent Pattern Growth Algorithm on Hadoop
Assocaton Rule Mnng wth Parallel Frequent Pattern Growth Algorthm on Hadoop Zhgang Wang 1,2, Guqong Luo 3,*,Yong Hu 1,2, ZhenZhen Wang 1 1 School of Software Engneerng Jnlng Insttute of Technology Nanng,
More informationRemote Sensing Image Retrieval Algorithm based on MapReduce and Characteristic Information
Remote Sensng Image Retreval Algorthm based on MapReduce and Characterstc Informaton Zhang Meng 1, 1 Computer School, Wuhan Unversty Hube, Wuhan430097 Informaton Center, Wuhan Unversty Hube, Wuhan430097
More informationCSCI 5417 Information Retrieval Systems Jim Martin!
CSCI 5417 Informaton Retreval Systems Jm Martn! Lecture 11 9/29/2011 Today 9/29 Classfcaton Naïve Bayes classfcaton Ungram LM 1 Where we are... Bascs of ad hoc retreval Indexng Term weghtng/scorng Cosne
More informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
More informationScheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research
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 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 informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationA 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 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 informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationTwo-Stage Data Distribution for Distributed Surveillance Video Processing with Hybrid Storage Architecture
Two-Stage Data Dstrbuton for Dstrbuted Survellance Vdeo Processng wth Hybrd Storage Archtecture Yangyang Gao, Hatao Zhang, Bngchang Tang, Yanpe Zhu, Huadong Ma Bejng Key Lab of Intellgent Telecomm. Software
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More 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 informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More 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 informationToday s Outline. Sorting: The Big Picture. Why Sort? Selection Sort: Idea. Insertion Sort: Idea. Sorting Chapter 7 in Weiss.
Today s Outlne Sortng Chapter 7 n Wess CSE 26 Data Structures Ruth Anderson Announcements Wrtten Homework #6 due Frday 2/26 at the begnnng of lecture Proect Code due Mon March 1 by 11pm Today s Topcs:
More informationInvestigating the Performance of Naïve- Bayes Classifiers and K- Nearest Neighbor Classifiers
Journal of Convergence Informaton Technology Volume 5, Number 2, Aprl 2010 Investgatng the Performance of Naïve- Bayes Classfers and K- Nearest Neghbor Classfers Mohammed J. Islam *, Q. M. Jonathan Wu,
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationApplication of VCG in Replica Placement Strategy of Cloud Storage
Internatonal Journal of Grd and Dstrbuted Computng, pp.27-40 http://dx.do.org/10.14257/jgdc.2016.9.4.03 Applcaton of VCG n Replca Placement Strategy of Cloud Storage Wang Hongxa Computer Department, Bejng
More informationOntology Generator from Relational Database Based on Jena
Computer and Informaton Scence Vol. 3, No. 2; May 2010 Ontology Generator from Relatonal Database Based on Jena Shufeng Zhou (Correspondng author) College of Mathematcs Scence, Laocheng Unversty No.34
More informationA fast algorithm for color image segmentation
Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au
More informationDeep Classification in Large-scale Text Hierarchies
Deep Classfcaton n Large-scale Text Herarches Gu-Rong Xue Dkan Xng Qang Yang 2 Yong Yu Dept. of Computer Scence and Engneerng Shangha Jao-Tong Unversty {grxue, dkxng, yyu}@apex.sjtu.edu.cn 2 Hong Kong
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 informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
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 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 informationPERFORMANCE EVALUATION FOR SCENE MATCHING ALGORITHMS BY SVM
PERFORMACE EVALUAIO FOR SCEE MACHIG ALGORIHMS BY SVM Zhaohu Yang a, b, *, Yngyng Chen a, Shaomng Zhang a a he Research Center of Remote Sensng and Geomatc, ongj Unversty, Shangha 200092, Chna - yzhac@63.com
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 informationAn Anti-Noise Text Categorization Method based on Support Vector Machines *
An Ant-Nose Text ategorzaton Method based on Support Vector Machnes * hen Ln, Huang Je and Gong Zheng-Hu School of omputer Scence, Natonal Unversty of Defense Technology, hangsha, 410073, hna chenln@nudt.edu.cn,
More informationA Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures
A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School
More informationFuzzy Modeling of the Complexity vs. Accuracy Trade-off in a Sequential Two-Stage Multi-Classifier System
Fuzzy Modelng of the Complexty vs. Accuracy Trade-off n a Sequental Two-Stage Mult-Classfer System MARK LAST 1 Department of Informaton Systems Engneerng Ben-Guron Unversty of the Negev Beer-Sheva 84105
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 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 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 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 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 informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More 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 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 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 informationEfficient Text Classification by Weighted Proximal SVM *
Effcent ext Classfcaton by Weghted Proxmal SVM * Dong Zhuang 1, Benyu Zhang, Qang Yang 3, Jun Yan 4, Zheng Chen, Yng Chen 1 1 Computer Scence and Engneerng, Bejng Insttute of echnology, Bejng 100081, Chna
More informationAn Efficient Algorithm for PC Purchase Decision System
Proceedngs of the 6th WSAS Internatonal Conference on Instrumentaton, Measurement, Crcuts & s, Hangzhou, Chna, Aprl 15-17, 2007 216 An ffcent Algorthm for PC Purchase Decson Huay Chang Department of Informaton
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
More 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 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 informationIncremental Learning with Support Vector Machines and Fuzzy Set Theory
The 25th Workshop on Combnatoral Mathematcs and Computaton Theory Incremental Learnng wth Support Vector Machnes and Fuzzy Set Theory Yu-Mng Chuang 1 and Cha-Hwa Ln 2* 1 Department of Computer Scence and
More informationA NEW LINEAR APPROXIMATE CLUSTERING ALGORITHM BASED UPON SAMPLING WITH PROBABILITY DISTRIBUTING
A NEW LINEAR APPROXIMATE CLUSTERING ALGORITHM BASED UPON SAMPLING WITH PROBABILITY DISTRIBUTING CHANG-AN YUAN,, CHANG-JIE TANG, CHUAN LI, JIAN-JUN HU, JING PENG College of Computer, Schuan unversty, Chengdu,
More informationJournal of Chemical and Pharmaceutical Research, 2014, 6(6): Research Article. A selective ensemble classification method on microarray data
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(6):2860-2866 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A selectve ensemble classfcaton method on mcroarray
More 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 informationOptimizing Naïve Bayes Algorithm for SMS Spam Filtering on Mobile Phone to Reduce the Consumption of Resources
Journal of Computers Vol. 28, No. 3, 2017, pp. 174-183 do:10.3966/199115592017062803014 Optmzng Naïve Bayes Algorthm for SMS Spam Flterng on Moble Phone to Reduce the Consumpton of Resources L-qun Bao
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationSorting: The Big Picture. The steps of QuickSort. QuickSort Example. QuickSort Example. QuickSort Example. Recursive Quicksort
Sortng: The Bg Pcture Gven n comparable elements n an array, sort them n an ncreasng (or decreasng) order. Smple algorthms: O(n ) Inserton sort Selecton sort Bubble sort Shell sort Fancer algorthms: O(n
More informationAn Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 97-735 Volume Issue 9 BoTechnology An Indan Journal FULL PAPER BTAIJ, (9), [333-3] Matlab mult-dmensonal model-based - 3 Chnese football assocaton super league
More informationData Mining: Model Evaluation
Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationArabic Text Classification Using N-Gram Frequency Statistics A Comparative Study
Arabc Text Classfcaton Usng N-Gram Frequency Statstcs A Comparatve Study Lala Khresat Dept. of Computer Scence, Math and Physcs Farlegh Dcknson Unversty 285 Madson Ave, Madson NJ 07940 Khresat@fdu.edu
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 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 informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationMotivation. EE 457 Unit 4. Throughput vs. Latency. Performance Depends on View Point?! Computer System Performance. An individual user wants to:
4.1 4.2 Motvaton EE 457 Unt 4 Computer System Performance An ndvdual user wants to: Mnmze sngle program executon tme A datacenter owner wants to: Maxmze number of Mnmze ( ) http://e-tellgentnternetmarketng.com/webste/frustrated-computer-user-2/
More informationAn Improvement to Naive Bayes for Text Classification
Avalable onlne at www.scencedrect.com Proceda Engneerng 15 (2011) 2160 2164 Advancen Control Engneerngand Informaton Scence An Improvement to Nave Bayes for Text Classfcaton We Zhang a, Feng Gao a, a*
More informationKeywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines
(IJCSIS) Internatonal Journal of Computer Scence and Informaton Securty, Herarchcal Web Page Classfcaton Based on a Topc Model and Neghborng Pages Integraton Wongkot Srura Phayung Meesad Choochart Haruechayasak
More informationDeep Classifier: Automatically Categorizing Search Results into Large-Scale Hierarchies
Deep Classfer: Automatcally Categorzng Search Results nto Large-Scale Herarches Dkan Xng 1, Gu-Rong Xue 1, Qang Yang 2, Yong Yu 1 1 Shangha Jao Tong Unversty, Shangha, Chna {xaobao,grxue,yyu}@apex.sjtu.edu.cn
More informationAudio Content Classification Method Research Based on Two-step Strategy
(IJACSA) Internatonal Journal of Advanced Computer Scence and Applcatons, Audo Content Classfcaton Method Research Based on Two-step Strategy Sume Lang Department of Computer Scence and Technology Chongqng
More informationA New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1
A New Feature of Unformty of Image Texture Drectons Concdng wth the Human Eyes Percepton Xng-Jan He, De-Shuang Huang, Yue Zhang, Tat-Mng Lo 2, and Mchael R. Lyu 3 Intellgent Computng Lab, Insttute of Intellgent
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationDescription of NTU Approach to NTCIR3 Multilingual Information Retrieval
Proceedngs of the Thrd NTCIR Workshop Descrpton of NTU Approach to NTCIR3 Multlngual Informaton Retreval Wen-Cheng Ln and Hsn-Hs Chen Department of Computer Scence and Informaton Engneerng Natonal Tawan
More informationJournal of Chemical and Pharmaceutical Research, 2014, 6(6): Research Article
Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(6):2512-2520 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 Communty detecton model based on ncremental EM clusterng
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More 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 informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More 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 information