Limitations and improvement opportunities for implicit result diversification in search engines

Download

index.pdf

Date

2019

Author

Ulu, Yaşar Barış

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

230
views

79
downloads

Search engine users essentially expect to find the relevant results for their query. Additionally, the results of the query should contain different possible query intents, which leads to the well-known problem of search result diversification. Our work first investigates the limitations of implicit search result diversification, and in particular, reveals that typical optimization tricks (such as clustering) may not necessarily improve the diversification effectiveness. Then, as our second contribution, we explore whether recently introduced word embeddings can be exploited for representing documents to improve diversification, and show a positive result. Third, as our detailed analysis reveals that the candidate set size plays a critical role for implicit diversification, we propose to automatically predict the size of the candidate set on per query basis. To this end, we use a rich set of features based on the inter-similarity of documents and similarity between queries and documents. Finally, we propose caching similarities of document pairs to improve the processing time efficiency of implicit result diversification.

Subject Keywords

Search engines., Keywords: Search Engines, Search Result Diversification, Implicit Result Diversification Methods, Machine Learning, Caching.

URI

http://etd.lib.metu.edu.tr/upload/12624874/index.pdf
https://hdl.handle.net/11511/45070

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Supervised learning for image search result diversification Göynük, Burak; Altıngövde, İsmail Sengör; Department of Computer Engineering (2019) Due to ambiguity of user queries and growing size of data living on the internet, methods for diversifying search results have gained more importance lately. While earlier works mostly focus on text search, a similar need also exists for image data, which grows rapidly as people produce and share image data via their smartphones and social media applications such as Instagram, Snapchat, and Facebook. Therefore, in this thesis, we focus on the result diversiﬁcation problem for image search. To this end, as o...
Explicit Search Result Diversification Using Score and Rank Aggregation Methods Ozdemiray, Ahmet Murat; Altıngövde, İsmail Sengör (2015-06-01) Search result diversification is one of the key techniques to cope with the ambiguous and underspecified information needs of web users. In the last few years, strategies that are based on the explicit knowledge of query aspects emerged as highly effective ways of diversifying search results. Our contributions in this article are two-fold. First, we extensively evaluate the performance of a state-of-the-art explicit diversification strategy and pin-point its potential weaknesses. We propose basic yet novel ...
Cost-aware result caching strategies for meta-search engines Bakkal, Emre; Altıngövde, İsmail Sengör; Department of Computer Engineering (2015) Meta-search engines are tools that generate top-k search results of a query by combining local top-k search results retrieved from various data sources in parallel. A result cache that stores the results of the previously seen queries is a crucial component in a meta-search engine to improve the efficiency, scalability and availability of the system. Our goal in this thesis is to design and analyze different cost-aware and dynamic result caching strategies to be used in meta-search engines. To this end, as ...
Effective & efficient methods for web search result diversification Özdemiray, Ahmet Murat; Altıngövde, İsmail Sengör; Department of Computer Engineering (2015) Search result diversification is one of the key techniques to cope with the ambiguous and/or underspecified information needs of the web users. In this study we first extensively evaluate the performance of a state-of-the-art explicit diversification strategy and pin-point its weaknesses. We propose basic yet novel optimizations to remedy these weaknesses and boost the performance of this algorithm. Secondly, we cast the diversification problem to the problem of ranking aggregation and propose to materializ...
Space Efficient Caching of Query Results in Search Engines Ozcan, Rifat; Altıngövde, İsmail Sengör; Ulusoy, Oezguer (2008-01-01) Web search engines serve millions of query requests per day. Caching query results is one of the most crucial mechanisms to cope with such a demanding load. In this paper, we propose an efficient storage model to cache document identifiers of query results. Essentially, we first cluster queries that have common result documents. Next, for each cluster, we attempt to store those common document identifiers in a more compact manner. Experimental results reveal that the proposed storage model achieves space re...

Citation Formats

Y. B. Ulu, “Limitations and improvement opportunities for implicit result diversification in search engines,” Thesis (M.S.) -- Graduate School of Natural and Applied Sciences. Computer Engineering., Middle East Technical University, 2019.