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
Related Articles
- EP ID EP28233
- DOI -
- Views 275
- Downloads 2
MINIMIZING END – TO – END DELAY IN MULTIPARTY NETWORK APPLICATIONS
In these days interaction between different network applications are becoming more popular and to improve the speed and datatransfer rate delay difference between the multynetworks should minimize. In this paper we p...
UM: A Novel Seclusion Model for Defending Structural Information of Social Network Data
Publishing or sharing the social network data for social science research and business analysis lack of privacy. Existing technique k-anonymity is used to prevent identification of micro data. Even though an attacke...
Image Encryption Using Modified Particle Swarm Optimization
In this age of universal electronic connectivity, there is indeed no time at which security does not matter. Two trends have enough to make this work as vital need. First, the explosive growth in computer systems and...
Improving Performance Among Client-Server For Continuous Distributed Interactive Applications
In today’s situation consumers mainly use the network as an interactive medium for multimedia entertainment and communication purpose. In the entertainment arena, new applications involve multiple users participating...
Performance Issues of WMNs by implementing Coordinator in IEEE 802.11 Networks
The wireless networking is the current trend that most of the peoples that used and fastly grow in the world. The number of topologies has been used in this network and few are Star, Bus , Mesh etc. but the Mesh Topol...