Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Adar, E., Teevan, J., Dumais, S.T.: Resonance on the web: web dynamics and revisitation patterns. In: CHI, pp. 1381–1390 (2009)
Avrachenkov, K., Litvak, N.: Decomposition of the Google PageRank and optimal linking strategy. Technical report (2004). http://doc.utwente.nl/80247/
Avrachenkov, K., Litvak, N.: The effect of new links on Google PageRank. Stoch. Model. 22(2), 319–332 (2006)
Baeza-Yates, R.A., Castillo, C., López, V.: PageRank increase under different collusion topologies. In: AIRWeb, pp. 25–32 (2005)
Becchetti, L., Castillo, C.: The distribution of PageRank follows a power-law only for particular values of the damping factor. In: WWW, pp. 941–942 (2006)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Comput. Netw. ISDN Syst. 30(1), 107–117 (1998)
Broder, A., Josifovski, V.: MS&E 239: Introduction to Computational Advertising (2011). http://web.stanford.edu/class/msande239/
Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4, 233–235 (1979)
Csáji, B.C., Jungers, R.M., Blondel, V.D.: PageRank optimization in polynomial time by stochastic shortest path reformulation. In: ALT, pp. 89–103 (2010)
Csáji, B.C., Jungers, R.M., Blondel, V.D.: PageRank optimization by edge selection. Discrete Appl. Math. 169, 73–87 (2014)
Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 1, 439–485 (2005)
Feige, U.: Vertex cover is hardest to approximate on regular graphs. Technical report (2004)
Fortunato, S., Boguñá, M., Flammini, A., Menczer, F.: Approximating PageRank from in-degree. In: WAW, pp. 59–71 (2006)
Gleich, D.F.: PageRank beyond the web. SIAM Rev. 57(3), 321–363 (2015)
Gyöngyi, Z., Garcia-Molina, H.: Link spam alliances. In: VLDB, pp. 517–528 (2005)
Ipsen, I.C.F., Wills, R.S.: Mathematical properties and analysis of Google’s PageRank. Bol. Soc. Esp. Mat. Apl. 34, 191–196 (2006)
Ishii, H., Tempo, R.: Computing the PageRank variation for fragile web data. SICE J. Control Measur. Syst. Integr. 2(1), 1–9 (2009)
Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256–278 (1974)
de Kerchove, C., Ninove, L., Van Dooren, P.: Maximizing PageRank via outlinks. Linear Algebra Appl. 429, 1254–1276 (2008)
Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. 74(3), 335–349 (2008)
Kunegis, J.: KONECT - the Koblenz network collection. In: WWW Companion, pp. 1343–1350 (2013)
Leskovec, J., Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection, June 2014. http://snap.stanford.edu/data
Lovász, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13(4), 383–390 (1975)
Ohsaka, N., Maehara, T., Kawarabayashi, K.: Efficient PageRank tracking in evolving networks. In: KDD, pp. 875–884 (2015)
Olsen, M.: The computational complexity of link building. In: COCOON, pp. 119–129 (2008)
Olsen, M.: Maximizing PageRank with new backlinks. In: CIAC, pp. 37–48 (2010)
Olsen, M., Viglas, A., Zvedeniouk, I.: A constant-factor approximation algorithm for the link building problem. In: COCOA, pp. 87–96 (2010)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)
Pandurangan, G., Raghavan, P., Upfal, E.: Using PageRank to characterize web structure. In: COCOON, pp. 330–339 (2002)
Sydow, M.: Can one out-link change your PageRank? In: AWIC, pp. 408–414 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Ohsaka, N., Sonobe, T., Kakimura, N., Fukunaga, T., Fujita, S., Kawarabayashi, Ki. (2018). Boosting PageRank Scores by Optimizing Internal Link Structure. In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2018. Lecture Notes in Computer Science(), vol 11029. Springer, Cham. https://doi.org/10.1007/978-3-319-98809-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-98809-2_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98808-5
Online ISBN: 978-3-319-98809-2
eBook Packages: Computer ScienceComputer Science (R0)