Selection in Scale-Free Small World

Details Selection in Scale-Free Small World Selection in Scale-Free Small World

2005-04-14

arxiv.org/abs/cs/0504063v1

Computer Science

Learning

24 pages, 3 figures

Scientific paper

In this paper we compare the performance characteristics of our selection based learning algorithm for Web crawlers with the characteristics of the reinforcement learning algorithm. The task of the crawlers is to find new information on the Web. The selection algorithm, called weblog update, modifies the starting URL lists of our crawlers based on the found URLs containing new information. The reinforcement learning algorithm modifies the URL orderings of the crawlers based on the received reinforcements for submitted documents. We performed simulations based on data collected from the Web. The collected portion of the Web is typical and exhibits scale-free small world (SFSW) structure. We have found that on this SFSW, the weblog update algorithm performs better than the reinforcement learning algorithm. It finds the new information faster than the reinforcement learning algorithm and has better new information/all submitted documents ratio. We believe that the advantages of the selection algorithm over reinforcement learning algorithm is due to the small world property of the Web.

Affiliated with

Also associated with

No associations

Rating

Selection in Scale-Free Small World does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Selection in Scale-Free Small World, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Selection in Scale-Free Small World will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-145586