Revista Interamericana de Bibliotecología
versão impressa ISSN 0120-0976
MARIN, Andrés e BRANCH B, John W. Application of two new algorithms to group search results in on line public access catalogs (OPAC). Rev. Interam. Bibliot [online]. 2008, vol.31, n.1, pp. 47-65. ISSN 0120-0976.
With the ease of Internet use, and particularly the Web, today it is easier to gain access to new information sources available in anywhere in the world. Through the web, users search for specific information according to their own necessities. They may search either by means of search machines, such as Google and Yahoo, or specific library data bases or information systems. However, information seeking results on searching machines, online public access catalog systems, and in general, on the web search system can saturate a user because of the abundance of results, which leads to a loss of effectiveness. To solve this problem, the research "Agrupamiento de resultados obtenidos de consultas distribuidas en sistemas de catálogos públicos en línea (OPAC)", from which this paper derives, proposes two results clustering algorithms focused on concurrent online systems characterized by low consume of processor and memory cycles, which are used in a prototype of software.
Palavras-chave : k-means; clustering algorithm; OPACS; data mining; information retrieval.