Yu-Ting Kung

Learn More
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(More)
  • 1