A top-k retrieval algorithm based on a decomposition of ranking functions

DOI10.1016/J.INS.2018.09.014zbMath1441.68030OpenAlexW2892110531WikidataQ129224685 ScholiaQ129224685MaRDI QIDQ2200719

Pavel Rusnok, Nicolás Madrid

Publication date: 22 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.09.014

zbMATH Keywords

preferencesbig dataranking functionstop-k retrieval

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Uses Software

• Python

Cites Work

• A top-\(k\) query answering procedure for fuzzy logic programming
• Combining fuzzy information from multiple systems
• Optimal aggregation algorithms for middleware.
• A time optimized scheme for top-\( k\) list maintenance over incomplete data streams
• Finding top-\(k\) influential users in social networks under the structural diversity model
• Processing Top-k Dominating Queries in Metric Spaces
• Unnamed Item

This page was built for publication: A top-k retrieval algorithm based on a decomposition of ranking functions