Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/2550
Title: | Coefficient-based exact approach for frequent itemset hiding | Authors: | Leloğlu, Engin Ayav, Tolga Ergenç, Belgin |
Keywords: | Information loss Frequent itemset hiding Exact approach |
Publisher: | IARIA | Source: | Leloğlu, E., Ayav, T., and Ergenç, B. (2014). Coefficient-based exact approach for frequent itemset hiding. Paper presented at the eKNOW2014 The Sixth International Conference on Information, Process, and Knowledge Management, Barcelona, Spain, 23-27 March (pp. 124-130). Wilmington, DE: IARIA. | Abstract: | Concealing sensitive relationships before sharing a database is of utmost importance in many circumstances. This implies to hide the frequent itemsets corresponding to sensitive association rules by removing some items of the database. Research efforts generally aim at finding out more effectivemethods in terms of convenience, execution time and side-effect. This paper presents a practical approach for hiding sensitive patterns while allowing as much nonsensitive patterns as possible in the sanitized database. We model the itemset hiding problem as integer programming whereas the objective coefficients allow finding out a solution with minimum loss of nonsensitive itemsets. We evaluate our method using three real datasets and compared the results with a previous work. The results show that information loss is dramatically minimized without sacrificing the accuracy. | URI: | http://hdl.handle.net/11147/2550 | ISBN: | 9781612083292 |
Appears in Collections: | Computer Engineering / Bilgisayar Mühendisliği |
Show full item record
CORE Recommender
Page view(s)
304
checked on Dec 9, 2024
Download(s)
92
checked on Dec 9, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.