RI UFLA (Universidade Federal de Lavras) >
Revistas UFLA >
Please use this identifier to cite or link to this item:
|Title: ||An architectural framework of a personalized web crawler based on user interests|
|???metadata.dc.creator???: ||Akilandeswari, J.|
Gopalan, N. P.
|Keywords: ||Personalized crawler|
Multi-level frontier queue
Ordenação de URL
Múltiplas filas de fronteira
|Publisher: ||Editora da UFLA|
|Citation: ||AKILANDESWARI, J.; GOPALAN, N. P. An architectural framework of a personalized web crawler based on user interests. INFOCOMP: Journal of Computer Science, Lavras, v. 8, n. 2, p. 81-89, June 2009.|
|Abstract: ||The World Wide Web (WWW) is overwhelmed with information which can not be assimilated by the normal users without the use of search tools. The traditional search returns thousands of results for a single search query making the search and surﬁng experience cumbersome. This drawback has triggered the need for implementing personalized search tools. In this paper, a novel architecture is proposed to gather pages that are relevant to a particular user or group of users. The system consists of three modules: input, crawling and feedback. The input module is integrated with topic suggestion component extracting search query terms and representative documents from different sources. The crawling module is realized with intelligent multi-agent system for prioritizing the download of appropriate URLs. The relevance of the documents is computed based on interests of the users. While rendering the results, the user gives feedback and the system is compared to different crawler implementations. The empirical results clearly suggest the advantage of using topic suggestion component and computation of personalized relevance score in terms of harvest ratio and coverage.|
|Other Identifiers: ||http://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/263|
|Appears in Collections:||Infocomp|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.