Research on Categorization of Animation Effect Based on Data Mining
|
|
- Hope Pitts
- 6 years ago
- Views:
Transcription
1 MATEC Web of Conferences 22, ( 2015) DOI: / matecconf/ C Owned by the authors, publshed by EDP Scences, 2015 Research on Categorzaton of Anmaton Effect Based on Data Mnng Na N Department of Anmaton, Art College, Henan Unversty, Kafeng, Henan, Chna ABSTRACT: Nowadays, the producton process of anmaton effect s ncreasngly developed, and ts effect s also growng better. But n most cases, the categorzaton of specal effect added to the anmaton s confusng due to excessve varatons. Data mnng wll desrably solve the problem of anmaton effect categorzaton, so the applcaton of data mnng n the anmaton effect categorzaton becomes the hot spot n research and analyss at present. Ths artcle makes a detaled analyss on relevant algorthm of data mnng technology, that s, the k applcaton of averagng method, k central pont method and relatonal degree algorthm n problem of anmaton effect categorzaton. It provdes a clear method of categorzaton for anmaton effect. Thereafter, t also concludes the accuracy of anmaton effect categorzaton can be greatly mproved through reasonable algorthm ntegraton n the treatment of anmaton effect categorzaton by data mnng. Keywords: data mnng, anmaton effect categorzaton, cluster analyss, relatonal degree 1 INTRODUCTION In the background of openng up polcy, the establshment of socalst road wth Chnese features realzes rapd development for varous trades n Chna. The ncorporaton of dversfed elements and varous ndustres provdes unque vtalty for varous ndustres, and our Chnese producton process of anmaton effect also rapdly develops from mmaturty to excellence. We are always learnng and tryng to use the globally advanced new technologes. Prepare the whole anmaton effect based on thnkng and experence n prevous anmaton makng, dfferent eras, objectves and promnent effect. So there are many knds of anmaton effect wth dfferent advantageous functons. Therefore, how to dstngush a great number and many types of anmaton effect and provde obvous categorzaton ndex becomes the hot spot nowadays. In the current bg data era, many use the mathematc method to solve the actual problems, and the methods are ncreasngly perfected. Ths artcle tres to use data mnng method for detaled research and analyss on the problem of anmaton effect categorzaton. Fgure 1. Anmaton effect of herarchy sense Ths s an Open Access artcle dstrbuted under the terms of the Creatve Commons Attrbuton Lcense 4.0, whch permts unrestrcted use, dstrbuton, and reproducton n any medum, provded the orgnal work s properly cted. Artcle avalable at or
2 MATEC Web of Conferences Fgure 2. Anmaton effect of fuzzy Fgure 3. Typcal flow chart of data mnng p.2
3 ICETA 2015 Fgure 4. Flow chart of data mnng for anmaton effect categorzaton 2 MODEL ESTABLISHMENT AND ITS SOLU- TION In the current socety wth developed mass meda, there are ncreasngly growng types of anmaton effect that are used to mprove the anmaton effect and have more comprehensve functons. For example, the anmaton wth many scenc spots wll requre specal effect to strengthen the sense of herarchy, and the anmaton requrng artstc concepton shall be added wth specal effect of local fuzzy or renderng; the acton scene wth vsual mpact requres mproved specal effect of textle, and so on. Fgure 1 and Fgure 2 add the specal effect of herarchy sense and fuzzy for the anmaton to provde satsfactory vsual effect for the anmaton. It can be seen from Fgure 1 and Fgure 2 that, despte the emphass of those two Fgures, n most cases the anmaton s composed by multple specal effects, so the specal effect categorzaton added for the anmaton becomes fuzzy and the accuracy wll be greatly reduced. Data mnng wll desrably solve the problem of anmaton effect categorzaton, so the applcaton of data mnng n the anmaton effect categorzaton becomes the hot spot n research and analyss at present. 2.1 Prncple of data mnng for anmaton effect categorzaton The data mnng refers to extract the hdden nformaton whch s hard to be dentfed by human efforts by mnng and collectng a large number of fuzzy data or partal data; then structure and screen out avalable nformaton therefrom; and deduct, generalze and make statstcs; then fnally vsualze those nformaton, and fnd out the relevance of those data by macro analyss and research; categorze them based on comprehensve consderaton of ther typcal features. Whle the data mnng algorthm used for treatment of anmaton effect categorzaton problem n ths artcle manly focuses on extractng and mnng the types and specal effect of producton process for each anmaton effect, generalzng and makng statstcs therefor, fndng out the relevance of varous anmaton effects and fnally categorze and dentfy them based on relevance of varous anmaton effects. Fgure 3 s the typcal flow chart of data mnng. It s known from the fgure 3 that the tradtonal data mnng method s to use varous data analyss algorthm based on the obtaned data, to establsh a model, to categorze and assess the obtaned data; predct the varables and fnally to concentrate and group accordng to the relevance. Whle for the treatment of anmaton effect categorzaton, t manly mnes and analyzes the 3D or mult-dmensonal data. Fgure 4 s the flow chart of data mnng for anmaton effect categorzaton. It can be seen from Fgure 4 that ths artcle makes pre-treatment for the anmaton effect; nvests t nto type and tranng concentraton; then comes nto feature selecton mode; conducts feature analyss for obtaned data; extracts feature data; categorzes the anmaton effect and nspects the categorzaton accu p.3
4 MATEC Web of Conferences racy of obtaned result. Thus t wll be avoded to select the data wthout dfferences and wll make other serous mstakes. And the fnal nspecton of categorzaton accuracy for anmaton effect categorzaton s also an mportant ndex for assessment model accuracy, and t mposes a great mpact on the clarty and accuracy of anmaton effect. 2.2 Analyss on data mnng algorthm As mentoned above, the data mnng refers to extractng the hdden nformaton hard to be dentfed by human efforts by mnng and collectng a large number of fuzzy data or partal data, then structurng and screenng out avalable nformaton therefrom, and makng mathematcal statstcs, then analyzng the relevance of those data, and fnally categorzng them based on comprehensve consderaton of ther typcal features. Ths artcle uses three data mnng algorthms to conduct correspondng analyss and research respectvely on the problems of anmaton effect categorzaton Analyss on cluster algorthm The cluster analyss s a process that generalzes and categorzes the obtaned data accordng to ts smlarty, and put the smlar data nto one set. Then mark every obtaned data aggregate. Ths cluster algorthm analyss may solve varant problems and desrably fnd the relatve features for varous data aggregate. There are two types of data aggregate n the cluster analyss, whch are data matrx and adjacent value matrx. Data matrx, that s, the matrx of m n by representng n target wth m varables, shown as follows: x L x L x 11 1 f 1p L L L L L x L x L x L L L L L x L x L x 1 f p n1 nf np Whle adjacent value matrx refers to a matrx of n n, whch represents n matrx of data smlarty as follows: 0 d(2,1) 0 d(3,1) d(3, 2) 0 L L L 0 dn (,1) dn (,2) L L 0 Among whch, the smlarty measured between data and data j s d (, j ). As d (, j ) approaches 0, t ndcates the data and j are more smlar; smlarly, as d (, j ) value grows, t ndcates the data and j have less smlarty. So there may be errors between data aggregates n dfferent categorzatons. Whle the error calculaton method used n the cluster analyss of ths artcle s as follows: 1) The absolute error of mean: 1 S x m x m L x m n f 1f f 2f f nf f x,, 1 f L xnf represent n measured values for f, whle the average of f s m f 1 m x x L x n f 1f 2f nf, and 2) Standard measured value: The absolute error of mean proposed above can desrably reduce the mpact of outlers on calculaton result. That s to say, the measured value of outlers obtaned from absolute error of mean can be well dentfed. The calculaton formula wth measured value s as follows: z f x f m s f f The smlarty between data aggregates n cluster analyss s determned accordng to comparson of adjacent values for all data. Whle there are manly two calculaton methods for d (, j ): 1) Eucldean dstance: L d (, j) x xj x xj xn xjn ( x, x, L, x ) and 1 2 n j1 j2 jn j ( x, x, L, x ) n the formula above respectvely represents the data n two n -dmensonal data aggregate. 2) Manhattan dstance: d j x x x x x x (, ) 1 j1 2 j2 L n jn The Eucldean dstance and Manhattan dstance above shall meet the requrements below, namely: p.4
5 ICETA 2015 d (, j) 0 d (,) 0 d (, j) d( j,) d (, j) dh (, ) dhj (, ) The cluster algorthm analyss ntroduced n ths artcle solves the categorzaton problem of anmaton effect wth two methods, namely k averagng method and k central pont method. The k averagng method s to dvde n data nto k data aggregates by takng k as the parameter, and the categorzaton result s the hgher data smlarty n the data aggregate whch leads to hgher dfference between data aggregates. However, the smlarty of data aggregate s ts barycenter. It s defned as follows: k E pm 1 pc 2 E represents the sum of quadratc dfference of all data n the data aggregate, p the specfed data pont, and m the mean of data aggregate C. Randomly select k data n the data set D as the ntal center of data aggregate, judge each data accordng to the formula above through the obtaned mean, put t nto the data aggregate wth the most smlar features, change the mean of data aggregate, and calculate the mean of data untl t does not change. Therefore, the k averagng method wll have a better performance when the data aggregate separated from anmaton effect has a relatvely obvous dfference. Whle the k central pont method s to select a data n each data aggregate to represent the whole data aggregate, and cluster the rest of data nto the data aggregate of selected data wth the hghest smlarty n order to categorze the data of anmaton effect. It s defned as follows: k E po 1 pc j o j represents the data selected from C j. Now we randomly select k data from data set D as the ntal selected data; assgn the rest data nto the data aggregate represented by the selected data accordng to the above formula; select one more data o ; change o j nto o ; f the generally pad functon s S 0, a new data set wll be formed, and the repeated calculaton s requred untl t s unchanged. The result calculated by central pont s used to assess the mean of dssmlarty between selected and resdual data through the functon S, but there are four cases as to whether the data o can be changed nto o. j p.5
6 MATEC Web of Conferences Fgure 5. Four statuses to change non-representatve data As known from the fgure above, when p s n the data aggregate represented by o j, f o j s changed nto o, and p s closest to the resdual selected data o, p shall be put nto o ; when p s n the data aggregate represented by o j, f o j s changed nto o, and p s closest to the data o, p shall be put nto o ; when p s n the data aggregate represented by o, f o j s changed nto o, and p s closest to the data o, t shall not be subject to a second assgnment; when p s n the data aggregate represented by o, f o j s changed nto o, and p s closest to the data o, the p shall be put nto o ; every assgnment wll make the S functon of E change. If S 0, a new data set wll be formed; If S 0, t wll ndcate the change can be accepted, and thus t s not subject to another assgnment, that s to say the categorzaton s fnshed Analyss on relatonal degree algorthm Relatonal degree algorthm refers to an algorthm that can desrably fnd out the relatonshp and relatonal degree between obtaned data sets after obtanng the vald data through varous data mnng methods and algorthms. Such as Aa B, that s to say, when the feature value of A s a, the feature value of frequent tem set B wll have a hgher probablty to be b. So the relatonal degree algorthm may be used to detect the abnormal data and acheve hgh accuracy wth the help of other cluster algorthm. To fnd out relatonal degree, we shall frst obtan the frequent tem set and the relevance among the data. And the frequent tem set refers to elements wth hgh appearance rate n the data aggregate, and ts threshold scope s defned by support functon. Its functon s as follows: Support( A, B) P( AYB) Support A, B N( AB, ) Among whch, N s the total number of tmes, and N ( AB, ) the number of tmes the elements A and B appear smultaneously. As the mnmum support threshold Mn-sup s found, ths parameter may only capture the data larger than Mn-sup, so t wll be easy to obtan the frequent tem set n the objectve aggregate. As the frequent tem set s found, we may calculate the relatonal degree, that s to say we may get a relevance that has hgher relatonal degree and an mportant mpact on the analyss. When calculatng the relatonal degree, ts confdence level shall be met. The calculate formula s as follows: N confdence( A B) P( B A) p.6
7 ICETA 2015 Support confdence( A B) Support A, B A The formula above ndcates the confdence level of A B s the probablty of B under A con- B dton, namely the confdence level of A may be obtaned through calculaton of Support A, B and Support A, whch also ndcates A B can be easly calculated after determnng the value of Support A, B and Support A, that s to say we may obtan the correspondng relatonal degree among data and nspect ts accuracy after determnng the value of, Support A. Support A B and It s known from the analyss above that, n solvng the problem of anmaton effect categorzaton, the data mnng dentfes and categorzes the specal effect based on analyss of creaton purpose and process of anmaton effect, as well as through dscoverng and extractng the data of anmaton effect. Ths artcle categorzes the anmaton effect wth k averagng method and k central pont method and nspects the abnormal data of anmaton effect categorzaton by ncorporatng k central pont method and relatonal degree algorthm to mprove the categorzaton accuracy. 3 CONCLUSION Ths artcle wll frst analyze the development stuaton of current anmaton effect accordng to the detaled stuaton of socety, and then fnd out the man reason that causes the problem of anmaton effect categorzaton as well as the necessty to apply the data mnng theren. Ths artcle makes a detaled analyss on relevant algorthm of data mnng technology, namely the applcaton of k averagng method, k central pont method and relatonal degree algorthm n problem of anmaton effect categorzaton. It provdes a clear method of categorzaton for anmaton effect. In solvng the problem of anmaton effect categorzaton, ths artcle uses the data mnng to dentfy and categorze the specal effect based on analyss of creaton purpose and process of anmaton effect, as well as through dscoverng and extractng the data of anmaton effect. Ths artcle categorzes the anmaton effect wth k averagng method and k central pont method and nspects the abnormal data of anmaton effect categorzaton by ncorporatng k central pont method and relatonal degree algorthm to mprove the categorzaton accuracy. ACKNOWLEDGEMENT Ths work was supported by research of creatve thnk ng model tranng n art and desgn educaton of colle ges and unverstes n Hennan ( ). REFERENCES [1] Faber, L. & Walters, H Anmaton Unlmted. Translated by Wang, K.Y. Shangha People's Fne Arts Publshng House. [2] Stephen Vsro Dgtal Cartoon Art. GU, C. Shangha People's Fne Arts Publshng House. [3] Steve Capln, Adam, Banks Dgtal Graphcs Art. Translated by Cao, T.Q. Shangha People s Fne Arts Publshng House. [4] Lu, F., Wu, P... Abnormal Data Capture and Analyss Based on Data Mnng. The research Chna nformaton system. [5] Q, H.Y., Wu, X.J., Wang, S. & Yang, J.Y A Collaboratve FCPM Fuzzy Clusterng Algorthm, Pattern Recognton and Artfcal Intellgence, 23 (1): [6] Gan, L. & Wang, X Study on Cluster Analyss n Data Mnng. Coastal Enterprses and Scence And Technology, 42 (3): [7] Lu, H.Y., Chen, J. &Chen, G.Q Revew of Data Categorzaton Algorthms for Data Mnng. Journal of Tsnghua Unversty (NATURAL SCIENCE EDITION), 42 (06): [8] Kong, L.F., Wang, H. & Lan, Q.S Data Organzaton Method Based on Assocaton Rules Mnng. Computer Engneerng, 32 (21): [9] Fu, Z.W Research on Incremental Updatng Algorthm for Assocaton Rules. Journal of Software, 9 (8): [10]L, J.F., Xao, R. & Qn, J Research and Desgn of Incremental Mnng Assocaton Rules. Journal of Software, 9 (10): p.7
Cluster 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 informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More 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 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 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 informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More 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 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 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 informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationA high precision collaborative vision measurement of gear chamfering profile
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng
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 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 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 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 informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
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 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 Simple Methodology for Database Clustering. Hao Tang 12 Guangdong University of Technology, Guangdong, , China
for Database Clusterng Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal: 6085@qq.com Me Zhang Guangdong Unversty of Technology, Guangdong, 0503, Chna E-mal:64605455@qq.com Database clusterng
More informationProfessional competences training path for an e-commerce major, based on the ISM method
World Transactons on Engneerng and Technology Educaton Vol.14, No.4, 2016 2016 WIETE Professonal competences tranng path for an e-commerce maor, based on the ISM method Ru Wang, Pn Peng, L-gang Lu & Lng
More informationModular PCA Face Recognition Based on Weighted Average
odern Appled Scence odular PCA Face Recognton Based on Weghted Average Chengmao Han (Correspondng author) Department of athematcs, Lny Normal Unversty Lny 76005, Chna E-mal: hanchengmao@163.com Abstract
More informationOutline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:
Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A
More 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 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 informationA Statistical Model Selection Strategy Applied to Neural Networks
A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos
More 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 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 informationResearch and Application of Fingerprint Recognition Based on MATLAB
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department
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 informationStudy of Data Stream Clustering Based on Bio-inspired Model
, pp.412-418 http://dx.do.org/10.14257/astl.2014.53.86 Study of Data Stream lusterng Based on Bo-nspred Model Yngme L, Mn L, Jngbo Shao, Gaoyang Wang ollege of omputer Scence and Informaton Engneerng,
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Supervsed vs. Unsupervsed Learnng Up to now we consdered supervsed learnng scenaro, where we are gven 1. samples 1,, n 2. class labels for all samples 1,, n Ths s also
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More 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 informationFace Recognition Method Based on Within-class Clustering SVM
Face Recognton Method Based on Wthn-class Clusterng SVM Yan Wu, Xao Yao and Yng Xa Department of Computer Scence and Engneerng Tong Unversty Shangha, Chna Abstract - A face recognton method based on Wthn-class
More 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 informationA CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION
A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION 1 FENG YONG, DANG XIAO-WAN, 3 XU HONG-YAN School of Informaton, Laonng Unversty, Shenyang Laonng E-mal: 1 fyxuhy@163.com, dangxaowan@163.com, 3 xuhongyan_lndx@163.com
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 informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationEmpirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap
Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*
More informationDetection of hand grasping an object from complex background based on machine learning co-occurrence of local image feature
Detecton of hand graspng an object from complex background based on machne learnng co-occurrence of local mage feature Shnya Moroka, Yasuhro Hramoto, Nobutaka Shmada, Tadash Matsuo, Yoshak Shra Rtsumekan
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 informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationA PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION
1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute
More informationAnalysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD
Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,
More informationClustering Algorithm of Similarity Segmentation based on Point Sorting
Internatonal onference on Logstcs Engneerng, Management and omputer Scence (LEMS 2015) lusterng Algorthm of Smlarty Segmentaton based on Pont Sortng Hanbng L, Yan Wang*, Lan Huang, Mngda L, Yng Sun, Hanyuan
More informationNetwork Intrusion Detection Based on PSO-SVM
TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More 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 informationData Preprocessing Based on Partially Supervised Learning Na Liu1,2, a, Guanglai Gao1,b, Guiping Liu2,c
6th Internatonal Conference on Informaton Engneerng for Mechancs and Materals (ICIMM 2016) Data Preprocessng Based on Partally Supervsed Learnng Na Lu1,2, a, Guangla Gao1,b, Gupng Lu2,c 1 College of Computer
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationA Clustering Algorithm for Chinese Adjectives and Nouns 1
Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationText Similarity Computing Based on LDA Topic Model and Word Co-occurrence
2nd Internatonal Conference on Software Engneerng, Knowledge Engneerng and Informaton Engneerng (SEKEIE 204) Text Smlarty Computng Based on LDA Topc Model and Word Co-occurrence Mngla Shao School of Computer,
More informationNonlocal Mumford-Shah Model for Image Segmentation
for Image Segmentaton 1 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:ccluxaoq@163.com ebo e 23 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:
More informationThe Comparison of Calibration Method of Binocular Stereo Vision System Ke Zhang a *, Zhao Gao b
3rd Internatonal Conference on Materal, Mechancal and Manufacturng Engneerng (IC3ME 2015) The Comparson of Calbraton Method of Bnocular Stereo Vson System Ke Zhang a *, Zhao Gao b College of Engneerng,
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
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 informationA new segmentation algorithm for medical volume image based on K-means clustering
Avalable onlne www.jocpr.com Journal of Chemcal and harmaceutcal Research, 2013, 5(12):113-117 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCRC5 A new segmentaton algorthm for medcal volume mage based
More informationApplication of Clustering Algorithm in Big Data Sample Set Optimization
Applcaton of Clusterng Algorthm n Bg Data Sample Set Optmzaton Yutang Lu 1, Qn Zhang 2 1 Department of Basc Subjects, Henan Insttute of Technology, Xnxang 453002, Chna 2 School of Mathematcs and Informaton
More informationThe Nottingham eprints service makes this work by researchers of the University of Nottingham available open access under the following conditions.
Da, Wujao and Lu, Bn and Meng, Xaoln and Huang, D. () Spato-temporal modellng of dam deformaton usng ndependent component analyss. Survey Revew, 6 (9). pp. 7-. ISSN 7-76 Access from the Unversty of Nottngham
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationAPPLICATION OF IMPROVED K-MEANS ALGORITHM IN THE DELIVERY LOCATION
An Open Access, Onlne Internatonal Journal Avalable at http://www.cbtech.org/pms.htm 2016 Vol. 6 (2) Aprl-June, pp. 11-17/Sh Research Artcle APPLICATION OF IMPROVED K-MEANS ALGORITHM IN THE DELIVERY LOCATION
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 informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationA CO-TRAINING METHOD FOR IDENTIFYING THE SAME PERSON ACROSS SOCIAL NETWORKS
A CO-TRAINING METHOD FOR IDENTIFYING THE SAME PERSON ACROSS SOCIAL NETWORKS Zheng Fang 1,2, Yanan Cao 2, Yanmn Shang 2, Yanbng Lu 2, Janlong Tan 2, L Guo 2 1 School of Cyber Securty, Unversty of Chnese
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 informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationA Topology-aware Random Walk
A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble
More informationThe Man-hour Estimation Models & Its Comparison of Interim Products Assembly for Shipbuilding
Internatonal Journal of Operatons Research Internatonal Journal of Operatons Research Vol., No., 9 4 (005) The Man-hour Estmaton Models & Its Comparson of Interm Products Assembly for Shpbuldng Bn Lu and
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 informationResearch Article A High-Order CFS Algorithm for Clustering Big Data
Moble Informaton Systems Volume 26, Artcle ID 435627, 8 pages http://dx.do.org/.55/26/435627 Research Artcle A Hgh-Order Algorthm for Clusterng Bg Data Fanyu Bu,,2 Zhku Chen, Peng L, Tong Tang, 3 andyngzhang
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationA Clustering Algorithm for Key Frame Extraction Based on Density Peak
Journal of Computer and Communcatons, 2018, 6, 118-128 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 A Clusterng Algorthm for Key Frame Extracton Based on Densty Peak Hong Zhao
More informationAn Internal Clustering Validation Index for Boolean Data
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 6 Specal ssue wth selecton of extended papers from 6th Internatonal Conference on Logstc, Informatcs and Servce Scence
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 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 informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15
CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More 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 informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationApplication of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling
, pp.40-45 http://dx.do.org/10.14257/astl.2017.143.08 Applcaton of Improved Fsh Swarm Algorthm n Cloud Computng Resource Schedulng Yu Lu, Fangtao Lu School of Informaton Engneerng, Chongqng Vocatonal Insttute
More informationApproxMGMSP: A Scalable Method of Mining Approximate Multidimensional Sequential Patterns on Distributed System
ApproxMGMSP: A Scalable Method of Mnng Approxmate Multdmensonal Sequental Patterns on Dstrbuted System Changha Zhang, Kongfa Hu, Zhux Chen, Lng Chen Department of Computer Scence and Engneerng, Yangzhou
More informationCollege of Information & Computer, Anhui Agricultural University, Hefei, Anhui, , China
4th Internatonal Conference on Mechatroncs Materals Chemstry and Computer Engneerng (ICMMCCE 15) Improved retnex mage enhancement algorthm based on blateral flterng Ya nan Yang 1 a Zhaohu Jang 1 b * Chunhe
More informationA Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks
A Load-balancng and Energy-aware Clusterng Algorthm n Wreless Ad-hoc Networks Wang Jn, Shu Le, Jnsung Cho, Young-Koo Lee, Sungyoung Lee, Yonl Zhong Department of Computer Engneerng Kyung Hee Unversty,
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
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 information