Please use this identifier to cite or link to this item:
|Title:||Mining of frequent itemsets with JoinFI-mine algorithm|
|Keywords:||Algorithm;Association rule mining;Data mining;Database;Frequent itemsets mining;Frequent pattern mining;Knowledge discovery|
|Publisher:||10th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases, AIKED'11|
|Citation:||Recent Researches in Artificial Intelligence, Knowledge Engineering and Data Bases - 10th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases, AIKED'11 2011;73-78|
|Abstract:||Association rule mining among frequent items has been widely studied in data mining field. Many researches have improved the algorithm for generation of all the frequent itemsets. In this paper, we proposed a new algorithm to mine all frequents itemsets from a transaction database. The main features of this paper are: (1) the database is scanned only one time to mine frequent itemsets; (2) the new algorithm called the JoinFI-Mine algorithm which use mathematics properties to reduces huge of subsequence mining; (3) the proposed algorithm mines frequent itemsets without generation of candidate sets; and (4) when the minimum support threshold is changed, the database is not require to scan. We have provided definitions, algorithms, examples, theorem, and correctness proving of the algorithm.|
|Appears in Collections:||Mathematics: International Proceedings|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.