ABSTRACT
Clustering of search results is an important feature in many of today's information retrieval applications. The notion of hit list clustering appears in Web search engines and enterprise search engines as a mechanism that allows users to further explore the coverage of a query. However, there has been little work on exposing temporal attributes for constructing and presentation of clusters. These attributes appear in documents as part of the textual content, e.g., as a date and time token or as a temporal reference in a sentence. In this paper, we outline a model and describe a prototype that shows the main ideas.
- R. Baeza-Yates "Searching the Future" SIGIR Workshop MF/IR (2005).Google Scholar
- O. Zamir and O. Etzioni "Web Document Clustering: a Feasibility Demonstration", Proc. of 21st SIGIR (1998), 46--54. Google ScholarDigital Library
- A. Aula, N. Jhaveri, and M. Kaki. "Information Search Re-access Strategies of Experienced Web Users", Proc. of 14th WWW (2005), 583--592. Google ScholarDigital Library
- H. Cunningham, D. Maynard, K. Bontcheva, V. Tablan. "GATE: A Framework and Graphical Development Environment for Robust NLP Tools and Applications", ACL'02. PA, July 2002.Google Scholar
- D. Koen and W. Bender. "Time Frames: Temporal Augmentation of the News". IBM System Journal, Vol. 39, No. 4 (2000), 597--616. Google ScholarDigital Library
- F. Schlider and C. Habel. "From Temporal Expressions to Temporal Information: Semantic Tagging of News Messages", ACL'01 Workshop on temporal and spatial information processing (2001), 1--8. Google ScholarDigital Library
- A. Jain, M. Murthy, and P. Flynn. "Data Clustering: A Survey". ACM Computing Surveys, 31(3):264-323, (1999) Google ScholarDigital Library
- http://www.itl.nist.gov/iad/894.01/tests/ie-er/er_99/er_99.htmGoogle Scholar
Index Terms
- Clustering of search results using temporal attributes
Recommendations
A personalized search engine based on web-snippet hierarchical clustering
WWW '05: Special interest tracks and posters of the 14th international conference on World Wide WebIn this paper we propose a hierarchical clustering engine, called snaket, that is able to organize on-the-fly the search results drawn from 16 commodity search engines into a hierarchy of labeled folders. The hierarchy offers a complementary view to the ...
Re-ranking search results using query logs
CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge managementThis work addresses two common problems in search, frequently occurring with underspecified user queries: the top-ranked results for such queries may not contain documents relevant to the user's search intent, and fresh and relevant pages may not get ...
A Concept-Driven Algorithm for Clustering Search Results
Most search engines return search results in a single-dimensional ranking of relevance to a user's query. Although this method works well for specific information needs, it often fails when users submit broad, ambiguous queries, seeking a general cross-...
Comments