1 Automatic indexing Salton: When the assignment of content identifiers is carried out with the aid of modern computing equipment the operation becomes.

Slides:



Advertisements
Similar presentations
Information Retrieval (IR) on the Internet. Contents  Definition of IR  Performance Indicators of IR systems  Basics of an IR system  Some IR Techniques.
Advertisements

Chapter 5: Introduction to Information Retrieval
1 Evaluation Rong Jin. 2 Evaluation  Evaluation is key to building effective and efficient search engines usually carried out in controlled experiments.
Crawling, Ranking and Indexing. Organizing the Web The Web is big. Really big. –Over 3 billion pages, just in the indexable Web The Web is dynamic Problems:
Mining External Resources for Biomedical IE Why, How, What Malvina Nissim
Prof. Carolina Ruiz Computer Science Department Bioinformatics and Computational Biology Program WPI WELCOME TO BCB4003/CS4803 BCB503/CS583 BIOLOGICAL.
Evaluating Search Engine
Information Retrieval in Practice
Search Engines and Information Retrieval
Query Operations: Automatic Local Analysis. Introduction Difficulty of formulating user queries –Insufficient knowledge of the collection –Insufficient.
Search Strategies Online Search Techniques. Universal Search Techniques Precision- getting results that are relevant, “on topic.” Recall- getting all.
IR & Metadata. Metadata Didn’t we already talk about this? We discussed what metadata is and its types –Data about data –Descriptive metadata is external.
Xyleme A Dynamic Warehouse for XML Data of the Web.
Modern Information Retrieval
WMES3103 : INFORMATION RETRIEVAL
Article Review Study Fulltext vs Metadata Searching Brad Hemminger School of Information and Library Science University of North Carolina.
1 CS 430: Information Discovery Lecture 3 Inverted Files and Boolean Operations.
Information Retrieval Concerned with the: Representation of Storage of Organization of, and Access to Information items.
Information Retrieval in Practice
INFO 624 Week 3 Retrieval System Evaluation
Computer comunication B Information retrieval. Information retrieval: introduction 1 This topic addresses the question on how it is possible to find relevant.
Information retrieval Finding relevant data using irrelevant keys Example: database of photographic images sorted by number, date. DBMS: Well structured.
CSE 730 Information Retrieval of Biomedical Data The use of medical lexicon in biomedical IR.
Information retrieval: overview. Information Retrieval and Text Processing Huge literature dating back to the 1950’s! SIGIR/TREC - home for much of this.
1 CS 502: Computing Methods for Digital Libraries Lecture 11 Information Retrieval I.
Chapter 5: Information Retrieval and Web Search
Overview of Search Engines
Query Relevance Feedback and Ontologies How to Make Queries Better.
Search Engines and Information Retrieval Chapter 1.
Evaluation Experiments and Experience from the Perspective of Interactive Information Retrieval Ross Wilkinson Mingfang Wu ICT Centre CSIRO, Australia.
Chapter 2 Architecture of a Search Engine. Search Engine Architecture n A software architecture consists of software components, the interfaces provided.
Data Mining Chapter 1 Introduction -- Basic Data Mining Tasks -- Related Concepts -- Data Mining Techniques.
1 Information Retrieval Acknowledgements: Dr Mounia Lalmas (QMW) Dr Joemon Jose (Glasgow)
1 CS 430: Information Discovery Lecture 3 Inverted Files.
Chapter 6: Information Retrieval and Web Search
Search Engines. Search Strategies Define the search topic(s) and break it down into its component parts What terms, words or phrases do you use to describe.
Relevance Detection Approach to Gene Annotation Aid to automatic annotation of databases Annotation flow –Extraction of molecular function of a gene from.
1 Automatic Classification of Bookmarked Web Pages Chris Staff Second Talk February 2007.
Introduction to Digital Libraries hussein suleman uct cs honours 2003.
Information Retrieval Model Aj. Khuanlux MitsophonsiriCS.426 INFORMATION RETRIEVAL.
LIS618 lecture 3 Thomas Krichel Structure of talk Document Preprocessing Basic ingredients of query languages Retrieval performance evaluation.
1 CS 430: Information Discovery Lecture 4 Files Structures for Inverted Files.
Chapter 8 Evaluating Search Engine. Evaluation n Evaluation is key to building effective and efficient search engines  Measurement usually carried out.
How Do We Find Information?. Key Questions  What are we looking for?  How do we find it?  Why is it difficult? “A prudent question is one-half of wisdom”
Information Retrieval
Web Information Retrieval Prof. Alessandro Agostini 1 Context in Web Search Steve Lawrence Speaker: Antonella Delmestri IEEE Data Engineering Bulletin.
Advantages of Query Biased Summaries in Information Retrieval by A. Tombros and M. Sanderson Presenters: Omer Erdil Albayrak Bilge Koroglu.
Chapter. 3: Retrieval Evaluation 1/2/2016Dr. Almetwally Mostafa 1.
1 CS 430: Information Discovery Lecture 8 Automatic Term Extraction and Weighting.
Identifying “Best Bet” Web Search Results by Mining Past User Behavior Author: Eugene Agichtein, Zijian Zheng (Microsoft Research) Source: KDD2006 Reporter:
1 CS 430: Information Discovery Lecture 8 Collection-Level Metadata Vector Methods.
Selecting Relevant Documents Assume: –we already have a corpus of documents defined. –goal is to return a subset of those documents. –Individual documents.
Text Similarity: an Alternative Way to Search MEDLINE James Lewis, Stephan Ossowski, Justin Hicks, Mounir Errami and Harold R. Garner Translational Research.
Major Issues n Information is mostly online n Information is increasing available in full-text (full-content) n There is an explosion in the amount of.
Information Retrieval in Practice
Information Retrieval in Practice
Sections 10.5 – 10.6 Hashing.
Searching for Information
Evaluation Anisio Lacerda.
Information Organization: Overview
Research on Knowledge Element Relation and Knowledge Service for Agricultural Literature Resource Xie nengfu; Sun wei and Zhang xuefu 3rd April 2017.
Text Based Information Retrieval
Evaluation of IR Systems
CS 430: Information Discovery
Multimedia Information Retrieval
CS 430: Information Discovery
Data Mining Chapter 6 Search Engines
Introduction to Information Retrieval
Information Organization: Overview
Introduction to Search Engines
Presentation transcript:

