摘要
The idea of discovering patterns in data seems to be essential for decision making in our social activities. This paper presents a simple algorithm which can be used to detect such patterns in elementary sequences of symbols. It adopts a data compression algorithm to seek for interesting patterns, which is important in understanding the way that the input symbol stream repeats itself In this paper, the algorithm and related data structures are described in detail, and an illustrative example is given.
The idea of discovering patterns in data seems to be essential for decision making in our social activities. This paper presents a simple algorithm which can be used to detect such patterns in elementary sequences of symbols. It adopts a data compression algorithm to seek for interesting patterns, which is important in understanding the way that the input symbol stream repeats itself In this paper, the algorithm and related data structures are described in detail, and an illustrative example is given.
基金
the National Natural Science Foundation of China (69873031 )
