Ranking Categories for Web Search
In the context of Web Search, clustering based engines are emerging as an alternative for the classical ones. In this paper we analyse different possible ranking algorithms for ordering clusters of documents within a search result. More specifically, we investigate approaches based on document rankings, on the similarities between the user query and the search results, on the quality of the produced clusters, as well as some document independent approaches. Even though we use a topic based hierarchy for categorizing the URLs, our metrics can be applied to other clusters as well. An empirical analysis with a group of 20 subjects showed that the average similarity between the user query and the documents within each category yields the best cluster ranking.
KeywordsUser Query Ranking Algorithm Ranking Approach Ranking Category Random Query
Unable to display preview. Download preview PDF.
- 1.Chen, H., Dumais, S.T.: Bringing order to the web: automatically categorizing search results. In: ACM SIGCHI (2000)Google Scholar
- 2.Cutting, D.R., Pedersen, J.O., Karger, D.R., Tukey, J.W.: Scatter/gather: A cluster-based approach to browsing large document collections. In: ACM SIGIR (1992)Google Scholar
- 4.Zeng, H.-J., He, Q.-C., Chen, Z., Ma, W.-Y., Ma, J.: Learning to cluster web search results. In: ACM SIGIR (2004)Google Scholar