Evaluating top-k algorithms with various sources of data and user preferences
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10106669" target="_blank" >RIV/00216208:11320/11:10106669 - isvavai.cz</a>
Result on the web
<a href="http://www.scopus.com" target="_blank" >http://www.scopus.com</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-24764-4_23" target="_blank" >10.1007/978-3-642-24764-4_23</a>
Alternative languages
Result language
angličtina
Original language name
Evaluating top-k algorithms with various sources of data and user preferences
Original language description
Our main motivation is the data access model and aggregation algorithm for middleware by R. Fagin, A. Lotem and M. Naor. They assume data attributes in a variety of repositories ordered by a grade of attribute values of objects. Moreover they assume theuser has an aggregation function, which eventually qualifies an object to top-k answers. In this paper we adopt a model of various users (there is no single ordering of objects in repositories and no single aggregation) with user preference learning algorithm on the middleware side. We present a new model of repository for simultaneous access by many users. The model is an extension of original model of Fagin, Lotem, Naor. Our solution is based on a model of fast learning of user preferences from his/her reactions. Experiments are focused on the performance of top-k algorithms (both TA and NRA) using data integration on an experimental prototype of our solution. Cache size, network latency and batch size were the features studied in exp
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
2011
Issue of the periodical within the volume
7022
Country of publishing house
DE - GERMANY
Number of pages
12
Pages from-to
258-269
UT code for WoS article
—
EID of the result in the Scopus database
—