Query performance prediction for aspect weighting in search result diversification

Date

2014-01-01

Author

Ozdemiray, Ahmet Murat
Altıngövde, İsmail Sengör

Metadata

Show full item record

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

Item Usage Stats

79
views

0
downloads

Accurate estimation of query aspect weights is an important issue to improve the performance of explicit search result diversification algorithms. For the first time in the literature, we propose using post-retrieval query performance predictors (QPPs) to estimate, for each aspect, the retrieval effectiveness on the candidate document set, and leverage these estimations to set the aspect weights. In addition to utilizing well-known QPPs from the literature, we also introduce three new QPPs that are based on score distributions and hence, can be employed for online query processing in real-life search engines. Our exhaustive experiments reveal that using QPPs for aspect weighting improves almost all state-of-the-art diversification algorithms in comparison to using a uniform weight estimator. Furthermore, the proposed QPPs are comparable or superior to the existing predictors in the context of aspect weighting.

Subject Keywords

İnformation systems

URI

https://hdl.handle.net/11511/38332

DOI

https://doi.org/10.1145/2661829.2661975

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Query Consolidation: Interpreting a Set of Independent Queries Using a Multidatabase Architecture in the Reverse Direction Acar, Aybar Can (null; 2008-08-23) We introduce the problem of query consolidation, which seeks to interpret a set of disparate queries submitted to independent databases with a single “global” query. This problem has multiple applications, from improving database design to protecting information from a seemingly innocuous set of apparently unrelated queries. The problem exhibits attractive duality with the much-researched problem of query decomposition, which has been addressed intensively in the context of multidatabase environments: How t...
Concurrency control for distributed multiversion databases through time intervals Halıcı, Uğur (1991-04-01) © 1991 ACM.Multiversion Schedulers are now a widely accepted method for enhancing performance of the concurrency control component of a database. When the read and write sets of transactions are known in advance, the amount of concurrency provided by the Multiversion Schedulers can further be improved. In this paper, a new concurrency control technique, which uses multiversion data in conjunction with predeclared read-write sets and the Time Interval technique is suggested. With the proposed method, a trans...
Exploiting Navigational Queries for Result Presentation and Caching in Web Search Engines Ozcan, Rifat; Altıngövde, İsmail Sengör; Ulusoy, Ozgur (Wiley, 2011-04-01) Caching of query results is an important mechanism for efficiency and scalability of web search engines. Query results are cached and presented in terms of pages, which typically include 10 results each. In navigational queries, users seek a particular website, which would be typically listed at the top ranks (maybe, first or second) by the search engine, if found. For this type of query, caching and presenting results in the 10-per-page manner may waste cache space and network bandwidth. In this article, w...
Discrete Sizing of Steel Frames Using Adaptive Dimensional Search Algorithm Hasançebi, Oğuzhan (Periodica Polytechnica Budapest University of Technology and Economics, 2019-01-01) Adaptive dimensional search (ADS) algorithm is a recently proposed metaheuristic optimization technique for discrete structural optimization problems. In this study, discrete sizing optimization problem of steel frames is tackled using the ADS algorithm. An important feature of the algorithm is that it does not use any metaphor as an underlying principle for its implementation. Instead, the algorithm employs an efficient performance-oriented methodology at each iteration for convergence to the optimum or a ...
Integer Linear Programming Solution for the Multiple Query Optimization Problem Dokeroglu, Tansel; Bayir, Murat Ali; Coşar, Ahmet (2014-10-28) Multiple Query Optimization (MQO) is a technique for processing a batch of queries in such a way that shared tasks in these queries are executed only once, resulting in significant savings in the total evaluation. The first phase of MQO requires producing alternative query execution plans so that the shared tasks between queries are identified and maximized. The second phase of MQO is an optimization problem where the goal is selecting exactly one of the alternative plans for each query to minimize the tota...

Citation Formats

A. M. Ozdemiray and İ. S. Altıngövde, “Query performance prediction for aspect weighting in search result diversification,” 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38332.