Abstract
Web-page scoring is a method to improve Web search-engines by assigning a score to each page according to its importance. The PageRank algorithm implemented for Google is a well known efficient scoring method for WWW search-engines, whereas it is not efficient for searching a local Web. For the latter case, text matching is usually used for computing scores and the hyperlink structure of Web-pages is wasted. Although a method for scoring local Web-pages called the HotLink method has been proposed, it is not well established because the scores depend on how to extract a tree structure, which is unknown, from the Web-graph.
In this paper, we solve the problem of the HotLink method by considering all shortest-path trees and taking the average score. As a result, the scores are independent of the selection of a tree, which makes the scores robust. We also propose an efficient algorithm to compute this average score in O(|V||E|) time where V and E is the set of pages and hyperlinks of a local Web-graph, respectively. Experimental results show that our new scoring method captures important pages in a local Web.
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
Bose, P., Czyzowicz, J., Gąsieniec, L., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.: Strategies for Hotlink Assignment. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 23–34. Springer, Heidelberg (2000)
Bröder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the Web: Experiments and models. In: Proceedings of WWW, pp. 309–320 (2000)
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Elementary Graph Algorithms. In: Introduction to Algorithms, 2nd edn., Ch. 22, pp. 527–560 (2001)
Fagin, R., Kumar, R., McCurley, K., Novak, J., Sivakumar, D., Tomlin, J., Williamson, D.: Seaching the Workplace Web. In: Proceedings of WWW (2003)
Ikawa, Y., Sadakane, K.: A Webpage Scoring Method for Local Web Search Engines. FIT Information Technology Letters (in Japanese), LD-2 (2002)
Ikawa, Y., Sadakane, K.: A Webpage Scoring Method for Local Web Search Engines. DBSJ Letters (in Japanese) 2(1), 115–118 (2003)
Kleinberg, J., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: The Web as a graph: measurements, models, and methods. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 1–18. Springer, Heidelberg (1999)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Technical Report, Computer Science Department, Stanford University (1998)
Uno, T.: An Algorithm for Enumerating All Directed Spanning Trees in a Directed Graph. In: Nagamochi, H., Suri, S., Igarashi, Y., Miyano, S., Asano, T. (eds.) ISAAC 1996. LNCS, vol. 1178, pp. 166–173. Springer, Heidelberg (1996)
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
Ikawa, Y., Sadakane, K. (2004). A Web Page Scoring Method for Local Web Search Engines. In: Lee, Y., Li, J., Whang, KY., Lee, D. (eds) Database Systems for Advanced Applications. DASFAA 2004. Lecture Notes in Computer Science, vol 2973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24571-1_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-24571-1_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21047-4
Online ISBN: 978-3-540-24571-1
eBook Packages: Springer Book Archive