{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:13:48Z","timestamp":1775913228326,"version":"3.50.1"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p>\n            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\n            <jats:italic>q<\/jats:italic>\n            , we first consider Simrank [7] as a way to identify queries similar to\n            <jats:italic>q<\/jats:italic>\n            , 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 versions 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 from Yahoo!, and using a variety of metrics. Our results show that the enhanced methods can yield more and better query rewrites.\n          <\/jats:p>","DOI":"10.14778\/1453856.1453903","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"408-421","source":"Crossref","is-referenced-by-count":126,"title":["Simrank++"],"prefix":"10.14778","volume":"1","author":[{"given":"Ioannis","family":"Antonellis","sequence":"first","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hector Garcia","family":"Molina","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi Chao","family":"Chang","sequence":"additional","affiliation":[{"name":"Yahoo! Inc., Sunnyvale, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347176"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277784"},{"key":"e_1_2_1_5_1","volume-title":"OSDI","author":"Dean Jeffrey","year":"2004","unstructured":"Jeffrey Dean and Sanjay Ghemawat . MapReduce : Simplified data processing on large clusters . In OSDI 2004 . Jeffrey Dean and Sanjay Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI 2004."},{"key":"e_1_2_1_6_1","volume-title":"Indexing by latent semantic analysis","author":"Deerwester S. C.","year":"1990","unstructured":"S. C. Deerwester , S. T. Dumais , T. K. Landauer , G. W. Furnas , and R. A. Harshman . Indexing by latent semantic analysis . 1990 . S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. 1990."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860538"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135835"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275505"},{"key":"e_1_2_1_11_1","volume-title":"Proc. 2nd Workshop on Sponsored Search Auctions.","author":"Regelson M.","unstructured":"M. Regelson and D. Fain . Predicting click-through rate using keyword clusters . In Proc. 2nd Workshop on Sponsored Search Auctions. M. Regelson and D. Fain. Predicting click-through rate using keyword clusters. In Proc. 2nd Workshop on Sponsored Search Auctions."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860475"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/140552"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031182"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/503104.503108"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277942"},{"key":"e_1_2_1_18_1","volume-title":"Query Log Analysis Workshop, WWW '07","author":"Zhang Wei Vivian","unstructured":"Wei Vivian Zhang and Rosie Jones . Comparing click logs and editorial labels for training query rewriting . In Query Log Analysis Workshop, WWW '07 . Wei Vivian Zhang and Rosie Jones. Comparing click logs and editorial labels for training query rewriting. In Query Log Analysis Workshop, WWW '07."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1453856.1453903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:07:46Z","timestamp":1672225666000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1453856.1453903"}},"subtitle":["query rewriting through link analysis of the click graph"],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.14778\/1453856.1453903"],"URL":"https:\/\/doi.org\/10.14778\/1453856.1453903","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}