Maxim Zhukovskiy
Pavel Serdyukov
ABSTRACT
Graph-based ranking plays a key role in many applications, such as web search and social computing. Pioneering methods of ranking on graphs (e.g., PageRank and HITS) computed ranking scores relying only on the graph structure. Recently proposed methods, such as Semi-Supervised Page-Rank, take into account both the graph structure and the metadata associated with nodes and edges in a unified optimization framework. Such approaches are based on initializing the underlying random walk models with prior weights of nodes and edges that in turn depend on their individual properties. While in those models the prior weights of nodes and edges depend only on their own features, one can also assume that such weights may also depend or be related to the prior weights of their neighbors. This paper addresses the problem of weighting nodes and edges according to this intuition by realizing it in a general ranking model and an efficient algorithm of tuning the parameters of that model.
- L. Backstrom, J. Leskovec, Supervised random walks: predicting and recommending links in social networks, WSDM'11. Google Scholar
Digital Library
- K. Berberich, M. Vazirgiannis, G. Weikum, Time-aware authority ranking, Int. Math., 2(3), pp. 301--332, 2005.Google ScholarCross Ref
- S. Chakrabarti, A. Agarwal, Learning parameters in entity relationship graphs from ranking preferences, PKDD'06. Google ScholarDigital Library
- H. Chang, D. Cohn, A. K. McCallum, Learning to create customized authority lists, ICML'00. Google ScholarDigital Library
- Na Dai and Brian D. Davison, Freshness Matters: In Flowers, Food, and Web Authority, SIGIR'10. Google ScholarDigital Library
- Nadav Eiron, Kevin S. McCurley, John A. Tomlin, Ranking the web frontier, WWW'04. Google ScholarDigital Library
- B. Gao. Tie-Yan Liu, Wei Wei Huazhong, T. Wang, H. Li, Semi-supervised ranking on very large graphs with rich metadata, KDD'11. Google ScholarDigital Library
- Taher H. Haveliwala, Efficient computation of PageRank, Stanford University Technical Report, 1999.Google Scholar
- Taher H. Haveliwala, Topic-Sensitive PageRank, WWW'2002. Google ScholarDigital Library
- N. Kanhabua, K. Nørvåg, Improving Temporal Language Models for Determining Time of Non-timestamped Documents, ECDL'08. Google ScholarDigital Library
- J. M. Kleinberg, Authoritative sources in a hyperlinked environment, SODA'98. Google ScholarDigital Library
- Ni Lao, William W. Cohen, Relational retrieval using a combination of path-constrained random walks, Journal Machine Learning archive, 81(1), pp. 53--67, 2010. Google ScholarDigital Library
- Y. Liu, B. Gao, T.-Y. Liu, Y. Zhang, Z. Ma, S. He, H. Li, BrowseRank: Letting Web Users Vote for Page Importance, SIGIR'08. Google ScholarDigital Library
- Y. Liu, M. Zhang, S. Ma, L. Ru, User Browsing Graph: Structure, Evolution and Application, WSDM'09.Google Scholar
- E. Minkov, William W. Cohen, Learning to rank typed graph walks: local and global approaches, KDD'07. Google ScholarDigital Library
- J. R. Norris, Markov Chains, Cambridge University, 1998.Google Scholar
- L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank citation ranking: Bringing order to the web. http://dbpubs.stanford.edu/pub/1999-66, 1999.Google Scholar
- M. Richardson, P. Domingos, The intelligent surfer: Probabilistic combination of link and content information in PageRank, Neural Information Processing Systems, 14, pp. 1441--1448, 2002.Google Scholar
- T. Sakai, Alternatives to Bpref, SIGIR '07. Google ScholarDigital Library
- W. J. Stewart, Introduction to the Numerical Solution of Markov Chains, Princeton University, N.J., 1994.Google Scholar
- A. C. Tsoi, G. Morini, F. Scarselli, M. Hagenbuchner, M. Maggini, Adaptive ranking of Web pages, WWW'03. Google ScholarDigital Library
- D. Zhou, J. Huang, B. Scholkopf, Learning from labeled and unlabeled data on a directed graph, ICML'05. Google ScholarDigital Library
- J. Gao, W. Yuan, X. Li, K. Deng, J.-Y. Nie, Smoothing Clickthrough Data for Web Search Ranking, SIGIR'09. Google ScholarDigital Library
- G. Malewicz, M. H. Austern, A. J. C. Bik, J. C. Dehnert, I. Horn, N. Leiser, G. Czajkowski, Pregel: A System for Large-Scale Graph Processing, SIGMOD'10. Google ScholarDigital Library
- J. A. Snyman, Practical Mathematical Optimization: An Introduction to Basic Optimization Theory and Classical and New Gradient-Based Algorithms, Springer, 2005.Google Scholar
- M. Zhukovskii, D. Vinogradov, G. Gusev, P. Serdyukov, A. Raigorodkii, Recency-sensitive model of web page authority, CIKM'12. Google ScholarDigital Library
- M. Zhukovskii, A. Khropov, G. Gusev, P. Serdyukov, Fresh BrowseRank, SIGIR'13. Google ScholarDigital Library
Index Terms
- Supervised Nested PageRank
Recommendations
Fresh BrowseRank
SIGIR '13: Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrievalIn the last years, a lot of attention was attracted by the problem of page authority computation based on user browsing behavior. However, the proposed methods have a number of limitations. In particular, they run on a single snapshot of a user browsing ...
Recency-sensitive model of web page authority
CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge managementTraditional link-based web ranking algorithms run on a single web snapshot without concern of the dynamics of web pages and links. In particular, the correlation of web pages freshness and their classic PageRank is negative (see [11]). For this reason, ...
Associated pagerank: improved pagerank measured by frequent term sets
VECIMS'09: Proceedings of the 2009 IEEE international conference on Virtual Environments, Human-Computer Interfaces and Measurement SystemsWeb search engines encounter many new challenges while the amount of information on the web increases rapidly. Web documents have been a main resource for various purposes, and people rely on search engines to retrieve the desired documents. This paper ...
Comments