Skip to main content
Conference Proceedings

On top-k retrieval for a family of non-monotonic ranking functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8132 LNAI 507-518
DOI: 10.1007/978-3-642-40769-7_44
4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Madrid, N., & Straccia, U. (2013). On top-k retrieval for a family of non-monotonic ranking functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8132 LNAI, pp. 507–518). https://doi.org/10.1007/978-3-642-40769-7_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free