CSDL Home W WI-IAT 2011 Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on
Aug. 22, 2011 to Aug. 27, 2011
Ephemeral clustering has been studied for more than a decade, although with low user acceptance. According to us, this situation is mainly due to (1) an excessive number of generated clusters, which makes browsing difficult and (2) low quality labeling, which introduces imprecision within the search process. In this paper, our motivation is twofold. First, we propose to reduce the number of clusters of Web page results, but keeping all different query meanings. For that purpose, we propose a new polythetic methodology based on an informative similarity measure, the InfoSimba, and a new hierarchical clustering algorithm, the HISGK-means. Second, a theoretical background is proposed to define meaningful cluster labels embedded in the definition of the HISGK-means algorithm, which may elect as best label, words outside the given cluster. To confirm our intuitions, we propose a new evaluation framework, which shows that we are able to extract most of the important query meanings but generating much less clusters than state-of-the-art systems.
Hierarchical Ephemeral Clustering, Polythetic Web Snippet Representation, Informative Similarity Measure, Automatic Cluster and Label Evaluation
Gaël Dias, Guillaume Cleuziou, David Machado, "Informative Polythetic Hierarchical Ephemeral Clustering", WI-IAT, 2011, Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on, Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on 2011, pp. 104-111, doi:10.1109/WI-IAT.2011.123