Skip to main content
SpringerLink
Log in

An effective approach for maintenance of pre-large-based frequent-itemset lattice in incremental mining

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Incremental mining has attracted the attention of many researchers due to its usefulness in online applications. Many algorithms have thus been proposed for incrementally mining frequent itemsets. Maintaining a frequent-itemset lattice (FIL) is difficult for databases with large numbers of frequent itemsets, especially huge databases, due to the storage of links of nodes in the lattice. However, generating association rules from a FIL has been shown to be more effective than traditional methods such as directly generating rules from frequent itemsets or frequent closed itemsets. Therefore, when the number of frequent itemsets is not huge (i.e., they can be stored in the lattice without excessive memory overhead), the lattice-based approach outperforms approaches which mine association rules from frequent itemsets/frequent closed itemsets. However, incremental algorithms for building FILs have not yet been proposed. This paper proposes an effective approach for the maintenance of a FIL based on the pre-large concept in incremental mining. The building process of a FIL is first improved using two proposed theorems regarding the paternity relation between two nodes in the lattice. An effective approach for maintaining a FIL with dynamically inserted data is then proposed based on the pre-large and the diffset concepts. The experimental results show that the proposed approach outperforms the batch approach for building a FIL in terms of execution time.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27

Similar content being viewed by others

Notes

  1. http://fimi.cs.helsinki.fi/data/

References

  1. Agrawal R, Imielinski T, Swami AN (1993) Mining association rules between sets of items in large databases. In: SIGMOD’93. pp 207–216

  2. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: VLDB’94. pp 487–499

  3. Cai R, Tung AKH, Zhang Z, Hao Z (2011) What is unequal among the equals? Ranking equivalent rules from gene expression data. IEEE Trans Knowl Data Eng 23(11):1735–1747

    Article  Google Scholar 

  4. Chen H, Yan X, Han J (2004) IncSpan: Incremental mining of sequential patterns in large databases. In: KDD’04. pp 527–532

  5. Cheung DW, Han J, Ng VT, Wong CY (1996) Maintenance of discovered association rules in large databases: an incremental updating approach. In: ICDE’96. pp 106–114

  6. Cong G, Tan K-L, Tung A K H, Xu X (2005) Mining Top-k covering rule groups for gene expression data. In: SIGMOD’05. pp 670–681

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

    Article  Google Scholar 

  8. Grahne G, Zhu J (2005) Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans Knowl Data Eng 17:1347–1362

    Article  Google Scholar 

  9. Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: SIGMOD’00. pp 1–12

  10. Hong TP, Wang CY, Tao YH (2001) A new incremental data mining algorithm using pre-large itemsets. Int Data Anal 5(2):111–129

    MATH  Google Scholar 

  11. Hong TP, Lin CW, Wu YL (2008) Incrementally fast updated frequent pattern trees. Expert Syst Appl 34(4):2424–2435

    Article  Google Scholar 

  12. Hong TP, Lin CW, Wu YL (2009) Maintenance of fast updated frequent pattern trees for record deletion. Comput Stat Data Anal 53(6):2485–2499

    Article  MathSciNet  MATH  Google Scholar 

  13. Hong TP, Wang CY, Tseng SS (2011) An incremental mining algorithm for maintaining sequential patterns using pre-large sequences. Expert Syst Appl 38(5):7051–7058

    Article  Google Scholar 

  14. Koh JL, Shied SF (2004) An efficient approach for maintaining association rules based on adjusting FP-tree structures. In: DASFAA’04. pp 417–424

  15. La PT, Le B, Vo B (2014) Incrementally building frequent closed itemset lattice. Expert Syst Appl 41(5):2703–2712

    Article  Google Scholar 

  16. Le T, Vo B (2014) MEI: an efficient algorithm for mining erasable itemsets. Eng Appl Artif Int 27:155–166

    Article  Google Scholar 

  17. Le TP, Hong TP, Vo B, Le B (2012) An efficient incremental mining approach based on IT-tree. In: RIVF’12. pp 57–61

  18. Lin CW, Hong TP, Lan GC, Wong JW, Lin WY (2014) Incrementally mining high utility patterns based on pre-large concept. Appl Int 40(2):343–357

    Article  Google Scholar 

  19. Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Efficient mining of association rules using closed Itemset lattices. Inform Syst 24(1):25–46

    Article  Google Scholar 

  20. Shie BE, Philip SY, Tseng VS (2013) Mining interesting user behavior patterns in mobile commerce environments. Appl Int 38(3):418–435

    Article  Google Scholar 

  21. Song W, Yang B, Xu Z (2008) Index-BitTableFI: an improved algorithm for mining frequent itemsets. Knowl-Based Syst 21:507–513

    Article  Google Scholar 

  22. Song W, Liu Y, Li J (2014) Mining high utility itemsets by dynamically pruning the tree structure. Appl Int 40(1):29–43

    Article  Google Scholar 

  23. Vo B, Le B (2009) Mining traditional association rules using frequent itemsets lattice. In: CIE’09. pp 1401–1406

  24. Vo B, Le B (2011) Interestingness measures for association rules: Combination between lattice and hash tables. Expert Syst Appl 38(9):11630–11640

    Article  Google Scholar 

  25. Vo B, Hong TP, Le B (2013) A lattice-based approach for mining most generalization association rules. Knowl-Based Syst 45:20–30

    Article  Google Scholar 

  26. Yen SJ, Lee YS (2013) Mining non-redundant time-gap sequential patterns. Appl Int 39(4):727–738

    Article  MathSciNet  Google Scholar 

  27. Yen SJ, Lee YS, Wang CK (2013) An efficient algorithm for incrementally mining frequent closed itemsets. Appl Int. doi:10.1007/s10489-013-0487-8 (in press)

  28. Zaki MJ, Gouda K (2003) Fast vertical mining using diffsets. In KDD’03. pp 326–335

  29. Zaki MJ, Hsiao CJ (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans Knowl Data Eng 17(4):462–478

    Article  Google Scholar 

  30. Zaki MJ, Parthasarathy S, Ogihara M, Li W (1997) New algorithms for fast discovery of association rules. In: KDD’97. pp 283–286

Download references

Author information

Authors and Affiliations

  1. Division of Data Science, Ton Duc Thang University, Ho Chi Minh, Vietnam

    Bay Vo & Tuong Le

  2. Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh, Viernam

    Bay Vo & Tuong Le

  3. Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan, Republic of China

    Tzung-Pei Hong

  4. Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan, Republic of China

    Tzung-Pei Hong

  5. Department of Computer Science, University of Science, Ho Chi Minh, Vietnam

    Bac Le

Authors
  1. Bay Vo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tuong Le
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tzung-Pei Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bac Le
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bay Vo.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vo, B., Le, T., Hong, TP. et al. An effective approach for maintenance of pre-large-based frequent-itemset lattice in incremental mining. Appl Intell 41, 759–775 (2014). https://doi.org/10.1007/s10489-014-0551-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-014-0551-z

Keywords

Search

Navigation