The amount of information on Internet is increasing very fast and, as a result, search becomes more and more a harder task. A common solution is to use authority-based search engines. However, for a community of people with similar interests, quality of results can be improved exploiting also implicit knowledge. We propose an agent-based recommendation system for supporting communities of people in searching the web by means of a popular search engine. Agents use data mining techniques in order to learn and discover users behaviors, and they interact to share knowledge about the users. We also present set of experimental results showing in terms of precision and recall how interaction increases the performance of the system.
Implicit: An Agent-Based Recommendation System for Web Search / Birukov, Alexander; Blanzieri, Enrico; Giorgini, Paolo. - ELETTRONICO. - (2004).
Implicit: An Agent-Based Recommendation System for Web Search
Blanzieri, Enrico;Giorgini, Paolo
2004-01-01
Abstract
The amount of information on Internet is increasing very fast and, as a result, search becomes more and more a harder task. A common solution is to use authority-based search engines. However, for a community of people with similar interests, quality of results can be improved exploiting also implicit knowledge. We propose an agent-based recommendation system for supporting communities of people in searching the web by means of a popular search engine. Agents use data mining techniques in order to learn and discover users behaviors, and they interact to share knowledge about the users. We also present set of experimental results showing in terms of precision and recall how interaction increases the performance of the system.File | Dimensione | Formato | |
---|---|---|---|
TechReport_ImplAAMAS05.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
202.86 kB
Formato
Adobe PDF
|
202.86 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione