Secured Diversified Data set Selection From Dynamic Data

Apply

Secured Diversified Data set Selection From Dynamic Data

Journal Title: International Journal of Research in Computer and Communication Technology - Year 2015, Vol 4, Issue 8

Abstract

Once the data is created, the data that it contains doesn’t change is known as static data (ex: newspaper).Where as the data can be change and update in the dynamic data (ex: website). A lot of information available online creates the need for developing methods towards selecting and presenting to users representative result sets. Diversification has recently attracted considerable attention as a means of increasing user satisfaction in recommender systems, as well as in web and database search. In this paper on the problem of selecting the k-most diverse items from a result set. Whereas previous research has mainly considered the static version of the problem, in this paper, exploit the dynamic case in which the result set changes over time, as for example, in the case of notification services. The proposed approach is based on cover trees and supports dynamic item insertion and deletion and provides theoretical bounds that characterize the quality of cover tree solution with respect to the optimal one. Since results are often associated with a relevance score, to extend the proposed approach to account for relevance.

Authors and Affiliations

K. Suresh, Ch. Nanda Krishna

Keywords

EP ID EP28233
DOI -
Views 271
Downloads 2