Lecture 3 Modeling.pdf

More documents

Recommendations

Info

Non-Overlapping Lists(Continued)• Data structure– a single inverted file– each structural component (e.g., chap, sec, …) stands asan entry– for each entry, there is a list of text regions as a listoccurrences• Operations– Select a region which contains a given word– Select a region A which does not contain any otherregion B (where B belongs to a list distinct from the listfor A)– Select a region not contained within any other region– …Recall that there is another invertedfile for the words in the text3-88
Inverted Files• File is represented as an array of indexed records.Term 1 Term 2 Term 3 Term 4Record 1 1 1 0 1Record 2 0 1 1 1Record 3 1 0 1 1Record 4 0 0 1 13-89
Page 1 and 2:
Lecture 3 Modeling3-1
Page 3 and 4:
Information Retrieval Models• Cla
Page 5 and 6:
Taxonomy of Information Retrieval M
Page 7 and 8:
Combinations of these issuesUSERTAS
Page 9 and 10:
User profile• Simplistic approach
Page 11 and 12:
Formal Definition of IR Models(cont
Page 13 and 14:
Boolean Model• The index term wei
Page 15 and 16:
Boolean Model (Continued)• advant
Page 17 and 18:
Document representation in vector s
Page 19 and 20:
Similarity Measure (Continued)• v
Page 21 and 22:
Sample query-documentsimilarity com
Page 23 and 24:
Vector Model• w i,j : a positive,
Page 25 and 26:
document ranking• Similarity (i.e
Page 27 and 28:
Definition of tf• N: total number
Page 29 and 30:
Analysis of vector model• advanta
Page 31 and 32:
Probabilistic Model (Continued)•
Page 33 and 34:
Probabilistic Principle• w i,j
Page 35 and 36:
3-35independence assumption ofindex
Page 37 and 38: Initial guess• P(k i |R) is const
Page 39 and 40: Small values of V and V i• altern
Page 41 and 42: • Initial GuessProbabilistic Mode
Page 43 and 44: No Interaction with User• Retriev
Page 45 and 46: No Interaction with User• Retriev
Page 47 and 48: Interaction with User• Alternativ
Page 49 and 50: Analysis of Probabilistic Model•
Page 51 and 52: Alternative Set Theoretic Models-Fu
Page 53 and 54: Examples• Assume U={d 1 , d 2 , d
Page 55 and 56: Fuzzy OR3-55
Page 57 and 58: Fuzzy Information Retrieval• basi
Page 59 and 60: Fuzzy Information Retrieval(Continu
Page 61 and 62: ExampleQuery q=k a ∧ (k b ∨¬k
Page 63 and 64: Fuzzy Set Model3-63
Page 65 and 66: Fuzzy Set Model• Sim(q,d): Altern
Page 67 and 68: Review• Two vectors u and v are l
Page 69 and 70: Generalized Vector Space Model(Cont
Page 71 and 72: t=3cccminterm m r m r vectorm 1 =(0
Page 73 and 74: Generalized Vector Space Model(Cont
Page 75 and 76: 3-7523,823,623,423,283,863,63,423,2
Page 77 and 78: asic idea• Map each document and
Page 79 and 80: Singular Value DecompositionA∈R(1
Page 81 and 82: A=QDQtAQ=tQDQ Q=QDwhere Q=[ q q21Kq
Page 83 and 84: M=tM= ( K S D= ( DSDSM M=K St22: do
Page 85 and 86: Ranking in LSI• query: a pseudo-d
Page 87: Non-Overlapping Lists• divide the
Page 91 and 92: Inverted-file process (Continued)
Page 93 and 94: Extensions of Inverted Index Operat
Page 95 and 96: Model Based on Proximal Nodes• hi
Page 97 and 98: Model Based on Proximal Nodes(Conti
Page 99 and 100: Models for Browsing• Flat organiz
show all

Lecture 3 Modeling.pdf

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?