Advertisement

An Efficient Approach for Mining Top-K Fault-Tolerant Repeating Patterns

  • Jia-Ling Koh
  • Yu-Ting Kung
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3882)

Abstract

In this paper, an efficient strategy for mining top-K non-trivial fault-tolerant repeating patterns (FT-RPs in short) with lengths no less than min_len from data sequences is provided. By extending the idea of appearing bit sequences, fault-tolerant appearing bit sequences are defined to represent the locations where candidate patterns appear in a data sequence with insertion/deletion errors being allowed. Two algorithms, named TFTRP-Mine(Top-K non-trivial FT-RPs Mining) and RE-TFTRP-Mine (REfinement of TFTRP-Mine), respectively, are proposed. Both of these two algorithms use the recursive formulas to obtain the fault-tolerant appearing bit sequence of a pattern systematically and then the fault-tolerant frequency of each candidate pattern could be counted quickly. Besides, RE-TFTRP-Mine adopts two additional strategies for pruning the searching space in order to improve the mining efficiency. The experimental results show that RE-TFTRP-Mine outperforms TFTRP-Mine algorithm when K and min_len are small. In addition, more important and implicit repeating patterns could be found from real music objects by adopting fault tolerant mining.

Keywords

Execution Time Data Item Fault Tolerance Recursive Formula Recursive Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Liu, C.C., Hsu, J.L., Chen, A.L.P.: Efficient Theme and Non-Trivial Repeating Pattern Discovering in Music Databases. In: Proceedings of the 15th International Conference on Data Engineering (ICDE 1999) (1999)Google Scholar
  2. 2.
    Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining Top-K Frequent Closed Patterns without Minimum Support. In: Proceedings of 2002 International Conference on Data Mining (ICDM 2002) (2002)Google Scholar
  3. 3.
    Hsu, J.L., Liu, C.C., Chen, A.L.P.: Efficient Repeating Pattern Finding in Music Databases. In: Proceedings of the Seventh International Conference on Information and Knowledge Management(ACM CIKM 1998) (1998)Google Scholar
  4. 4.
    Koh, J.L., Yu, W.D.C.: Efficient Feature Mining in Music Objects. In: Mayr, H.C., Lazanský, J., Quirchmayr, G., Vogel, P. (eds.) DEXA 2001. LNCS, vol. 2113, pp. 221–231. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Koh, J.L., Yo, P.W.: An Efficient Approach for Mining Fault-Tolerant Frequent Itemsets based on Bit Sequences. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Pei, J., Tung, A.K.H., Han, J.: Fault-Tolerant Frequent Pattern Mining: Problem and Challenges. In: Proceedings of ACM-SIGMOD International Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD 2001) (2001)Google Scholar
  7. 7.
    Tzvetkov, P., Yan, X., Han, J.: TSP: Mining Top-K Closed Sequential Patterns. In: Proceedings of 2003 International Conference on Data Mining (ICDM 2003) (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jia-Ling Koh
    • 1
  • Yu-Ting Kung
    • 1
  1. 1.Department of Information and Computer EducationNational Taiwan Normal UniversityTaipeiTaiwan, R.O.C.

Personalised recommendations