Relevance Feedback Document Retrieval using Non-Relevant Documents
|
|
- Warren Eaton
- 5 years ago
- Views:
Transcription
1 Relevance Feedback Document Retreval usng Non-Relevant Documents TAKASHI ONODA, HIROSHI MURATA and SEIJI YAMADA Ths paper reports a new document retreval method usng non-relevant documents. From a large data set of documents, we need to fnd documents that relate to human nterestng n as few teratons of human testng or checkng as possble. In each teraton a comparatvely small batch of documents s evaluated for relatng to the human nterestng. Ths method s called relevance feedback. The relevance feedback needs a set of relevant and non-relevant documents. However, the ntal presented documents whch are checked by a user don t always nclude relevant documents. Accordngly we propose a feedback method usng nformaton of non-relevant documents only. We named ths method non-relevance feedback. The rrelevance feedback selects a set of documents based on learnng result by One-class SVM. Results from experments show that ths method s able to retreve a relevant document from a set of non-relevant documents effectvely. 1. Introducton As Internet technology progresses, accessble nformaton by end users s explosvely ncreasng. In ths stuaton, we can now easly access a huge document database through the web. However t s hard for a user to retreve relevant documents from whch he/she can obtan useful nformaton, and a lot of studes have been done n nformaton retreval, especally document retreval 1). Actve works for such document retreval have been reported n TREC (Text Retreval Conference) 2) for Englsh documents, IREX (Informaton Retreval and Extracton Exercse) 3) and NTCIR (NII- NACSIS Test Collecton for Informaton Retreval System) 4) for Japanese documents. In general, snce a user hardly descrbes a precse query n the frst tral, nteractve approach to modfy the query vector by evaluaton of the user on documents n a lst of retreved documents. Ths method s called relevance feedback 6) and used wdely n nformaton retreval systems. In ths method, a user drectly evaluates whether a document s relevant or non-relevant n a lst of retreved documents, and a system modfes the query vector usng the user evaluaton. In another approach, relevant and rrelevant document vectors are consdered as postve and negatve examples, and relevance feedback s transposed to a bnary class classfcaton problem 7). For the bnary class classfcaton problem, Support Vector Machnes(whch are called SVMs) have shown the Central Research Insttute of Electrc Power Industry Natonal Insttute of Informatcs Fg. 1 Non- Relevant Documents Intal Search: Input Query Feedback Search & Rankng Check relevant or non-relevant Dsplay top N ranked documents Image of a problem n the relevance feedback documents retreval: The gray arrow parts are made teratvely to retreve useful documents for the user. Ths teraton s called feedback teraton n the nformaton retreval research area. But f the evaluaton of the user has only non-relevant documents, ordnary relevance feedback methods can not feed back the nformaton of useful retreval. excellent ablty. And some studes appled SVM to the text classfcaton problems 8) and the nformaton retreval problems 9). Recently, we have proposed a relevance feedback framework wth SVM as actve learnng and shown the usefulness of our proposed method expermentally 10). The ntal retreved documents, whch are dsplayed to a user, sometmes don t nclude relevant documents. In ths case, almost all relevance feedback document retreval systems work hardly, because the systems need relevant and non-relevant documents to construct a bnary class classfcaton problem(see Fgure 1). Whle a machne learnng research feld has some methods whch can deal wth one class classfcaton problem. In the above document retreval case, 1
2 we can use only non-relevant documents nformaton. Therefore, we consder ths retreval stuaton s as same as one class classfcaton problems. In ths paper, we propose a framework of an nteractve document retreval usng only non-relevant documents nformaton. We call the nteractve document retreval non-relevance feedback document retreval, because we can use only nonrelevant documents nformaton. Our proposed non-relevance document retreval s based on One Class Support Vector Machne(One-Class SVM) 11). One-Class SVM can generate a dscrmnant hyperplane that can separate the non-relevant documents whch are evaluated by a user. Our proposed method can dsplay documents, whch may be relevant documents for the user, usng the dscrmnant hyperplane. In the remanng parts of ths paper, we explan the One-Class SVM algorthm n the next secton brefly, and propose our document retreval method based on One-Class SVM n the thrd secton. In the fourth secton, n order to evaluate the effectveness of our approach, we made experments usng a TREC data set of Los Angels Tmes and dscuss the expermental results. Fnally we conclude our work and dscuss our future work n the ffth secton. 2. One-Class SVM Schölkopf et al. suggested a method of adaptng the SVM methodology to one-class classfcaton problem. Essentally, after transformng the feature va a kernel, they treat the orgn as the only member of the second class. The usng relaxaton parameters they separate the mage of the one class from the orgn. Then the standard two-class SVM technques are employed. One-class SVM 11) returns a functon f that takes the value +1 n a small regon capturng most of the tranng data ponts, and -1 elsewhere. The algorthm can be summarzed as mappng the data nto a feature space H usng an approprate kernel functon, and then tryng to separate the mapped vectors from the orgn wth maxmum margn(see Fgure /reffg:one-classsvm). Let the tranng data be x 1,...,x l (1) belongng to one class X, where X s a compact subset of R N and l s the number of observatons. Let Φ : X H be a kernel map whch transforms the tranng examples to feature space. The dot product n the mage of Φ can be computed by Fg. 2 Orgn One-Class SVM Classfer: the orgn s the only orgnal member of the second class. evaluatng some smple kernel k(x, y) =(Φ(x) Φ(y)) (2) such as the Gaussan kernel ( ) x y 2 k(x, y) =exp. (3) c The strategy s to map the data nto the feature space correspondng to the kernel, and to separate them from the orgn wth maxmum margn. Then, To separate the data set from the orgn, one needs to solve the followng quadratc program: 1 mn w H,ξ R l ρ R N 2 w ξ ρ νl subject to (w Φ(x )) ρ ξ, (4) ξ 0. Here, ν (0, 1) s an upper bound on the fracton of outlers, and a lower bound on the fracton of Support Vectors. Snce nonzero slack varables ξ are penalzed n the objectve functon, we can expect that f w and ρ solve ths problem, then the decson functon f(x) =sgn((w Φ(x)) ρ) (5) wll be postve for most examples x contaned n the tranng set, whle the SV type regularzaton term w wll stll be small. The actual trade-off between these two s controlled by ν. For a new pont x, the value f(x) s determned by evaluatng whch sde of the hyperplane t falls on, n feature space. Usng multplers α,β 0, we ntroduce a Lagrangan L(w, ξ,ρ,α, β) = 1 2 w ξ ρ νl α ((w x ) ρ + ξ ) β ξ (6) and set the dervatves wth respect to the prmal varables w,ξ,ρequal to zero, yeldng 2
3 w = α x, (7) α = 1 νl β 1 νl, α =1. (8) In Eqn. (7), all patterns {x : [l],α > 0} are called Support Vectors. Usng Eqn. (2), the SV expanson transforms ( the decson functon ) Eqn. (5) f(x) =sgn α k(x, x) ρ. (9) Substtutng Eqn. (7) and Eqn. (8) nto Eqn. (6), we obtan the dual problem: 1 mn α α α j k(x, x j ) 2,j subject to 0 α 1 νl, α =1. (10) One can show that at the optmum, the two nequalty constrants Eqn. (4) become equaltes f α and β are nonzero,.e. f 0 <α 1/(νl). Therefore, we can recover ρ by explotng that for any such α, the correspondng pattern x satsfes ρ =(w x )= α j x j x. (11) j Note that f ν approaches 0, the upper boundares on the Lagrange multplers tend to nfnty,.e. the second nequalty constrant n Eqn. (10) become vod. The problem then resembles the correspondng hard margn algorthm, snce the penalzaton of errors becomes nfnte, as can be seen from the prmal objectve functon Eqn. (4). It s stll a feasble problem, snce we have placed no restrcton on ρ, soρ can become a large negatve number n order to satsfy Eqn. (4). If we had requred ρ 0 from the start, we would have ended up wth the constrant α 1 nstead of the correspondng equalty constrant n Eqn. (10), and the multplers α could have dverged. In our research we used the LIBSVM. Ths s an ntegrated tool for support vector classfcaton and regresson whch can handle one-class SVM usng the Schölkopf etc algorthms. The LIBSVM s avalable at cjln/lbsvm. 3. Non-relevance Feedback Document Retreval In ths secton, we descrbe our proposed method of document retreval based on Non-relevant documents usng One-class SVM. The ntal retreved documents, whch are dsplayed to a user, sometmes don t nclude relevant documents. In ths case, almost all relevance feedback document retreval systems does not contrbute to effcent document retreval, because the systems need relevant and non-relevant documents to construct a bnary class classfcaton problem(see Fgure 1). The One-Class SVM can generate dscrmnant hyperplane for the one class usng one class tranng data. Consequently, we propose to apply One- Class SVM n a non-relevance feedback document retreval method. The retreval steps of proposed method perform as follows: Step 1: Preparaton of documents for the frst feedback The conventonal nformaton retreval system based on vector space model dsplays the top N ranked documents along wth a request query to the user. In our method, the top N ranked documents are selected by usng cosne dstance between the request query vector and each document vectors for the frst feedback teraton. Step 2: Judgment of documents The user then classfers these N documents nto relevant or non-relevant. If the user labels all N documents non-relevant, the documents are labeled +1 and go to the next step. If the user classfes the N documents nto relevant documents and non-relevant documents, the non-relevant documents are labeled +1 and non-relevant documents are labeled -1 and then our prevous proposed relevant feedback method s adopted 10). Step 3: Determnaton of non-relevant documents area based on non-relevant documents The dscrmnant hyperplane for classfyng non-relevant documents area s generated by usng One-Class SVM. In order to generate the hyperplane, the One-Class SVM learns labeled non-relevant documents whch are evaluated n the prevous step (see Fgure 3). Step 4: Classfcaton of all documents and Selecton of retreved documents The One-class SVM learned by prevous step can classfes the whole documents as nonrelevant or not non-relevant. The documents whch are dscrmnated n not non-relevant 3
4 Fg. 3 w Generaton of a hyperplane to dscrmnate non-relevant documents area: Crcles denote documents whch are checked non-relevant by a user. The sold lne denotes the dscrmnant hyperplane. w Fg. 4 Mapped non-checked documents nto the feature space: Boxes denote non-checked documents whch are mapped nto the feature space. Crcles denotes checked documents whch are mapped nto the feature space. Gray boxes denotes the dsplayed documents to a user n the next teraton. These documents are n the not non-relevant document area and near the dscrmnant hyperplane. area are newly selected. From the selected documents, the top N ranked documents, whch are ranked n the order of the dstance from the non-relevant documents area, are shown to user as the document retreval results of the system (see Fgure 4). Then return to Step 2. The feature of our One-Class SVM based nonrelevant feedback document retreval s the selecton of dsplayed documents to a user n Step 4. Our proposed method selects the documents whch are dscrmnated not non-relevant and near the dscrmnant hyperplane between non-relevant documents and not non-relevant documents. Generally f the system got the opposte nformaton from a user, the system should select the nformaton, whch s far from the opposte nformaton area, for dsplayng to the user. However, n our case, the classfed non-relevant documents by the user ncludes a request query vector of the user. Therefore, f we select the documents, whch are far from the non-relevant documents area, the documents may not nclude the request query of the user. Our selected documents (see Fgure 4) s expected that the probablty of the relevant documents for the user s hgh, because the documents are not non-relevant and may nclude the query vector of the user. 4. Experments 4.1 Expermental settng We made experments for evaluatng the utlty of our nteractve document retreval based on non-relevant documents usng One-Class SVM descrbed n secton 3. The document data set we used s a set of artcles n the Los Angels Tmes whch s wdely used n the document retreval conference TREC 2). The data set has about 130 thousands artcles. The average number of words n a artcle s 526. Ths data set ncludes not only queres but also the relevant documents to each query. Thus we used the queres for experments. Our experment used three topcs for experments and show these topcs n Table 1. These topcs do not have relevant documents n top 20 ranked documents n the order of cosne dstance between the query vector and document vectors. Our experments set the sze of N of dsplayed documents presented n Step 1 n the secton 3 10 or 20. We used TFIDF 1), whch s one of the most popular methods n nformaton retreval to generate document feature vectors, and we adoped the equaton of TFIDF n the reference 12). In our experments, we used the lnear kernel for One-class SVM learnng, and found a dscrmnant functon for the One-class SVM classfer n the feature space. The vector space model of documents s hgh dmensonal space. Moreover, the number of the documents whch are evaluated by a user s small. Therefore, we do not need to use the kernel trck and the parameter ν (see secton 2) s set adequately small value (ν =0.01). The small ν means hard margn n the One-Class SVM. For comparson wth our approach, two nformaton retreval methods were used. The frst s an nformaton retreval method that does not use a feedback, namely documents are retreved usng the rank n vector space model(vsm). The second Table 1 Topcs, query words and the number of relevant documents n the Los Angels Tmes used for experments topc query words # of relevant doc. 306 Afrca, cvlan, death polce, death mental, ll, drug 55 4
5 Table 2 The number of retreved relevant documents at each teraton: the number of dsplayed documents s 10 at each teraton topc 308 # of retreved relevant doc. # of teratons Proposed method VSM Roccho topc 343 # of retreved relevant doc. # of teratons Proposed method VSM Roccho topc 383 # of retreved relevant doc. # of teratons Proposed method VSM Roccho s an nformaton retreval method usng conventonal Roccho-based relevance feedback 6) whch s wdely used n nformaton retreval research. The Roccho-based relevance feedback modfes a query vector Q by evaluaton of a user usng the followng equaton. Q +1 = Q + α x β x, (12) x R r x R n where R r s a set of documents whch were evaluated as relevant documents by a user at the th feedback, and R n s a set of documents whch were evaluated as non-relevant documents at the feedback. α and β are weghts for relevant and nonrelevant documents respectvely. In ths experment, we set α =1.0 β =0.5whch are known adequate expermentally. 4.2 Expermental results Here, we descrbe the relatonshps between the performances of proposed method and the number of feedback teratons. Table 2 gave the number of retreved relevant documents at each feedback teraton. At each feedback teraton, the system dsplays ten hgher ranked not non-relevant documents, whch are near the dscrmnant hyperplane, for our proposed method. We also show the retreved documents of Roccho-based method at each feedback teraton for comparng to proposed method n table 2. We can see from ths table that our non-relevance Table 3 The number of retreved relevant documents at each teraton: the number of dsplayed documents s 20 at each teraton topc 306 # of retreved relevant doc. # of teratons Proposed method VSM Roccho topc 343 # of retreved relevant doc. # of teratons Proposed method VSM Roccho topc 383 # of retreved relevant doc. # of teratons Proposed method VSM Roccho feedback approach gves the hgher performance n terms of the number of teraton for retrevng relevant document. On the other hand, the Rocchobased feedback method cannot search a relevant document n all cases. The vector space model wthout feedback s better than Roccho-based feedback. After all, we can beleve that proposed method can make an effectve document retreval usng only non-relevant documents, and Rocchobased feedback method can not work well when the system can receve the only non-relevant documents nformaton. Table 3 gave the number of retreved relevant documents at each feedback teraton. At each feedback teraton, the system dsplays twenty hgher ranked not non-relevant documents, whch are near the dscrmnant hyperplane, for our proposed method. We also show the retreved documents of Roccho-based method at each feedback teraton for comparng to proposed method n table 3. We can observe from ths table that our nonrelevance feedback approach gves the hgher performance n terms of the number of teraton for retrevng relevant documents, and the same expermental results as table 2 about Roccho-based method and VSM. In table 2, a user already have seen twenty documents at the frst teraton. Before the fst teraton, the user have to see ten documents, whch are retreved results usng cosne dstance between a query vector and document vectors n VSM. In 5
6 table 3, the user also have seen forty documents at the frst teraton. Before the fst teraton, the user also have to see ten documents to evaluate the documents, whch are retreved results usng cosne dstance between a query vector and document vectors n VSM. When we compare the expermental results of table 2 wth the results of table 3, we can observe that the small number of dsplayed documents makes more effectve document retreval performance than the large number of dsplayed documents. In table 2, the user had to see thrty documents by fndng the frst relevant document about topc 343 and 383. In table 3, the user had to see forty documents by fndng the frst relevant document about topc 343 and 383. Therefore, we beleve that the early non-relevance feedback s useful for an nteractve document retreval. 5. Concluson In ths paper, we proposed the non-relevance feedback document retreval based on One-Class SVM usng only non-relevant documents for a user. In our non-relevance feedback document retreval, the system use only non-relevant documents nformaton. One-Class SVM can generate a dscrmnant hyperplane of observed one class nformaton, so our proposed method adopted One-Class SVM for non-relevance feedback document retreval. Ths paper compared our method wth a conventonal relevance feedback method and a vector space model wthout feedback. Expermental results on a set of artcles n the Los Angels Tmes showed that the proposed method gave a consstently better performance than the compared method. Therefore we beleve that our proposed One-Class SVM based approach s very useful for the document retreval wth only non-relevant documents nformaton. If our proposed non-relevant feedback document retreval method fnd and dsplay relevant documents for a user, the system wll swtch from our non-relevant feedback method to ordnary relevance feedback document retreval method mmedately. When one see ths procedure, one may thnk that there are few chances of usng our nonrelevant feedback method n an nteractve document retreval. However, we guess that our nonrelevant feedback method has a lot of chances n the nteractve document retreval. Because t s very hard for the nteractve document retreval to fnd relevant documents usng a few keywords n a large database. For nstance, please consder a case where you want to search patent nformaton related your research. In the frst, you nput a few keywords to fnd your nterestng patent nformaton. And then you can see too many patent documents. Can you fnd your nterestng nformaton n them easly We thnk t s very dffcult to fnd nterestng nformaton n the top 100 documents. Therefore, we beleve that our proposed non-relevance feedback method s useful for an effectve nteractve document retreval. Ths paper proposed that the system should dsplay the documents whch are n the not nonrelevant documents area and near the dscrmnant hyperplane of One-Class SVM at each feedback teraton. However, we do not dscuss how the selecton of documents nfluence both the effectve learnng and the performance of nformaton retreval theoretcally. Ths pont s our future work. References 1) Yates, R. B. and Neto, B. R.: Modern Informaton Retreval, Addson Wesley (1999). 2) TREC Web page: 3) IREX: 4) NTCIR: ñtcadm/. 5) Salton, G. and McGll, J.: Introducton to modern nformaton retreval, McGraw-Hll (1983). 6) Salton, G.(ed.): Relevance feedback n nformaton retreval, Englewood Clffs, N.J.: Prentce Hall, pp (1971). 7) Okabe, M. and Yamada, S.: Interactve Document Retreval wth Relatonal Learnng, Proceedngs of the 16th ACM Symposum on Appled Computng, pp (2001). 8) Tong, S. and Koller, D.: Support Vector Machne Actve Learnng wth Applcatons to Text Classfcaton, Journal of Machne Learnng Research, Vol. 2, pp (2001). 9) Drucker, H., Shahrary, B. and Gbbon, D. C.: Relevance Feedback usng Support Vector Machnes, Proceedngs of the Eghteenth Internatonal Conference on Machne Learnng, pp (2001). 10) Onoda, T., Murata, H. and Yamada, S.: Relevance Feedback wth Actve Learnng for Document Retreval, Proc. of IJCNN2003, pp (2003). 11) Schölkopf, B., Platt, J., Shawe-Taylor, J., Smola, A. and Wllamson, R.: Estmatng the Support for a Hgh-Dmensonal Dstrbuton, Techncal Report MSR-TR-99-87, Mcrosoft Research, One Mcrosoft Way Redmon WA (1999). 12) Schapre, R., Snger, Y. and Snghal, A.: Boostng and Roccho Appled to Text Flterng, Proceedngs of the Twenty-Frst Annual Internatonal ACM SI- GIR, pp (1998). 6
Classification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationMachine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)
Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes
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 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 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 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 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 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 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 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 informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationAnnouncements. Supervised Learning
Announcements See Chapter 5 of Duda, Hart, and Stork. Tutoral by Burge lnked to on web page. Supervsed Learnng Classfcaton wth labeled eamples. Images vectors n hgh-d space. Supervsed Learnng Labeled eamples
More informationIncremental Learning with Support Vector Machines and Fuzzy Set Theory
The 25th Workshop on Combnatoral Mathematcs and Computaton Theory Incremental Learnng wth Support Vector Machnes and Fuzzy Set Theory Yu-Mng Chuang 1 and Cha-Hwa Ln 2* 1 Department of Computer Scence and
More 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 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 informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
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 informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More 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 informationClassification and clustering using SVM
Lucan Blaga Unversty of Sbu Hermann Oberth Engneerng Faculty Computer Scence Department Classfcaton and clusterng usng SVM nd PhD Report Thess Ttle: Data Mnng for Unstructured Data Author: Danel MORARIU,
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 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 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 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 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 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 informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS46: Mnng Massve Datasets Jure Leskovec, Stanford Unversty http://cs46.stanford.edu /19/013 Jure Leskovec, Stanford CS46: Mnng Massve Datasets, http://cs46.stanford.edu Perceptron: y = sgn( x Ho to fnd
More informationFace Recognition Based on SVM and 2DPCA
Vol. 4, o. 3, September, 2011 Face Recognton Based on SVM and 2DPCA Tha Hoang Le, Len Bu Faculty of Informaton Technology, HCMC Unversty of Scence Faculty of Informaton Scences and Engneerng, Unversty
More informationHuman Face Recognition Using Generalized. Kernel Fisher Discriminant
Human Face Recognton Usng Generalzed Kernel Fsher Dscrmnant ng-yu Sun,2 De-Shuang Huang Ln Guo. Insttute of Intellgent Machnes, Chnese Academy of Scences, P.O.ox 30, Hefe, Anhu, Chna. 2. Department of
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 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 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 informationTraining of Kernel Fuzzy Classifiers by Dynamic Cluster Generation
Tranng of Kernel Fuzzy Classfers by Dynamc Cluster Generaton Shgeo Abe Graduate School of Scence and Technology Kobe Unversty Nada, Kobe, Japan abe@eedept.kobe-u.ac.jp Abstract We dscuss kernel fuzzy classfers
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 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 informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
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 informationAn Anti-Noise Text Categorization Method based on Support Vector Machines *
An Ant-Nose Text ategorzaton Method based on Support Vector Machnes * hen Ln, Huang Je and Gong Zheng-Hu School of omputer Scence, Natonal Unversty of Defense Technology, hangsha, 410073, hna chenln@nudt.edu.cn,
More informationCS47300: Web Information Search and Management
CS47300: Web Informaton Search and Management Prof. Chrs Clfton 15 September 2017 Materal adapted from course created by Dr. Luo S, now leadng Albaba research group Retreval Models Informaton Need Representaton
More informationTaxonomy of Large Margin Principle Algorithms for Ordinal Regression Problems
Taxonomy of Large Margn Prncple Algorthms for Ordnal Regresson Problems Amnon Shashua Computer Scence Department Stanford Unversty Stanford, CA 94305 emal: shashua@cs.stanford.edu Anat Levn School of Computer
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
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 informationRECOGNIZING GENDER THROUGH FACIAL IMAGE USING SUPPORT VECTOR MACHINE
Journal of Theoretcal and Appled Informaton Technology 30 th June 06. Vol.88. No.3 005-06 JATIT & LLS. All rghts reserved. ISSN: 99-8645 www.jatt.org E-ISSN: 87-395 RECOGNIZING GENDER THROUGH FACIAL IMAGE
More informationA Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines
A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría
More informationSpam Filtering Based on Support Vector Machines with Taguchi Method for Parameter Selection
E-mal Spam Flterng Based on Support Vector Machnes wth Taguch Method for Parameter Selecton We-Chh Hsu, Tsan-Yng Yu E-mal Spam Flterng Based on Support Vector Machnes wth Taguch Method for Parameter Selecton
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 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 informationCAN COMPUTERS LEARN FASTER? Seyda Ertekin Computer Science & Engineering The Pennsylvania State University
CAN COMPUTERS LEARN FASTER? Seyda Ertekn Computer Scence & Engneerng The Pennsylvana State Unversty sertekn@cse.psu.edu ABSTRACT Ever snce computers were nvented, manknd wondered whether they mght be made
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 information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
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 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 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 informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationA Background Subtraction for a Vision-based User Interface *
A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton
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 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 informationFingerprint matching based on weighting method and SVM
Fngerprnt matchng based on weghtng method and SVM Ja Ja, Lanhong Ca, Pnyan Lu, Xuhu Lu Key Laboratory of Pervasve Computng (Tsnghua Unversty), Mnstry of Educaton Bejng 100084, P.R.Chna {jaja}@mals.tsnghua.edu.cn
More informationEYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS
P.G. Demdov Yaroslavl State Unversty Anatoly Ntn, Vladmr Khryashchev, Olga Stepanova, Igor Kostern EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS Yaroslavl, 2015 Eye
More informationCLASSIFICATION OF ULTRASONIC SIGNALS
The 8 th Internatonal Conference of the Slovenan Socety for Non-Destructve Testng»Applcaton of Contemporary Non-Destructve Testng n Engneerng«September -3, 5, Portorož, Slovena, pp. 7-33 CLASSIFICATION
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
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 informationINF 4300 Support Vector Machine Classifiers (SVM) Anne Solberg
INF 43 Support Vector Machne Classfers (SVM) Anne Solberg (anne@f.uo.no) 9..7 Lnear classfers th mamum margn for toclass problems The kernel trck from lnear to a hghdmensonal generalzaton Generaton from
More informationCHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION
48 CHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION 3.1 INTRODUCTION The raw mcroarray data s bascally an mage wth dfferent colors ndcatng hybrdzaton (Xue
More informationA Robust LS-SVM Regression
PROCEEDIGS OF WORLD ACADEMY OF SCIECE, EGIEERIG AD ECHOLOGY VOLUME 7 AUGUS 5 ISS 37- A Robust LS-SVM Regresson József Valyon, and Gábor Horváth Abstract In comparson to the orgnal SVM, whch nvolves a quadratc
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More 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 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 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 informationComplex System Reliability Evaluation using Support Vector Machine for Incomplete Data-set
Internatonal Journal of Performablty Engneerng, Vol. 7, No. 1, January 2010, pp.32-42. RAMS Consultants Prnted n Inda Complex System Relablty Evaluaton usng Support Vector Machne for Incomplete Data-set
More informationImplementation Naïve Bayes Algorithm for Student Classification Based on Graduation Status
Internatonal Journal of Appled Busness and Informaton Systems ISSN: 2597-8993 Vol 1, No 2, September 2017, pp. 6-12 6 Implementaton Naïve Bayes Algorthm for Student Classfcaton Based on Graduaton Status
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
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 informationLaplacian Eigenmap for Image Retrieval
Laplacan Egenmap for Image Retreval Xaofe He Partha Nyog Department of Computer Scence The Unversty of Chcago, 1100 E 58 th Street, Chcago, IL 60637 ABSTRACT Dmensonalty reducton has been receved much
More informationLearning to Classify Documents with Only a Small Positive Training Set
Learnng to Classfy Documents wth Only a Small Postve Tranng Set Xao-L L 1, Bng Lu 2, and See-Kong Ng 1 1 Insttute for Infocomm Research, Heng Mu Keng Terrace, 119613, Sngapore 2 Department of Computer
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 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 informationJapanese Dependency Analysis Based on Improved SVM and KNN
Proceedngs of the 7th WSEAS Internatonal Conference on Smulaton, Modellng and Optmzaton, Bejng, Chna, September 15-17, 2007 140 Japanese Dependency Analyss Based on Improved SVM and KNN ZHOU HUIWEI and
More informationA Gradient Difference based Technique for Video Text Detection
A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg
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 informationQuerying by sketch geographical databases. Yu Han 1, a *
4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,
More informationReliable Negative Extracting Based on knn for Learning from Positive and Unlabeled Examples
94 JOURNAL OF COMPUTERS, VOL. 4, NO. 1, JANUARY 2009 Relable Negatve Extractng Based on knn for Learnng from Postve and Unlabeled Examples Bangzuo Zhang College of Computer Scence and Technology, Jln Unversty,
More informationA Gradient Difference based Technique for Video Text Detection
2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationLearning a Class-Specific Dictionary for Facial Expression Recognition
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 4 Sofa 016 Prnt ISSN: 1311-970; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-016-0067 Learnng a Class-Specfc Dctonary for
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 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 informationFast Sparse Gaussian Processes Learning for Man-Made Structure Classification
Fast Sparse Gaussan Processes Learnng for Man-Made Structure Classfcaton Hang Zhou Insttute for Vson Systems Engneerng, Dept Elec. & Comp. Syst. Eng. PO Box 35, Monash Unversty, Clayton, VIC 3800, Australa
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationFast Feature Value Searching for Face Detection
Vol., No. 2 Computer and Informaton Scence Fast Feature Value Searchng for Face Detecton Yunyang Yan Department of Computer Engneerng Huayn Insttute of Technology Hua an 22300, Chna E-mal: areyyyke@63.com
More informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
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 informationElliptical Rule Extraction from a Trained Radial Basis Function Neural Network
Ellptcal Rule Extracton from a Traned Radal Bass Functon Neural Network Andrey Bondarenko, Arkady Borsov DITF, Rga Techncal Unversty, Meza ¼, Rga, LV-1658, Latva Andrejs.bondarenko@gmal.com, arkadjs.borsovs@cs.rtu.lv
More informationDiscriminative classifiers for object classification. Last time
Dscrmnatve classfers for object classfcaton Thursday, Nov 12 Krsten Grauman UT Austn Last tme Supervsed classfcaton Loss and rsk, kbayes rule Skn color detecton example Sldng ndo detecton Classfers, boostng
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 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 information