Share Email Print

Proceedings Paper

Connectionist-based information retrieval
Author(s): Marco Gori; Marco Maggini; Enrico Martinelli
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In this paper we suggest the application of connectionist models to information retrieval problems. In particular we propose the application of neural networks to the task of assigning a score to web pages in order to guide the user in navigating the web. Recent extensions of neural models to the processing of structured domains are a natural framework to build oracles capable to score hypertexts. Recursive neural networks can process directed acyclic graphs and thus can be employed to evaluate a hypertext taking into account also information coming from the pages referred by the hyperlinks it contains. Moreover, we can take advantage from the learning algorithms to adapt the scoring process to the user's preferences and habit. We show how different levels of the scoring process can be implemented using connectionist processing: we propose a method to summarize documents using multi-layer neural networks used as autoassociators; we suggest to use recurrent neural networks as predictors for the user's trajectories in the page domain; we explore the application of recursive neural networks to score hypertextual pages with respect to the context they are in.

Paper Details

Date Published: 13 October 1997
PDF: 8 pages
Proc. SPIE 3165, Applications of Soft Computing, (13 October 1997); doi: 10.1117/12.279604
Show Author Affiliations
Marco Gori, Univ. di Siena (Italy)
Marco Maggini, Univ. di Siena (Italy)
Enrico Martinelli, Univ. di Siena (Italy)

Published in SPIE Proceedings Vol. 3165:
Applications of Soft Computing
Bruno Bosacchi; James C. Bezdek; David B. Fogel, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?