Downloads: 123
M.Tech M.E PhD Thesis | Computer Science Engineering | Volume 5 Issue 6, June 2016 | Pages: 1600 - 1604 | India
FIM-Anonymizing Using Tree Structured Data
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
How to Cite?: Rabitha T, Farzin Ahammed T, "FIM-Anonymizing Using Tree Structured Data", Volume 5 Issue 6, June 2016, International Journal of Science and Research (IJSR), Pages: 1600-1604, https://www.ijsr.net/getabstract.php?paperid=NOV164590, DOI: https://dx.doi.org/10.21275/NOV164590