In this paper, we introduce a new method, called EWAT+, for finding discords in time series databases. The proposed method takes full advantages of WAT, the discord discovery algorithm proposed by Fu et al., with major improvements based on new discord measure functions which help to set up a range of alternative good orderings for the outer loop of the discord discovery algorithm. In addition, we employ a branch-and-bound search mechanism on augmented trie that is carried out in the inner loop of the algorithm. Our experiments show that EWAT+ is highly effective in terms of running time.
|Title of host publication||IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future (RIVF)|
|Number of pages||4|
|Publication status||Published - 2010|