CLOLINK: An Adapted Algorithm for Mining Closed Frequent Itemsets
|
| Title | CLOLINK: An Adapted Algorithm for Mining Closed Frequent Itemsets |
| Authors | |
| Abstract | Mining of the complete set of frequent itemsets will lead to a huge number of itemsets. Fortunately, this problem can be reduced to the mining of closed frequent itemsets, which results in a much smaller number of itemsets. Methods for efficient mining of closed frequent itemsets have been studied extensively by many researchers using various strategies to prove their efficiencies such as Apriori-likemethods, FP growth algorithms, Tree projection and so on. However, when mining databases, these methods still encounter some performance bottlenecks like processing time, storage space and so on. This paper integrates the advantages of the strategies of H-Mine, a memory efficient algorithmfor mining frequent itemsets. The study proposes an algorithm named CLOLINK, which makes use of a compact data structure named L struct that links the items in the database dynamically during the mining process. An extensive experimental evaluation of the approach on real databases shows a better performance over the previous methods in mining closed frequent itemsets. |
| Publisher | University of Zagreb, University Computing Centre - SRCE |
| Date | 2013-04-02 |
| Source | Journal of Computing and Information Technology Vol 20, No 4 (2012) |
| Rights | CIT. Journal of Computing and Information Technology is an open access journal. Authors who publish with this journal agree to the following terms:Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the works authorship and initial publication in this journal. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journals published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access). |