Abstract
This paper proposes a calculus for computing personalized PageRank for complex categories given a precomputed set of primitive categories. This is a work in progress aiming at reduction of the necessary number of precomputed PageRanks for a set of (next to disjoint) categories.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Deng, H., Lyu, M.R., King, I.: A generalized Co-HITS algorithm and its application to bipartite graphs. In: Proc. of the 15th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining, KDD 2009, June 28-July 1, pp. 239–248. ACM, New York (2009)
Geng, X., Liu, T.Y., Qin, T., Arnold, A., Li, H., Shum, H.Y.: Query dependent ranking using k-nearest neighbor. In: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2008, pp. 115–122. ACM, New York (2008)
Haveliwala, T., Kamvar, S., Jeh, G.: An analytical comparison of approaches to personalizing PageRank. Technical Report 2003-35, Stanford InfoLab (June 2003), http://ilpubs.stanford.edu:8090/596/
Haveliwala, T.H.: Topic-sensitive PageRank: A context-sensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng. 15(4), 784–796 (2003)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604–632 (1999)
Langville, A.N.: An annotated bibliography of papers about Markov chains and information retrieval (2005), http://www.cofc.edu/~langvillea/bibtexpractice.pdf
Langville, A.N., Meyer, C.D.: Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press (2006)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab (November 1999), http://ilpubs.stanford.edu:8090/422/
Ren, Y., Pan, J.Z., Zhao, Y.: Soundness preserving approximation for tbox reasoning in r. In: Grau, B.C., Horrocks, I., Motik, B., Sattler, U. (eds.) Description Logics. Proceedings of the 22nd International Workshop DL 2009, Oxford, UK, July 27-30. CEUR Workshop Proceedings, vol. 477, CEUR-WS.org (2009)
Richardson, M., Domingos, P.: The Intelligent Surfer: Probabilistic Combination of Link and Content Information in PageRank. In: Advances in Neural Information Processing Systems 14. MIT Press (2002), http://citeseer.ist.psu.edu/460350.html
Zhang, L., Zhang, X., Shum, H.Y.: Qsrank: Query-sensitive hash code ranking for efficient ε-neighbor search. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 2058–2065 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kłopotek, M.A., Wierzchoń, S.T., Czerski, D., Ciesielski, K., Dramiński, M. (2013). A Calculus for Personalized PageRank. In: Kłopotek, M.A., Koronacki, J., Marciniak, M., Mykowiecka, A., Wierzchoń, S.T. (eds) Language Processing and Intelligent Information Systems. IIS 2013. Lecture Notes in Computer Science, vol 7912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38634-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-38634-3_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38633-6
Online ISBN: 978-3-642-38634-3
eBook Packages: Computer ScienceComputer Science (R0)