Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/2528
Title: Full-Exact Approach for Frequent Itemset Hiding
Authors: Ayav, Tolga
Ergenç, Belgin
Keywords: Association rule hiding
Itemset hiding
Cost model
Side effect
Exact approach
Problem solving
Publisher: IGI Global Publishing
Source: Ayav, T., and Ergenç, B. (2015). Full-exact approach for frequent itemset hiding. International Journal of Data Warehouse and Mining, 11(4), 49-63. doi:10.4018/ijdwm.2015100103
Abstract: This paper proposes a novel, exact approach that relies on integer programming for association rule hiding. A large panorama of solutions exists for the complex problem of itemset hiding: from practical heuristic approaches to more accurate exact approaches. Exact approaches provide better solutions while suffering from the lack of performance and existing exact approaches still augment their methods with heuristics to make the problem solvable. In this case, the solution may not be optimum. This work present a full-exact method, without any need for heuristics. Extensive tests are conducted on 10 real datasets to analyze distance and information loss performances of the algorithm in comparison to a former similar algorithm. Since the approach provides the optimum solution to the problem, it should be considered as a reference method.
URI: http://doi.org/10.4018/ijdwm.2015100103
http://hdl.handle.net/11147/2528
ISSN: 1548-3924
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File Description SizeFormat 
2528.pdfMakale277.56 kBAdobe PDFThumbnail
View/Open
Show full item record



CORE Recommender

SCOPUSTM   
Citations

4
checked on Dec 13, 2024

WEB OF SCIENCETM
Citations

3
checked on Nov 9, 2024

Page view(s)

65,000
checked on Dec 16, 2024

Download(s)

830
checked on Dec 16, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.