1 / 16

Query Suggestions Using Query-Flow Graphs

Query Suggestions Using Query-Flow Graphs. Paolo Boldi et al . WSCD 2009. Objective. Query suggestion using query-flow graphs. What is a query flow graph?. Node = query. What is a query flow graph?. Same “ search mission ”. What is a query flow graph?. Edge weight:.

jada-valencia
Download Presentation

Query Suggestions Using Query-Flow Graphs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Query Suggestions Using Query-Flow Graphs Paolo Boldi et al. WSCD 2009

  2. Objective • Query suggestion using query-flow graphs

  3. What is a query flowgraph? • Node = query

  4. What is a query flowgraph? • Same “search mission”

  5. What is a query flowgraph? • Edge weight:

  6. What is a query flowgraph? Four transitions: • Generalization • Specialization • Error Correction • Parallel Move

  7. Corpus • Generate query-flow graphs: • Yahoo! UK • Testing: • MSN Live Spring 2006 Data Asset

  8. Recommendation Algorithm 1 • Start at the input query node • Do a random walk of k iterations • Recommend queries with highest PageRank values

  9. Recommendation Algorithm 2 • Scale the score in Algorithm 1 by a random start • Recommend queries with highest PageRank ratio

  10. Experiment Setup • Recommendation Algorithms: • Different Query-flow subgraphs • Baseline: Query-document graph by Crasswell and Szummer • Test Corpus • 114 input queries in MSN Live having frequency between 700 and 1500

  11. Query-Flow Subgraphs • Queryflow-S • Queryflow-SP • Queryflow-SC • Queryflow-SCP • Queryflow-GSPC

  12. Query-Flow Composed Subgraphs • Queryflow-(S2) • Queryflow-(SST) • Queryflow-(SG)

  13. Evaluation Procedure • Top 5 recommendations per query per system • 5 assessors rated a recommendation as • Useful, Somewhat useful, Not useful • “Related to the same intent and provides information not available in original query”

  14. Experiment Results

  15. Diversity Experiment • Issue top 5 recommendations per query per system to a search engine • Get top 5 URLs • Compute average number of new URLs per query

  16. Diversity Experiment Results

More Related