A new approach to search result clustering and labeling
dc.citation.epage | 292 | en_US |
dc.citation.spage | 283 | en_US |
dc.citation.volumeNumber | 7097 | en_US |
dc.contributor.author | Türel, Anıl | en_US |
dc.contributor.author | Can, Fazlı | en_US |
dc.coverage.spatial | Dubai, United Arab Emirates | en_US |
dc.date.accessioned | 2016-02-08T12:15:17Z | |
dc.date.available | 2016-02-08T12:15:17Z | |
dc.date.issued | 2011 | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.description | Conference name: 7th Asia Information Retrieval Societies Conference, AIRS 2011 | en_US |
dc.description | Date of Conference: December 18-20, 2011 | en_US |
dc.description.abstract | 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. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T12:15:17Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2011 | en |
dc.identifier.doi | 10.1007/978-3-642-25631-8_26 | en_US |
dc.identifier.doi | 10.1007/978-3-642-25631-8 | en_US |
dc.identifier.issn | 0302-9743 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/28246 | en_US |
dc.language.iso | English | en_US |
dc.publisher | Springer, Berlin, Heidelberg | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-642-25631-8_26 | en_US |
dc.relation.isversionof | https://doi.org/10.1007/978-3-642-25631-8 | en_US |
dc.source.title | Information Retrieval Technology | en_US |
dc.subject | Cluster labeling | en_US |
dc.subject | Search result clustering | en_US |
dc.subject | Web information retrieval | en_US |
dc.subject | Cluster content | en_US |
dc.subject | Cluster labeling | en_US |
dc.subject | Clustering approach | en_US |
dc.subject | Clustering methods | en_US |
dc.subject | Clustering quality | en_US |
dc.subject | Data sets | en_US |
dc.subject | K-Means clustering algorithm | en_US |
dc.subject | Post processing | en_US |
dc.subject | Precision and recall | en_US |
dc.subject | Query results | en_US |
dc.subject | Relative performance | en_US |
dc.subject | Research problems | en_US |
dc.subject | Search results | en_US |
dc.subject | Suffix-trees | en_US |
dc.subject | Term weighting | en_US |
dc.subject | Web information retrieval | en_US |
dc.subject | Clustering algorithms | en_US |
dc.subject | Content based retrieval | en_US |
dc.subject | Information retrieval | en_US |
dc.subject | Infrared devices | en_US |
dc.subject | World Wide Web | en_US |
dc.subject | Search engines | en_US |
dc.title | A new approach to search result clustering and labeling | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- A new approach to search result clustering and labeling.pdf
- Size:
- 165.77 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version