ISSN: 1744-0084
Online from: 2005
Subject Area: Information and Knowledge Management
Content: Latest Issue |
Latest Issue RSS | Previous Issues
Options: To add Favourites and Table of Contents Alerts please take a Emerald profile
| Title: | S2ProT: rank allocation by superpositioned propagation of topic relevance |
|---|---|
| Author(s): | Ola Ågren, (Department of Computing Science, Umeå University, Umeå, Sweden) |
| Citation: | Ola Ågren, (2008) "S2ProT: rank allocation by superpositioned propagation of topic relevance", International Journal of Web Information Systems, Vol. 4 Iss: 4, pp.416 - 440 |
| Keywords: | Information retrieval, Search engines, Spatial data structures, Worldwide web |
| Article type: | Research paper |
| DOI: | 10.1108/17440080810919477 (Permanent URL) |
| Publisher: | Emerald Group Publishing Limited |
| Acknowledgements: | The authors thank the referees for their valuable comments that have led to numerous improvements on the structure and content of the paper. They also thank all the participants of the assessment. |
| Abstract: | Purpose – The purpose of this paper is to assign topic-specific ratings to web pages. Design/methodology/approach – The paper uses power iteration to assign topic-specific rating values (called Findings – The paper finds that this approach exhibits desirable properties such as fast convergence, stability and yields relevant answer sets. The first property will be shown using theoretical proofs, while the others are evaluated through stability experiments and assessments of real world data in comparison with already established algorithms. Research limitations/implications – In the assessment, all pages that a web spider was able to find in the Nordic countries were used. It is also important to note that entities that use domains outside the Nordic countries (e.g..com or.org) are not present in the paper's datasets even though they reside logically within one or more of the Nordic countries. This is quite a large dataset, but still small in comparison with the entire worldwide web. Moreover, the execution speed of some of the algorithms unfortunately prohibited the use of a large test dataset in the stability tests. Practical implications – It is not only possible, but also reasonable, to perform ranking of web pages without using Markov chain approaches. This means that the work of generating answer sets for complex questions could (at least in theory) be divided into smaller parts that are later summed up to give the final answer. Originality/value – This paper contributes to the research on internet search engines. |
Downloadable; Printable; Owned
HTML, PDF (224kb)
To purchase this item please login or register.
Fill in an Order form to request this document from your librarian