Dynamic frequent itemset mining based on matrix appriori algorithm
tarafından
Oğuz, Damla.
Başlık
:
Dynamic frequent itemset mining based on matrix appriori algorithm
Yazar
:
Oğuz, Damla.
Yazar Ek Girişi
:
Oğuz, Damla.
Yayın Bilgileri
:
[s.l.]: [s.n.], 2012.
Fiziksel Tanımlama
:
ix, 41 leaves.: ill. + 1 computer laser optical disc.
Özet
:
The frequent itemset mining algorithms discover the frequent itemsets from a database. When the database is updated, the frequent itemsets should be updated as well. However, running the frequent itemset mining algorithms with every update is inefficent. This is called the dynamic update problem of frequent itemsets and the solution is to devise an algorithm that can dynamically mine the frequent itemsets. In this study, a dynamic frequent itemset mining algorithm, which is called Dynamic Matrix Apriori, is proposed and explained. In addition, the proposed algorithm is compared using two datasets with the base algorithm Matrix Apriori which should be re-run when the database is updated.
Konu Başlığı
:
Data mining.
Association rule mining.
Yazar Ek Girişi
:
Ergenç, Belgin.
Tüzel Kişi Ek Girişi
:
İzmir Institute of Technology. Computer Engineering.
Tek Biçim Eser Adı
:
Thesis (Master)--İzmir Institute of Technology: Computer Engineering.
İzmir Institute of Technology: Computer Engineering--Thesis (Master).
Elektronik Erişim
:
Library | Materyal Türü | Demirbaş Numarası | Yer Numarası | Durumu/İade Tarihi |
---|
IYTE Library | Tez | T001016 | QA76.9.D343 O359 2012 | Tez Koleksiyonu |