Discovery of Frequent Itemsets based on Minimum Quantity and Support

International Journal of Computer Science and Security

Ananthanarayana V S¹  Preetham Kumar¹ 

[1] $$

关键词: Channel allocation problem;    tabu search;    simulated annealing;   

DOI  :  

来源: Computer Science and Security

【 摘 要 】

Most of the association rules mining algorithms to discover frequent itemsets do not consider the components of transactions such as number of items bought or quantity and its total cost. In a large database it is possible that even if the itemset appears in a very few transactions, it may be purchased in a large quantity for every transaction in which it is present, and may lead to very high profit. Therefore the quantity and its total cost of the item bought are the most important components, without which it may lead to loss of information. Our novel method discovers all frequent itemsets based on items quantity, in addition to the discovery of frequent itemsets based on user defined minimum support. In order to achieve this, we first construct a tree containing the quantities of the items bought as well as the transactions which do not contain these items in a single scan of the database. Then by scanning the tree we can discover all frequent itemset based on user defined minimum quantity as well as support. This method is also found to be more efficient than Apriori and FP-tree, which require multiple scans of the database to discover all frequent itemsets based on user defined minimum support.

【 授权许可】

Unknown