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.
Gori, M., Maggini, M., Martinelli, E. (1997). Connectionist-based information retrieval. In Proceedings of the 42nd SPIE's annual meeting, Vol. 3165, Applications of Soft Computing (pp.78-85).
Connectionist-based information retrieval
GORI, MARCO;MAGGINI, MARCO;MARTINELLI, ENRICO
1997-01-01
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.File | Dimensione | Formato | |
---|---|---|---|
SPIE97.pdf
non disponibili
Tipologia:
Pre-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
740.89 kB
Formato
Adobe PDF
|
740.89 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/35960
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo