Learning automata-based solutions to the optimal web polling problem modelled as a nonlinear fractional knapsack problem

Authors:
Ole-Christoffer Granmo;B. John Oommen
Affiliations:
Department of Information and Communication Technology, University of Agder, Grooseveien 36, NO-4876 Grimstad, Norway;University of Agder, Grimstad, Norway and School of Computer Science, Carleton University, Ottawa, Canada K1S 5B6
Venue:
Engineering Applications of Artificial Intelligence
Year:
2011

Citing 8
Cited 1

Absorbing and ergodic discretized two-action learning automata

IEEE Transactions on Systems, Man and Cybernetics
Learning automata: an introduction

Learning automata: an introduction
Optimal crawling strategies for web search engines

Proceedings of the 11th international conference on World Wide Web
Monitoring the dynamic web to respond to continuous queries

WWW '03 Proceedings of the 12th international conference on World Wide Web
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Solving Stochastic Nonlinear Resource Allocation Problems Using a Hierarchy of Twofold Resource Allocation Automata

IEEE Transactions on Computers
Stochastic searching on the line and its applications to parameter learning in nonlinear optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Learning Automata-Based Solutions to the Nonlinear Fractional Knapsack Problem With Applications to Optimal Resource Allocation

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

On incorporating the paradigms of discretization and Bayesian estimation to create a new family of pursuit learning automata

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of polling web pages as a strategy for monitoring the world wide web. The problem consists of repeatedly polling a selection of web pages so that changes that occur over time are detected. In particular, we consider the case where we are constrained to poll a maximum number of web pages per unit of time, and this constraint is typically dictated by the governing communication bandwidth, and by the speed limitations associated with the processing. Since only a fraction of the web pages can be polled within a given unit of time, the issue at stake is one of determining which web pages are to be polled, and we attempt to do it in a manner that maximizes the number of changes detected. We solve the problem by first modelling it as a stochastic nonlinear fractional knapsack problem. We then present an online learning automata (LA) system, namely, the hierarchy of twofold resource allocation automata (H-TRAA), whose primitive component is a twofold resource allocation automaton (TRAA). Both the TRAA and the H-TRAA have been proven to be asymptotically optimal. Finally, we demonstrate empirically that the H-TRAA provides orders of magnitude faster convergence compared to the learning automata knapsack game (LAKG) which represents the state-of-the-art for this problem. Further, in contrast to the LAKG, the H-TRAA scales sub-linearly. Based on these results, we believe that the H-TRAA has also tremendous potential to handle demanding real-world applications, particularly those which deal with the world wide web.