Closed frequent itemsets mining based on It-Tree
Article Sidebar
Main Article Content
Abstract
In the last decade, the amount of collected data, in various computer science applications, has grown considerably. These large volumes of data need to be analysed in order to extract useful hidden knowledge. This work focuses on association rule extraction. This technique is one of the most popular in data mining. Nevertheless, the number of extracted association rules is often very high, and many of them are redundant. In this paper, we propose an algorithm, for mining closed itemsets, with the construction of an it-tree. This algorithm is compared with the DCI (direct counting & intersect) algorithm based on min support and computing time. CHARM is not memery-efficient. It needs to store all closed itemsets in the memory. The lower min-sup is, the more frequent closed itemsets there are so that the amounts of memory used by CHARM are increasing.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Global Journal of Computer Sciences: Theory and Research is an Open Access Journal. All articles can be downloaded free of charge. Articles published in the Journal are Open-Access articles distributed under CC-BY license [Attribution 4.0 International (CC BY 4.0)]
Birlesik Dunya Yenilik Arastirma ve Yayincilik Merkezi (BD-Center) is a gold open access publisher. At the point of publication, all articles from our portfolio of journals are immediately and permanently accessible online free of charge. BD-Center articles are published under the CC-BY license [Attribution 4.0 International (CC BY 4.0)], which permits unrestricted use, distribution, and reproduction in any medium, provided the original authors and the source are credited.