An Improved Frequent Itemset Generation Algorithm Based On Correspondence

Ajay, R Y and Kumar, Sharath and Kumar, Preetham and Pai, Radhika M (2012) An Improved Frequent Itemset Generation Algorithm Based On Correspondence. In: First International Conference on Information Science and Techniques, IST 2012, December 22-23 , Chennai.

[img] PDF
rmp_sharath_csit_2012.pdf - Published Version
Restricted to Registered users only

Download (225kB) | Request a copy


Association rules play a very vital role in the present day market that especially involves generation of maximal frequent itemsets in an efficient way. The efficiency of association rule is determined by the number of database scans required to generate the frequent itemsets. This in turn is proportional to the time, which will lead to the faster computation of the frequent itemsets. In this paper, a single scan algorithm which makes use of the mapping of the item numbers and array indexing to achieve the generation of the frequent item sets dynamically and faster. The proposed algorithm is an incremental algorithm in that it generates frequent itemsets as and when the data is entered into the database.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Computer Science & Information Technology(CS & IT) series
Uncontrolled Keywords: Maximal Frequent Itemset, Support, Data Mining, Mapping
Subjects: Engineering > MIT Manipal > Information and Communication Technology
Depositing User: MIT Library
Date Deposited: 22 Mar 2013 08:51
Last Modified: 22 Mar 2013 08:51

Actions (login required)

View Item View Item