ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

FIM-Anonymizing Using Tree Structured Data

Journal: International Journal of Science and Research (IJSR) (Vol.5, No. 6)

Publication Date:

Authors : ; ;

Page : 1600-1604

Keywords : Anonymity; generalization; information loss; synopsis tree; frequent item set mining;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

FIM-anonymizing using tree structured data study about the problem of protecting privacy in the publication of set-valued data. Considering a collection of supermarket transactional data that contains detailed information about items bought together by individuals. Even after removing all personal characteristics of the buyer, which can serve as a link to his identity, thus resulting to privacy attacks from adversaries who have partial knowledge about the set. Depending upon the point of view of the adversaries. We define a new version of the k-anonymity guarantee. Our anonymization model relies on generalization instead of suppression. We develop an algorithm which find the frequent item set. The frequent-itemsets problem is that of nding sets of items that appear in (are related to) many of the same dataset. .

Last modified: 2021-07-01 14:39:08