Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web |
| |
Authors: | Menczer Filippo Belew Richard K |
| |
Affiliation: | (1) Management Sciences Department, University of Iowa, Iowa City, IA 52242-1000, USA;(2) Computer Science and Engineering Department, University of California San Diego, La Jolla, CA 92093-0114, USA |
| |
Abstract: | 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 linkage topology to guide their search on-line. We show how this approach can complement the current state of the art, especially with respect to the scalability challenge. |
| |
Keywords: | InfoSpiders distributed information retrieval evolutionary algorithms local selection internalization reinforcement learning neural networks relevance feedback linkage topology scalability selective query expansion adaptive on-line Web agents |
本文献已被 SpringerLink 等数据库收录! |
|