Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/10654
Title: DMA: Matrix based dynamic itemset mining algorithm
Authors: Oğuz, Damla
Yıldız, Baroş
Ergenç, Belgin
Keywords: Algorithms
Dynamic Itemset Mining
Itemset Mining
Matrix Apriori
Operational Database
Issue Date: 2013
Publisher: IGI Global Publishing
Abstract: Updates on an operational database bring forth the challenge of keeping the frequent itemsets up-to-date without re-running the itemset mining algorithms. Studies on dynamic itemset mining, which is the solution to such an update problem, have to address some challenges as handling i) updates without re-running the base algorithm, ii) changes in the support threshold, iii) new items and iv) additions/deletions in updates. The study in this paper is the extension of the Incremental Matrix Apriori Algorithm which proposes solutions to the first three challenges besides inheriting the advantages of the base algorithm which works without candidate generation. In the authors' current work, the authors have improved a former algorithm as to handle updates that are composed of additions and deletions. The authors have also carried out a detailed performance evaluation study on a real and two benchmark datasets.
URI: https://doi.org/10.4018/ijdwm.2013100104
https://hdl.handle.net/11147/10654
ISSN: 1548-3924
1548-3932
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record



CORE Recommender

SCOPUSTM   
Citations

5
checked on Dec 2, 2023

WEB OF SCIENCETM
Citations

4
checked on Jun 17, 2023

Page view(s)

12
checked on Dec 4, 2023

Google ScholarTM

Check




Altmetric


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