Performance Evaluation of Information Retrieval Systems


 Rose Russell
 1 years ago
 Views:
Transcription
1 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 and Tech, Hong Kong) There are many retreval models/ algorthms/ systems, whch one s the best? What s the best component for: Rankng functon (dotproduct, cosne, ) Term selecton (stopword removal, stemmng ) Term weghtng (TF, TFIDF, ) How far down the ranked lst wll a user need to look to fnd some/all relevant documents? Dffcultes n Evaluatng IR Systems Effectveness s related to the relevancy of retreved tems. Relevancy s not typcally bnary but contnuous. Even f relevancy s bnary, t can be a dffcult judgment to make. Relevancy, from a human standpont, s: Subjectve: Depends upon a specfc user s judgment. Stuatonal: Relates to user s current needs. Cogntve: Depends on human percepton and behavor. Dynamc: Changes over tme. Human Labeled Corpora (Gold Standard) Start wth a corpus of documents. Collect a set of queres for ths corpus. Have one or more human experts exhaustvely label the relevant documents for each query. Typcally assumes bnary relevance judgments. Requres consderable human effort for large document/query corpora. 3 4 Entre document collecton Relevant documents Precson and Recall Retreved documents umber of relevant documents retreved recall = Total number of relevant documents relevant rrelevant retreved & rrelevant retreved & relevant retreved ot retreved & rrelevant not retreved but relevant not retreved Precson and Recall Precson The ablty to retreve topranked documents that are mostly relevant. Recall The ablty of the search to fnd all of the relevant tems n the corpus. precson = umber of relevant documents Total number of retreved documents retreved 5 6
2 Determnng Recall s Dffcult Total number of relevant tems s sometmes not avalable: Sample across the database and perform relevance judgment on these tems. Apply dfferent retreval algorthms to the same database for the same query. The aggregate of relevant tems s taken as the total relevant set. Tradeoff between Recall and Precson Returns relevant documents but msses many useful ones too Precson 0 Recall The deal Returns most relevant documents but ncludes lots of junk 7 8 Computng Recall/Precson Ponts For a gven query, produce the ranked lst of retrevals. Adjustng a threshold on ths ranked lst produces dfferent sets of retreved documents, and therefore dfferent recall/precson measures. Mark each document n the ranked lst that s relevant accordng to the gold standard. Compute a recall/precson par for each poston n the ranked lst that contans a relevant document. 9 Computng Recall/Precson Ponts: An Example n doc # relevant 588 x 589 x x x x Let total # of relevant docs = 6 Check each new recall pont: R=/6=0.67; P=/= R=/6=0.333; P=/= R=3/6=0.5; P=3/4=0.75 R=4/6=0.667; P=4/6=0.667 R=5/6=0.833; p=5/3=0.38 Mssng one relevant document. ever reach 00% recall 0 Interpolatng a Recall/Precson Curve Interpolate a precson value for each standard recall level: r j {0.0, 0., 0., 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9,.0} r 0 = 0.0, r = 0.,, r 0 =.0 The nterpolated precson at the jth standard recall level s the maxmum known precson at any recall level between the jth and (j + )th level: P( r ) = max P( r) j rj r r j + Precson Interpolatng a Recall/Precson Curve: An Example Recall
3 3 Average Recall/Precson Curve Typcally average performance over a large set of queres. Compute average precson at each standard recall level across all queres. Plot average precson/recall curves to evaluate overall system performance on a document/query corpus. Compare Two or More Systems The curve closest to the upper rghthand corner of the graph ndcates the best performance Precson ostem Stem Recall 3 4 Sample RP Curve for CF Corpus Problems wth Recall/Precson Recall/Precson and ts related measures need a par of numbers, not very ntutve Snglevalue measures Rprecson Fmeasure Emeasure Fallout rate ESL ASL 5 6 R Precson FMeasure Precson at the Rth poston n the rankng of results for a query that has R relevant documents. n doc # relevant 588 x 589 x x x x R = # of relevant docs = 6 RPrecson = 4/6 = One measure of performance that takes nto account both recall and precson. Harmonc mean of recall and precson: PR = = F P + R + R P Compared to arthmetc mean, both need to be hgh for harmonc mean to be hgh. 8
4 4 E Measure (parameterzed F Measure) A varant of F measure that allows weghtng emphass on precson over recall: ( + β ) PR ( + β ) E = = β P + R β + R P Value of β controls tradeoff: β = : Equally weght precson and recall (E=F). β > : Weght precson more. β < : Weght recall more. Fallout Rate Problems wth both precson and recall: umber of rrelevant documents n the collecton s not taken nto account. Recall s undefned when there s no relevant document n the collecton. Precson s undefned when no document s retreved. no.of nonrelevant tems retreved Fallout = total no.of nonrelevant tems n the collecton 9 0 Other Measures Fve Types of ESL Expected Search Length: [Cooper 968] average number of documents that must be examned to retreve a gven number of relevant documents : maxmum number of relevant documents e : expected search length for ESL = = * e = Type : A user may just want the answer to a very specfc factual queston or a sngle statstcs. Only one relevant document s needed to satsfy the search request. Type : A user may actually want only a fxed number, for example, sx of relevant documents to a query. Type 3: A user may wsh to see all documents relevant to the topc. Type 4: A user may want to sample a subject area as n, but wsh to specfy the deal sze for the sample as some proporton, say onetenth, of the relevant documents. Type 5: A user may wsh to read all relevant documents n case there should be less than fve, and exactly fve n case there exst more than fve. Other Measures (cont.) Average Search Length: [Losee 998] expected poston of a relevant document n the ordered lst of all documents : total number of documents Q: probablty that the rankng s optmal (perfect) A: expected proporton of all documents examned n order to reach the average poston of a relevant document n an optmal rankng ASL= [ QA+ ( Q)( A)] Problems Whle they are sngle value measurements (Fmeasure, Emeasure, ESL, ASL) They are not easy to measure (compute) Or they are not ntutve Or the data requred for the measure are typcally not avalable (e.g. ASL) They don t work well n web search envronment 3 4
5 5 RankPower We propose a sngle, effectve measure for nteractve nformaton search systems such as the web. Take nto consderaton both the placement of the relevant documents and the number of relevant documents n a set of retreved documents for a gven query. Some defntons For a gven query, documents are returned Among the returned documents, R are relevant documents, R = C < Each of the relevant document n R s placed at L Average rank of returned relevant documents R avg () R avg ( ) C = = C L 5 6 Some propertes A functon of two varables, ndvdual ranks of relevant documents, and the number of relevant documents For a fxed C, the more documents lsted earler, the more favorte the value s (smaller values are favored). If the sze of returned documents ncreases and the number of relevant documents n also ncreases, the average rank ncreases (unbounded). In the dea case where every sngle returned document s relevant, the average rank s smply (+)/ RankPower defnton C L Ravg( ) = RankPower ( ) = = C C 7 8 RankPower propertes It s a decreasng functon of snce the rate of ncrease of the denomnator (C ) s faster than the numerator It s bounded below by ½ so the measure can be used as a benchmark to compare dfferent systems It weghs the placement very heavly (see an example for explanaton later), the ones placed earler n the lst are much favored. If two sets of returned documents have the same average rank, the one wth more document s favored. Examples Compare two systems each of whch returns a lst of 0 documents. System A has two relevant documents lsted as st and nd, wth a RankPower of Let s examne some scenaro n whch system B can match or surpass system A. If system B returns 3 relevant documents, unless two of the three are lsted st and nd, t s less favored than A snce the two best cases (+3+4)/3 =0.89 and (+3+4)/3 = whch are greater than that of A (0.75). System B needs to have 6 relevant documents n ts top 0 lst to beat A f t doesn t capture st and nd places. 9 30
6 6 Examples (cont.) The measure (RankPower) s tested n a real web search envronment. We compare the results of sendng 7 queres to AltaVsta and MARS (one of our ntellgent web search projects), lmtng to the frst 0 returned results. R avg C RankPower MARS AltaVsta RankPower A Varaton R avg () : average rank of relevant docs among retreved docs C : count of relevant docs among retreved docs S : poston of the th relevant document S Ravg( ) RankPower ( ) = = C C RP( ) 0. 5 = C ( C + ) RankPowerAlt( ) = C C ( C + ) = C S S = = RPAlt( ) Subjectve Relevance Measure ovelty Rato: The proporton of tems retreved and judged relevant by the user and of whch they were prevously unaware. Ablty to fnd new nformaton on a topc. Coverage Rato: The proporton of relevant tems retreved out of the total relevant documents known to a user pror to the search. Relevant when the user wants to locate documents whch they have seen before (e.g., the budget report for Year 000). 33
Optimizing 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 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), 700705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don HoeLan
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationLife Tables (Times) Summary. Sample StatFolio: lifetable times.sgp
Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables
More informationTerm Weighting Classification System Using the Chisquare Statistic for the Classification Subtask at NTCIR6 Patent Retrieval Task
Proceedngs of NTCIR6 Workshop Meetng, May 1518, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Chsquare Statstc for the Classfcaton Subtask at NTCIR6 Patent Retreval Task Kotaro Hashmoto
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 informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationDescription of NTU Approach to NTCIR3 Multilingual Information Retrieval
Proceedngs of the Thrd NTCIR Workshop Descrpton of NTU Approach to NTCIR3 Multlngual Informaton Retreval WenCheng Ln and HsnHs Chen Department of Computer Scence and Informaton Engneerng Natonal Tawan
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationTsinghua University at TAC 2009: Summarizing Multidocuments by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Multdocuments by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
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 informationAn EntropyBased Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An EntropyBased Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More 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 informationRelevance Feedback Document Retrieval using NonRelevant Documents
Relevance Feedback Document Retreval usng NonRelevant Documents TAKASHI ONODA, HIROSHI MURATA and SEIJI YAMADA Ths paper reports a new document retreval method usng nonrelevant documents. From a large
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 informationKIDS Lab at ImageCLEF 2012 Personal Photo Retrieval
KD Lab at mageclef 2012 Personal Photo Retreval ChaWe Ku, BeenChan Chen, GuanBn Chen, LJ Gaou, Rongng Huang, and aoen Wang Knowledge, nformaton, and Database ystem Laboratory Department of Computer
More informationInformation Retrieval
Anmol Bhasn abhasn[at]cedar.buffalo.edu Moht Devnan mdevnan[at]cse.buffalo.edu Sprng 2005 #$ "% &'" (! Informaton Retreval )" " * + %, ##$ + *. / "#,0, #'",,,#$ ", # " /,,#,0 1"%,2 '",, Documents are
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8, 7 ISSN 5966 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. AlRababah and Mohammad A. AlRababah Faculty of IT, AlAhlyyah Amman Unversty,
More informationThe Effect of Similarity Measures on The Quality of Query Clusters
The effect of smlarty measures on the qualty of query clusters. Fu. L., Goh, D.H., Foo, S., & Na, J.C. (2004). Journal of Informaton Scence, 30(5) 396407 The Effect of Smlarty Measures on The Qualty of
More informationCSCI 5417 Information Retrieval Systems Jim Martin!
CSCI 5417 Informaton Retreval Systems Jm Martn! Lecture 11 9/29/2011 Today 9/29 Classfcaton Naïve Bayes classfcaton Ungram LM 1 Where we are... Bascs of ad hoc retreval Indexng Term weghtng/scorng Cosne
More informationNews. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example
Unversty of Brtsh Columba CPSC, Intro to Computaton JanApr Tamara Munzner News Assgnment correctons to ASCIIArtste.java posted defntely read WebCT bboards Arrays Lecture, Tue Feb based on sldes by Kurt
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of BozenBolzano Faculty of Computer Scence Academc Year 01101 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
More 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 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 informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 21415 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 20140404 ISSN: 16627482, Vols. 536537, pp 678682 do:10.4028/www.scentfc.net/amm.536537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationExercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005
Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed
More informationSolutions to Programming Assignment Five Interpolation and Numerical Differentiation
College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent
More informationBehavioral Model Extraction of Search Engines Used in an Intelligent Meta Search Engine
Behavoral Model Extracton of Search Engnes Used n an Intellgent Meta Search Engne AVEH AVOUSI Computer Department, Azad Unversty, Garmsar Branch BEHZAD MOSHIRI Electrcal and Computer department, Faculty
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 MAXSAT wth weghts, such that the
More informationParallelism for Nested Loops with Nonuniform and Flow Dependences
Parallelsm for Nested Loops wth Nonunform and Flow Dependences SamJn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseodong, Cheonan, Chungnam, 33080, Korea. seong@cheonan.ac.kr
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 informationIntelligent Information Acquisition for Improved Clustering
Intellgent Informaton Acquston for Improved Clusterng Duy Vu Unversty of Texas at Austn duyvu@cs.utexas.edu Mkhal Blenko Mcrosoft Research mblenko@mcrosoft.com Prem Melvlle IBM T.J. Watson Research Center
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 Leastsquares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationSAO: A Stream Index for Answering Linear Optimization Queries
SAO: A Stream Index for Answerng near Optmzaton Queres Gang uo Kunung Wu Phlp S. Yu IBM T.J. Watson Research Center {luog, klwu, psyu}@us.bm.com Abstract near optmzaton queres retreve the topk tuples
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stockmarket
More informationRelatedMode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 RelatedMode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationFederated Search of TextBased Digital Libraries in Hierarchical PeertoPeer Networks
Federated Search of TextBased Dgtal Lbrares n Herarchcal PeertoPeer Networks Je Lu School of Computer Scence Carnege Mellon Unversty Pttsburgh, PA 15213 jelu@cs.cmu.edu Jame Callan School of Computer
More informationCan We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search
Can We Beat the Prefx Flterng? An Adaptve Framework for Smlarty Jon and Search Jannan Wang Guolang L Janhua Feng Department of Computer Scence and Technology, Tsnghua Natonal Laboratory for Informaton
More informationSynthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007
Syntheszer 1.0 A Varyng Coeffcent Meta MetaAnalytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons
More informationLoad Balancing for HexCell 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 HexCell Interconnecton Network Saher Manaseer,
More informationFor instance, ; the five basic numbersets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
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 informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (SemCentralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of IllnosUrbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
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 informationFitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.
Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both
More informationSome material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier
Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS NonParametrc Approach Mxture of Denstes MaxmumLkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationKmeans and Hierarchical Clustering
Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your
More informationSorting: The Big Picture. The steps of QuickSort. QuickSort Example. QuickSort Example. QuickSort Example. Recursive Quicksort
Sortng: The Bg Pcture Gven n comparable elements n an array, sort them n an ncreasng (or decreasng) order. Smple algorthms: O(n ) Inserton sort Selecton sort Bubble sort Shell sort Fancer algorthms: O(n
More informationEVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS
Academc Research Internatonal ISSL: 39553, ISS: 39944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay
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 informationData Mining: Model Evaluation
Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct
More informationCE 221 Data Structures and Algorithms
CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume
More informationLearningBased TopN Selection Query Evaluation over Relational Databases
LearnngBased TopN 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 informationEECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science
EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Bran Curless Sprng 2008 Announcements (5/14/08) Homework due at begnnng of class on Frday. Secton tomorrow: Graded homeworks returned More dscusson
More informationA KIND OF ROUTING MODEL IN PEERTOPEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE
A KIND OF ROUTING MODEL IN PEERTOPEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE 1 TAO LIU, 2 JIJUN XU 1 College of Informaton Scence and Technology, Zhengzhou Normal Unversty, Chna 2 School of Mathematcs
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
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 information3. CR parameters and MultiObjective Fitness Function
3 CR parameters and Multobjectve Ftness Functon 41 3. CR parameters and MultObjectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationKeywordbased Document Clustering
Keywordbased ocument lusterng SeungShk Kang School of omputer Scence Kookmn Unversty & AIrc hungnungdong Songbukgu Seoul 3672 Korea sskang@kookmn.ac.kr Abstract ocument clusterng s an aggregaton of
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memorymanagement methods normally requres the entre process
More informationToday s Outline. Sorting: The Big Picture. Why Sort? Selection Sort: Idea. Insertion Sort: Idea. Sorting Chapter 7 in Weiss.
Today s Outlne Sortng Chapter 7 n Wess CSE 26 Data Structures Ruth Anderson Announcements Wrtten Homework #6 due Frday 2/26 at the begnnng of lecture Proect Code due Mon March 1 by 11pm Today s Topcs:
More informationShape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram
Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton
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 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 informationGreedy Technique  Definition
Greedy Technque Greedy Technque  Defnton The greedy method s a general algorthm desgn paradgm, bult on the follong elements: confguratons: dfferent choces, collectons, or values to fnd objectve functon:
More informationInformation Retrieval. (M&S Ch 15)
Information Retrieval (M&S Ch 15) 1 Retrieval Models A retrieval model specifies the details of: Document representation Query representation Retrieval function Determines a notion of relevance. Notion
More informationA Knowledge Management System for Organizing MEDLINE Database
A Knowledge Management System for Organzng MEDLINE Database Hyunk Km, SuShng Chen Computer and Informaton Scence Engneerng Department, Unversty of Florda, Ganesvlle, Florda 32611, USA Wth the exploson
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 informationReport on Online Graph Coloring
2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm
More informationAdjustment methods for differential measurement errors in multimode surveys
Adjustment methods for dfferental measurement errors n multmode surveys Salah Merad UK Offce for Natonal Statstcs ESSnet MM DCSS, Fnal Meetng Wesbaden, Germany, 45 September 2014 Outlne Introducton Stablsng
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan ScentfcResearch and DesgnProspectng Insttute of Energetc AZ1012, Ave HZardab94 Emal:aydn_murad@yahoocom Importance of
More informationImproving Web Image Search using Meta Rerankers
VOLUME1, ISSUEV (AugSep 2013) IS NOW AVAILABLE AT: www.dcst.com Improvng Web Image Search usng Meta Rerankers B.Kavtha 1, N. Suata 2 1 Department of Computer Scence and Engneerng, Chtanya Bharath Insttute
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 MoyotlHernández, Héctor JménezSalazar Facultad de Cencas de la Computacón, B. Unversdad Autónoma de Puebla, 14 Sur
More informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationPriorityBased Scheduling Algorithm for Downlink Traffics in IEEE Networks
PrortyBased Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks JaMng Lang, JenJee Chen, YouChun Wang, YuChee Tseng, and BaoShuh P. Ln Department of Computer Scence Natonal ChaoTung Unversty,
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) Inplace Merge Sort T(n) = Θ(n lg(n)) Not nplace Selecton Sort (from homework) T(n) = Θ(n 2 ) Inplace
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 informationBiostatistics 615/815
The EM 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 informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 Bsplne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationA Generation Model to Unify Topic Relevance and Lexiconbased Sentiment for Opinion Retrieval
A Generaton Model to Unfy Topc Relevance and Lexconbased Sentment for Opnon Retreval Mn Zhang State key lab of Intellgent Tech.& Sys, Dept. of Computer Scence, Tsnghua Unversty, Bejng, 00084, Chna 86062792595
More informationIntro. Iterators. 1. Access
Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy
More informationAn efficient iterative source routing algorithm
An effcent teratve source routng algorthm Gang Cheng Ye Tan Nrwan Ansar Advanced Networng Lab Department of Electrcal Computer Engneerng New Jersey Insttute of Technology Newar NJ 7 {gc yt Ansar}@ntedu
More informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
More informationDetermining Fuzzy Sets for Quantitative Attributes in Data Mining Problems
Determnng Fuzzy Sets for Quanttatve Attrbutes n Data Mnng Problems ATTILA GYENESEI Turku Centre for Computer Scence (TUCS) Unversty of Turku, Department of Computer Scence Lemmnkäsenkatu 4A, FIN5 Turku
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 informationSteps for Computing the Dissimilarity, Entropy, HerfindahlHirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, HerfndahlHrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationEffectiveness of Information Retraction
Effectveness of Informaton on Cndy Hu, Malk MagdonIsmal, Mark Goldberg and Wllam A. Wallace Department of Industral and Systems Engneerng Rensselaer Polytechnc Insttute Troy, New York Emal: huc@rp.edu,
More informationFuzzy Modeling of the Complexity vs. Accuracy Tradeoff in a Sequential TwoStage MultiClassifier System
Fuzzy Modelng of the Complexty vs. Accuracy Tradeoff n a Sequental TwoStage MultClassfer System MARK LAST 1 Department of Informaton Systems Engneerng BenGuron Unversty of the Negev BeerSheva 84105
More informationLSTaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract
12 th Internatonal LSDYNA Users Conference Optmzaton(1) LSTaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LSTaSC verson 2.1,
More information