Topic-sensitive PageRank Export

@inproceedings{citeulike:523632, abstract = {In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query. To yield more accurate search results, we propose computing a set of PageRank vectors, biased using a set of representative topics, to capture more accurately the notion of importance with respect to a particular topic. By using these...}, address = {Honolulu, Hawaii}, author = {Haveliwala, Taher H.}, booktitle = {WWW '02: Proceedings of the 11th international}, citeulike-article-id = {523632}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.1400}, keywords = {pagerank, personalization}, month = {May}, pages = {517--526}, posted-at = {2008-11-04 06:06:20}, priority = {2}, title = {Topic-sensitive PageRank}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.1400}, year = {2002} }

TY - CONF ID - citeulike:523632 L3 - citeulike-article-id:523632 N2 - In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query. To yield more accurate search results, we propose computing a set of PageRank vectors, biased using a set of representative topics, to capture more accurately the notion of importance with respect to a particular topic. By using these... AD - Honolulu, Hawaii EP - 526 TI - Topic-sensitive PageRank T2 - WWW '02: Proceedings of the 11th international SP - 517 KW - pagerank KW - personalization AU - Haveliwala, Taher PY - 2002/May// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.1400 ER -