Web信息体系结构 Chapter5_wjm.pptVIP

Chapter 5. Query Operations Wang Jimin Oct. 24 Formulating one’s information need is difficult. Good way: initial query formulation, and then query reformulation. Query Expansion: Expanding the original query with new terms Term Reweighting: Reweighting the term in the expanded query Outline User Relevance Feedback Automatic Local Analysis Automatic Global Analysis 5.2 User Relevance Feedback Query Expansion and Term Reweighting for the Vector Model Term Reweighting for the Probabilistic Model A Variant of Probabilistic Term Reweighting Evaluation of Relevance Feedback Strategies 5.2.1 Query Expansion and Term Reweighting for the Vector Model Basic idea: Reformulate the query such that it gets closer to the term-weight vector space of the relevant documents Some symbols: for a given query, retrieved documents Dr+Dn. Let Cr: set of relevant documents in the collection D. Their relations can be represented as follow. Relationship Formula If Cr is known in advance, then the best query will be represented P119 (5.1). According to the user feedback, we get the modified query q_m which can be written in three ways, i.e. P119 middle. Three techniques above yield similar results. Use a positive feedback strategy only: r=0 Advantage: simplicity and good results Disadvantage: no optimality criterion 5.2.2 Term Reweighting for the Probabilistic Model sim(dj,q) ~ ~ ? wiq * wij * (log P(ki | R) + log P(ki | ?R) ) P(?ki | R) P(?ki | ?R) Probabilities P(ki | R) and P(ki | ?R) ? Estimates based on assumptions: P(ki | R) = 0.5 P(ki | ?R) = ni N where ni is the number of docs that contain ki Use this initial guess to retrieve an initial ranking Improve upon this initial ranking Let Dr : set of relevent docs judged by the users Dr,i : subset of Dr contained ki Reevaluate estimates: P(ki | R) = |Dr,i| |Dr| P(ki | ?R) = ni - |Dr,i| N - |Dr| Some