A new approach to search result clustering and labeling
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/28246
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Conference Paper 
Search engines present query results as a long ordered list of web snippets divided into several pages. Post-processing of retrieval results for easier access of desired information is an important research problem. In this paper, we present a novel search result clustering approach to split the long list of documents returned by search engines into meaningfully grouped and labeled clusters. Our method emphasizes clustering quality by using cover coefficient-based and sequential k-means clustering algorithms. A cluster labeling method based on term weighting is also introduced for reflecting cluster contents. In addition, we present a new metric that employs precision and recall to assess the success of cluster labeling. We adopt a comparative strategy to derive the relative performance of the proposed method with respect to two prominent search result clustering methods: Suffix Tree Clustering and Lingo. Experimental results in the publicly available AMBIENT and ODP-239 datasets show that our method can successfully achieve both clustering and labeling tasks. © 2011 Springer-Verlag Berlin Heidelberg.
Showing items related by title, author, creator and subject.
Adsorption of Pt and bimetallic PtAu clusters on the partially reduced rutile (110) TiO 2 surface: A first-principles study Çakír, D.; Gülseren O. (2012)An extensive study of the adsorption of small Pt n (n = 1-8) and bimetallic Pt 2Au m (m = 1-5) clusters on the partially reduced rutile (110) TiO 2 surface has been performed via total energy pseudopotential calculations ...
Altingovde I.S.; Atilgan, D.; Ulusoy Ö. (2010)In this paper, we first employ the well known Cover-Coefficient Based Clustering Methodology (C3M) for clustering XML documents. Next, we apply index pruning techniques from the literature to reduce the size of the document ...
Can F.; Altingövde I.S.; Demir, E. (2004)Our research shows that for large databases, without considerable additional storage overhead, cluster-based retrieval (CBR) can compete with the time efficiency and effectiveness of the inverted index-based full search ...