Text Similarity Computing Based on LDA Topic Model and Word Co-occurrence
|
|
- Johnathan Norris
- 5 years ago
- Views:
Transcription
1 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, Electroncs and Informaton Guangx Unversty annng, Chna E-mal: Langx Qn School of Computer, Electroncs and Informaton Guangx Unversty annng, Chna E-mal: Abstract LDA (Latent Drchlet Allocaton) topc model has been wdely appled to text clusterng owng to ts effcent dmenson reducton. The prevalent method s to model text set through LDA topc model, to make nference by Gbbs samplng, and to calculate text smlarty wth JS (Jensen- Shannon) dstance. However, JS dstance cannot dstngush semantc assocatons among text topcs. For ths defect, a new text smlarty computng algorthm based on hdden topcs model and word co-occurrence analyss s ntroduced. Tests are carred out to verfy the clusterng effect of ths mproved computng algorthm. Results show that ths method can effectvely mprove text smlarty computng result and text clusterng accuracy. Keywords-topc model; LDA (Latent Drchlet Allocaton); JS (Jensen-Shannon) dstance; word co-occurrence; smlarty I. ITRODUCTIO Wth the rapd development of nternet, the amount of nformaton on the nternet ncreases exponentally. How to dscover useful nformaton effcently from the magnanmous text data (one of the man carrer of nformaton) becomes a cryng need. Vector space model (VSM), a classc mode n the text mnng area, represents the documents as space vector and computes the smlarty among the vectors to measure the smlarty among the documents. Herento, the TF-IDF (Term frequency-nverse document frequency) s the most wdely appled smlarty measure method. By ths method, word-weghtng s expressed by the frequency of a partcular word n a partcular document and by the nverse frequency of ths word n the document set. However, ths method gnores the semantc assocatons among words, leavng t dffcult to process the semantc factors. For example, there are no common words between Steve Jobs left us. and wll the prce of Apple products drop?, yet there s certan correlaton between them. For another example, when the word appears n two artcles descrbng respectvely a frut and a cell phone brand, the two apple are consdered as correlated. What s more, ths method also bears problems regardng the hgh-dmensonal sparse of data space. In solvng these problems, modelng the text set through LDA topc model and computng the smlarty of the text wth the JS (Jensen-Shannon) dstance have made preferable clusterng results. However, JS dstance cannot dstngush semantc assocaton among text topcs. Ths may leads to wrong clusterng of texts that have smlar topc probablty yet dfferent topcs. For ths defect, we ntroduce the dea of word co-occurrence to analyze the semantc correlaton of text themes, snce co-occurrence words embody the text topc better. It provdes an mproved text smlarty measure method based on hdden topc model and word cooccurrence analyss. II. RELATED WORKS A. Text hdden topc model Text topcs mnng have receved wde attenton and have been extensvely appled to text clusterng n recent years snce topc model can reduce dmensons effcently and s nterpretable. Currently avalable hdden topc model ncludes LSA (Latent Semantc Analyss) [], PLSA (Probablstc Latent Semantc Analyss) [2] and LDA, etc. LSA apples SVD (Sngular Value Decomposton) and other mathematcal method to dscover hdden semantc structures of documents. Its lmtaton les n ts dsablty to dstngush polysemy n the documents. PLSA s a probablstc model presented by Hofmann on the foundaton of LSA. Basng ts work on the producton model and maxmum lkelhood estmaton method, ths model gets results by EM (Expectaton Maxmzaton) algorthm. Thus PLSA s pror to LSA n dealng wth largescale date sets. LDA ntroduces Drchlet pror parameters to word layer and hdden topc layer n modelng, whch s a groundbreakng extenson of PLSA. It solves the problem of overfttng generated by concomtant lnear ncrease of topc parameters at the ncrease of tranng documents n PLSI model and LSI model, makng t more sutable for largescale corpus processng. Sh Jan-hong [3] et al. appled LDA topc model to Chnese mcro blog topc and carred out effectve mcro blog topc dscoveres. L Wen-bo [4] et al. rased a labeled LDA topc model by addng text class nformaton to the LDA topc model, whch calculated the dstrbuton of hdden topcs n each class and rased the classfcaton ablty of the tradtonal LDA model. Phan [5] et al. adopted hdden topc n text character extenson based on the external corpus. Sh Jng [6] et al. acheved a preferable extracton effect by usng Shannon nformaton to extract key words n LDA probablty dstrbuton. Quan [7] et al. used topc as dependency of thrd-party words and further mned text smlarty. Zhang Zh-fe [8] et al. rased a text 204. The authors - Publshed by Atlants Press 99
2 classfyng method based on LDA topc model and an overall consderaton of context. B. Word co-occurrence Word co-occurrence analyss s a successful use of natural language processng n nformaton retreval. Its core concept s that the co-occurrence rate of words can to some extent reflect the semantc correlaton of them. Word co-occurrence analyss s beng ncreasngly appled to text analyss. Geng Huan-tong [9] et al. rased the topc word extracton algorthm based on word cooccurrence, expandng extracton scope of the orgnal topc word by mnng the co-occurrence word of canddate words. Chang Peng [0] dd a deep analyss of the nner lnk between text topc representaton and word co-occurrence and desgned a new method of co-occurrence word extracton. He also rased a new document representaton model on ths bass. Yuan L-ch [] proposed to measure word smlarty based on the Mutual nformaton. Ths method effectvely elmnated word ndetermnacy. III. APPLICATIO OF LDA TOPIC MODEL I TEXT REPRESETATIO A. LDA topc model LDA (Latent Drchlet Allocaton) topc model s a threelayer Bayesan probablty model composed of word, topc and text. Its basc dea s that every document s a mxture of several hdden topcs and each hdden topc s a mxture of several words. The relaton between document and topc follows Drchlet pror dstrbuton and the relaton between topc and word follows polynomal dstrbuton. The generatve process of LDA s as shown n Fgure (): Fgure. LDA generaton probablty dagram Among the varables, M denotes the number of documents, K denotes the number of hdden topc, denotes the number of words n a document. α β are the document layer parameters of LDA, α denotes the relatve strength of latent hdden topcs n the document set and β denotes the probablty dstrbuton of all hdden topcs. θ denotes the topc probablty dstrbuton for certan document. φ denotes the word dstrbuton for certan hdden topc. Rectangle denotes repeated samplng process, unlateral crcle denotes hdden varables. Bcrcle denotes observable varables. The computng formula of probablty model s as shown n formula (): p( θ, z, w α, β) p( θ α) p( z θ) p( w z, β) () n n n n The generatve process of LDA topc model s as follows: ) For hdden topc, calculate φ polynomal dstrbuton of feature word of ts hdden topc accordng to Drchlet dstrbuton; 2) Obtan the number of words n the document accordng to Posson dstrbuton; 3) Calculate the topc probablty dstrbuton θ for each text; 4) For each feature word of each document of each document set: a) Select a hdden topc z randomly from the topc probablty dstrbuton θ; b) Select a feature word randomly from the polynomal dstrbuton of topc z. B. Gbbs samplng Parameter estmaton s needed n LDA modelng. Here Gbbs samplng s used. It s easy to understand, easy to realze and can effectvely select topcs from large-scale documents. The man dea of computng s that, for a certan feature word w, use Gbbs samplng to extract the approxmaton of the posteror dstrbuton pz ( z, w) of word from a hdden topc z. The computng formula s as shown n formula (2): ( d ),, ( ) ( d ), β, pz ( z, w) n + β n + α n + W n + Tα Among the varables, n, denotes the number of word tokens of feature word w assgned to the hdden topc. n, denotes the number of word tokens assgned to the hdden topc. n d, denotes the scale of feature words n document d that are assgned to hdden topc. n d, denotes the number of feature words n document d that are assgned to hdden topc. T and W denote nonnegatve weghtng. In teraton extractng process, parameter θ and φ s estmated separately accordng to formula (3) and formula (4). n + α (2) $ d ( d ) θ d n + Tα (3) $ n + β n + Wα (4) ϕ ( ) 200
3 IV. IMPROVED TEXT SIMILARITY COMPUTIG A. JS dstance Snce the topc dstrbuton of a text s a smple mappng of text space, smlarty of two texts can be measured by computng the topc dstrbuton. KL dstance s the measurement of dfference between two probabltes. Some people have used KL dstance as the crteron of smlarty computng. Let p(x) and q(x) be two probablty densty functons, the KL dstance between ths two can be defned as shown n formula (5): T p D ( p, q) p ln (5) KL However, DKL ( p, q) DKL ( q, p) means the KL dstance s asymmetrcal. So here ts symmetrcal verson s used as shown n formula (6): Dλ ( p, q) λdkl ( p, λp+ ( λ) q) + ( λ) D ( q, λp+ ( λ) q) When λ/2, the above formula turns nto JS dstance. Assgnng the value [0, ] to t, the results s as shown n formula (7): KL q (6) p + q p+ q Ds ( p, q) [ DKL ( p, )+ DKL ( q, )] (7) B. Improved text smlarty computng based on word cooccurrence JS Dstance can t dstngush the semantc relaton between topcs when t s used to carry out smlarty computng. For ths defect, an mproved smlarty computng method s proposed, whch analyzes the semantc correlaton between topcs from a word co-occurrence angle and adds a semantc correlaton computng of topc feature words to the orgnal JS measurng method. Detals are as follows: Assume T s the topc of text D, word set W { w, w, LLw } s the feature word of topc T. 2 Accordng to co-occurrence formula (8) (as follows), the cooccurrence probablty of feature word s p, p 2, p 3 L p. pw (, w ) pw ( T) pw ( T) (8) m n m n After the computng of co-occurrence probablty of topc feature word, here follows the dscusson of the semantc correlaton between feature words from topc T and topc T. If the probablty of feature word w m n topc T s p m, the co-occurrence probablty of feature word wm and wn n topc T s p mn ( pmn can be obtaned from formula (8), then the smlarty computng formula of w and w s as shown n formula (9) : m n pmn correlaton( wm, wn ) p + p p m n mn Accordng to formula (9), when the value of p mn s 0, correlaton( wm, w n ) 0, whch means feature word wm and w n s uncorrelated. When correlaton( wm, wn ) 0, feature word wm and wn s correlated. When takng a comprehensve consderaton from the angle of probablty dstrbuton of hdden topc and from the angle of feature word co-occurrence of hdden topc, t s known that when the smlarty degree of hdden topc probablty dstrbuton s hgh and the topc feature word s correlated, the text smlarty degree s the hghest and these documents should be placed n one category. When the smlarty degree of hdden topc probablty dstrbuton s low and the topc feature word s not correlated, the text smlarty degree s the lowest and these documents should not be placed n one category. When the smlarty degree of hdden topc probablty dstrbuton s hgh and the correlaton degree of topc feature word s low, smlarty between texts should be reduced. When the smlarty degree of hdden topc probablty dstrbuton s low and the correlaton degree of topc feature word s hgh, smlarty between texts should be enhanced. To sum up, a new text smlarty computng method s proposed, whch s shown n formula (0): Smlarty( d, d ) λ D s( d, d ) V (0) + ( λ ) ( correlaton( wm, w n )) ( V ( V )) mn, Among the varables, d and d denote arbtrary texts from the document set, wm and wn denotes the feature word of d and d separately, V denotes the number of feature word of ths selected document. λ [0,] denotes a correlaton coeffcent assgned to ths document. The smaller the value of Smlarty( d, d ) s, the more smlar the two texts d and d are. Detaled steps of ths mproved computng method are as follows: Computng method: Improved text smlarty computng method. Input: arbtrary text d and d, probablty dstrbuton φ and θ; Output: smlarty between d and d : Smlarty( d, d ) Step : extract the frst letters of hghest document probablty dstrbuton as the feature word of text d and d, (9) 20
4 based on the dstrbuton of word n probablty dstrbuton φ and θ; Step 2: extract feature word based on formula (8) and Step, calculate the co-occurrence probablty of text feature word; Step 3: calculate the correlaton between arbtrary feature words based on formula (9); Step 4: calculate smlarty between d and s Smlarty( d, d ) Step 3. d, whch, based on formula (7) and results from V. EXPERIMETAL DESIG AD RESULT AALYSIS A. Evaluaton crteron Ths paper measures text smlarty and clusterng effect wth a clusterng analyss of text, adoptng F Metrc, Precson Rato and Recall rato. F Metrc s a balance ndex for nformaton retreval combnng Precson Rato and Recall rato. Precson Rato P (, ), Recall rato R(, ) and F Metrc F (, ) are defned respectvely n formula (), (2) and (3): P (, ) () R (, ) (2) 2 P (, )* R (, ) F (, ) P (, ) + R (, ) (3) Among the varables, denotes the number of text from category n cluster. denotes the number of text from category. denotes the number of text from cluster. B. Corpus choce Ths method s tested n the Chnese Corpus of Fudan Unversty. In the experment, three subsets were extracted and were named as C3-Art C7-Hstory C9-Computer. From each subset, 400 peces of text were extracted, wth a total number of 200. C. Expermental procedure and man parameters selecton ) Preprocessng of document: manly ncludes word segmentaton and the elmnaton of Stop words, etc. Word segmentaton s carred out wth the ICTCLAS system developed by Insttute of Computng Technology n the Chnese Academy of Scences. 2) Document modelng: Document modelng: model the document by LDA topc model and do model solve and effcency analyss by Gbbs samplng algorthm. In the experment, assgn value to α and β accordng to Document [2]. Let α be 50/K, β be 0.0, T be 00, whch generates the best effect. Do the teraton for 000 tmes to get the probablty dstrbuton matrx θ of document-topc and probablty dstrbuton matrx φ of topc-word. 3) Document smlarty computng: measure document smlarty by the smlarty computng method mentoned n 4.2. Let λ be Repeated comparatve testng and analyzng show that the result s the best when the value of λ equals. Thus λ s assgned to the value of. 4) Document clusterng: carry out text clusterng through herarchcal clusterng algorthm and analyze the clusterng result to evaluate the degree of accuracy of the computng.. D. Analyses of expermental results Ths paper does a comparatve analyss of the orgnal computng method and LDA+ JS+ Word cooccurrence computng method proposed n ths paper. Expermental results are as shown n TABLE I, Fgure 2, Fgure 3 and Fgure 4. Results prove that the Accuracy rate and Recall rato of LDA+ JS+ Word co-occurrence computng method proposed n ths paper s hgher. Ths result owes to the fact that analyzng co-occurrence word as a whole can better represent the text topc. At the bass of adoptng JS Dstance n the measurng of text smlarty, topc correlaton analyss based on word cooccurrence s added, thus effectvely solvng problems concernng polysemy, synonym and context dependency, better representng text smlarty and effectvely reducng ms-clusterng of texts that have smlar topc probablty yet dfferent topcs. Test results prove that the smlarty computng method proposed n ths paper s feasble. TABLE I. EXPERIMETAL RESULT Category + Word co-occurrence Precson Rato Recall Rato F Metrc Precson Rato Recall Rato F Metrc Art Computer Hstory
5 +Word co-occurrence Art Computer Hstory Fgure 2. Precson Rato +Word co-occurrence Art Computer Hstory Fgure 3. Recall Rato +word co-occurrence Art Computer Hstory Fgure 4. F Metrc VI. COCLUSIO In ths paper, we present a research nto text smlarty computng from the two angles of text hdden topc probablty dstrbuton dfferences and of semantc correlaton of text feature words. Modelng documents by LDA hdden topc model greatly reduces text dmenson and mproves the computng effcency. Analyzng semantc correlaton of text feature word from a word co-occurrence angle based on LDA model enhances the use of text topc nformaton and effectvely mproves text clusterng result. Snce LDA topc model s hghly expandable, follow-up works wll be centered on new text modelng method and text smlarty computng method. Ideas may nclude modelng text by replacng the sngle word n LDA model wth co-occurrence word combnaton. Ths topc-based processng method has much sgnfcance for Data Mnng and other dscplnes. REFERECES [] Deerwester S, Dumas S, Landauer T. Indexng by latent semantc analyss [J]. Journal of the Amercan Socety of Informaton Scence, 990,4(6): [2] Hofmann T. Probablstc latent semantc ndexng[c] // Proc of the 22nd Annual Int ACM SIGIR Conf on Research and Development n Informaton Retreval. ew York: ACM, 999:50-57 [3] Sh Jan-hong, Chen Xng-shu, Wang Wen-xan. Dscoverng topc from mcroblog based on hdden topcs analyss [J]. Applcaton Research of Computers. 204, 3(3): [4] L Wen-bo, Sun Le, Zhang Da-kun. Text classfcaton based on Labled-LDA model [J]. Chnese Journal of Computers, 2008, 3(4): [5] Phan X H, guyen L M, Horguch S. Learnng to classfy short and sparse text & web wth hdden topcs from large - scale data collectons[c] In: Proceedngs of the 7th Internatonal Conference on World Wde Web (WWW08). ewyork: ACM, 2008: 9-00 [6] Sh Jng, L Wan-long. Topc words extracton method based on LDA model [J]. Computer Engneerng, 200,9(36): 8-83 [7] Quan X J, Lu G, Lu Z. Short text smlarty based on probablstc topcs [J]. Knowledge Informaton System, 200, 25(3): [8] Zhang Zh-fe, Mao Duo-qan, Gao Can. Short text classfcaton usng latent Drchlet allocaton [J]. Journal of Computer Applcatons, 203,33(6): [9] Geng Huan-tong, Ca Qng-Sheng, Yu Kun, Zhao Peng. A knd of automatc text key phrase extracton method based on word cooccurrence[j]. Journal of anng Unversty (atural Scences), 2006,42(2): [0] Chang Peng. Research on terms co-occurrence based models and algorthms for Text Mnng [D]. Tann: Tentsn Unversty, 2009: [] Yuan L-ch. A word clusterng method based on mutual nformaton [J]. Systems Engneerng, 2008,26(5): [2] Huang Bo. Research on mcroblog topc detecton based on VSM model and LDA model[d]. Chengdu: Southwest Jaotong Unversty, 202:
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 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 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 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 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 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 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 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 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 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 informationResearch on Categorization of Animation Effect Based on Data Mining
MATEC Web of Conferences 22, 0102 0 ( 2015) DOI: 10.1051/ matecconf/ 2015220102 0 C Owned by the authors, publshed by EDP Scences, 2015 Research on Categorzaton of Anmaton Effect Based on Data Mnng Na
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 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 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 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 informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More 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 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 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 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 informationCross-lingual Pseudo Relevance Feedback Based on Weak Relevant Topic Alignment
Cross-lngual Pseudo Relevance Feedback Based on Weak Relevant opc Algnment WANG Xu-wen Insttute of Medcal Informaton & Lbrary, Chnese Academy of Medcal Scences, Beng 100020 wang.xuwen@mcams.ac.cn ZHANG
More informationMULTISPECTRAL REMOTE SENSING IMAGE CLASSIFICATION WITH MULTIPLE FEATURES
MULISPECRAL REMOE SESIG IMAGE CLASSIFICAIO WIH MULIPLE FEAURES QIA YI, PIG GUO, Image Processng and Pattern Recognton Laboratory, Bejng ormal Unversty, Bejng 00875, Chna School of Computer Scence and echnology,
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 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 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 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 informationDeep Classification in Large-scale Text Hierarchies
Deep Classfcaton n Large-scale Text Herarches Gu-Rong Xue Dkan Xng Qang Yang 2 Yong Yu Dept. of Computer Scence and Engneerng Shangha Jao-Tong Unversty {grxue, dkxng, yyu}@apex.sjtu.edu.cn 2 Hong Kong
More 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 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 informationThe Discriminate Analysis and Dimension Reduction Methods of High Dimension
Open Journal of Socal Scences, 015, 3, 7-13 Publshed Onlne March 015 n ScRes. http://www.scrp.org/journal/jss http://dx.do.org/10.436/jss.015.3300 The Dscrmnate Analyss and Dmenson Reducton Methods of
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
More 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 informationThe Study of Remote Sensing Image Classification Based on Support Vector Machine
Sensors & Transducers 03 by IFSA http://www.sensorsportal.com The Study of Remote Sensng Image Classfcaton Based on Support Vector Machne, ZHANG Jan-Hua Key Research Insttute of Yellow Rver Cvlzaton and
More informationA fast algorithm for color image segmentation
Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au
More 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 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 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 informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationA Novel Term_Class Relevance Measure for Text Categorization
A Novel Term_Class Relevance Measure for Text Categorzaton D S Guru, Mahamad Suhl Department of Studes n Computer Scence, Unversty of Mysore, Mysore, Inda Abstract: In ths paper, we ntroduce a new measure
More informationWeb Document Classification Based on Fuzzy Association
Web Document Classfcaton Based on Fuzzy Assocaton Choochart Haruechayasa, Me-Lng Shyu Department of Electrcal and Computer Engneerng Unversty of Mam Coral Gables, FL 33124, USA charuech@mam.edu, shyu@mam.edu
More informationWireless Sensor Network Localization Research
Sensors & Transducers 014 by IFSA Publshng, S L http://wwwsensorsportalcom Wreless Sensor Network Localzaton Research Lang Xn School of Informaton Scence and Engneerng, Hunan Internatonal Economcs Unversty,
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 informationRecommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm
Recommended Items Ratng Predcton based on RBF Neural Network Optmzed by PSO Algorthm Chengfang Tan, Cayn Wang, Yuln L and Xx Q Abstract In order to mtgate the data sparsty and cold-start problems of recommendaton
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
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 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 informationAssociative Based Classification Algorithm For Diabetes Disease Prediction
Internatonal Journal of Engneerng Trends and Technology (IJETT) Volume-41 Number-3 - November 016 Assocatve Based Classfcaton Algorthm For Dabetes Dsease Predcton 1 N. Gnana Deepka, Y.surekha, 3 G.Laltha
More 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 informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More 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 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 informationThe Rate Adapting Poisson Model for Information Retrieval and Object Recognition
for Informaton Retreval and Object Recognton Peter V. Gehler PGEHLER@TUEBINGEN.MPG.DE Max Planck Insttute for Bologcal Cybernetcs, Spemannstrasse 38, 72076 Tübngen, Germany Alex D. Holub HOLUB@VISION.CALTECH.EDU
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 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 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 informationOn-line Hot Topic Recommendation Using Tolerance Rough Set Based Topic Clustering
JOURNAL OF COMPUTERS, VOL. 5, NO. 4, APRIL 2010 549 On-lne Hot Topc Recommendaton Usng Tolerance Rough Set Based Topc Clusterng Yonghu Wu, Yuxn Dng, Xaolong Wang, Jun Xu Intellgence Computng Research Center
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 informationEfficient Text Classification by Weighted Proximal SVM *
Effcent ext Classfcaton by Weghted Proxmal SVM * Dong Zhuang 1, Benyu Zhang, Qang Yang 3, Jun Yan 4, Zheng Chen, Yng Chen 1 1 Computer Scence and Engneerng, Bejng Insttute of echnology, Bejng 100081, Chna
More informationOptimizing Document Scoring for Query Retrieval
Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationExtraction of Human Activities as Action Sequences using plsa and PrefixSpan
Extracton of Human Actvtes as Acton Sequences usng plsa and PrefxSpan Takuya TONARU Tetsuya TAKIGUCHI Yasuo ARIKI Graduate School of Engneerng, Kobe Unversty Organzaton of Advanced Scence and Technology,
More informationChinese Word Segmentation based on the Improved Particle Swarm Optimization Neural Networks
Chnese Word Segmentaton based on the Improved Partcle Swarm Optmzaton Neural Networks Ja He Computatonal Intellgence Laboratory School of Computer Scence and Engneerng, UESTC Chengdu, Chna Department of
More informationInternational Conference on Applied Science and Engineering Innovation (ASEI 2015)
Internatonal Conference on Appled Scence and Engneerng Innovaton (ASEI 205) Desgn and Implementaton of Novel Agrcultural Remote Sensng Image Classfcaton Framework through Deep Neural Network and Mult-
More informationComparison Study of Textural Descriptors for Training Neural Network Classifiers
Comparson Study of Textural Descrptors for Tranng Neural Network Classfers G.D. MAGOULAS (1) S.A. KARKANIS (1) D.A. KARRAS () and M.N. VRAHATIS (3) (1) Department of Informatcs Unversty of Athens GR-157.84
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationSupport Vector Machines
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 informationPruning Training Corpus to Speedup Text Classification 1
Prunng Tranng Corpus to Speedup Text Classfcaton Jhong Guan and Shugeng Zhou School of Computer Scence, Wuhan Unversty, Wuhan, 430079, Chna hguan@wtusm.edu.cn State Key Lab of Software Engneerng, Wuhan
More informationModeling Inter-cluster and Intra-cluster Discrimination Among Triphones
Modelng Inter-cluster and Intra-cluster Dscrmnaton Among Trphones Tom Ko, Bran Mak and Dongpeng Chen Department of Computer Scence and Engneerng The Hong Kong Unversty of Scence and Technology Clear Water
More informationLocal Quaternary Patterns and Feature Local Quaternary Patterns
Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents
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 informationUnderstanding K-Means Non-hierarchical Clustering
SUNY Albany - Techncal Report 0- Understandng K-Means Non-herarchcal Clusterng Ian Davdson State Unversty of New York, 1400 Washngton Ave., Albany, 105. DAVIDSON@CS.ALBANY.EDU Abstract The K-means algorthm
More informationNon-Negative Matrix Factorization and Support Vector Data Description Based One Class Classification
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 5, No, September 01 ISSN (Onlne): 1694-0814 www.ijcsi.org 36 Non-Negatve Matrx Factorzaton and Support Vector Data Descrpton Based One
More informationBOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET
1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School
More informationBAYESIAN MULTI-SOURCE DOMAIN ADAPTATION
BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION SHI-LIANG SUN, HONG-LEI SHI Department of Computer Scence and Technology, East Chna Normal Unversty 500 Dongchuan Road, Shangha 200241, P. R. Chna E-MAIL: slsun@cs.ecnu.edu.cn,
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 informationEvaluation of the application of BIM technology based on PCA - Q Clustering Algorithm and Choquet Integral
IETI Transactons on Busness and Management Scences, 2016, Volume 1, Issue 1, 47-55. http://www.et.net/tc An Internatonal Open Access Journal Evaluaton of the applcaton of BIM technology based on PCA -
More informationA Hidden Markov Model Variant for Sequence Classification
Proceedngs of the Twenty-Second Internatonal Jont Conference on Artfcal Intellgence A Hdden Markov Model Varant for Sequence Classfcaton Sam Blasak and Huzefa Rangwala Computer Scence, George Mason Unversty
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 informationJournal of Chemical and Pharmaceutical Research, 2014, 6(6): Research Article
Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(6):2512-2520 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 Communty detecton model based on ncremental EM clusterng
More 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 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 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 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 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 informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
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 informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
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 informationExperiments in Text Categorization Using Term Selection by Distance to Transition Point
Experments n Text Categorzaton Usng Term Selecton by Dstance to Transton Pont Edgar Moyotl-Hernández, Héctor Jménez-Salazar Facultad de Cencas de la Computacón, B. Unversdad Autónoma de Puebla, 14 Sur
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 informationFINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK
FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,
More informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
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 informationImage Emotional Semantic Retrieval Based on ELM
Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 2014) Image Emotonal Semantc Retreval Based on ELM Pele Zhang, Mn Yao, Shenzhang La College of computer scence & Technology
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 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 informationCorrelative features for the classification of textural images
Correlatve features for the classfcaton of textural mages M A Turkova 1 and A V Gadel 1, 1 Samara Natonal Research Unversty, Moskovskoe Shosse 34, Samara, Russa, 443086 Image Processng Systems Insttute
More information