This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Diverse Set Selection Over Dynamic Data
May 2014 (vol. 26 no. 5)
pp. 1-1
Evaggelia Pitoura, Computer Science Department, University of Ioannina, Ioannina, Greece
Marina Drosou, Computer Science Department, University of Ioannina, Ioannina, Greece
Result 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, we focus 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, we exploit the dynamic case in which the result set changes over time, as for example, in the case of notification services. We define the CONTINUOUS $k$ -DIVERSITY PROBLEM along with appropriate constraints that enforce continuity requirements on the diversified results. Our proposed approach is based on cover trees and supports dynamic item insertion and deletion. The diversification problem is in general NP-hard; we provide theoretical bounds that characterize the quality of our cover tree solution with respect to the optimal one. Since results are often associated with a relevance score, we extend our approach to account for relevance. Finally, we report experimental results concerning the efficiency and effectiveness of our approach on a variety of real and synthetic datasets.
Index Terms:
Heuristic algorithms,Diversity reception,Approximation algorithms,Silicon,Complexity theory,Indexes,Computational modeling,Selection process,Information Technology and Systems,Database Management,Physical Design,Database Applications,Information Storage and Retrieval,Information Search and Retrieval,Information filtering
Citation:
Evaggelia Pitoura, Marina Drosou, "Diverse Set Selection Over Dynamic Data," IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 5, pp. 1-1, May 2014, doi:10.1109/TKDE.2013.44
Usage of this product signifies your acceptance of the Terms of Use.