On top-k retrieval for a family of non-monotonic ranking functions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17610%2F13%3AA14017UP" target="_blank" >RIV/61988987:17610/13:A14017UP - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On top-k retrieval for a family of non-monotonic ranking functions
Original language description
We presented a top-k algorithm to retrieve tuples according to the order provided by a non-necessarily monotone ranking funtion that belongs to a novel family of functions. The conditions imposed on the ranking functions are related to the values where the maximum score is achieved.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
O - Projekt operacniho programu
Others
Publication year
2013
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
Article name in the collection
Lecture Notes in Artificial Intelligence
ISBN
978-3-642-40768-0
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
507-518
Publisher name
Springer-Verlag
Place of publication
—
Event location
Granada
Event date
Jan 1, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—