Relevance Feedback Limitations –Must yield result within at most 3-4 iterations –Users will likely terminate the process sooner –User may get irritated.

Slides:



Advertisements
Similar presentations
Pseudo-Relevance Feedback For Multimedia Retrieval By Rong Yan, Alexander G. and Rong Jin Mwangi S. Kariuki
Advertisements

Chapter 5: Introduction to Information Retrieval
Query Languages. Information Retrieval Concerned with the: Representation of Storage of Organization of, and Access to Information items.
UCLA : GSE&IS : Department of Information StudiesJF : 276lec1.ppt : 5/2/2015 : 1 I N F S I N F O R M A T I O N R E T R I E V A L S Y S T E M S Week.
Natural Language Processing WEB SEARCH ENGINES August, 2002.
Computational Models of Discourse Analysis Carolyn Penstein Rosé Language Technologies Institute/ Human-Computer Interaction Institute.
1 DAFFODIL Effective Support for Using Digital Libraries Norbert Fuhr University of Duisburg-Essen, Germany.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Search Engines and Information Retrieval
T.Sharon - A.Frank 1 Internet Resources Discovery (IRD) Classic Information Retrieval (IR)
1 CS 430 / INFO 430 Information Retrieval Lecture 8 Query Refinement: Relevance Feedback Information Filtering.
Image Search Presented by: Samantha Mahindrakar Diti Gandhi.
ISP 433/633 Week 10 Vocabulary Problem & Latent Semantic Indexing Partly based on G.Furnas SI503 slides.
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.
Learning to Advertise. Introduction Advertising on the Internet = $$$ –Especially search advertising and web page advertising Problem: –Selecting ads.
1 Information Retrieval and Extraction 資訊檢索與擷取 Chia-Hui Chang, Assistant Professor Dept. of Computer Science & Information Engineering National Central.
Information Retrieval and Extraction 資訊檢索與擷取 Chia-Hui Chang National Central University
Eric Sieverts University Library Utrecht IT Department Institute for Media & Information Management (Hogeschool van Amsterdam)
Ranking by Odds Ratio A Probability Model Approach let be a Boolean random variable: document d is relevant to query q otherwise Consider document d as.
Latent Semantic Analysis (LSA). Introduction to LSA Learning Model Uses Singular Value Decomposition (SVD) to simulate human learning of word and passage.
Query Operations: Automatic Global Analysis. Motivation Methods of local analysis extract information from local set of documents retrieved to expand.
Chapter 5: Information Retrieval and Web Search
Content-Based Video Retrieval System Presented by: Edmund Liang CSE 8337: Information Retrieval.
Query Relevance Feedback and Ontologies How to Make Queries Better.
Search Engines and Information Retrieval Chapter 1.
Implementing Genetic Algorithms in Finance Applications Nihaar Sinha.
Multimedia Databases (MMDB)
Chapter 7 Web Content Mining Xxxxxx. Introduction Web-content mining techniques are used to discover useful information from content on the web – textual.
INFO624 - Week 4 Query Languages and Query Operations Dr. Xia Lin Associate Professor College of Information Science and Technology Drexel University.
Redeeming Relevance for Subject Search in Citation Indexes Shannon Bradshaw The University of Iowa
Knowledge Representation and Indexing Using the Unified Medical Language System Kenneth Baclawski* Joseph “Jay” Cigna* Mieczyslaw M. Kokar* Peter Major.
1 University of Qom Information Retrieval Course Web Search (Link Analysis) Based on:
Thanks to Bill Arms, Marti Hearst Documents. Last time Size of information –Continues to grow IR an old field, goes back to the ‘40s IR iterative process.
Social Networking Algorithms related sections to read in Networked Life: 2.1,
1 CS 430: Information Discovery Lecture 9 Term Weighting and Ranking.
1 University of Palestine Topics In CIS ITBS 3202 Ms. Eman Alajrami 2 nd Semester
Information Retrieval Models - 1 Boolean. Introduction IR systems usually adopt index terms to process queries Index terms:  A keyword or group of selected.
Text Mining In InQuery Vasant Kumar, Peter Richards August 25th, 1999.
1 Information Retrieval Acknowledgements: Dr Mounia Lalmas (QMW) Dr Joemon Jose (Glasgow)
Natural Language Based Reformulation Resource and Web Exploitation for Question Answering Ulf Hermjakob, Abdessamad Echihabi, Daniel Marcu University of.
Chapter 6: Information Retrieval and Web Search
The Anatomy of a Large-Scale Hyper textual Web Search Engine S. Brin, L. Page Presenter :- Abhishek Taneja.
IR Theory: Relevance Feedback. Relevance Feedback: Example  Initial Results Search Engine2.
Mining Binary Constraints in Feature Models: A Classification-based Approach Yi Li.
Information Retrieval
Generating Query Substitutions Alicia Wood. What is the problem to be solved?
A Patent Document Retrieval System Addressing Both Semantic and Syntactic Properties Liang Chen*,Naoyuki Tokuda+, Hisahiro Adachi+ *University of Northern.
Steve Cassidy Computing at MacquarieNo 1 Searching The Web Steve Cassidy Centre for Language Technology Department of Computing Macquarie University.
Michael Bendersky, W. Bruce Croft Dept. of Computer Science Univ. of Massachusetts Amherst Amherst, MA SIGIR
A System for Automatic Personalized Tracking of Scientific Literature on the Web Tzachi Perlstein Yael Nir.
Citation-Based Retrieval for Scholarly Publications 指導教授:郭建明 學生:蘇文正 M
Relevance Feedback Hongning Wang
1 CS 430: Information Discovery Lecture 5 Ranking.
The Development of a search engine & Comparison according to algorithms Sung-soo Kim The final report.
Enhanced hypertext categorization using hyperlinks Soumen Chakrabarti (IBM Almaden) Byron Dom (IBM Almaden) Piotr Indyk (Stanford)
Chapter 6. Inference beyond the index 2007 년 1 월 30 일 부산대학교 인공지능연구실 김민호 Text : FINDING OUT ABOUT Page. 182 ~ 251.
1 CS 430 / INFO 430 Information Retrieval Lecture 12 Query Refinement and Relevance Feedback.
1 DAFFODIL Effective Support for Using Digital Libraries Norbert Fuhr University of Duisburg-Essen, Germany.
1 CS 430: Information Discovery Lecture 21 Interactive Retrieval.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
A GOLDMINE of PATENTS IP+IR Keith van Rijsbergen Vienna, Nov., 2007.
1 CS 430 / INFO 430: Information Retrieval Lecture 20 Web Search 2.
Automated Information Retrieval
Human Computer Interaction Lecture 21,22 User Support
Eric Sieverts University Library Utrecht Institute for Media &
Information Retrieval
Chapter Two: Review of the Literature
Retrieval Utilities Relevance feedback Clustering
6 Differential Evolution
Chapter Two: Review of the Literature
Presentation transcript:

