Comparison of dynamic rule mining algorithms için kapak resmi
Comparison of dynamic rule mining algorithms
Shariff, Karunda.
Yazar Ek Girişi:
Yayın Bilgileri:
[s.l.]: [s.n.], 2012.
Fiziksel Tanımlama:
x, 59 leaves.: ill. + 1 computer laser optical disc.
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.
Yazar Ek Girişi:
Tek Biçim Eser Adı:
Thesis (Master)--İzmir Institute of Technology: Computer Engineering.

İzmir Institute of Technology: Computer Engineering--Thesis (Master).
Elektronik Erişim:
Access to Electronic Versiyon.


Materyal Türü
Demirbaş Numarası
Yer Numarası
Durumu/İade Tarihi
Tez T001030 QA76.9.D343 S531 2012

On Order