Fundamentals of matrix computations
Fundamentals of matrix computations
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Efficient crawling through URL ordering
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Breadth-first crawling yields high-quality pages
Proceedings of the 10th international conference on World Wide Web
ACM Transactions on Internet Technology (TOIT)
Modern Information Retrieval
Hyperlink Analysis for the Web
IEEE Internet Computing
Adaptive on-line page importance computation
WWW '03 Proceedings of the 12th international conference on World Wide Web
Challenges in web search engines
ACM SIGIR Forum
What's new on the web?: the evolution of the web from a search engine perspective
Proceedings of the 13th international conference on World Wide Web
Impact of search engines on page popularity
Proceedings of the 13th international conference on World Wide Web
Average-clicks: a new measure of distance on the World Wide Web
Journal of Intelligent Information Systems - Special issue on web intelligence
Scheduling Algorithms for Web Crawling
LA-WEBMEDIA '04 Proceedings of the WebMedia & LA-Web 2004 Joint Conference 10th Brazilian Symposium on Multimedia and the Web 2nd Latin American Web Congress
The indexable web is more than 11.5 billion pages
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Page quality: in search of an unbiased web ranking
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Generalizing PageRank: damping functions for link-based ranking algorithms
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
FICA: A novel intelligent crawling algorithm based on reinforcement learning
Web Intelligence and Agent Systems
A3CRank: An adaptive ranking method based on connectivity, content and click-through data
Information Processing and Management: an International Journal
Applying reinforcement learning for web pages ranking algorithms
Applied Soft Computing
Popularity-based relevance propagation
Journal of Web Engineering
Slash-based relevance propagation model for topic distillation
Journal of Web Engineering
Hi-index | 0.00 |
A fast and efficient page ranking mechanism for web crawling and retrieval remains as a challenging issue. Recently, several link based ranking algorithms like PageRank, HITS and OPIC have been proposed. In this paper, we propose a novel recursive method based on reinforcement learning which considers distance between pages as punishment, called ''DistanceRank'' to compute ranks of web pages. The distance is defined as the number of ''average clicks'' between two pages. The objective is to minimize punishment or distance so that a page with less distance to have a higher rank. Experimental results indicate that DistanceRank outperforms other ranking algorithms in page ranking and crawling scheduling. Furthermore, the complexity of DistanceRank is low. We have used University of California at Berkeley's web for our experiments.