Open Access
Translator Disclaimer
2006 Cluster Generation and Labeling for Web Snippets: A Fast, Accurate Hierarchical Solution
Filippo Geraci, Marco Pellegrini, Marco Maggini, Fabrizio Sebastiani
Internet Math. 3(4): 413-443 (2006).


This paper describes Armil, a meta-search engine that groups the web snippets returned by auxiliary search engines into disjoint labeled clusters. The cluster labels generated by Armil provide the user with a compact guide to assessing the relevance of each cluster to his/her information need. Striking the right balance between running time and cluster well-formedness was a key point in the design of our system. Both the clustering and the labeling tasks are performed on the fly by processing only the snippets provided by the auxiliary search engines, and they use no external sources of knowledge. Clustering is performed by means of a fast version of the furthest-point-first algorithm for metric $k$-center clustering. Cluster labeling is achieved by combining intra-cluster and inter-cluster term extraction based on a variant of the information gain measure. We have tested the clustering effectiveness of Armil against Vivisimo, the de facto industrial standard in web snippet clustering, using as benchmark a comprehensive set of snippets obtained from the Open Directory Project hierarchy. According to two widely accepted ``external'' metrics of clustering quality, Armil achieves better performance levels by $10%$. We also report the results of a thorough user evaluation of both the clustering and the cluster labeling algorithms. On a standard desktop PC (AMD Athlon 1-Ghz Clock with 750 Mbytes RAM), Armil performs clustering and labeling altogether of up to 200 snippets in less than one second.


Download Citation

Filippo Geraci. Marco Pellegrini. Marco Maggini. Fabrizio Sebastiani. "Cluster Generation and Labeling for Web Snippets: A Fast, Accurate Hierarchical Solution." Internet Math. 3 (4) 413 - 443, 2006.


Published: 2006
First available in Project Euclid: 18 November 2008

zbMATH: 1147.68349
MathSciNet: MR2412872

Rights: Copyright © 2006 A K Peters, Ltd.


Vol.3 • No. 4 • 2006
Back to Top