Rare association rule mining from incremental databases

  • Anindita BorahEmail author
  • Bhabesh Nath
Theoretical Advances


Rare association rule mining is an imperative field of data mining that attempts to identify rare correlations among the items in a database. Although numerous attempts pertaining to rare association rule mining can be found in the literature, there are still certain issues that need utmost attention. The most prominent one among them is the rare association rule mining from incremental databases. The existing rare association rule mining techniques are capable of operating only on static databases, assuming that the entire database to be operated on is available during the outset of the mining process. Inclusion of new records, however, may lead to the generation of some new interesting rules from the current set of data, invalidating the previously extracted significant rare association rules. Executing the entire mining process from scratch for the newly arrived set of data could be a tedious affair. With a view to resolve the issue of incremental rare association rule mining, this study presents a single-pass tree-based approach for extracting rare association rules when new data are inserted into the original database. The proposed approach is capable of generating the complete set of frequent and rare patterns without rescanning the updated database and reconstructing the entire tree structure when new transactions are added to the existent database. Experimental evaluation has been carried out on several benchmark real and synthetic datasets to analyze the efficiency of the proposed approach. Furthermore, to assess its applicability in real-world applications, experimental analysis has been performed on a real geological dataset where earthquake records are incrementally being added on an annual basis. Comparative performance analysis demonstrates the preeminence of proposed approach over existing frequent and rare association rule mining techniques.


Rare pattern Association rule Rare association rule Incremental mining 


  1. 1.
    Adda M, Wu L, Feng Y (2007) Rare itemset mining. In: Sixth international conference on machine learning and applications, ICMLA, IEEE, pp 73–80Google Scholar
  2. 2.
    Agrawal R, Imieliński T, Swami A (1993) Mining association rules between sets of items in large databases. In: ACM sigmod record, vol 22. ACM, pp 207–216Google Scholar
  3. 3.
    Agrawal R, Srikant R et al (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large data bases, VLDB, vol 1215, pp 487–499Google Scholar
  4. 4.
    Aumann Y, Feldman R, Lipshtat O, Manilla H (1999) Borders: an efficient algorithm for association generation in dynamic databases. J Intell Inf Syst 12(1):61–73CrossRefGoogle Scholar
  5. 5.
    Bhatt U, Patel P (2015) A novel approach for finding rare items based on multiple minimum support framework. Proc Comput Sci 57:1088–1095CrossRefGoogle Scholar
  6. 6.
    Borah A, Nath B (2017) Mining patterns from data streams: an overview. In: International conference on I-SMAC (IoT in social, mobile, analytics and cloud) (I-SMAC), IEEE, pp 371–376Google Scholar
  7. 7.
    Borah A, Nath B (2017) Mining rare patterns using hyper-linked data structure. In: International conference on pattern recognition and machine intelligence. Springer, pp 467–472Google Scholar
  8. 8.
    Borah A, Nath B (2017) Rare association rule mining: a systematic review. Int J Knowl Eng Data Min 4(3–4):204–258CrossRefGoogle Scholar
  9. 9.
    Borah A, Nath B (2018) Fp-tree and its variants: towards solving the pattern mining challenges. In: Proceedings of first international conference on smart system, innovations and computing. Springer, pp 535–543Google Scholar
  10. 10.
    Borah A, Nath B (2018) Identifying risk factors for adverse diseases using dynamic rare association rule mining. Expert Syst Appl 113:233–263CrossRefGoogle Scholar
  11. 11.
    Borah A, Nath B (2019) Performance analysis of tree-based approaches for pattern mining. In: Computational intelligence in data mining. Springer, pp 435–448Google Scholar
  12. 12.
    Cheung DW, Han J, Ng VT, Wong C (1996) Maintenance of discovered association rules in large databases: an incremental updating technique. In: Proceedings of the twelfth international conference on data engineering, IEEE, pp 106–114Google Scholar
  13. 13.
    Cheung DWL, Lee SD, Kao B et al (1997) A general incremental technique for maintaining discovered association rules. In: DASFAA, vol 6, pp 185–194Google Scholar
  14. 14.
    Cheung W, Zaiane OR (2003) Incremental mining of frequent patterns without candidate generation or support constraint. In: Proceedings of seventh international database engineering and applications symposium, IEEE, pp 111–116Google Scholar
  15. 15.
    Ezeife CI, Su Y (2002) Mining incremental association rules with generalized fp-tree. In: Conference of the Canadian society for computational studies of intelligence. Springer, pp 147–160Google Scholar
  16. 16.
    Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: ACM sigmod record, vol 29. ACM, pp 1–12Google Scholar
  17. 17.
    Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Discov 8(1):53–87MathSciNetCrossRefGoogle Scholar
  18. 18.
    Hong TP, Lin CW, Wu YL (2008) Incrementally fast updated frequent pattern trees. Expert Syst Appl 34(4):2424–2435CrossRefGoogle Scholar
  19. 19.
    Kiran RU, Krishna Re P (2009) An improved multiple minimum support based approach to mine rare association rules. In: IEEE symposium on computational intelligence and data mining, CIDM’09, IEEE, pp 340–347Google Scholar
  20. 20.
    Lee YC, Hong TP, Lin WY (2005) Mining association rules with multiple minimum supports using maximum constraints. Int J Approx Reason 40(1):44–54CrossRefGoogle Scholar
  21. 21.
    Leung CKS, Khan QI, Li Z, Hoque T (2007) Cantree: a canonical-order tree for incremental frequent-pattern mining. Knowl Inf Syst 11(3):287–311CrossRefGoogle Scholar
  22. 22.
    Lin CW, Hong TP, Lu WH (2009) The pre-fufp algorithm for incremental mining. Expert Syst Appl 36(5):9498–9505CrossRefGoogle Scholar
  23. 23.
    Liu B, Hsu W, Ma Y (1999) Mining association rules with multiple minimum supports. In: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 337–341Google Scholar
  24. 24.
    Szathmary L, Napoli A, Valtchev P (2007) Towards rare itemset mining. In: 19th IEEE international conference on tools with artificial intelligence, ICTAI 2007, IEEE, vol 1, pp 305–312Google Scholar
  25. 25.
    Troiano L, Scibelli G, Birtolo C (2009) A fast algorithm for mining rare itemsets. In: 2009 Ninth international conference on intelligent systems design and applications, IEEE, pp 1149–1155Google Scholar
  26. 26.
    Tsang S, Koh YS, Dobbie G (2011) RP-Tree: rare pattern tree mining. In: International conference on data warehousing and knowledge discovery. Springer, Berlin, pp 277–288CrossRefGoogle Scholar
  27. 27.
    Wang K, Tang L, Han Liu, J (2002) Top down fp-growth for association rule mining. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, pp 334–340CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Ltd., part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringTezpur UniversityTezpurIndia

Personalised recommendations