Skip to main content

ARMFEG: Association Rule Mining by Frequency-Edge-Graph for Rare Items

  • Conference paper
  • First Online:
Recent Advances in Information and Communication Technology 2018 (IC2IT 2018)

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

Included in the following conference series:

  • 569 Accesses

Abstract

Almost every global economy has now entered the digital era. Most stores are trading online and they are highly competitive. Traditional association rule mining is not suitable for online trading because information is dynamic and it needs a fast processing time. Sometimes products on online stores are out of stock or unavailable which needs to be manually addressed. Therefore, this work proposes a new algorithm called Association Rule Mining by Frequency-Edge-Graph (ARMFEG) that can convert transaction data to form a complete virtual graph and store items counting in the adjacency matrix. With the limitation of search space using the top weight which is automatically generated during frequency items generation, ARMFEG is very fast during the rule generation phase and can find association rules in all items from adjacency matrix which solves the rare item problem.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487–499. Morgan Kaufmann Publishers Inc., CA (1994)

    Google Scholar 

  2. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pp. 1–12. ACM, Texas (2000)

    Article  Google Scholar 

  3. Narvekar, M., Syed, S.F.: Anoptimized algorithm for association rule mining using FP tree. Procedia Comput. Sci. 45, 101–110 (2015)

    Article  Google Scholar 

  4. Dong, J., Han, M.: BitTableFI: an efficient mining frequent itemsets algorithm. Knowl. Based Syst. 20, 329–335 (2007)

    Article  Google Scholar 

  5. Asadi, A., Afzali, M., Shojaei, A., Sulaimani, S.: New binary PSO based method for finding best thresholds in association rule mining. Life Sci. J. 9, 260–264 (2012)

    Google Scholar 

  6. Pears, R., Koh, Y.S., Dobbie, G., Yeap, W.: Weighted association rule mining via a graph based connectivity model. Inf. Sci. 218, 61–84 (2013)

    Article  MathSciNet  Google Scholar 

  7. Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum supports. In: The Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, California, pp. 337–341 (1999)

    Google Scholar 

  8. Duck, J., Long, J., Hwang, B., Keun-Ho, R.: Frequent pattern mining using bipartite graph. In: Proceedings of 18th International Workshop on Database and Expert Systems Applications, DEXA 2007, pp. 182–186 (2007)

    Google Scholar 

  9. Tiwari, V., Tiwari, V., Gupta, S., Tiwari, R.: Association rule mining: A graph based approach for mining frequent itemsets. In: Proceedings of International Conference on Networking and Information Technology (ICNIT), pp. 309–313 (2010)

    Google Scholar 

  10. Al-Dharhani, G., Othman, Z., Bakar, A.: A graph-based ant colony optimization for association rule mining. Arab. J. Sci. Eng. 39, 4651–4665 (2014)

    Article  Google Scholar 

  11. Pears, R., Pisalpanus, S., Koh, Y.S.: A graph based approach to inferring item weights for pattern mining. Expert Syst. Appl. 42, 451–461 (2015)

    Article  Google Scholar 

  12. Amal Dev, P., Shobana, N.V., Joseph, P.: GARM: A simple graph based algorithm for association rule mining. Int. J. Comput. Appl. 76(16) ,1–4 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pramool Suksakaophong .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Suksakaophong, P., Meesad, P., Unger, H. (2019). ARMFEG: Association Rule Mining by Frequency-Edge-Graph for Rare Items. In: Unger, H., Sodsee, S., Meesad, P. (eds) Recent Advances in Information and Communication Technology 2018. IC2IT 2018. Advances in Intelligent Systems and Computing, vol 769. Springer, Cham. https://doi.org/10.1007/978-3-319-93692-5_2

Download citation

Publish with us

Policies and ethics