ABSTRACT
Association rule mining is used to find association relationships among data sets. Apriori algorithm is one of the classical algorithms of association rule mining. It generates the association rules from transaction data, such as, if item 'a' is bought then what are the chances to buy item 'b'. It uses support and confidence values to generate the association rule.
In this paper, we modified the classical apriori algorithm in such way that so we can generate item sets as a package, which have higher possibility to buy together by the customers. To generate these packages, we introduced a new combined support value of the items sets. This combined support value is used along with the apriori algorithm to generate package items within a minimum support value. The generated item sets can also help the decision maker to forming new packages for the customers.
- R. Agrawal and R. Srikant, 1994 Fast algorithms for mining association rules, Proceedings of the 20th Very Large DataBases Conference (VLDB'94), Santiago de Chile, Chile, pp. 487--499.Google Scholar
- R. Karthiyayini and Dr. R. Balasubramanian, 2016 Affinity Analysis and Association Rule Mining using Apriori Algorithm in Market Basket Analysis, Volume 6, Issue 10, October 2016, ISSN: 2277 128X.Google Scholar
- Shaosong Yang and Guoyan Xu and Zhijian Wang and Fachao Zhou, 2015 The Parallel Improved Apriori Algorithm Research Based on Spark, 2015 Ninth International Conference on Frontier of Computer Science and Technology.Google ScholarDigital Library
- Ketan D. Shah and Dr. (Mrs.) Sunita Mahajan, 2009 Maximizing the Efficiency of Parallel Apriori Algorithm, 2009 International Conference on Advances in Recent Technologies in Communication and Computing.Google Scholar
- Bo Wu and Defu Zhang and Qihua Lan and Jiemin Zheng, 2008, An Efficient Frequent Patterns Mininsg Algorithm based on Apriori Algorithm and the FPtree Structure, Third 2008 International Conference on Convergence and Hybrid Information Technology.Google ScholarDigital Library
- Xueyan Lin, 2014 MR-Apriori: Association Rules Algorithm Based on MapReduce, 2014 5th IEEE International Conference on Software Engineering and Service Science (ICSESS).Google ScholarCross Ref
Index Terms
- Combined Item Sets Generation using Modified Apriori Algorithm
Recommendations
Mining Frequent Itemsets Using Improved Apriori on Spark
ICISDM '19: Proceedings of the 2019 3rd International Conference on Information System and Data MiningFinding the frequent itemset is one of the most investigated extents of data mining. The Apriori algorithm is the most established algorithm for frequent itemset mining, but it has issues regarding scanning frequent databases and generating a large ...
Research and improvement on association rule algorithm based on FP-Growth
WISM'12: Proceedings of the 2012 international conference on Web Information Systems and MiningAssociation rules mining (ARM) is one of the most useful techniques in the field of knowledge discovery and data mining and so on. Frequent item sets mining plays an important role in association rules mining. Apriori algorithm and FP-growth algorithm ...
Mining Association Rules Based on Apriori Algorithm and Application
IFCSTA '09: Proceedings of the 2009 International Forum on Computer Science-Technology and Applications - Volume 01In the data mining research, mining association rules is an important topic. Apriori algorithm submitted by Agrawal and R. Srikant in 1994 is the most effective algorithm. Aimed at two problems of discovering frequent itemsets in a large database and ...
Comments