Evaluating hierarchical clustering of search results

Authors:
Juan M. Cigarran;Anselmo Pen̈as;Julio Gonzalo;Felisa Verdejo
Affiliations:
Dept. Lenguajes y Sistemas Informáticos, E.T.S.I. Informática UNED;Dept. Lenguajes y Sistemas Informáticos, E.T.S.I. Informática UNED;Dept. Lenguajes y Sistemas Informáticos, E.T.S.I. Informática UNED;Dept. Lenguajes y Sistemas Informáticos, E.T.S.I. Informática UNED
Venue:
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Year:
2005

Citing 6
Cited 2

Reexamining the cluster hypothesis: scatter/gather on retrieval results

SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Concept Data Analysis: Theory and Applications

Concept Data Analysis: Theory and Applications
Understanding user goals in web search

Proceedings of the 13th international conference on World Wide Web
A hierarchical monothetic document clustering algorithm for summarization and browsing search results

Proceedings of the 13th international conference on World Wide Web
A personalized search engine based on web-snippet hierarchical clustering

WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Automatic selection of noun phrases as document descriptors in an FCA-Based information retrieval system

ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis

A survey of Web clustering engines

ACM Computing Surveys (CSUR)
Concept location using formal concept analysis and information retrieval

ACM Transactions on Software Engineering and Methodology (TOSEM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a goal-oriented evaluation measure, Hierarchy Quality, for hierarchical clustering algorithms applied to the task of organizing search results -such as the clusters generated by Vivisimo search engine-. Our metric considers the content of the clusters, their hierarchical arrangement, and the effort required to find relevant information by traversing the hierarchy starting from the top node. It compares the effort required to browse documents in a baseline ranked list with the minimum effort required to find the same amount of relevant information by browsing the hierarchy (which involves examining both documents and node descriptors).