Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web

This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information environments on-line in search of pages relevant to the user, by traversing hyperlinks in an autonomous and intelligent fashion. Each agent adapts to the spatial and temporal regularities of its local context thanks to a combination of machine learning techniques inspired by ecological models: evolutionary adaptation with local selection, reinforcement learning and selective query expansion by internalization of environmental signals, and optional relevance feedback. We evaluate the feasibility and performance of these methods in three domains: a general class of artificial graph environments, a controlled subset of the Web, and (preliminarly) the full Web. Our results suggest that InfoSpiders could take advantage of the starting points provided by search engines, based on global word statistics, and then use...

• Type: Journal
• Year: 2000
• Where: ML
• Authors: Filippo Menczer, Richard K. Belew
• Keywords: Adaptive Web Agents, Local Context Thanks, Machine Learning, ML 2000, Selective Query Expansion