title: A Ranking Approach on Large-Scale Graph With Multidimensional Heterogeneous Information.
abstract: Graph-based ranking has been extensively studied and frequently applied in many applications, such as webpage ranking. It aims at mining potentially valuable information from the raw graph-structured data. Recently, with the proliferation of rich heterogeneous information (e.g., node/edge features and prior knowledge) available in many real-world graphs, how to effectively and efficiently leverage all information to improve the ranking performance becomes a new challenging problem. Previous methods only utilize part of such information and attempt to rank graph nodes according to link-based methods, of which the ranking performances are severely affected by several well-known issues, e.g., over-fitting or high computational complexity, especially when the scale of graph is very large. In this paper, we address the large-scale graph-based ranking problem and focus on how to effectively exploit rich heterogeneous information of the graph to improve the ranking performance. Specifically, we propose an innovative and effective semi-supervised PageRank (SSP) approach to parameterize the derived information within a unified semi-supervised learning framework (SSLF-GR), then simultaneously optimize the parameters and the ranking scores of graph nodes. Experiments on the real-world large-scale graphs demonstrate that our method significantly outperforms the algorithms that consider such graph information only partially.
authors.forename: Wei
authors.initials: W
authors.lastname: Wei
authors.forename: Bin
authors.initials: B
authors.lastname: Gao
authors.forename: Tie-Yan
authors.initials: TY
authors.lastname: Liu
authors.forename: Taifeng
authors.initials: T
authors.lastname: Wang
authors.forename: Guohui
authors.initials: G
authors.lastname: Li
authors.forename: Hang
authors.initials: H
authors.lastname: Li