Please use this identifier to cite or link to this item:
Title: Dynamic frequent itemset mining based on Matrix Appriori algorithm
Authors: Ergenç, Belgin
Oğuz, Damla
Issue Date: 2012
Publisher: Izmir Institute of Technology
Abstract: 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.
Description: Thesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 2012
Includes bibliographical references (leaves: 36-38)
Text in English; Abstract: Turkish and English
ix, 41 leaves
Appears in Collections:Master Degree / Yüksek Lisans Tezleri

Files in This Item:
File Description SizeFormat 
T001016.pdfMasterThesis588.25 kBAdobe PDFThumbnail
Show full item record

CORE Recommender

Page view(s)

checked on Dec 4, 2023


checked on Dec 4, 2023

Google ScholarTM


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