Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/6174
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGökçe, Harun-
dc.contributor.authorAbul, Osman-
dc.date.accessioned2021-09-11T15:35:10Z-
dc.date.available2021-09-11T15:35:10Z-
dc.date.issued2010en_US
dc.identifier.citationInternational Conference on Knowledge Discovery and Information Retrieval (KDIR 2010) -- OCT 25-28, 2010 -- Valencia, SPAINen_US
dc.identifier.isbn978-989-8425-28-7-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/6174-
dc.description.abstractSensitive frequent itemset hiding problem is typically solved by applying a sanitization process which transforms the source database into a release version. The main challenge in the process is to preserve the database utility while ensuring no sensitive knowledge is disclosed, directly or indirectly. Several algorithmic solutions based on different approaches are proposed to solve the problem. We observe that the available algorithms are like seesaws as far as both effectiveness and efficiency performances are considered. However, most practical domains demand for solutions with satisfactory effectiveness/efficiency performances, i.e., solutions balancing the tradeoff between the two. Motivated from this observation, in this paper, we present yet a simple and practical frequent itemset hiding algorithm targeting the balanced solutions. Experimental evaluation, on two datasets, shows that the algorithm indeed achieves a good balance between the two performance criteria.en_US
dc.description.sponsorshipInst Syst & Technol Informat Control & Communen_US
dc.description.sponsorshipTUBITAKTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [108E016]en_US
dc.description.sponsorshipThe work is supported by TUBITAK under the grant number 108E016.en_US
dc.language.isoenen_US
dc.publisherScitepressen_US
dc.relation.ispartofKdir 2010: Proceedings of The International Conference On Knowledge Discovery And Information Retrievalen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectData miningen_US
dc.subjectFrequent itemset miningen_US
dc.subjectPrivacyen_US
dc.subjectSensitive knowledge hidingen_US
dc.titleA Tradeoff Balancing Algorithm For Hiding Sensitive Frequent Itemsetsen_US
dc.typeConference Objecten_US
dc.departmentFaculties, Faculty of Engineering, Department of Computer Engineeringen_US
dc.departmentFakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümütr_TR
dc.identifier.startpage200en_US
dc.identifier.endpage205en_US
dc.identifier.wosWOS:000391896900024en_US
dc.identifier.scopus2-s2.0-78651457192en_US
dc.institutionauthorAbul, Osman-
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.relation.conferenceInternational Conference on Knowledge Discovery and Information Retrieval (KDIR 2010)en_US
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairetypeConference Object-
item.cerifentitytypePublications-
item.languageiso639-1en-
crisitem.author.dept02.3. Department of Computer Engineering-
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show simple item record



CORE Recommender

Page view(s)

32
checked on Mar 25, 2024

Google ScholarTM

Check




Altmetric


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