Abstract : Current Web search engines return long lists of ranked documents that users are forced to sift through to find relevant documents. This paper introduces an interactive presentation method of the search results, based on the notion of clustering by compression. Compression algorithms allow defining a similarity measure based on the degree of common information. Clustering methods allow clustering similar data without any previous knowledge. For this work, we have developed a Java application which retrieves the first 50 results returned by the Google search engine in response to a query, applies some text processing techniques to the Web documents, and thirdly applies the clustering by compression algorithm. The result is a binary tree enhancing the visualization of the formed clusters.
https://hal-supelec.archives-ouvertes.fr/hal-00232719
Contributor : Evelyne Faivre
<>
Submitted on : Friday, February 1, 2008 - 4:03:51 PM
Last modification on : Tuesday, August 21, 2018 - 11:40:04 AM
Frédéric Boulanger, Géraldine Polaillon, Dorin Carstoiu, Alexandra Cernian, Stefan Bodea. Organizing Web Search Results Using Clustering By Compression. IADIS INTERNATIONAL CONFERENCE e-SOCIETY 2007, Mar 2007, Lisbon, Portugal. pp.419-423. ⟨hal-00232719⟩
