Yan Qiuyan
School of Computer Science and Technology, China University of Mining and Technology, China
Chen Xiongtao
School of Computer Science and Technology, China University of Mining and Technology, China
ABSTRACT
Time series discords are subsequences that are maximally different to all other time series subsequences of a longer time series. Discord Detection is widely used in time series applications. We observed that the discord position are often changed when noise data interfere with the time series. This phenomenon is produced because the traditional method cannot concern the factor that noise data infect the original datas distribution. In this study, we opposed a novel method which combined top-k discord detection with uncertain ranking to achieve uncertain top-k discord detection. Through transforming the discord score interval to satisfied with Gaussian distribution, the new method can ranking series data with arbitrary distribution. Finally, we demonstrate a comprehensive experimental study to verify the effectiveness and efficiency of the proposed approach.
PDF References Citation
How to cite this article
Yan Qiuyan and Chen Xiongtao, 2013. A Novel Never-ending Uncertain Top-k Discord Detection Method. Information Technology Journal, 12: 4906-4910.
DOI: 10.3923/itj.2013.4906.4910
URL: https://scialert.net/abstract/?doi=itj.2013.4906.4910
DOI: 10.3923/itj.2013.4906.4910
URL: https://scialert.net/abstract/?doi=itj.2013.4906.4910
REFERENCES
- Buu, H.T.Q. and D.T. Anh, 2011. Time series discord discovery based on iSAX symbolic representation. Proceedings of the 3rd International Conference on Knowledge and Systems Engineering, October 14-17, 2011, Hanoi, Vietnam, pp: 11-18.
CrossRef - Camerra, A., T. Palpanas, J. Shieh and E.J. Keogh, 2010. iSAX 2.0: Indexing and mining one billion time series. Proceedings of the IEEE International Conference on Data Mining, December 14-17, 2010, Sydney, Australia, pp: 58-67.
CrossRef - Keogh, E., J. Lin and A. Fu, 2005. HOT SAX: Efficiently finding the most unusual time series subsequence. Proceedings of the 5th IEEE International Conference on Data Mining, November 27-30, 2005, Houston, Texas, USA., pp: 226-233.
CrossRef - Khanh, N.D.K. and D.T. Anh, 2012. Time series discord discovery using WAT algorithm and iSAX representation. Proceedings of the 3rd Symposium on Information and Communication Technology, August 23-24, 2012, Ha Long, Vietnam, pp: 207-213.
CrossRef - Li, J., B. Saha and A. Deshpande, 2011. A unified approach to ranking in probabilistic databases. VLDB J., 20: 249-275.
CrossRef - Ma, J. and S. Perkins, 2003. Online novelty detection on temporal sequences. Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 24-27, 2003, Washington, DC., USA., pp: 613-618.
CrossRef - Soliman, M.A. and I.F. Ilyas, 2009. Ranking with uncertain scores. Proceedings of the IEEE International Conference on Data Engineering, March 29-April 2, 2009, Shanghai, China, pp: 317-328.
CrossRef