Show simple item record

dc.contributor.authorAbuzayed, Nourhan
dc.contributor.authorErgenç, Belgin
dc.date.accessioned2017-11-15T07:53:45Z
dc.date.available2017-11-15T07:53:45Z
dc.date.issued2017-07
dc.identifier.citationAbuzayed, N., and Ergenç, B. (2017, July 12-14). Comparison of dynamic itemset mining algorithms for multiple support thresholds. Paper presented at the 21st International Database Engineering and Applications Symposium. doi:10.1145/3105831.3105846en_US
dc.identifier.isbn9781450352208
dc.identifier.urihttp://doi.org/10.1145/3105831.3105846
dc.identifier.urihttp://hdl.handle.net/11147/6460
dc.description21st International Database Engineering and Applications Symposium, IDEAS 2017; Bristol; United Kingdom; 12 July 2017 through 14 July 2017en_US
dc.description.abstractMining1 frequent itemsets is an important part of association rule mining process. Handling dynamic aspect of databases and multiple support threshold requirements of items are two important challenges of frequent itemset mining algorithms. Most of the existing dynamic itemset mining algorithms are devised for single support threshold whereas multiple support threshold algorithms are static. This work focuses on dynamic update problem of frequent itemsets under multiple support thresholds and proposes tree-based Dynamic CFP-Growth++ algorithm. Proposed algorithm is compared to our previous dynamic algorithm Dynamic MIS [50] and a recent static algorithm CFP-Growth++ [2] and, findings are; in dynamic database, 1) both of the dynamic algorithms are better than the static algorithm CFP-Growth++, 2) as memory usage performance; Dynamic CFP-Growth++ performs better than Dynamic MIS, 3) as execution time performance; Dynamic MIS is better than Dynamic CFP-Growth++. In short, Dynamic CFP-Growth++ and Dynamic MIS have a trade-off relationship in terms of memory usage and execution time.en_US
dc.description.sponsorshipThe Scientific and Technological Research Council of Turkey (TUBITAK) under ARDEB 3501 Project No: 114E779.en_US
dc.language.isoengen_US
dc.publisherAssociation for Computing Machineryen_US
dc.relationinfo:eu-repo/grantAgreement/TUBITAK/EEEAG/114E779en_US
dc.relation.isversionof10.1145/3105831.3105846en_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectAssociation rule miningen_US
dc.subjectDynamic itemset miningen_US
dc.subjectItemset miningen_US
dc.subjectMultiple support thresholdsen_US
dc.subjectData miningen_US
dc.titleComparison of dynamic itemset mining algorithms for multiple support thresholdsen_US
dc.typeconferenceObjecten_US
dc.contributor.authorIDTR130596en_US
dc.contributor.institutionauthorAbuzayed, Nourhan
dc.contributor.institutionauthorErgenç, Belgin
dc.relation.journal21st International Database Engineering and Applications Symposiumen_US
dc.contributor.departmentİYTE, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.identifier.volumePart F129476en_US
dc.identifier.startpage309en_US
dc.identifier.endpage316en_US
dc.identifier.scopusSCOPUS:2-s2.0-85028059942
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record