World Wide Web Metasearch Clustering Algorithm
As the storage capacity and the processing speed of search engine is growing to keep up with the constant expansion of the World Wide Web, the user is facing an increasing list of results for a given query. A simple query composed of common words sometimes have hundreds even thousands of results making it practically impossible for the user to verify all of them, in order to identify a particular site. Even when the list of results is presented to the user ordered by a rank, most of the time it is not sufficient support to help him identify the most relevant sites for his query. The concept of search result clustering was introduced as a solution to this situation. The process of clustering search results consists of building up thematically homogenous groups from the initial list results provided by classic search tools, and using up characteristics present within the initial results, without any kind of predefined categories.
| Year of publication: |
2008
|
|---|---|
| Authors: | LIPAI, Adina |
| Published in: |
Informatica Economica. - Academia de Studii Economice din Bucureşti, ISSN 1453-1305. - Vol. XII.2008, 2, p. 5-11
|
| Publisher: |
Academia de Studii Economice din Bucureşti |
| Subject: | search results | clustering algorithm | World Wide Web search |
Saved in:
Saved in favorites
Similar items by subject
-
Behnert, Christiane, (2017)
-
Building a web‐snippet clustering system based on a mixed clustering method
Chen, Lin‐Chih, (2011)
-
Ghosh, Prosenjit, (2022)
- More ...
Similar items by person
-
Web Metasearch Result Clustering System
LIPAI, Adina, (2008)
- More ...