Matching Task Profiles and User Needs in Personalized Web Search Julia Luxenburger, Shady Elbassuoni, Gerhard Weikum CIKM ...
Outline <ul><li>Introduction </li></ul><ul><li>Model and Algorithms </li></ul><ul><ul><li>Architecture </li></ul></ul><ul>...
Introduction <ul><li>Personalization  provides better search experience to individual users. </li></ul><ul><ul><li>User’s ...
Architecture <ul><li>A  client-side  search personalization with the use of a proxy which is running locally.  </li></ul><...
Personalization Framework <ul><li>user profile : query chains (subsequently posed queries), result sets, clicked result pa...
 
<ul><li>Task : user’s past search and browse behavior.  </li></ul><ul><ul><li>by means of a  hierarchical clustering  of t...
Selective Personalization Strategy <ul><li>Case I: the current query is the first query in the current session. </li></ul>...
Selective Personalization Strategy  cont. <ul><li>Considering the Kullback Leibler (KL) divergence between a query fact  F...
Means of Personalization <ul><li>We update the query representation with terms best discriminating the query facet  F ∗ i ...
Means of Personalization  cont. <ul><li>Using a threshold  δ  to allow for an automatic reformulation of the query sent to...
Task Language Model <ul><li>The language model of a user task is a weighted mixture of its components:  queries ,  result ...
Query language model   <ul><li>Let QC denote a query chain  Q 1 ,  Q 2 ,…, Q k .  </li></ul><ul><ul><li>query language mod...
Query language model  cont. <ul><li>The mixture model:  </li></ul><ul><ul><li>q : query string.  </li></ul></ul><ul><ul><l...
Query language model  cont. <ul><li>All constituent language models employ Dirichlet prior smoothing:  </li></ul><ul><ul><...
Facet Language Model <ul><li>The facet language model  F  is the uniform mixture of the result snippet  s   ∈  F </li></ul>
Experimental Setup <ul><li>7 volunteers install proxy to log their search and browsing activities for a period of 2 months...
Experimental Setup  cont. <ul><li>Each participant evaluated 8 self-chosen search tasks.  </li></ul><ul><ul><li>A search t...
Experimental Setup  cont. <ul><li>Measure: Discounted Cumulative gain (DCG) </li></ul><ul><ul><li>i  : the rank of the res...
Evaluation results with re-ranking <ul><li>Fixed: the same fixed number of expansion terms. </li></ul><ul><li>Flexible: th...
Query Expanding Evaluation v ( w ) < τ v ( w ) <  δ
Correlating KL-divergence with performance gains <ul><li>Goal: whether a query benefits from personalization. </li></ul><u...
Parameterizing the personalization framework
Efficiency <ul><li>Tasks are computed offline. </li></ul><ul><li>Using a incremental clustering to fold in the new session...
Conclusion <ul><li>They proposed a thorough language model that addresses user tasks and matches the user needs with past ...
Upcoming SlideShare
Loading in...5
×

Matching Task Profiles And User Needs In Personalized Web Search

1,058

Published on

Published in: Technology
0 Comments
1 Like
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total Views
1,058
On Slideshare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
13
Comments
0
Likes
1
Embeds 0
No embeds

No notes for slide

