Efficient algorithms for k-regret minimizing sets

PK Agarwal, N Kumar, S Sintos, S Suri - arxiv preprint arxiv:1702.01446, 2017 - arxiv.org
A regret minimizing set Q is a small size representation of a much larger database P so that
user queries executed on Q return answers whose scores are not much worse than those on …

Comparative study of Topk based on Fagin's algorithm using correlation metrics in cloud computing QoS

K El handri, A Idrissi - International Journal of Internet …, 2020 - inderscienceonline.com
With the exponential growth of cloud computing services recently, several internet
technologies began to require the processing of multi-criteria ranking. The collaborative …

Efficient approaches to k representative g-skyline queries

X Zhou, K Li, Z Yang, Y Gao, K Li - ACM Transactions on Knowledge …, 2020 - dl.acm.org
The G-Skyline (GSky) query is a powerful tool to analyze optimal groups in decision support.
Compared with other group skyline queries, it releases users from providing an aggregate …

Space filling approach for distributed processing of top-k dominating queries

D Amagata, T Hara, M Onizuka - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
A top-k dominating query returns k data objects that dominate the highest number of data
objects in a given dataset. This query provides us with a set of intuitively preferred data, thus …

Efficient processing of top k group skyline queries

Z Yang, X Zhou, K Li, G **ao, Y Gao, K Li - Knowledge-Based Systems, 2019 - Elsevier
For a given multi-dimensional data set, a group skyline query returns the optimal groups not
dominated by any other group of equal size. The group skyline query is a powerful tool in …

Graph threshold algorithm

W Lee, JJS Song, CC Lee, TC Jo, JJH Lee - The Journal of …, 2021 - Springer
Recently more and more information sources are connected together and become a sort of
complex graphs that can be exploited not only as a structured and semi-structured data such …

Parallel processing of top-k dominating queries on incomplete data

X Ding, C Yan, Y Zhao - 2018 IEEE 4th international …, 2018 - ieeexplore.ieee.org
A top-k dominating query returns the k objects dominating the maximum number of objects
in a given dataset. It combines the advantages of skyline queries and top-k queries, and …

Scalable similarity joins of tokenized strings

A Metwally, CH Huang - 2019 IEEE 35th International …, 2019 - ieeexplore.ieee.org
This work tackles the problem of fuzzy joining of strings that naturally tokenize into
meaningful substrings, eg, full names. Tokenized-string joins have several established …

A Top-K Retrieval algorithm based on a decomposition of ranking functions

N Madrid, P Rusnok - Information Sciences, 2019 - Elsevier
A Top-k retrieval algorithm returns the k best answers of a query according to a given
ranking. From a theoretical point of view, the solution of this query is straightforward if we do …

[PDF][PDF] Phone Number: 2310013770

T ELEFTHERIOS - acf.teithe.gr
CURRICULUM VITAE TIAKAS ELEFTHERIOS, MSc, PhD Department: Accounting and
Information Systems – International Hellenic Universi Page 1 CURRICULUM VITAE TIAKAS …