A Top-K Retrieval algorithm based on a decomposition of ranking functions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17610%2F19%3AA2001N0O" target="_blank" >RIV/61988987:17610/19:A2001N0O - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S002002551830714X" target="_blank" >https://www.sciencedirect.com/science/article/pii/S002002551830714X</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ins.2018.09.014" target="_blank" >10.1016/j.ins.2018.09.014</a>
Alternative languages
Result language
angličtina
Original language name
A Top-K Retrieval algorithm based on a decomposition of ranking functions
Original language description
A Top-k retrieval algorithm returns the k best answers of a query according to a given ranking. From a theoretical point of view, the solution of this query is straightforward if we do not take into consideration execution time. However, in many practical situations, execution time is a substantial issue. In such a case, the process of getting the top k in an optimal time becomes an interesting and non-trivial task. This paper presents an algorithm to retrieve the top-k associated to an arbitrary ranking function. The idea is to decompose the ranking function as a supremum of a certain set of functions where an efficient top-k retrieval procedure can be easily applied. Besides the theoretical presentation of the algorithm, the paper provides a set of experiments to validate the approach.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
<a href="/en/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Information Sciences
ISSN
0020-0255
e-ISSN
—
Volume of the periodical
474
Issue of the periodical within the volume
Únor
Country of publishing house
US - UNITED STATES
Number of pages
8
Pages from-to
136-153
UT code for WoS article
000449567200009
EID of the result in the Scopus database
2-s2.0-85054090365