Are you Sergey A. Orshanskiy?

Claim your profile

Publications (1)0 Total impact

  • Source
    Ding Zhou · Sergey A. Orshanskiy · Hongyuan Zha · C. Lee Giles
    [Show abstract] [Hide abstract]
    ABSTRACT: Recent graph-theoretic approaches have demonstrated remarkable successes for ranking networked entities, but most of their applications are limited to homogeneous networks such as the network of citations between publications. This paper proposes a novel method for co-ranking authors and their publications using several networks: the social network connecting the authors, the citation network connecting the publications, as well as the authorship network that ties the previous two together. The new co-ranking framework is based on coupling two random walks, that separately rank authors and documents following the PageRankparadigm. As a result, improved rankings of documents and their authors depend on each other in a mutually reinforcing way, thus taking advantage of the additional information implicit in the heterogeneous network of authors and documents.
    Data Mining, 2007. ICDM 2007. Seventh IEEE International Conference on; 11/2007