Show simple item record

dc.creatorGkoulalas-Divanis, A.en
dc.creatorVerykios, V. S.en
dc.description.abstractIn this paper, we propose a novel, exact border-based approach that provides an optimal solution for the hiding of sensitive frequent item sets by 1) minimally extending the original database by a synthetically generated database part-the database extension, 2) formulating the creation of the database extension as a constraint satisfaction problem, 3) mapping the constraint satisfaction problem to an equivalent binary integer programming problem, 4) exploiting underutilized synthetic transactions to proportionally increase the support of nonsensitive item sets, 5) minimally relaxing the constraint satisfaction problem to provide an approximate solution close to the optimal one when an ideal solution does not exist, and 6) using a partitioning in the universe of the items to increase the efficiency of the proposed hiding algorithm. Extending the original database for sensitive item set hiding is proved to provide optimal solutions to an extended set of hiding problems compared to previous approaches and to provide solutions of higher quality. Moreover, the application of binary integer programming enables the simultaneous hiding of the sensitive item sets and thus allows for the identification of globally optimal solutions.en
dc.sourceIeee Transactions on Knowledge and Data Engineeringen
dc.source.uri<Go to ISI>://WOS:000264300600007
dc.subjectPrivacy preserving data miningen
dc.subjectknowledge hidingen
dc.subjectassociation ruleen
dc.subjectbinary integer programmingen
dc.subjectComputer Science, Artificial Intelligenceen
dc.subjectComputer Science, Informationen
dc.subjectEngineering, Electrical & Electronicen
dc.titleExact Knowledge Hiding through Database Extensionen

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record