Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Databases and Information Systems
A Fully Dynamic Algorithm For K-Regret Minimizing Sets, Yanhao Wang, Yuchen Li, Raymond Chi-Wing Wong, Kian-Lee Tan
A Fully Dynamic Algorithm For K-Regret Minimizing Sets, Yanhao Wang, Yuchen Li, Raymond Chi-Wing Wong, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
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 database P of tuples with multiple numerical attributes, the k-RMS problem returns a size-r subset Q of P such that, for any possible ranking function, the score of the top-ranked tuple in Q is not much worse than the score of the kth-ranked tuple in P. Although the k-RMS problem has been extensively studied in the literature, existing methods …