Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/2528
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAyav, Tolga-
dc.contributor.authorErgenç, Belgin-
dc.date.accessioned2016-11-25T14:39:55Z-
dc.date.available2016-11-25T14:39:55Z-
dc.date.issued2015-11-
dc.identifier.citationAyav, 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.2015100103en_US
dc.identifier.issn1548-3924-
dc.identifier.urihttp://doi.org/10.4018/ijdwm.2015100103-
dc.identifier.urihttp://hdl.handle.net/11147/2528-
dc.description.abstractThis 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.en_US
dc.language.isoenen_US
dc.publisherIGI Global Publishingen_US
dc.relation.ispartofInternational Journal of Data Warehouse and Miningen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectAssociation rule hidingen_US
dc.subjectItemset hidingen_US
dc.subjectCost modelen_US
dc.subjectSide effecten_US
dc.subjectExact approachen_US
dc.subjectProblem solvingen_US
dc.titleFull-exact approach for frequent itemset hidingen_US
dc.typeArticleen_US
dc.authoridTR114453en_US
dc.authoridTR130596en_US
dc.institutionauthorAyav, Tolga-
dc.institutionauthorErgenç, Belgin-
dc.departmentİzmir Institute of Technology. Computer Engineeringen_US
dc.identifier.volume11en_US
dc.identifier.issue4en_US
dc.identifier.startpage49en_US
dc.identifier.endpage63en_US
dc.identifier.wosWOS:000358073200003en_US
dc.identifier.scopus2-s2.0-84931832720en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.doi10.4018/ijdwm.2015100103-
dc.relation.doi10.4018/ijdwm.2015100103en_US
dc.coverage.doi10.4018/ijdwm.2015100103en_US
dc.identifier.wosqualityQ4-
dc.identifier.scopusqualityQ2-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.grantfulltextopen-
crisitem.author.dept03.04. Department of Computer Engineering-
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 Description SizeFormat 
2528.pdfMakale277.56 kBAdobe PDFThumbnail
View/Open
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

4
checked on Mar 22, 2024

WEB OF SCIENCETM
Citations

3
checked on Mar 27, 2024

Page view(s)

64,816
checked on Mar 25, 2024

Download(s)

482
checked on Mar 25, 2024

Google ScholarTM

Check




Altmetric


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