Abstract
When searching for information on the World Wide Web, it is often necessary to use one of the available search engines. Because the number of results are quite large for most queries, it is very important to have some measure of relevance of the result Web pages. One of the most important relevance factors is the popularity score which indicates how popular the page is among the users. We propose a modified version of status index by Katz and present efficient sequential and parallel algorithms that solve the problem. The high flexibility in our algorithm results in resilience to spamming as we show by experiments.
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
Berenbrink, P., Meyer auf der Heide, F., Schröder, K.: Schröder, K., Allocating weighted jobs in parallel. Theory of Computing Systems 32, 281–300 (1999)
Bonacich, P., Lloyd, P.: Eigenvector-like measures of centrality for asymmetric relations (manuscrip)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems 30(1-7), 107–117 (1998)
Hubbell, C.H.: An input-output approach to clique identification. Sociometry 28, 377–399 (1965)
JáJá, J.: An Introduction to Parallel Algorithms
Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18, 39–43 (1953)
Kleinberg, J.: Authoritative sources in a hyperlinked environment. Journal of the ACM 46(5), 604–632 (1999)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the Web, Technical report, Stanford University (1998), Addison- Wesley (1992)
Sadakane, K., Imai, H.: Fast algorithms for k-word proximity search. IEICE Trans. Fundamentals E84-A(9), 312–319 (2001)
Valiant, L.G.: A bridging model for parallel computation. Comm. ACM 33, 103–111 (1990)
Valiant, L.G.: General purpose parallel architectures. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 943–972. Elsevier/The MIT Press, Amsterdam (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, SR. (2004). Efficient Sequential and Parallel Algorithms for Popularity Computation on the World Wide Web with Applications against Spamming. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24767-8_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-24767-8_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22057-2
Online ISBN: 978-3-540-24767-8
eBook Packages: Springer Book Archive