Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 842))

Abstract

An improved Apriori-Pro algorithm is proposed to solve the disadvantages of a large number of invalid candidate sets when mining association rules. The new algorithm adds the transaction label column in the item set list to calculate the support degree, and makes use of the difference of the transaction label column to determine whether the link operation is conducted, effectively avoiding the generation of the invalid candidate set. In addition, when the algorithm scans the database for the first time, the dataset is put into the list without having to scan the database multiple times. Experimental results show that the new algorithm is greatly improved compared with the original algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Agrawal, R., Srikan, R.: Fast algorithms for mining association rules in lager databases. In: Proceedings of the Twentieth International Conference on very Large Databases, Santiago, pp. 487–499 (1994)

    Google Scholar 

  2. Liu, W., Chen, J., Qu, S., et al.: Improved Apriori algorithm. Comput. Eng. Appl. 47(11), 149–151 (2011)

    Google Scholar 

  3. Qin, J., Hao, T., Dong, Q.: Parallel improvement of Apriori algorithm based on MapReduce. Comput. Technol. Dev. 27(4), 64–68 (2017)

    Google Scholar 

  4. Wei, L., Wei, Y., Gao, C.: Improved Apriori algorithm based on bigtable and MapReduce. Comput. Sci. 42(10) (2015)

    Google Scholar 

  5. Mi, Y., Jiang, L., Mi, C.: Rough association rules algorithm with negation under MapReduce. Comput. Integr. Manuf. Syst. 20(11), 2893–2903 (2014)

    Google Scholar 

  6. Zhang, W.: An improved AprioriTid algotithm. J. Shenyang Univ. Technol. 38(3), 314–318 (2016)

    Google Scholar 

  7. Liu, L., Yu, S., Wei, X., et al.: Animproved Apriori-based algorithm for friends recommendation in microblog. Int. J. Commun. Syst. 32(2), 3453–3462 (2017)

    Article  Google Scholar 

  8. Feng, D., Zhu, L., Zhang, L.: Research on improved Apriori algorithm based on MapReduce and HBase. In: Proceedings of 2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference, pp. 887–891 (2016)

    Google Scholar 

Download references

Acknowledgement

This Research work was supported by the National Science Foundation of China under (Grant No. 61703005).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huaping Zhou .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhou, H., Zhang, D. (2019). An Improved Apriori-Pro Algorithm. In: Abawajy, J., Choo, KK., Islam, R., Xu, Z., Atiquzzaman, M. (eds) International Conference on Applications and Techniques in Cyber Security and Intelligence ATCI 2018. ATCI 2018. Advances in Intelligent Systems and Computing, vol 842. Springer, Cham. https://doi.org/10.1007/978-3-319-98776-7_10

Download citation

Publish with us

Policies and ethics