Abstract
The Intelligent Surfer is one of algorithms designed for ranking of search engine results. It is an interesting combination of the PageRank algorithm and the content of web pages. Its main disadvantage is long computation time compared to the PageRank computation time. A computation of the PageRank itself is a very time-consuming process. A lot of papers with topic of efficiency and speed-up of the PageRank computation were published. This paper brings a proposal of speed-up of the Intelligent Surfer algorithm in three steps denoted as the CZDIS algorithm. Experiments with web graph of 1 million nodes size proved that proposed algorithm is usable solution for search engine results ranking in dependance on the page content. Successful implementation of Czech language model experimentally proved possibility of Intelligent Surfer application to different, non English languages.
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.
References
Richardson, M., Domingos, P.: The Intelligent Surfer: Probabilistic Combination of Link and Content Information in tPageRank. In: Advances in Neural Information Processing Systems, vol. 14, pp. 1441–1448. MIT Press, Cambridge (2002)
Page, L., Brin, S., Motwani, R., Winograd, T.: The Pagerank citation ranking: bringing order to the Web. Stanford University technical report (1999)
Langville, A.N., Meyer, C.D.: Deep inside Pagerank. Internet Mathmathematics 1(3), 335–400 (2005)
Haveliwala, T.H.: Efficient Computation of PageRank. Stanford University Technical Report (September 1999)
Langville, A.N., Meyer, C.D.: A Reordering for the PageRank Problem. SIAM J. Sci. Comput. 27(6), 2112–2120 (2006)
Dolamic, L., Savoy, J.: Stemming Approaches for East European Languages. In: Peters, C., Jijkoun, V., Mandl, T., Müller, H., Oard, D.W., Peñas, A., Petras, V., Santos, D. (eds.) CLEF 2007. LNCS, vol. 5152. Springer, Heidelberg (2008)
Gleich, D., Zhukov, L., Berkhin, P.: Scalable Computing with Power Law Graphs: Experience with Parallel PageRank, Technical Report, Yahoo! (2005)
Haveliwala, T., Kamvar, S., Jeh, G.: An Analytical Comparison of Approaches to Personalizing PageRank, Stanford University Technical Report (July 2003)
Savoy, J.: Czech stop words (2008), http://www.unine.ch/info/clef/
Vrany, J.: Efective computation of personalized PageRank in Python. In: DIR 2009 (submited, 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vraný, J. (2009). Parallel Algorithm for Query Content Based Webpages Ranking. In: Abramowicz, W. (eds) Business Information Systems. BIS 2009. Lecture Notes in Business Information Processing, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01190-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-01190-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01189-4
Online ISBN: 978-3-642-01190-0
eBook Packages: Computer ScienceComputer Science (R0)