Simrank++: Query rewriting through link analysis of the click graph

Computer Science – Digital Libraries

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Available via http://dbpubs.stanford.edu/pub/2007-32

Scientific paper

We focus on the problem of query rewriting for sponsored search. We base rewrites on a historical click graph that records the ads that have been clicked on in response to past user queries. Given a query q, we first consider Simrank as a way to identify queries similar to q, i.e., queries whose ads a user may be interested in. We argue that Simrank fails to properly identify query similarities in our application, and we present two enhanced version of Simrank: one that exploits weights on click graph edges and another that exploits ``evidence.'' We experimentally evaluate our new schemes against Simrank, using actual click graphs and queries form Yahoo!, and using a variety of metrics. Our results show that the enhanced methods can yield more and better query rewrites.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Simrank++: Query rewriting through link analysis of the click graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simrank++: Query rewriting through link analysis of the click graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simrank++: Query rewriting through link analysis of the click graph will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-681703

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.