Relevance Feedback Limitations –Must yield result within at most 3-4 iterations –Users will likely terminate the process sooner –User may get irritated at seeing same documents repeated after every iteration It has proven to increase the effectiveness of retrieval

Designing a Relevance Feedback System Use positive or negative relevance judgments Where to apply relevance judgments (query, profile, document, retrieval algorithm) Term weight modification. E.g., –Increase the weight for terms that appear in relevant docs –Add new terms found in relevant docs that are frequently mention in connection with query term

Genetic Algorithms Several possible solutions are generated in parallel The best few of these solutions is chosen and replicated, while the poor ones eliminated Replicated solutions creates a breeding population, from which new solutions arise The breeding is accomplished by by an exchange of some of the characteristics of the chosen solutions in a crossover operation

Genetic Algorithms (cont.) Hill climbing is avoided by –Pursue multiple solutions in parallel, and discard the low hills –Introduce new characteristic values at low rate through mutation process (random exchange) Relevance Feedback –Relieves the user of the burden of assigning term weights Begins with no weights. Generates query variants by assigning term weights randomly

Genetic Algorithms (cont.) Query variants are vector of query term weights Each query variant is used to search the documents in the database Evaluate each variant with equation on pg. 226 The variants with highest value creating the most replications The resulting breeding population is developed to the same size as the original population

Natural Language Processing Focus on structure more than meaning, consequently problems are –Syntactic ambiguity e.g., they are visiting relatives – Deep structure of a sentence e.g., grace –May or may not be semantically correct e.g., Colorless green ideas sleep furiously –Syntactic rules do not apply to e.g., boolean queries

Natural Language Processing (cont.) Semantic Analysis –Even more elusie e.g., red herring, carrying coals to Newcastle Techniques for Semantic Analysis –Latent semantic indexing uses multidimensional scaling methods to identify concepts –Dialogue Analysis involves interaction that each time clarifies further what is to be retrieved

Citation Processing Use of cited documents to enhance the description of a primary document Some use co-citation as a measure of document similarity I.e., number of papers that cite both Bibliographic coupling, when two documents cite the same document Design problems: Locating citations, interpretation, eliminate duplicate/useless,

Hypertext Links Means of connecting 2 distinct pieces of text Consists of an identifier and a pointer Possibly aid retrieval by suggesting hyperlinks given in top ranked document retrieved Do not follow links from linked documents Information Filtering: Eliminate large segments of database from consideration Passage Retrieval: Identifying relevant sections within a large document encyclopedia

Image and Sound Processing Techniques for evaluating and manipulating images directly Voice recognition Animation and sound: compare to those in libraries Music can use style and then pattern matching