Paper: Easy Web Search Results Clustering: When Baselines Can Reach State-of-the-Art Algorithms

ACL ID E14-4001
Title Easy Web Search Results Clustering: When Baselines Can Reach State-of-the-Art Algorithms
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 2014
Authors

This work discusses the evaluation of baseline algorithms for Web search re- sults clustering. An analysis is performed over frequently used baseline algorithms and standard datasets. Our work shows that competitive results can be obtained by either fine tuning or performing cascade clustering over well-known algorithms. In particular, the latter strategy can lead to a scalable and real-world solution, which evidences comparative results to recent text-based state-of-the-art algorithms.