Results 11 - 20
of
39
Supporting Privacy Protection in Personalized Web Search,’
- IEEE Transactions on Knowledge and Data Engineering,
, 2014
"... Abstract-Personalized web search (PWS) has demonstrated its effectiveness in improving the quality of various search services on the Internet. However, evidences show that users' reluctance to disclose their private information during search has become a major barrier for the wide proliferatio ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
(Show Context)
Abstract-Personalized web search (PWS) has demonstrated its effectiveness in improving the quality of various search services on the Internet. However, evidences show that users' reluctance to disclose their private information during search has become a major barrier for the wide proliferation of PWS. We study privacy protection in PWS applications that model user preferences as hierarchical user profiles. We propose a PWS framework called UPS that can adaptively generalize profiles by queries while respecting userspecified privacy requirements. Our runtime generalization aims at striking a balance between two predictive metrics that evaluate the utility of personalization and the privacy risk of exposing the generalized profile. We present two greedy algorithms, namely GreedyDP and GreedyIL, for runtime generalization. We also provide an online prediction mechanism for deciding whether personalizing a query is beneficial. Extensive experiments demonstrate the effectiveness of our framework. The experimental results also reveal that GreedyIL significantly outperforms GreedyDP in terms of efficiency.
PiCoDa: Privacy-preserving Smart Coupon Delivery Architecture
"... In this paper, we propose a new privacy-preserving smart coupon delivery system called PiCoDa. Like prior work on private behavioral targeted advertising, PiCoDa protects user data by performing targeting on the end-user’s device. However, PiCoDa makes two more guarantees: it verifies a user’s eligi ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
In this paper, we propose a new privacy-preserving smart coupon delivery system called PiCoDa. Like prior work on private behavioral targeted advertising, PiCoDa protects user data by performing targeting on the end-user’s device. However, PiCoDa makes two more guarantees: it verifies a user’s eligibility for a coupon, and it protects the vendor’s privacy by not revealing the targeting strategy. To accommodate the constraints of different targeting strategies, PiCoDa provides two targeting protocols that tradeoff user privacy and vendor privacy in different ways. We show how both designs meet requirements for user privacy, vendor protection, and robustness. In addition, we present simulation results of the protocols using realistic parameters to further validate the efficiency and effectiveness of PiCoDa. 1
Privacy-aware daas services composition
- in Database and Expert Systems Applications
"... ..."
(Show Context)
Privacy, Personalization, and the Web: A Utility-theoretic Approach
"... Online offerings such as web search face the challenge of providing high-quality service to a large, heterogeneous user base. Recent efforts have highighted the potential to improve performance by introducing methods to personalize services based on special knowledge about users. For example, a user ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Online offerings such as web search face the challenge of providing high-quality service to a large, heterogeneous user base. Recent efforts have highighted the potential to improve performance by introducing methods to personalize services based on special knowledge about users. For example, a user’s location, demographics, and past search and browsing may be useful in enhancing the efficiency and accuracy of web search. However, reasonable concerns about privacy by both users and providers limit access by services to such information. We explore the rich space of possibility where people can opt to share, in a standing or a real-time manner, personal information in return for expected enhancements in the quality of an online service. We present methods and studies on addressing such tradeoffs between privacy and utility in online services. We introduce concrete and realistic objective functions for efficacy and privacy and demonstrate how we can efficiently find a provably near-optimal optimization of the utility-privacy tradeoff. We evaluate our methodology on data drawn from a large-scale web search log of people who volunteered to have their logs explored so as to contribute to enhancing search performance. In order to incorporate personal preferences about privacy and utility, and the willingness to trade off revealing some quantity of personal data to a search system in returns for gains in efficiency, we performed a user study with 1400 participants. Employing utility and preferences estimated from the real-world data, we show that a significant level of personalization can be achieved using only a small amount of information about users. 1
Article: Refinement in personalize web search system with privacy protection
- International Journal of Computer Applications
, 2015
"... There are number of users searching for particular information with same topic. Personalized web search helps to improve the excellence of various searches on the Internet. But during searching the search engine may disclose or use user’s personal information to improve search performance. We propos ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
There are number of users searching for particular information with same topic. Personalized web search helps to improve the excellence of various searches on the Internet. But during searching the search engine may disclose or use user’s personal information to improve search performance. We propose a fine tuning in Personalize Web Search system by generalizing user profiles. We suggest a technique to generate online profile with user’s permission for query. Every time when user requests for certain information,our system allows user to select profile information as per his or her requirement and risk of exposition of sensitive attributes such as name,gender, contact number and many other different attributes. In addition our systems will also help to search accurate information based on user interests. Thus this system maintains stability between use of personalize information and the risk of exposing of personal profile by refining profile. This system is developed by GreedyIL algorithm which improves search quality and makes search computation fast
Anatomy of a Collaborative Search Engine
"... ABSTRACT We present ExpertRec, a collaborative/social Web search engine. With ExpertRec, users share experts' search histories (search expertise) through a Web browser toolbar or a proxy browser. As compared to a current web search engine, there are two challenges in ExpertRec: one is to suppl ..."
Abstract
- Add to MetaCart
(Show Context)
ABSTRACT We present ExpertRec, a collaborative/social Web search engine. With ExpertRec, users share experts' search histories (search expertise) through a Web browser toolbar or a proxy browser. As compared to a current web search engine, there are two challenges in ExpertRec: one is to supply a right teamwork environment to satisfy users' collaborative search; other is to identify search expertise through utilizing users' search histories and so on. Firstly, we implement a Mozilla Firefox toolbar (a Firefox extension), which can integrate with mainstream search engines like Google, Yahoo!, et al., to meet users' teamwork needs. And it allows users to generate high-quality tags, votes, comments over current Web including search histories, personal archival content in local host typically beyond the reach of existing Web 2.0 social tagging system. Then, a CBR (case-based reasoning)-based recommendation engine is designed to build recommendations and its core is a scalable method to identify search expertise based on a hierarchical user profile in order to improve users' search quality. In addition, a novel recommendation form is adopted through merging recommendations into return-list by a search engine with the help of ExpertRec toolbar. We describe the architecture, user interface, main techniques and algorithms of ExpertRec, and our primary evaluation is introduced.
Preserving User's Profile Protection for Personalized Web Search
"... ABSTRACT: Internet of things is in its peak in today's world. The web search is the widely performing task in the internet world. When the query is searched over web should provide the relevant information to the users. The irrelevant results may annoy the users and hence the efficiency of the ..."
Abstract
- Add to MetaCart
(Show Context)
ABSTRACT: Internet of things is in its peak in today's world. The web search is the widely performing task in the internet world. When the query is searched over web should provide the relevant information to the users. The irrelevant results may annoy the users and hence the efficiency of the query search should be improved. To improve the search, personalized web search framework is proposed to retrieve the data based on user's interest. When the information is retrieved based on user's interest, user's profile will be publicly available. In this paper, the User's profile is also protected to handle privacy threats using generalization technique with Greedy Discriminating Power and Greedy Info Loss algorithm. The efficiency of search is improved by transferring the query with user's profile to the web server to retrieve the results. If the results are not satisfied to the user then the re-ranking technique is proposed to retrieve the most relevant search results.
Privacy Preserving Web Search by Client Side Generalization of User Profile
, 2015
"... Abstract -Personalized online search (PWS) has incontestible its effectiveness in up the standard of assorted search services on the web. However, evidences show that users reluctance to disclose their personal data throughout search has become a serious barrier for the wide proliferation of PWS. w ..."
Abstract
- Add to MetaCart
Abstract -Personalized online search (PWS) has incontestible its effectiveness in up the standard of assorted search services on the web. However, evidences show that users reluctance to disclose their personal data throughout search has become a serious barrier for the wide proliferation of PWS. we have a tendency to study privacy protection in PWS applications that model user preferences as ranked user profiles. we have a tendency to propose a PWS framework referred to as UPS which will adaptively generalize profiles by queries whereas respecting user such privacy necessities. Our runtime generalization aims at placing a balance between 2 prognostic metrics that valuate the utility of personalization and also the privacy risk of exposing the generalized profile. We are going to use Resource Description Frame Work, for runtime generalization. Where privacy requirements represented as a set of sensitive-nodes. we use to conjointly offer an internet prediction mechanism for deciding whether personalization is required or not. The decision depends on users wish. When decision is made by the user that particular nodes along with all sub nodes will be removed in that hierarchical tree, in depth experiments demonstrate the effectiveness of our framework.
Personalized Web Search
"... We study the problem of anonymizing user profiles so that user privacy is sufficiently protected while the anonymized profiles are still effective in enabling personalized web search. We propose a Bayes-optimal privacy based principle to bound the prior and posterior probability of associating a use ..."
Abstract
- Add to MetaCart
(Show Context)
We study the problem of anonymizing user profiles so that user privacy is sufficiently protected while the anonymized profiles are still effective in enabling personalized web search. We propose a Bayes-optimal privacy based principle to bound the prior and posterior probability of associating a user with an individual term in the anonymized user profile set. We also propose a novel bundling technique that clusters user profiles into groups by taking into account the semantic relationships between the terms while satisfying the privacy constraint. We evaluate our approach through a set of preliminary experiments using real data demonstrating its feasibility and effectiveness.