Please use this identifier to cite or link to this item:
Title: Comparison of dynamic rule mining algorithms
Authors: Ergenç, Belgin
Shariff, Karunda
Issue Date: 2012
Publisher: Izmir Institute of Technology
Abstract: In real life, new data is constantly added to databases while the existing one is modified or deleted. The new challenge of association rule mining is the need to always maintain meaningful association rules whenever the databases are updated. Many dynamic algorithms that use different techniques have been proposed in the past to deal with this challenge. However less work has been done in comparing their performance. In this study comparison of two dynamic rule mining algorithms; Dynamic Matrix Apriori and Fast Update 2, which have not been compared in the past, is done. The algorithms are tested on three different datasets to determine their execution time with updates of: additions, deletions and different support thresholds. Our findings reveal that DMA performs better with two dataset and so is FUP2 with the other dataset. The difference in performance of the two algorithms is mainly caused by the nature of the datasets.
Description: Thesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 2012
Includes bibliographical references (leaves: 43-46)
Text in English; Abstract: Turkish and English
x, 59 leaves
Appears in Collections:Master Degree / Yüksek Lisans Tezleri

Files in This Item:
File Description SizeFormat 
T001030.pdfMasterThesis1.18 MBAdobe PDFThumbnail
Show full item record

CORE Recommender

Page view(s)

checked on Oct 3, 2022


checked on Oct 3, 2022

Google ScholarTM


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