Downloads: 116 | Views: 258

M.Tech / M.E / PhD Thesis | Computer Science & Engineering | India | Volume 5 Issue 6, June 2016 | Popularity: 6.8 / 10

Rate This Article!      

FIM-Anonymizing Using Tree Structured Data

Rabitha T, Farzin Ahammed T

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. .

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

Edition: Volume 5 Issue 6, June 2016

Pages: 1600 - 1604

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article

Similar Articles