1 Automatic indexing Salton: When the assignment of content identifiers is carried out with the aid of modern computing equipment the operation becomes automatic indexing

2 Approaches and Methods n Initial approach –Create an inverted file –On-the-fly (natural language processing) n Methods –All words, remove stop words –Word frequencies (Wilson’s objective method of determining aboutness) –More sophisticated IR methods Semantic/linguistical analysis, co-occurrence/similarity measures, etc.

3 Basic arrangement of automatic indexes n Inverted file: contains all the index terms automatically drawn from the document records according to the indexing technique used. –Position of term -record number -Field number -Number of occurrences -Position in the field (digits 45-57)

4 Access of Inverted Files n Sequential access - alphabetical ordering n Binary chain access - binary search tree n Hashing

5 Pros and Cons of Automatic Indexing n Pros –Consistency –Cost reduction –Time reduction n Cons / limitations –Human intellect –Term relationships –Misleading in retrieval –Good algorithms, but generally domain-specific

6 Natural language vs. Controlled Vocabulary n Natural language continuum n

7 Natural language vs. Controlled Vocab. n Pros n Cons n Production cost n Cost to the end-user n Facilitate specificity in terms of access n Exhaustivity indexing n Handling of errors

8 What is Automatic Classification? n Automatic manipulation of a document’s contents to support logical grouping with other similar documents for organization and/or retrieval activities. Can include the assignment of, or manipulation of, classification notation.

9 Why Automatic Classification? n Classification is time consuming and expensive n Knowledge structuring –To much information n Status of automatic classification –Fairly experimental, although not completely… Operational systems for Web retrieval harvesting METADATA (semi- automatic)

