Search In this Thesis
   Search In this Thesis  
العنوان
Enhancing privacy approach of recommender systems/
المؤلف
Kamal, Reham Mohamed.
هيئة الاعداد
باحث / Reham Mohamed Kamal
مشرف / Rasha Ismail
مشرف / Wedad Hussein
تاريخ النشر
2019.
عدد الصفحات
103 p. :
اللغة
الإنجليزية
الدرجة
ماجستير
التخصص
Information Systems
تاريخ الإجازة
1/1/2019
مكان الإجازة
جامعة عين شمس - كلية الحاسبات والمعلومات - نظم المعلومات
الفهرس
Only 14 pages are availabe for public view

from 103

from 103

Abstract

In the last few decades, recommendation systems has received an iconic representation in the field of information technology. With the noticed rapid advancement of data mining, the issue of privacy has become an inevitable necessity. Hence, the mainstream challenge that accompanies data mining is developing a cutting-edge strategy to protect private information. In this work, we present two frameworks for enhancing and preserving the privacy of data in recommendation systems along with their experimental results and discussions.
In the first framework, we proposed a hybrid strategy data perturbation and query restriction (DPQR) with an improved version of MASK (Mining association rules with secrecy Konstraints) scheme to decrease the complexity of traditional MASK scheme. This hybridization resulted in 49.7% as recommendation precision and privacy degree of 97.4% while the traditional MASK scheme gives only 80% privacy degree. We enhanced our results by adopting non-linear programing and solved the privacy problem as a system of equations by setting the privacy equation to be our objective function, the privacy degree was raised to 99.6% and the recommendation precision reached 59%.
In the second framework, we implemented the DPQR strategy to hide sensitive association rules to overcome the limitation of (Modified Decrease Support of Right Hand Side item of Rule Clusters) MDSRRC algorithm that can hide multiple sensitive items in the right hand side by calculating the sensitivity of each item in the sensitive rule and delete the one with maximum sensitivity value then it repeats the calculations again till no sensitive items exist. The MDSRRC suffers long runtime as it requires multiple database scans, while DPQR can hide sensitive association rules in one database scan. We tested the performance of our framework by measuring hiding failure (HF), artificial rules (AR) and lost rules (LR). As for the HF it was 0% while AF and LR was 0.29% and 42% respectively. Also the runtime improvement is 96.22% compared with MDSRRC algorithm.