HCMX: AN EFFICIENT HYBRID CLUSTERING APPROACH FOR MULTI-VERSION XML DOCUMENTS
|
|
- Chrystal Ray
- 6 years ago
- Views:
Transcription
1 HCMX: AN EFFICIENT HYBRID CLUSTERING APPROACH FOR MULTI-VERSION XML DOCUMENTS VIJAY SONAWANE 1, D.RAJESWARA.RAO 2 1 Research Scholar, Department of CSE, K.L.Unversty, Green Felds, Guntur, Andhra Pradesh 2 Professor, Department of CSE, K.L.Unversty, Green Felds, Guntur, Andhra Pradesh E-mal: vjaysonawane11@gmal.com 1,rajeshduvvada@klunversty.n 2 ABSTRACT In order to retreve useful nformaton from large number of growng XML documents on the web, effectve management of XML document s essental. One soluton s to cluster XML documents to fnd knowledge that promote effectve nformaton management and mantenance. But n the real world XML documents are dynamc n nature. In contrast to statc XML documents, changes from one verson of XML document to another verson cannot be predcted. So clusterng technque of statc XML documents cannot be used to cluster multple versons of XML documents. In case of multverson XML documents, prelmnary clusterng soluton s not become vald after document versons appear. XML documents are self descrptve n nature, whch results n large document sze. To fnd new clusterng soluton after change, comparsons between all documents s not vable soluton. In ths paper we have proposed hybrd clusterng approach to cluster multverson XML documents. Ths approach mproves speed of clusterng by lmtng the growng sze of XML documents by usng homo-morphc compresson scheme and usng dstance nformaton from prelmnary clusterng soluton wth the changes recorded n compressed delta Keywords: HCMX, Hybrd Clusterng, Cluster re-evaluaton, Multverson, PCP, CSRP, compressed Delta. 1. INTRODUCTION Wth the huge growth of the Internet, XML has now become a unversal standard for nformaton representaton and exchange on over Internet [1]. Due smple and flexble nature of XML, varous applcatons lke scentfc wrtng and techncal papers to handle news summares [2] use XML n nformaton exchange and representaton. XML s also used to represent the web based free content encyclopeda known as Wkpeda, t has more than 3.4 mllon XML documents. XML offers many features of onlne busness functons such as content ntegraton and ntellgence. The growng popularty of XML has lft up many concerns regardng the methods of how to effcently mantan and manage the XML data and retreve these XML documents n large collectons. One of the feasble solutons to handle large XML collecton s to make group of smlar XML documents n the form of cluster. Clusterng smlar XML documents s supposed to be one of the more effectve way for document handlng by facltatng better nformaton retreval, data ndexng, data ntegraton and query processng.the clusterng of smlar XML documents has been perceved as potentally beng one of the more effectve solutons to mprove document handlng by facltatng better nformaton retreval, data ndexng, data ntegraton and query processng [3]. But there are several challenges n clusterng XML documents. Unlke the clusterng of text documents or normal data, clusterng of XML documents s a complex process [4] and as a result the most commonly used clusterng methods for text clusterng cannot be replcated for clusterng these documents. Ths s due to the fact that changes n XML documents are applcaton specfc. In real world content of XML documents s dynamc n nature and changes n t are lmtless and not predctable [5].Every tme changes n orgnal XML document gves brth to the new verson of t. Dynamc XML documents are applcable n many felds of nformaton mantenance and management, so t creates the demand for multverson support [6].So t s also necessary to store dfferent versons of XML documents. In spte ts potental, storage of all the versons of an XML document ncreases the redundancy and make searchng and queryng harder on growng documents collecton. In clusterng soluton of multverson XML documents, new document verson s not avalable n advance, or not completely new documents. Only they are dfferent n certan degree from ther prevous one. XML s self descrbng n nature, ths provdes enormous 137
2 flexblty to t, but also ntroduces the problem of verbosty whch results n huge document sze [7] and results n poor response tme. In ths paper we ntroduces an hybrd clusterng approach named HCMX to fnd clusterng soluton of mult-verson XML documents whch changes dynamcally. In ths we judge the amount of document affected, rather than consderng each comng document as new verson. To fnd new clusterng soluton, after changes n prelmnary one, nstead of comparng all members of clusterng soluton, we make the use of dstance nformaton durng prelmnary clusterng phase, wth the changes responsble for document verson to produce. To mprove clusterng speed and response tme homomorphc compresson scheme used whch retan documents orgnal structure. 2. MOTIVATION Wth the ncreasng number of XML documents on web the need becomes usual to properly organse these XML documents n order to retreve useful nformaton. The defcency of such an effectve organsaton of the XML documents causes a search of the total collecton of XML documents, whch results n poor response tme. So to effcently mantan XML document collecton, t s crucal to cluster these documents based on ther smlarty. Along wth the nformaton retreval, clusterng can also be used to dscover knowledge for web mnng and query executon [12]. XML documents clusterng process s not as straght forward as the process of the clusterng of text documents [10]. It has to pass many challenges n the clusterng of XML documents due to nature of XML documents. That are: 1) XML documents structure are havng herarchcal relatonshp wth ts elements, so ths relatonshp should be preserved. 2) In real-world, the dfference between consecutve versons of an XML document vares, so statc XML document clusterng technque cannot be used [11]. 3. METHODOLOGY Clusterng soluton S of gven set of XML document s represented as complete graph wth S*(S-1)/2 number of weghted edges. To fnd sngle lnk clusters of level L, the edges wth weght w L have to remove, remanng connected edges gves resultant cluster [8]. If correspondence between two XML documents s used as measure to fnd clusterng soluton then weght of the edges connectng documents symbolze the dstance between them. Prelmnary Clusterng Phase (PCP) - (one tme executon): Fgure-1(a). Shows prelmnary clusterng phase, n ths we frst: ) compress nput XML documents usng homo-morphc compresson technque (XGrnd n our case). ) Fnd cluster usng any dstance based clusterng algorthm. ) Save dstance matrx between all XML document par wth the set of operatons analogous to each mnmum dstance. XML Document Set Homomorphc Compresson Calculate Structural Dstance Structural Dstance Matrx Prelmnary Clusterng Prelmnary Clusterng Fgure-1. a) Prelmnary Clusterng Phase. XML Document Set Apply Verson Creaton Program Versons of XML Documents Homomorphc Compresson Re-calculate Structural Dstance Structural Dstance Matrx New Clusterng Soluton b) Expensve Re-Clusterng Method Dstance:- To get the dstance between two XML documents, edt operatons Op (nsert, delete, update) are used wth least cost value that transform one document nto other. d(d1, D2) = least ((dst(d1d2 ),dst(d2d1))) Least dstance between two documents ndcates larger resemblance between them. Two documents are sad to be equal when total cost of operaton s equal to zero. Any amount of changes n any document n prelmnary clusterng soluton wll affect the dstance wth rest documents n ntal cluster. If dstance between two documents s smaller, t ndcates the hgh resemblance between them. Hence when total cost operaton between two document s equal to zero then these document are 138
3 sad to smlar. When any document n prelmnary clusterng soluton changes then ts dstance wth rest of the documents n the cluster also changes. These number and type of changes are responsble for document resdence n the same cluster or form ts own cluster. To fnd new clusterng soluton after change n documents n prelmnary cluster, reassessment of modfed dstances between all XML documents pars s must. Fgure -1(b). shows one of the possble soluton. As shown, to get new clusterng soluton after changes n prelmnary clusterng soluton, comparson between all the documents par s possble (Full Comparson). But t s not cost effectve soluton because ) It ncur redundancy n calculatng the dstances between each par of document by makng full comparson between the documents. ). It does not consder degree of changes n the document, most of tme new verson may not modfed at all or may carry small amount of change, hence most of the operatons are needlessly repeated. Our proposed HCMX approach s depcted n fgure-2. HCMX s dvded nto two stages. 1) Prelmnary Clusterng Phase- Ths phase forms the base for HCMX. 2) Clusterng soluton re-evaluaton phase (CSRP): Ths phase s repeated whenever documents from prelmnary clusterng soluton changes. 1) Use set of changes from prelmnary clusterng phase and current tme stamp, recorded n compressed delta. 2) Read dstance matrx saved durng prelmnary clusterng phase. 3) Re-evaluate the dstances between documents based on dstances calculated durng PCP, changes responsble for document verson recorded n compressed delta and least cost drecton. Output of ths phase form the base for next teratve run of CSRP. The most mportant part n ths CSRP s reevaluatng the dstances based on dstances calculated durng PCP and set of changes recorded n compressed delta. Next secton of the paper presents the method to acheve ths. 4. DISTANCE MEASUREMENT Herarchcal relatonshp between elements of XML document makes easy to perform operaton on documents. Homomorphc compresson scheme used mantans document orgnal structure wth reduced n sze. In mult-verson XML documents, new versons are obtaned by applyng nsert, update and delete operatons n combnaton on XML Document Set Compressed Document Verson Fnd Compressed Delta Use Prevous Structural Dstance wth Delta New Structural Dstance Matrx Fnal Clusterng Composton New Clusterng Soluton Fgure -2. HCMX clusterng approach. document verson nodes and sum of these operatons are stored n compressed delta. Compressed Delta (C ) - Gven dynamc XML document D wth ts verson D *, compressed delta records the changes from one state of document to another. It conssts of a set operatons Op(nsert, delete, update) executon of t on document D wll return document n state D *. Cost Compressed Delta (CC ) It s sum of the operaton Op(nsert, delete, update) recorded n compressed delta, those are responsble to convert D n to D *. Inverted Operaton (O ) - Gven dynamc XML document D wth ts verson D *, If an executon of operaton Op (nsert, delete, update) on document D returns ts verson D *, then executon of ed operaton on verson D * returns orgnal document D..e nsert s ed operaton of correspondng delete. If prelmnary clusterng soluton S contans D1 and D2 wth d(d1,d2) s dstance between them and (D1D2) s least cost drecton and set of changes saved n compressed delta (responsble for document versonng), then new dstance d * can be defned as: 139
4 1. If set of changes stored n C transform D1 nto D1 * then new dstance between D1 * and D2 can be defned as : d * (D1 *, D2) = (d(d1,d2) C (D1, D1 * )) - (D1,D2) C (D1,D1 * )).e when D1 changes to D1 * then to fnd ts new dstance wth D2, common set of operatons that transforms D1 to D1 * wth least dstance need to be deducted as ther effect s equal, so only unque operatons need to consdered. 2. If set of changes stored n C transform D2 nto D2 * then new dstance between D1 and D2 * can be defned as : d * (D1,D2 * ) = d(d1,d2)+c (D2,D * ) - q = 1 Q + Q Here Q are the q operatons from d(d1,d2) whch have consequent ed operatons O n C (D2, D2 * ), 1 q..e set of operatons whch gves least dstance between D1 and D2, and were subsequently ed durng D2 transformaton nto D2 * need to be deducted when calculatng the dstance between D1 and D2, as ther combned effect s null, whereas only the dstnct non-ed operatons need to be consdered. 3. If set of changes stored n C 1 transform D1 nto D1 * and set of changes stored n C 2 transform D2 nto D2 * then new dstance between D1 * and D2 * can be defned as : d * (D1 *, D2 * ) = [(d(d1,d2) C 1 (D1,D1 * )) (d(d1,d2) C 1 (D1,D1 * )] + C 2 (D2,D2 * )- p = 1 Q + Q Here O are p resdual operatons from d(d1, D2) after removng repeated operatons from C 1 whch have consequent ed operatons O n C 2 (D2,D2 * ), 1 p..e when both D1 and D2 have changed nto ts consequent versons D1 * and D2 *, above both formulas are applcable to fnd new dstance d * (D1 *,D2 * ). 4. f both documents D1 and D2 do not change, then the new dstance d * s the same wth the prevous dstance d: d * (D1, D2) = d(d1, D2) If there s no change n dstance, t ndcates the total smlarty between the documents. 5. HCMX ALGORITHM Input: Clusterng soluton of compressed dynamc XML documents. Output: Re-evaluated clusterng Soluton. For each compressed documents [D 1, D 2 ] belongs to clusterng soluton and D 1 D f document D 1 changes but document D 2 does not change then shared_op_cost = 0; for each operaton O belongs to d(d 1, D 2 ) f operaton O s belongs to (D 1,D 1 * ) then shared_op_cost= shared_op_cost + 2*cost(O ) for next operaton O, the new dstance between d * (D 1 *,D 2 ) d(d 1, D 2 )+cost( (D 1,D 1 * ))- shared_op_cost 1.2. f document D 2 changes but document D 1 does not change then ed_op_cost = 0; for each operaton O belongs to d(d 1, D 2 ) f ed operaton O belongs to (D 2,D * 2 ) then ed_op_cost = ed_op_cost + cost (O )+ Cost (O ) for next operaton O, the new dstance between d * (D 1,D * 2 ) d(d 1,D 2 )+cost( (D 2,D * 2 ))- ed_op_cost f both documents D 1 and D 2 changes then for each operaton O belongs to d(d 1, D 2 ) f operaton O s belongs to (D 1,D 1 * ) then shared_op_cost = shared_op_cost + 2* cost(o ) f ed operaton O belongs to delta of (D 2,D 2 * ) then shared_op_cost = shared_op_cost + cost O + cost (O ) for next operaton O, the new dstance between d * (D 1 *,D 2 * ) d(d 1,D 2 )+cost( (D 1,D 1 * ))+cost( (D 2, D 2 * )) - shared_op_cost ed_op_cost 1.4. f both documents D and Dj does not changes then new dstance d * (D 1 *,D 2 * ) wll be same as d(d 1,D 2 ) 140
5 Table-1. Expermental Results No of Documents Input documents sze (Kb) Sze after compresson (Kb) % of Changes Appled Full Comparson Clusterng Tme (mllsecond) HCMX EXPERIMENTAL EVALUATION Proposed HCMX approach s mplanted n java. To assess the performance of HCMX approach we used documents of varable sze from XML data repostory [9]. As shown n fgure1. Prelmnary clusterng soluton of gven nput XML documents are obtaned by usng least dstance between all the compressed document pars. Prelmnary clusterng soluton of gven nput XML documents are obtaned by recordng and usng least dstance between all the document pars wth the set of operatons correspondng to each least dstance. New document versons are created wth dfferent percentage of changes by usng verson creaton program. The man objectve of evaluaton s to assess tme requred to fnd new clusterng soluton when documents change ther dstance n prelmnary clusterng soluton. We evaluated clusterng tme of HCMX wth full comparson. Expermental results are shown n table1. Result charts shown n fgure-3. to fgure- 5. reveal that our proposed HCMX performs better n spte the ncrease n documents, ther sze and appled changes. approach s tme effectve, as used homomorphc compresson scheme hghly reduces the documents sze and operatons nvolved n cluster soluton reevaluaton (CSRP) are reduced. Fgure -3. Result chart CONCLUSION In ths paper we have proposed hybrd clusterng approach HCMX to cluster mult-verson xml documents when prelmnary clusterng soluton becomes outdated. To fnd updated clusterng soluton after document versonng comparson between all documents ncur large amount of redundant operatons. Our proposed HCMX approach judge amount of document affected and re-evaluate cluster by usng effect of temporal changes recorded n compressed delta and dstances recorded durng prelmnary clusterng phase. Expermental results shows proposed Fgure -4. Result chart
6 REFERENCES: Fgure -5. Result chart 3. [1]. E. Wlde and R. J. Glushko. XML fever. J. Comm. ACM, 2008, (51) pp [2]. A. Tagarell and S. Greco. Semantc clusterng of XML documents. ACM Transactons on Informaton Systems, Vol. 28, No1, 2009, pp [3]. T. Tran, S. Kutty, and R. Nayak. Utlzng the structure and content nformaton for xml document clusterng. Lecture Notes n Computer Scence. Sprnger Berln Hedelberg. Volume 5631, 2009, pp [4]. S. Kutty, T. Tran, R. Nayak, and Y. L. Clusterng XML documents usng closed frequent subtrees: A structural smlarty approach. Lecture Notes n Computer Scence, Sprnger Berln / Hedelberg. Volume 4862, 2008, pp [5]. Dyreson. C, and Grand. F. Temporal XML, Database Systems, 2009, pp [6]. Sdra F., Mansoor S. Temporal and multversoned XML documents: A survey, Informaton Processng and Management, Vol. 50, No 1, 2014, pp [7]. Sherf Sakr. XML compresson technques: A survey and comparson., Journal of Computer and system Scence Vol 75, No 5, 2009 pp [8]. Dalamagas, T., Cheng, T., Wnkel, K.J. and Sells, T. Clusterng XML documents by Structure. SETN LNAI Sprnger. 3025, 2004, pp [9]. XML data repostory, onlne at k/xmldata [10]. Vjay Sonawane and D.Rajeshwara Rao. An Optmstc Approach for Clusterng Multverson XML Documents Usng Compressed Delta. Internatonal Journal of Electrcal and Computer Engneerng. Vol. 5, Issue , ISSN [11]. Vjay Sonawane and D.R.Rao. A Comparatve Study: Change Detecton and Queryng Dynamc XML Documents. Internatonal Journal of Electrcal and Computer Engneerng. Vol. 5 No ISSN [12]. Baeza-Yates and R. Rbero-Neto, B. Modern nformaton retreval: The concepts and technology behnd search. ACM Press/Addson-Wesley [13]. Gao,M and Chen F. Clusterng XML Data Streams by Structure based on SldngWndows and Exponental Hs-tograms. Proceedngs of the nternatonal conference on advances n databases, knowledge, and data applcatons pp [14]. Wuwongse V, Yoshkawa M., and Amagasa, T. Temporal versonng of XML documents. Proceedngs of the Seventh Internatonal conference on dgtal lbrares: Internatonal collaboraton and crossfertlzaton pp [15]. Cavaler F, Guerrn. G, Mest M. and Olbon, B. On the reducton of sequences of XML document and schema update operatons. Proceedngs of the IEEE twenty seventh nternatonal conference on data engneerng workshops Pp [16]. A. Tagarell. and S. Greco. Semantc clusterng of XML documents. ACM Transactons on Informaton Systems. Vol. 28, No pp [17]. M.X. Gao, W.J. Yao, and G.J. Mao. Exponental hstogram of cluster feature for XML tream. Journal of Bejng Unversty of Technology. vol. 37, pp
Parallelism 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 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 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 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 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 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 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 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 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 informationUsing Fuzzy Logic to Enhance the Large Size Remote Sensing Images
Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationQuery Clustering Using a Hybrid Query Similarity Measure
Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan
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 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 informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More 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 informationImpact of a New Attribute Extraction Algorithm on Web Page Classification
Impact of a New Attrbute Extracton Algorthm on Web Page Classfcaton Gösel Brc, Banu Dr, Yldz Techncal Unversty, Computer Engneerng Department Abstract Ths paper ntroduces a new algorthm for dmensonalty
More informationEsc101 Lecture 1 st April, 2008 Generating Permutation
Esc101 Lecture 1 Aprl, 2008 Generatng Permutaton In ths class we wll look at a problem to wrte a program that takes as nput 1,2,...,N and prnts out all possble permutatons of the numbers 1,2,...,N. For
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 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 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 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 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 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 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 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 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 informationRelevance Feedback for Image Retrieval
Vashal D Dhale et al, / (IJCSIT Internatonal Journal of Computer Scence and Informaton Technologes, Vol 4 (2, 203, 39-323 Relevance Feedback for Image Retreval Vashal D Dhale, Dr A R Mahaan, Prof Uma Thakur
More informationDocument Representation and Clustering with WordNet Based Similarity Rough Set Model
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 8, Issue 5, No 3, September 20 ISSN (Onlne): 694-084 www.ijcsi.org Document Representaton and Clusterng wth WordNet Based Smlarty Rough Set Model
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 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 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 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 informationHierarchical Image Retrieval by Multi-Feature Fusion
Preprnts (www.preprnts.org) NOT PEER-REVIEWED Posted: 26 Aprl 207 do:0.20944/preprnts20704.074.v Artcle Herarchcal Image Retreval by Mult- Fuson Xaojun Lu, Jaojuan Wang,Yngq Hou, Me Yang, Q Wang* and Xangde
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More 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 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 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 informationInformation Retrieval
Anmol Bhasn abhasn[at]cedar.buffalo.edu Moht Devnan mdevnan[at]cse.buffalo.edu Sprng 2005 #$ "% &'" (! Informaton Retreval )" " * + %, ##$ + *--. / "#,0, #'",,,#$ ", # " /,,#,0 1"%,2 '",, Documents are
More informationBRDPHHC: A Balance RDF Data Partitioning Algorithm based on Hybrid Hierarchical Clustering
015 IEEE 17th Internatonal Conference on Hgh Performance Computng and Communcatons (HPCC), 015 IEEE 7th Internatonal Symposum on Cyberspace Safety and Securty (CSS), and 015 IEEE 1th Internatonal Conf
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 informationRevealing Paths of Relevant Information in Web Graphs
Revealng Paths of Relevant Informaton n Web Graphs Georgos Kouzas 1, Vassleos Kolas 2, Ioanns Anagnostopoulos 1 and Eleftheros Kayafas 2 1 Unversty of the Aegean Department of Fnancal and Management Engneerng
More informationFuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval
Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,
More informationCombining Multiple Resources, Evidence and Criteria for Genomic Information Retrieval
Combnng Multple Resources, Evdence and Crtera for Genomc Informaton Retreval Luo S 1, Je Lu 2 and Jame Callan 2 1 Department of Computer Scence, Purdue Unversty, West Lafayette, IN 47907, USA ls@cs.purdue.edu
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More 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 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 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 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 informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More 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 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 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 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 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 informationReport on On-line Graph Coloring
2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm
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 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 informationSURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB
SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB V. Hotař, A. Hotař Techncal Unversty of Lberec, Department of Glass Producng Machnes and Robotcs, Department of Materal
More informationKeyword-based Document Clustering
Keyword-based ocument lusterng Seung-Shk Kang School of omputer Scence Kookmn Unversty & AIrc hungnung-dong Songbuk-gu Seoul 36-72 Korea sskang@kookmn.ac.kr Abstract ocument clusterng s an aggregaton of
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 informationA Webpage Similarity Measure for Web Sessions Clustering Using Sequence Alignment
A Webpage Smlarty Measure for Web Sessons Clusterng Usng Sequence Algnment Mozhgan Azmpour-Kv School of Engneerng and Scence Sharf Unversty of Technology, Internatonal Campus Ksh Island, Iran mogan_az@ksh.sharf.edu
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 informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More 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 informationHybrid Non-Blind Color Image Watermarking
Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,
More informationUB at GeoCLEF Department of Geography Abstract
UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department
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 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 informationObject-Based Techniques for Image Retrieval
54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the
More informationA Similarity Measure Method for Symbolization Time Series
Research Journal of Appled Scences, Engneerng and Technology 5(5): 1726-1730, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scentfc Organzaton, 2013 Submtted: July 27, 2012 Accepted: September 03, 2012
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 informationTOWARDS ADVANCED DATA RETRIEVAL FROM LEARNING OBJECTS REPOSITORIES
The Fourth Internatonal Conference on e-learnng (elearnng-03), 6-7 September 03, Belgrade, Serba TOWARDS ADVANCED DATA RETRIEVAL FROM LEARNING OBJECTS REPOSITORIES VALENTINA PAUNOVIĆ Belgrade Metropoltan
More informationImperialist Competitive Algorithm with Variable Parameters to Determine the Global Minimum of Functions with Several Arguments
Fourth Internatonal Conference Modellng and Development of Intellgent Systems October 8 - November, 05 Lucan Blaga Unversty Sbu - Romana Imperalst Compettve Algorthm wth Varable Parameters to Determne
More informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationThe Effect of Similarity Measures on The Quality of Query Clusters
The effect of smlarty measures on the qualty of query clusters. Fu. L., Goh, D.H., Foo, S., & Na, J.C. (2004). Journal of Informaton Scence, 30(5) 396-407 The Effect of Smlarty Measures on The Qualty of
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 information/02/$ IEEE
A Modfed Fuzzy ART for Soft Document Clusterng Ravkumar Kondadad and Robert Kozma Dvson of Computer Scence Department of Mathematcal Scences Unversty of Memphs, Memphs, TN 38152 ABSTRACT Document clusterng
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 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 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 informationLocal Tri-directional Weber Rhombus Co-occurrence Pattern: A New Texture Descriptor for Brodatz Texture Image Retrieval
ISS: 2278 323 Internatonal Journal of Advanced Research n Computer Engneerng & Technology (IJARCET) Local Tr-drectonal Weber Rhombus Co-occurrence Pattern: A ew Texture Descrptor for Brodatz Texture Image
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
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 informationVisual Thesaurus for Color Image Retrieval using Self-Organizing Maps
Vsual Thesaurus for Color Image Retreval usng Self-Organzng Maps Chrstopher C. Yang and Mlo K. Yp Department of System Engneerng and Engneerng Management The Chnese Unversty of Hong Kong, Hong Kong ABSTRACT
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationAn Image Compression Algorithm based on Wavelet Transform and LZW
An Image Compresson Algorthm based on Wavelet Transform and LZW Png Luo a, Janyong Yu b School of Chongqng Unversty of Posts and Telecommuncatons, Chongqng, 400065, Chna Abstract a cylpng@63.com, b y27769864@sna.cn
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationConnection-information-based connection rerouting for connection-oriented mobile communication networks
Dstrb. Syst. Engng 5 (1998) 47 65. Prnted n the UK PII: S0967-1846(98)90513-7 Connecton-nformaton-based connecton reroutng for connecton-orented moble communcaton networks Mnho Song, Yanghee Cho and Chongsang
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
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 informationK-means and Hierarchical Clustering
Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your
More informationA Method of Hot Topic Detection in Blogs Using N-gram Model
84 JOURNAL OF SOFTWARE, VOL. 8, NO., JANUARY 203 A Method of Hot Topc Detecton n Blogs Usng N-gram Model Xaodong Wang College of Computer and Informaton Technology, Henan Normal Unversty, Xnxang, Chna
More informationA Multiresolution Symbolic Representation of Time Series
A Multresoluton Symbolc Representaton of Tme Seres Vasleos Megalookonomou 1 Qang Wang 1 Guo L 1 Chrstos Faloutsos 2 1 Department of Computer & Informaton Scences 2 Department of Computer Scence Temple
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More information