An improved apriori algorithm based on support weight matrix for data mining in transaction database
- 16 Downloads
Data mining is a process to discover hidden information or knowledge automatically from huge database. In order to reduce the number of scanning databases and reflect the importance of different items and transaction so as to extract more valuable information, an improved Apriori algorithm is proposed in this paper, which is to build the 0–1 transaction matrix by scanning transaction database for getting the weighted support and confidence. The items and transactions is weighted to reflect the importance in the transaction database. The experiment results, both qualitative and quantitative, have shown that our improved algorithm shortens the running time and reduces the memory requirement and the number of I/O operations. Meanwhile, the support for rare items tends to increase, while the support for other items decreases slightly, thus the hidden and valuable items can be effectively extracted.
KeywordsData mining Apriori algorithm Weight matrix Support and confidence k-Itemset
This work was financially supported by National natural science foundation (No. 11671119); The Scientific and Technological Research Program of Henan Province, China (No. 172102210111); The Scientific and Technological Research Program of Henan Province China (No. 172102210441).
- Asif M, Jamil A (2015) Analysis of effectiveness of apriori and frequent pattern tree algorithm in software engineering data mining. In: Proceedings of 2015 6th international conference on intelligent systems, modelling and simulation, Shanghai, pp 28–33Google Scholar
- Baralis E, Caglicro I, Cerquitclli T et al (2014) NEM7C0; Mining network data through cloud-based data mining techniques. In: Utility and cloud computing, 2014 IEEE/ACM 7th international conference on IEEE, vol 201, pp 503–504Google Scholar
- Bellogín A, Castells P, Cantador I (2013) Improving memory-based collaborative filtering by neighbour selection based on user preference overlap. In: Proceedings of the 10th conference on open research areas in information retrieval, pp 145–148Google Scholar
- Fu S, Zhou HJ (2013) The research and improvement of apriori algorithm for mining association rules. Microelectron Comput 9:110–114Google Scholar
- Huang Chuanguang Y, Jian W, Jing et al (2010) Research on collaborative filtering recommendation algorithm for indefinite neighbors. Comput Sci 33(8):1369–1377Google Scholar
- Jiao Y (2013) Research of an improved apriori algorithm in data mining association rules. Int J Comput Commun Eng 2(1):25–27Google Scholar
- Liao J, Ghao Y, Long S (2014) MRPrePost-A parallel algorithm adapted for miningbig data. In: 2014 IEEE workshop on electronics, computer and applications, IEEE, 564–568Google Scholar
- Rao S, Gupta R (2012) Implementing improved algorithm over APRIORI data mining association rule algorithm. Int J Comput Sci Technol 3(1):489–493Google Scholar
- Toivonen H (1996) Sampling large databases for association rules. In: Proceedings of the 22th international conference on very large databases (VLDB’96). Morgan Kaufmann, Mumbai, India, pp 134–145Google Scholar
- Zaki MJ (1999) Parallel and distributed association mining: a survey. IEEE Concurr Spec Issue Parallel Mech Data Min 7(4):14–25Google Scholar
- Zhao BG, Liu Y (2015) An efficient Bittable Based frequent itemsets mining algorithm. J Shandong Univ 2015(5):23–29Google Scholar