Comparison of different algorithms for exploting the hidden trends in data sources için kapak resmi
Comparison of different algorithms for exploting the hidden trends in data sources
Özsevim, Emrah.
Yazar Ek Girişi:
Yayın Bilgileri:
[s.l.]: [s.n.], 2003
Fiziksel Tanımlama:
97 leaves.: ill.+ 1 computer laser optical disc.
The growth of large-scale transactional databases, time-series databases and other kinds of databases has been giving rise to the development of several efficient algorithms that cope with the computationally expensive task of association rule mining.In this study, different algorithms, Apriori, FP-tree and CHARM, for exploiting the hidden trends such as frequent itemsets, frequent patterns, closed frequent itemsets respectively, were discussed and their performances were evaluated. The perfomances of the algorithms were measured at different support levels, and the algorithms were tested on different data sets (on both synthetic and real data sets). The algorihms were compared according to their, data preparation performances, mining performance, run time performances and knowledge extraction capabilities.The Apriori algorithm is the most prevalent algorithm of association rule mining which makes multiple passes over the database aiming at finding the set of frequent itemsets for each level. The FP-Tree algorithm is a scalable algorithm which finds the crucial information as regards the complete set of prefix paths, conditional pattern bases and frequent patterns by using a compact FP-Tree based mining method. The CHARM is a novel algorithm which brings remarkable improvements over existing association rule mining algorithms by proving the fact that mining the set of closed frequent itemsets is adequate instead of mining the set of all frequent itemsets.Related to our experimental results, we conclude that the Apriori algorithm demonstrates a good performance on sparse data sets. The Fp-tree algorithm extracts less association in comparison to Apriori, however it is completelty a feasable solution that facilitates mining dense data sets at low support levels. On the other hand, the CHARM algorithm is an appropriate algorithm for mining closed frequent itemsets (a substantial portion of frequent itemsets) on both sparse and dense data sets even at low levels of support.
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 Version.


Materyal Türü
Demirbaş Numarası
Yer Numarası
Durumu/İade Tarihi
Tez T000258 QA76.9.D343 O97 2003

On Order