We consider and formulate problems of PageRank score boosting motivated by applications such as effective web advertising. More precisely, given a graph and target vertices, one is required to find a fixed-size set of missing edges that maximizes the minimum PageRank score among the targets. We provide theoretical analyses to show that all of them are NP-hard. To overcome the hardness, we develop heuristic-based algorithms for them. We finally perform experiments on several real-world networks to verify the effectiveness of the proposed algorithms compared to baselines. Specifically, our algorithm achieves 100 times improvements of the minimum PageRank score among selected 100 vertices by adding only dozens of edges.
CITATION STYLE
Ohsaka, N., Sonobe, T., Kakimura, N., Fukunaga, T., Fujita, S., & Kawarabayashi, K. ichi. (2018). Boosting PageRank Scores by Optimizing Internal Link Structure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11029 LNCS, pp. 424–439). Springer Verlag. https://doi.org/10.1007/978-3-319-98809-2_26
Mendeley helps you to discover research relevant for your work.