Un metabuscador que eficientiza búsquedas colaborativas
Loading...
Publication date
Advisors
Department
Research group
Center
Abstract
Al realizar actividades grupales frecuentemente los estudiantes deben buscar de
manera individual material disponible en la web. Cada integrante del grupo dispara su búsqueda y
analiza los resultados antes de colaborar con el resto de sus compañeros. dado que muchos de los
resultados obtenidos se repiten entre los diferentes estudiantes del grupo, proceder de esta forma
provoca una considerable pérdida de tiempo y esfuerzo. Para afrontar esta problemática se
desarrolló un metabuscador basado en agentes destinado a contextos colaborativos. La aplicación
posibilita que los integrantes de un grupo compartan un proceso de búsqueda web, donde cada
estudiante puede asignar una valoración personal a los resultados devueltos por el metabuscador y
también incorporar un comentario si lo desea. El metabuscadorordena los resultados mediante un
algoritmo de rankeo específicamente desarrollado que calcula una valoración grupal promediando
las valoraciones individuales asignadas. Los resultados obtenidos mediante experimentación con
grupos colaborativos de estudiantes universitarios demuestran que la aplicación desarrollada es útil, amigable, motivadora, y fundamentalmente que eficientiza los procesos de búsqueda colaborativos
al disminuir tanto el tiempo destinado a comunicación entre los integrantes de un grupo, como el
tiempo dedicado a la lectura de materiales web por parte de cada estudiante
In group activities students frequently have to search for material available on the web in an individual way. This means that each group member triggers a search and analyzes the results before collaborating with his group mates. Since many of the search results are repeated among the different students in the group, this way of working causes a considerable loss of time and effort. To address this problem, a metasearch engine based on software agents was developed for collaborative contexts. The metasearch engine allows members of a group to share a web search process. during this process each student can assign a personal assessment and incorporate a comment to the results returned by the metasearch engine. The metasearch engine organizes the results by means of a ranking algorithm that calculates a group valuation by averaging the individual valuations assigned. The results obtained through experimentation with collaborative groups of university students show that the metasearch engine is useful, friendly, and motivating. furthermore, the metasearch makes the collaborative searching processes more efficient by reducing the time allocated to communication between the members of a group and the time dedicated to the reading of web materials by each student
In group activities students frequently have to search for material available on the web in an individual way. This means that each group member triggers a search and analyzes the results before collaborating with his group mates. Since many of the search results are repeated among the different students in the group, this way of working causes a considerable loss of time and effort. To address this problem, a metasearch engine based on software agents was developed for collaborative contexts. The metasearch engine allows members of a group to share a web search process. during this process each student can assign a personal assessment and incorporate a comment to the results returned by the metasearch engine. The metasearch engine organizes the results by means of a ranking algorithm that calculates a group valuation by averaging the individual valuations assigned. The results obtained through experimentation with collaborative groups of university students show that the metasearch engine is useful, friendly, and motivating. furthermore, the metasearch makes the collaborative searching processes more efficient by reducing the time allocated to communication between the members of a group and the time dedicated to the reading of web materials by each student







