Finite-time Analysis of the Multiarmed Bandit Problem
Machine Learning
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Hi-index | 0.00 |
We describe a search robot (crawler) intended to collect information regarding outgoing hyperlinks from a given set of web sites related to a certain topic. The crawler's adaptive behavior is formulated in terms of a multi-armed bandit problem. Our experiments show that the choice of an adaptive algorithm for the crawler's rational behavior depends on the actual topic of the underlying set of web sites.