On obtaining stable rankings
Decision making is challenging when there is more than one criterion to consider. In such
cases, it is common to assign a goodness score to each item as a weighted sum of its …
cases, it is common to assign a goodness score to each item as a weighted sum of its …
RRR: Rank-regret representative
Selecting the best items in a dataset is a common task in data exploration. However, the
concept of" best''lies in the eyes of the beholder: different users may consider different …
concept of" best''lies in the eyes of the beholder: different users may consider different …
On Finding Rank Regret Representatives
Selecting the best items in a dataset is a common task in data exploration. However, the
concept of “best” lies in the eyes of the beholder: Different users may consider different …
concept of “best” lies in the eyes of the beholder: Different users may consider different …
A third-party replication service for dynamic hidden databases
S Hintzen, Y Liesy, C Zirpins - Service Oriented Computing and …, 2021 - Springer
Much data on the web is available in hidden databases. Users browse their contents by
sending search queries to form-based interfaces or APIs. Yet, hidden databases just return …
sending search queries to form-based interfaces or APIs. Yet, hidden databases just return …
ENABLING THIRD PARTY SERVICES OVER DEEP WEB DATABASES AND LOCATION BASED SERVICES
Y Durairaj Gunasekaran - 2018 - mavmatrix.uta.edu
Deep web databases are pillars of today's internet services hidden behind HTML forms and
Top-K search interfaces. While Top-K search interfaces provide a good way to retrieve …
Top-K search interfaces. While Top-K search interfaces provide a good way to retrieve …