|
Size: 711
Comment:
|
Size: 1031
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| == Introduction == | == Chapter 1 + Section 2.1 Introduction == This section includes information from chapter 1 as well. attachment:InformationRetreivalProcess.jpg * Three Models of Browsing * Flag * Structure guided * Hypertext == Section 2.2 A taxonomy of Information Retrieval Models == |
| Line 9: | Line 20: |
| == Section 2.3 == | == Section 2.3 Retrieval: Ad hoc and Filtering == |
Chapter 1 + Section 2.1 Introduction
This section includes information from chapter 1 as well.
attachment:InformationRetreivalProcess.jpg
- Three Models of Browsing
- Flag
- Structure guided
- Hypertext
Section 2.2 A taxonomy of Information Retrieval Models
Predicting which documents are relevant is usaually dependent on a ranking algorithm.
- The three classic models in information retreival are:
Boolean Model: In the boolean model documents and queries are represented as sets of index terms, thus we say this model is a set theoretic model
Vector Model: In the vector model documents and queries are represented as vectors in a t-dimensional space, thus we say that the model is algebraic.
Probabilistic Model: The framework for modeling document and query representations is based on probability theory, and thus we sat that the model is prababilistic.