10 Automatic Classification on the Web n Automatic Classification of Web resources using Java and Dewey Decimal Classification n SOSIG: Associated Research and Development

11 Why Automatic Classification? n Your articles…. n How defined n What was the purpose n How was the automatic classification done, or discussed n Outcome

12 Recall Number of relevant documents retrieved out of all the possible relevant documents in system. [quantity—did you get it all?] Precision Percentage of documents retrieved that were relevant [quality of what you found]

13 Tradeoff between Recall and Precision We can easily recall everything that matches a particular text string or pattern; however, we cannot search through all the matching results (too many) We can do an OK job limiting to most relevant, but as we “tune” result to be more relevant, we leave out more and more matching results.

Major Issues n Information is mostly online n Information is increasing available in full-text (full-content) n There is an explosion in the amount of information being produced. n So much so that even in fields like medical literature where there are major efforts like NLM Medline to index content, we cannot keep up. 14

What this means n Need ways to index without requiring paid experts –Automatic indexing, classification, keyword extraction, and even relationship and fact extraction. –Need to take advantage of experts who are reading the materials to comment on it and provide rankings, summarizations, keywords, “factoids”. (like Amazon)Amazon 15

Future Search n Full text searching of content, and of associated annotations on content, and metadata (including reader rankings, tags, etc). Like Connotea, NeoNote, etc.Connotea n Faceted based searching (Endeca, e.g. Home Depot, NCSU library). Home DepotNCSU library n Clustered based searching (Clusty)Clusty 16

Study on gene name searching n Looks at full text searching n Tradeoff between precision and recall n (Hemminger 2007). 17

18 Article Discovery Study Schizophrenia + Schizophrenia Gene Schizophrenia GeneArabidopsis Gene Genes Found in Metadata Only % % % Genes Found in Full- text Only % % % Genes Found in Metadata and Full-text % % % Totals for Found Genes

19 Article Review Study n Two literature cohorts, –Schizophrenia (Pat Sullivan) –Arabidopsis (Todd Vision) n Each cohort had three readers n Readers are asked to “review the article and judge its relevance to them as someone new to the gene in this biological setting, trying to build an understanding of the state of knowledge in that research area.”

20 Metadata Articles More Valuable n In both cases and for all observers, their mean quality rating values were lower (more useful) for the metadata discovered articles. There were statistically significant differences between the mean quality rating for the metadata discovered articles versus the full-text discovered articles for the both the Arabidopsis and Schizophrenia sets at the p < 0.05 level

21 Precision and Recall SchizophreniaArabidopsis RecallPrecisionRecallPrecision Metadata discovered15.7% (16.6%) 94.7%84.1% (84.1%) 100% Full-text only discovered100%63.7%100%69%

22 Article Features that correlate with Value: Number of Hits n The number of hits or matches of the search term within the returned document is a commonly used feature to rank returned articles. To test the value of this feature, the number of hits was correlated with the mean quality ranking for each article (averaged across all observers). The results clearly show a relationship where articles with many matches of the search term, tend to be much more highly valued.

23 Improving Relevance for Metadata Searching n Repeating the calculations on the schizophrenia and Arabidopsis article review sets, but limited to only matches with high hit counts (Schizophrenia ≥ 20 hits and Arabidopsis ≥ 15 hits) shows that precision for the full text is now the same (100% in Aradidopsis) or slightly better than that of the metadata retrieved articles (95% versus 94.4% in schizophrenia). However, the number of additional cases discovered by full- text searching is now only slightly better, finding 5% more cases in schizophrenia and 28% more in Arabidopsis.

24 Conclusions n This suggests that rather than accepting metadata searching as a surrogate for full- text searching, it may be time to make the transition to direct full text searching as the standard. This could be accomplished by using certain features of the full-text article, such as number of hits of the search string or whether the search string is found in the metadata (i.e. our current metadata search) as filters that allow us to increase the precision of our results. (and put the user in control of the filtering).