A fully dynamic algorithm for k-regret minimizing sets

• المؤلفون الرئيسيون: WANG, Yanhao, LI, Yuchen, CHI-WING WONG, Raymond, TAN, Kian-Lee
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2021
• الموضوعات: regret minimizing set; dynamic algorithm; set cover; top-k query; skyline; Databases and Information Systems; Theory and Algorithms
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/6208; https://ink.library.smu.edu.sg/context/sis_research/article/7211/viewcontent/a_fully_dynamic.pdf
• المؤسسة: Singapore Management University

Selecting a small set of representatives from a large database is important in many applications such as multi-criteria decision making, web search, and recommendation. The k-regret minimizing set (k-RMS) problem was recently proposed for representative tuple discovery. Specifically, for a large dat...