RUS  ENG
Full version
SEMINARS

PreMoLab Seminar
September 18, 2013 17:00, Moscow, A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences (Bol'shoi Karetnyi per., 19), room 615


Supervised versions of the PageRank algorithm

M. E. Zhukovskiiabc

a M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
b Moscow Institute of Physics and Technology (State University)
c Company "Yandex"


http://www.youtube.com/watch?v=dFnXmXsmihw

Abstract: Graph-based ranking plays a key role in many applications, such as web search and social computing. PageRank algotithm computes ranking scores relying only on the graph structure. Recently proposed methods, such as Semi-Supervised PageRank, take into account both the graph structure and the metadata associated with nodes and edges. In our talk we will describe some variants of these algorithms and efficient algorithms of tuning their parameters.


© Steklov Math. Inst. of RAS, 2025