Main Article Content
Association Rule Mining (ARM) plays a fundamental role in many data mining tasks that attempt to find interesting patterns from databases, such as correlations, sequences, episodes, classifiers, clusters, etc. Frequent Itemset Mining (FIM) is one of the essential parts of ARM which is an active research area and a large number of algorithms have been developed. FIM algorithms may be depth-first or breadth-first approach. Most depth-first based approaches do not effectively address the cost of database projections. Consequently, their performance gets degraded severely as the total number of frequent itemsets in a database increases significantly. To solve this problem, a three - strategy adaptive algorithm, Bitmap Itemset Support Counting (BISC) with the closed and maximal frequent itemset is presented in this paper. The core strategy of the proposed algorithm is the usage of the closed and maximal frequent itemset detection which could be able to find least number of association rules. The proposed approach is compared with the conventional approach to evaluate the performance and accuracy. The experimental results show that the proposed approach outperforms the existing approach.
Keywords: Data Mining Algorithms; Bitmap; Frequent Itemset Mining; Association Rule Mining.
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
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 acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment 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
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.