An Efficient Approach for Mining Fault-Tolerant Repeating Patterns based on Bit Sequences
碩士 === 國立臺灣師範大學 === 資訊教育研究所 === 92 === An efficient way of mining top-K non-trivial fault-tolerant repeating patterns (FT-RPs in short) with length no less than min_len for data sequences is proposed in this thesis. By extending the idea of appearing bit sequences, fault-tolerant appearing bit seque...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/02467736173396060842 |