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

DOI10.1016/J.INS.2018.09.014zbMATH Open1441.68030OpenAlexW2892110531WikidataQ129224685 ScholiaQ129224685MaRDI QIDQ2200719FDOQ2200719

Authors: Nicolás Madrid, Pavel Rusnok 

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

Recommendations

• $$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking
• Top-\(k\) ranked document search in general text databases
• Top-\(k\) document retrieval in optimal time and linear space
• Time-optimal top-\(k\) document retrieval
• An efficient method for the reverse top k search
• Top-\(k\) document retrieval in compact space and near-optimal time
• Top-\(k\) document retrieval in optimal space

zbMATH Keywords

big datapreferencesranking functionstop-k retrieval

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• Title not available (Why is that?)
• Optimal aggregation algorithms for middleware.
• A top-\(k\) query answering procedure for fuzzy logic programming
• Processing Top-k Dominating Queries in Metric Spaces
• Combining fuzzy information from multiple systems
• 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

Cited In (1)

• $$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking

Uses Software

• Python

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200719)