Fault Tolerance Patterns Mining in Dynamic Databases

  • Delvi Ester
  • Guanling leeEmail author
Conference paper
Part of the Lecture Notes in Business Information Processing book series (LNBIP, volume 222)


Mining of frequent patterns in database has been studied for several years. However, real-world data tends to be dirty and frequent pattern mining which extracts patterns that are absolutely matched is not enough. An approach, called frequent fault-tolerant pattern (FT-pattern) mining, is more suitable for extracting interesting information from real-world data that may be polluted by noise. Previous research on frequent fault-tolerant pattern mining has been widely studied. However, all of the researches focus on static database. In this paper, we propose an efficient framework to analyze the frequent FT-patterns mining in dynamic database. To avoid re-scanning the whole database, beside of keeping the fault-tolerance pattern, we will also keep the potential fault-tolerance pattern that has higher possibility of becoming a fault-tolerance pattern. The experimental results show that by re-using the existing pattern that had been generated, the proposed algorithms are highly efficient in terms of execution time and maximum memory usage for mining fault-tolerance frequent pattern in dynamic database compare to FFM algorithm.


Item support FT support Fault-tolerant frequent pattern Data mining Dynamic database 


  1. 1.
    Koh, J.-L., Yo, P.-W.: An efficient approach for mining fault-tolerant frequent patterns based on bit vector representations. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 568–575. Springer, Heidelberg (2005)Google Scholar
  2. 2.
    Lee, G., Lin, Y.-T.: A study on proportional fault-tolerant data mining. In: Proc. of Int. Conf. Innovation in Information Technology, Dubai, pp. 1–5, November 2006Google Scholar
  3. 3.
    Lee, G., Peng, S.-L., Lin, Y.-T.: Proportional Fault-tolerant Data Mining with Applications to Bioinformatics. Special Issue of Knowledge Discovery and Management in Biomedical Information Systems with the journal of Information Systems Frontiers (2009 to appear)Google Scholar
  4. 4.
    Pei, J., Tung, A.K.H., Han, J.: Fault-tolerant frequent pattern mining: problems and challenges. In: DMKD 2001, Santa Barbara, CA, May 2001Google Scholar
  5. 5.
    Yang, C., Fayyad, U., Bradley, P.S.: Efficient discovery of error-tolerant frequent item sets in high dimensions. In: Proceedings of the Seventh ACM SIGKDD International Conference On Knowledge Discovery And Data Mining, August 2001Google Scholar
  6. 6.
    Zeng, J.-J., Lee, G., Lee, C.-C.: Mining fault-tolerant frequent patterns efficiently with powerful pruning. In: Proc. of ACM, pp. 927–931 (2008)Google Scholar
  7. 7.
    Tseng, C.-C., Lee, G.: A depth-first search approach for mining proportional fault-tolerant frequent pat-terns efficiently in large database. In: International Conference on Information Management, February–March 2015Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer Science and Information EngineeringNational Dong Hwa UniversityShoufengTaiwan, R.O.C.

Personalised recommendations