Computer Science ›› 2018, Vol. 45 ›› Issue (1): 103-107.doi: 10.11896/j.issn.1002-137X.2018.01.016

Previous Articles     Next Articles

Pattern Matching with Weak-wildcard in Application of Time Series Analysis

TAN Chao-dong, MIN Fan, WU Xiao and LI Xin-lun   

  • Online:2018-01-15 Published:2018-11-13

Abstract: This paper proposed a pattern matching method based on weak-wildcards to obtain accurate and flexible matching which is good for locating critical time points and assisting users’ decision.First,a nominal sequence was obtained through coding the time series.Second,the concepts of weak-wildcard and gaps with special semantics were defined.Third,an efficient pattern matching algorithm was designed.In time series analysis,patterns reflect the trend of data change and indicate the occurrence of events.The traditional exact pattern matching is greatly affected by the noise,which has lower matching flexibility.Adding weak-wildcards gives consideration to both accuracy and flexibility.Experiments were undertaken on oil production and stock transaction data.Results show that compared to exact pattern matching method,the proposed pattern matching method copes with users’ expectation better.

Key words: Pattern matching,Time series,Weak-wildcard,Data preprocessing

[1] MONTGOMERY D C,JENNINGS C L,KULAHCI M.Introduction to time series analysis and forecasting[M].John Wiley &Sons,2015.
[2] SAKURAI Y,FALOUTSOS C,YAMAMURO M.Stream mo-nitoring under the time warping distance[C]∥2007 IEEE 23rd International Conference on Data Engineering.IEEE,2007:1046-1055.
[3] HE Y,WU X,ZHU X,et al.Mining frequent patterns withwildcards from biological sequences[C]∥2007 IEEE International Conference on Information Reuse and Integration.IEEE,2007:329-334.
[4] LU C J,LEE T S,CHIU C C.Financial time series forecasting using independent component analysis and support vector regression[J].Decision Support Systems,2009,47(2):115-125.
[5] KEOGH E,KASETTY S.On the need for time series data mi-ning benchmarks:a survey and empirical demonstration[J].Data Mining and Knowledge Discovery,2003,7(4):349-371.
[6] YANG Q,WANG X.10 Challenging Problems in data miningresearch[J].International Journal of Information Technology and Decision Making,2006,5(4):597-604.
[7] FISCHER M J,PATERSON M S.String-matching and otherproducts[C]∥Proceeding of the 7th SIAM AMS Complexity of Com-putation.Cambridge,USA,1974:113-125.
[8] INDYK P.Faster algorithms for string matching problems:matching the convolution bound[C]∥39th Annual Symposium on Foundations of Computer Science.IEEE,1998:166-173.
[9] KALAI A.Efficient pattern-matching with don’t cares[C]∥Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms.Philadelphia,PA,USA:ACM,2002:655-656.
[10] MANBER U,BAEZA-YATES R.An algorithm for string matching with a sequence of don’t cares[J].Information Processing Letters,1991,37(3):133-136.
[11] WU Y,WU X,MIN F,et al.A Nettree for pattern Matching with flexible wildcard Constraints[C]∥IEEE International Conference on Information Reuse and Integration.IEEE,2010:109-114.
[12] MIN F,WU X,LU Z.Pattern Matching with Independent Wildcard Gaps[C]∥Eighth IEEE International Conference on Dependable,Autonomic and Secure Computing.2009:194-199.
[13] CHEN G,WU X,ZHU X,et al.Efficient string matching with wildcards and length constraints[J].Knowledge & Information Systems,2006,10(4):399-419.
[14] TAN C D,FAN M,WANG M,et al.Discovering patterns with weak-wildcard gaps[J].IEEE Access,2016,4:4922-4932.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!