Matching Task Profiles And User Needs In Personalized Web Search

  1. 1. Matching Task Profiles and User Needs in Personalized Web Search Julia Luxenburger, Shady Elbassuoni, Gerhard Weikum CIKM ’08 Advisor: Chia-Hui Chang Student: Teng-Kai Fan Date: 2009-10-13
  2. 2. Outline <ul><li>Introduction </li></ul><ul><li>Model and Algorithms </li></ul><ul><ul><li>Architecture </li></ul></ul><ul><ul><li>Personalization Framework </li></ul></ul><ul><li>Experiments </li></ul><ul><li>Conclusion and Future Work </li></ul>
  3. 3. Introduction <ul><li>Personalization provides better search experience to individual users. </li></ul><ul><ul><li>User’s goal, tasks, and contexts. </li></ul></ul><ul><li>Introducing language model for user tasks representing user profile. </li></ul><ul><li>Personalization framework selectively matches the actual user information need with relevant past user tasks. </li></ul>
  4. 4. Architecture <ul><li>A client-side search personalization with the use of a proxy which is running locally. </li></ul><ul><ul><li>It can intercept all HTTP traffic. </li></ul></ul><ul><li>Result re-ranking </li></ul><ul><ul><li>Whenever a user action allows to update the query representation, unseen results are re-ranked. </li></ul></ul><ul><li>Query expansion </li></ul><ul><ul><li>For some queries, they might rewrite the query sent to the search engine. </li></ul></ul><ul><li>Merging of personalized and original results. </li></ul><ul><ul><li>Personalized result ranks and original web ranks are aggregated to form the final result ranking. </li></ul></ul><ul><ul><li>Combination method: Dwork et al. , “Rank aggregation methods for the web,” WWW’01. </li></ul></ul>
  5. 5. Personalization Framework <ul><li>user profile : query chains (subsequently posed queries), result sets, clicked result pages, the whole clickstream of subsequently visited web pages. </li></ul><ul><li>search session : user's timing as well as the relatedness of subsequent user's actions. </li></ul><ul><ul><li>Actions : (1) queries (2) result clicks (3) other page visits. </li></ul></ul><ul><li>task : user’s past search and browse behavior. </li></ul><ul><ul><li>They obtain tasks by means of a hierarchical clustering of the user’s profile. </li></ul></ul><ul><li>facet : using a hierarchical clustering of the query’s result set (represented by its title and snippet) to obtain query facets. </li></ul>
  6. 7. <ul><li>Task : user’s past search and browse behavior. </li></ul><ul><ul><li>by means of a hierarchical clustering of the user’s profile. </li></ul></ul>Session : user's timing as well as the relatedness of subsequent user's actions. Profile : query chains (subsequently posed queries), result sets, clicked result pages, the clickstream of subsequently visited web pages.
  7. 8. Selective Personalization Strategy <ul><li>Case I: the current query is the first query in the current session. </li></ul><ul><ul><li>We retrieve the top-k tasks T 1 ,…, T k most similar to the query from the user’s profile. </li></ul></ul><ul><li>Case II: there exists some query history already, and the current query is a refinement of previously issued query in the same session. </li></ul><ul><ul><li>The tasks present in the user profile are accompanied by a current task made up by all the actions of the currently active session, and represented by the language model T k+ 1. </li></ul></ul>
  8. 9. Selective Personalization Strategy cont. <ul><li>Considering the Kullback Leibler (KL) divergence between a query fact F i , and a task T j </li></ul><ul><ul><li>The KL divergence characterizes the strength of their similarity. </li></ul></ul><ul><li>If KL( F ∗ i , T ∗ j ) is larger than a threshold σ , we conclude that the current query goes for a previously unexplored task, and thus refrain from biasing the search results. </li></ul><ul><li>Otherwise, we might either reformulate the query sent to Google or re-rank the original search results. </li></ul>
  9. 10. Means of Personalization <ul><li>We update the query representation with terms best discriminating the query facet F ∗ i from all other query facts, while being most similar to the task T ∗ j . </li></ul><ul><li>That is, terms which have the largest impact on the KL-divergence between the union of the chosen facet-task pair and the remaining query facets. </li></ul>
  10. 11. Means of Personalization cont. <ul><li>Using a threshold δ to allow for an automatic reformulation of the query sent to Google. </li></ul><ul><li>Thus, </li></ul><ul><ul><li>Terms v ( w ) < δ qualify for query expansion. </li></ul></ul><ul><ul><li>Term with δ < v ( w ) <τand P ( w | ∪ i F i ) > 0 qualify for re-ranking the original top-50 search results. </li></ul></ul>
  11. 12. Task Language Model <ul><li>The language model of a user task is a weighted mixture of its components: queries , result clicks , clickstream documents and query-independent browsed documents . </li></ul><ul><li>Thus, the task language model T is: </li></ul><ul><ul><li>Q is a uniform mixture of the task’s query chains . </li></ul></ul><ul><ul><li>B is average of the individual browsed documents’ language models </li></ul></ul>
  12. 13. Query language model <ul><li>Let QC denote a query chain Q 1 , Q 2 ,…, Q k . </li></ul><ul><ul><li>query language model is the average of all query chains’ models. </li></ul></ul>
  13. 14. Query language model cont. <ul><li>The mixture model: </li></ul><ul><ul><li>q : query string. </li></ul></ul><ul><ul><li>CR : the set of clicked result items </li></ul></ul><ul><ul><li>NR : non-clicked result items ranked above a clicked one. </li></ul></ul><ul><ul><li>UR : unseen results ranked below the lowest-ranked clicked item. </li></ul></ul><ul><ul><li>CS : the set of clickstream documents beyond the result documents . </li></ul></ul>
  14. 15. Query language model cont. <ul><li>All constituent language models employ Dirichlet prior smoothing: </li></ul><ul><ul><li>μ : 2000 </li></ul></ul><ul><ul><li>c ( w ,.): the frequency of word w in (.). </li></ul></ul>
  15. 16. Facet Language Model <ul><li>The facet language model F is the uniform mixture of the result snippet s ∈ F </li></ul>
  16. 17. Experimental Setup <ul><li>7 volunteers install proxy to log their search and browsing activities for a period of 2 months. </li></ul>
  17. 18. Experimental Setup cont. <ul><li>Each participant evaluated 8 self-chosen search tasks. </li></ul><ul><ul><li>A search task is a sequence of queries, click and browsing actions until the user’s information need is satisfied. </li></ul></ul><ul><ul><li>For each task, the participant was presented with the top-50 Google results . </li></ul></ul><ul><ul><li>Then the participant was asked to mark each result as highly relevant, relevant or completely irrelevant . </li></ul></ul><ul><ul><li>Furthermore, we asked users to group the top-10 results of each query by giving labels to them. </li></ul></ul><ul><li>59 search tasks and 89 individual evaluation queries. </li></ul>
  18. 19. Experimental Setup cont. <ul><li>Measure: Discounted Cumulative gain (DCG) </li></ul><ul><ul><li>i : the rank of the result within the result set </li></ul></ul><ul><ul><li>G ( i ): the relevance level of the result. </li></ul></ul><ul><ul><ul><li>G ( i ) = 2 for highly relevant documents. </li></ul></ul></ul><ul><ul><ul><li>G ( i ) = 1 for relevant documents. </li></ul></ul></ul><ul><ul><ul><li>G ( i ) = 0 for non-relevant documents. </li></ul></ul></ul><ul><li>Parameters for the task query language model </li></ul>
  19. 20. Evaluation results with re-ranking <ul><li>Fixed: the same fixed number of expansion terms. </li></ul><ul><li>Flexible: the optimal threshold τ. </li></ul><ul><li>Enforced (no tasks) is unaware of both query facets and tasks. </li></ul><ul><li>Enforced (no facets) distinguishes between history tasks but still treats a query always in its entirety. </li></ul>
  20. 21. Query Expanding Evaluation v ( w ) < τ v ( w ) < δ
  21. 22. Correlating KL-divergence with performance gains <ul><li>Goal: whether a query benefits from personalization. </li></ul><ul><li>A negative correlation indicates that queries with more relevant information in the local index. </li></ul>
  22. 23. Parameterizing the personalization framework
  23. 24. Efficiency <ul><li>Tasks are computed offline. </li></ul><ul><li>Using a incremental clustering to fold in the new session. </li></ul><ul><ul><li>Hammouda et al. “Incremental document clustering using cluster similarity histograms,” WI’07. </li></ul></ul>
  24. 25. Conclusion <ul><li>They proposed a thorough language model that addresses user tasks and matches the user needs with past user tasks. </li></ul><ul><li>The model considers past viewed documents and past queries. </li></ul><ul><li>The proposed method achieved significant gains over both the Google ranking and traditional personalization approaches. </li></ul>
  1. A particular slide catching your eye?

    Clipping is a handy way to collect important slides you want to go back to later.

×