Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/9254
Full metadata record
DC FieldValueLanguage
dc.contributor.authorÖztürk, Ahmet Cumhur-
dc.contributor.authorErgenç, Belgin-
dc.date.accessioned2020-07-25T22:09:16Z-
dc.date.available2020-07-25T22:09:16Z-
dc.date.issued2018-
dc.identifier.issn1548-3924-
dc.identifier.issn1548-3932-
dc.identifier.urihttps://doi.org/10.4018/IJDWM.2018040103-
dc.identifier.urihttps://hdl.handle.net/11147/9254-
dc.description.abstractThis article describes how association rule mining is used for extracting relations between items in transactional databases and is beneficial for decision-making. However, association rule mining can pose a threat to the privacy of the knowledge when the data is shared without hiding the confidential association rules of the data owner. One of the ways hiding an association rule from the database is to conceal the itemsets (co-occurring items) from which the sensitive association rules are generated. These sensitive itemsets are sanitized by the itemset hiding processes. Most of the existing solutions consider single support thresholds and assume that the databases are static, which is not true in real life. In this article, the authors propose a novel itemset hiding algorithm designed for the dynamic database environment and consider multiple itemset support thresholds. Performance comparisons of the algorithm is done with two dynamic algorithms on six different databases. Findings show that their dynamic algorithm is more efficient in terms of execution time and information loss and guarantees to hide all sensitive itemsets.en_US
dc.language.isoenen_US
dc.publisherIGI Globalen_US
dc.relation.ispartofInternational Journal of Data Warehousing and Miningen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectDynamic Itemset Hidingen_US
dc.subjectItemset hidingen_US
dc.subjectMultiple Sensitive Support Thresholdsen_US
dc.titleDynamic itemset hiding algorithm for multiple sensitive support thresholdsen_US
dc.typeArticleen_US
dc.institutionauthorÖztürk, Ahmet Cumhur-
dc.institutionauthorErgenç, Belgin-
dc.departmentİzmir Institute of Technology. Computer Engineeringen_US
dc.identifier.volume14en_US
dc.identifier.issue2en_US
dc.identifier.startpage37en_US
dc.identifier.endpage59en_US
dc.identifier.wosWOS:000441223600003en_US
dc.identifier.scopus2-s2.0-85063916619en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.doi10.4018/IJDWM.2018040103-
dc.relation.doi10.4018/IJDWM.2018040103en_US
dc.coverage.doi10.4018/IJDWM.2018040103en_US
dc.identifier.wosqualityQ4-
dc.identifier.scopusqualityQ3-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextopen-
item.cerifentitytypePublications-
item.fulltextWith Fulltext-
item.openairetypeArticle-
crisitem.author.dept03.04. Department of Computer Engineering-
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 SizeFormat 
10.4018@IJDWM.2018040103.pdf6.3 MBAdobe PDFView/Open
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

2
checked on Feb 16, 2024

WEB OF SCIENCETM
Citations

1
checked on Feb 10, 2024

Page view(s)

114
checked on Feb 19, 2024

Download(s)

48
checked on Feb 19, 2024

Google ScholarTM

Check




Altmetric


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