Research on Apriori Algorithm Based on Matrix Compression in Basketball Techniques and Tactics

  • Jiyong LiaoEmail author
  • Ailian Liu
  • Sheng Wu
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1060)


Apriori algorithm is the most commonly used algorithm for mining frequent closed itemsets, which core idea is to generate frequent itemsets by computing support and pruning operations. However, the traditional Apriori algorithm has many shortcomings, an Apriori algorithm based on matrix compression is proposed, and the method of association and design of various technical actions in basketball matches is introduced. First, the transaction database is converted to Boolean matrix, which reduces the number of scans times and improves the time running efficiency of the algorithm. In addition, in order to improve space efficiency, the operation of deleting infrequent itemsets is added, and the generation of candidate sets is greatly reduced. Instance analysis and experimental results show that the improved algorithm has better performance than the existing algorithm, and can effectively improve the algorithm execution efficiency. And it can be effectively used to mine the potential relationship of basketball game technical movements, which is of great importance to the research of basketball game technical movements.


Association rules Apriori algorithm Matrix compression Basketball skills and tactics 


  1. 1.
    Dai YG, Zhang X, Xu T, Ye L, Ma YJ. Improved Apriori algorithm for mining association rules. In: 2018 international conference on modeling, simulation and analysis (ICMSA). IEEE;2018. pp. 175–80.Google Scholar
  2. 2.
    Dean A, Christian B, Mirianne D. ezDataMiner and strategic advantages of data mine. In: 2005 proceedings of European mediterranean and middle eastern conference on information systems (EMCIS). IEEE; 2005. pp. 7–8.Google Scholar
  3. 3.
    Qu DQ, Cheng ZP, Zhen K, Lei FM, Shi J. Statistics disciplines of sports and development trend. J Xi’an Phys Educ Univ. 2008;25(1):63–7.Google Scholar
  4. 4.
    Sun J, Yu WS, Zhao HQ. Study of association rule mining on technical action of ball games. In: 2010 international conference on measuring technology and mechatronics automation. IEEE; 2010. pp. 539–42.Google Scholar
  5. 5.
    Yang QX, Sun H. Apriori algorithm based on weight vector matrix reduction. Comput Eng Des. 2018;39(3):692–93 + 762.Google Scholar
  6. 6.
    Krajca P, Outrata J, Vychodil V. Using frequent closed itemsets for data dimensionality reduction. In: 2011 international conference on data mining (ICDM). IEEE; 2011. pp. 1128–33.Google Scholar
  7. 7.
    Lei M. Association rules mining algorithm based on matrix. In: 2015 international conference on advances in mechanical engineering and industrial informatics (AMEII). IEEE; 2015. pp. 1000–06.Google Scholar
  8. 8.
    Zhang ZL, Liu J, Zhang J. A fast algorithm for mining association rules based on Boolean matrix. In: 4th international conference on wireless communications, networking and mobile computing (WCNMC). IEEE; 2008. pp. 1–3.Google Scholar
  9. 9.
    Zhu X, Yang Q, Du FY. An improved Apriori algorithm for association analysis. In: 2016 international conference on education, training and management innovation (ETMI). IEEE; 2016. pp. 175–80.Google Scholar
  10. 10.
    Yang QL, Fu QC, Wang C, Yang JC. A matrix-based Apriori algorithm improvement. In: 2018 IEEE third international conference on data science in cyberspace (DSC). IEEE; 2018. pp. 824–28.Google Scholar
  11. 11.
    Luo D, Li TS. Research on improved Apriori algorithm based on compressed matrix. Comput Sci. 2013;40(12):75–80.Google Scholar
  12. 12.
    Liu HZ, Dai SP, Jing H. Quantitative association rules mining algorithm based on matrix. In: 2009 international conference on computational intelligence and software engineering (CISE). IEEE; 2009. pp. 1–4.Google Scholar
  13. 13.
    Du JL, Zhang XL, Zhang HM, Chen L. Research and improvement of Apriori algorithm. In: Sixth international conference on information science and technology. IEEE; 2016. pp. 117–21.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.School of Information Engineering and AutomationKunming University of Science and TechnologyKunming, YunnanChina

Personalised recommendations