(C) 2003, The University of Michigan1 Information Retrieval Handout #10 April 7, 2003.

Slides:



Advertisements
Similar presentations
Relevance Feedback User tells system whether returned/disseminated documents are relevant to query/information need or not Feedback: usually positive sometimes.
Advertisements

Information Retrieval and Organisation Chapter 11 Probabilistic Information Retrieval Dell Zhang Birkbeck, University of London.
Representing and Querying Correlated Tuples in Probabilistic Databases
The Probabilistic Model. Probabilistic Model n Objective: to capture the IR problem using a probabilistic framework; n Given a user query, there is an.
CSE 5522: Survey of Artificial Intelligence II: Advanced Techniques Instructor: Alan Ritter TA: Fan Yang.
Probabilistic Ranking Principle
 Andisheh Keikha Ryerson University Ebrahim Bagheri Ryerson University May 7 th
Information Retrieval Models: Probabilistic Models
1 CS 430 / INFO 430 Information Retrieval Lecture 12 Probabilistic Information Retrieval.
Fundamentals, Design, and Implementation, 9/e SI654 Database Application Design Instructor: Dragomir R. Radev Winter 2005.
Probabilistic IR Models Based on probability theory Basic idea : Given a document d and a query q, Estimate the likelihood of d being relevant for the.
1 CS 430 / INFO 430 Information Retrieval Lecture 12 Probabilistic Information Retrieval.
Modern Information Retrieval Chapter 2 Modeling. Can keywords be used to represent a document or a query? keywords as query and matching as query processing.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Confidence intervals.
Modeling Modern Information Retrieval
Information Retrieval - Organization of the course Jian-Yun Nie 聂建云.
Language Models for TR Rong Jin Department of Computer Science and Engineering Michigan State University.
Semantic (Language) Models: Robustness, Structure & Beyond Thomas Hofmann Department of Computer Science Brown University Chief Scientist.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Course outline and schedule Introduction Event Algebra (Sec )
ITCS 6010 Natural Language Understanding. Natural Language Processing What is it? Studies the problems inherent in the processing and manipulation of.
COMS W1004 Introduction to Computer Science June 17, 2009.
1 CS 430 / INFO 430 Information Retrieval Lecture 10 Probabilistic Information Retrieval.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Course outline and schedule Introduction (Sec )
CS : Artificial Intelligence: Representation and Problem Solving Fall 2002 Prof. Tuomas Sandholm Computer Science Department Carnegie Mellon University.
CIS 410/510 Probabilistic Methods for Artificial Intelligence Instructor: Daniel Lowd.
1 CS 502: Computing Methods for Digital Libraries Lecture 11 Information Retrieval I.
(C) 2000, The University of Michigan 1 Database Application Design Handout #11 March 24, 2000.
Please open your laptops and pull up Quiz Only the provided online calculator may be used on this quiz. You may use your yellow formula sheet for.
(C) 2000, The University of Michigan 1 Database Application Design Handout #3 January 21, 2000.
General information CSE : Probabilistic Analysis of Computer Systems
Winter 2015 COMP 2130 Introduction to Computer Systems Computing Science Thompson Rivers University Introduction and Overview.
Lemur Application toolkit Kanishka P Pathak Bioinformatics CIS 595.
© Allen C. Goodman, 2015 Economics 5520/6520 – Winter 2015 Syllabus and Course Page State and Local Public Finance Allen C. Goodman.
Information Retrieval and Web Search Text properties (Note: some of the slides in this set have been adapted from the course taught by Prof. James Allan.
Probability and Statistics Required!. 2 Review Outline  Connection to simulation.  Concepts to review.  Assess your understanding.  Addressing knowledge.
(C) 2000, The University of Michigan 1 Database Application Design Handout #4 January 28, 2000.
Information Retrieval and Web Search Lecture 1. Course overview Instructor: Rada Mihalcea Class web page:
CS505: Final Exam Review Jinze Liu. Major Topics Before Mid-Term – Security and Access Control – Indexing After Mid-Term – Transaction Management Locking,
Introduction and Overview Summer 2014 COMP 2130 Introduction to Computer Systems Computing Science Thompson Rivers University.
Representation and Modelling CS4012. Module Info Lecturer: Michael English Contact Details: – –Tel: 061.
(C) 2003, The University of Michigan1 Information Retrieval Handout #7 March 24, 2003.
(C) 2000, The University of Michigan 1 Database Application Design Handout #10 March 17, 2000.
(C) 2000, The University of Michigan 1 Database Application Design Handout #8 February 25, 2000.
(C) 2003, The University of Michigan1 Information Retrieval Handout #9 March 31, 2003.
(C) 2000, The University of Michigan 1 Database Application Design Handout #7 February 18, 2000.
Relevance Feedback Hongning Wang What we have learned so far Information Retrieval User results Query Rep Doc Rep (Index) Ranker.
DATABASE SYSTEMS. DATABASE u A filing system for holding data u Contains a set of similar files –Each file contains similar records Each record contains.
Database Systems I Content: –How to build a database application –Principles of database-system implementation Instructor: John Sieg Required Text:
Chapter 23: Probabilistic Language Models April 13, 2004.
(C) 2000, The University of Michigan 1 Database Application Design Handout #5 February 4, 2000.
Information Retrieval and Web Search Course overview Instructor: Rada Mihalcea.
(C) 2000, The University of Michigan 1 Database Application Design Handout #2 January 14, 2000.
Relevance Models and Answer Granularity for Question Answering W. Bruce Croft and James Allan CIIR University of Massachusetts, Amherst.
(C) 2003, The University of Michigan1 Information Retrieval Handout #2 February 3, 2003.
Relevance Feedback Hongning Wang
CS798: Information Retrieval Charlie Clarke Information retrieval is concerned with representing, searching, and manipulating.
Probabilistic Model n Objective: to capture the IR problem using a probabilistic framework n Given a user query, there is an ideal answer set n Querying.
Information Retrieval (9) Prof. Dragomir R. Radev
(C) 2003, The University of Michigan1 Information Retrieval Handout #5 January 28, 2005.
Introduction to Information Retrieval Introduction to Information Retrieval Lecture Probabilistic Information Retrieval.
B. Prabhakaran1 Multimedia Systems Reference Text “Multimedia Database Management Systems” by B. Prabhakaran, Kluwer Academic Publishers. – Kluwer bought.
Document Clustering for Natural Language Dialogue-based IR (Google for the Blind) Antoine Raux IR Seminar and Lab Fall 2003 Initial Presentation.
(C) 2000, The University of Michigan 1 Language and Information Handout #2 September 21, 2000.
Information Retrieval Models: Probabilistic Models
Relevance Feedback Hongning Wang
TM 605: Probability for Telecom Managers
Murat Açar - Zeynep Çipiloğlu Yıldız
Lecture1: Introduction to IT322 Software Engineering I
CS 4501: Information Retrieval
CS 430: Information Discovery
Presentation transcript:

(C) 2003, The University of Michigan1 Information Retrieval Handout #10 April 7, 2003

(C) 2003, The University of Michigan2 Course Information Instructor: Dragomir R. Radev Office: 3080, West Hall Connector Phone: (734) Office hours: M&F Course page: Class meets on Mondays, 1-4 PM in 409 West Hall

(C) 2003, The University of Michigan3 Schedule Final projects due 04/11 Final project presentations 04/14 Final exam 04/ essay questions, 2-3 problems

(C) 2003, The University of Michigan4 Language modeling

(C) 2003, The University of Michigan5 The problem In what order to show documents to the user?

(C) 2003, The University of Michigan6 Probabilistic retrieval Probabilistic retrieval [Robertson and Sparck Jones 1976] Given: query q and document d, estimate the probability that the user will find the document relevant. Assumption: the relevance depends only on the query and document representations

(C) 2003, The University of Michigan7 Probabilistic retrieval (cont’d) R = preferred set w i = index variables If P( R | d j ) > P ( R | d j ), then the document is relevant. prob. of randomly selecting d j from R can be ignored

(C) 2003, The University of Michigan8 Probabilistic retrieval (cont’d) Initial guess: Similarity:

(C) 2003, The University of Michigan9 Language models Each document generates a probability distribution Determine whether the query is from the same distribution as the document

(C) 2003, The University of Michigan10 Aspect models Hofmann Find diverse answers: e.g., queries about New Zealand from many perspectives

(C) 2003, The University of Michigan11 The Lemur system /clair4/projects/lemur-2.01/lemur/bin/ParseInQueryOp test2.sparam test2.squery /clair4/projects/lemur-2.01/lemur/bin/RetEval test2.param

(C) 2003, The University of Michigan12 The Lemur system more test2.squery #q1=#od2(New York); #q2=#od5(Spain Madrid); more test2.sparam outputFile = test2.query; /* result file */ more test2.query #ODN 2 LPAREN new york RPAREN #ODN 5 LPAREN spain madrid RPAREN more test2.out 1 AP AP LA AP AP AP AP AP WSJ SJMN AP AP WSJ AP WSJ WSJ WSJ