A multi-dimensional indexing approach for timestamped event sequence matching

Park, Sang‐Hyun; Won, Jung-Im; Yoon, Jee Hee; Kim, Sang Wook

doi:10.1016/j.ins.2007.06.020

Cited by 3 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Further more, the need for processing time-stamped data (event data or data that are not sampled coherently) is becoming particularly significant [39] [30] in stock analysis, network monitoring, fault analysis, etc.…”

Section: Distance (Ed) and Correlationmentioning

confidence: 99%

See 1 more Smart Citation

Time Warp Edit Distance with Stiffness Adjustment for Time Series Matching

Marteau

2009

IEEE Trans. Pattern Anal. Mach. Intell.

264

170

View full text Add to dashboard Cite

Abstract--In a way similar to the string-to-string correction problem we address time series similarity in light of a timeseries-to-time-series-correction problem for which the similarity between two time series is measured as the minimum cost sequence of "edit operations" needed to transform one time series into another. To define the "edit operations" we use the paradigm of a graphical editing process and end up with a dynamic programming algorithm that we call Time Warp Edit Distance (TWED). TWED is slightly different in form from Dynamic Time Warping, Longest Common Subsequence or Edit Distance with Real Penalty algorithms. In particular, it highlights a parameter which controls a kind of stiffness of the elastic measure along the time axis. We show that the similarity provided by TWED is a potentially useful metric in time series retrieval applications since it could benefit from the triangular inequality property to speed up the retrieval process while tuning the parameters of the elastic measure. In that context, a lower bound is derived to link the matching of time series into down-sampled representation spaces to the matching into the original space. Empiric quality of the TWED distance is evaluated on a simple classification task. Compared to Edit Distance, Dynamic Time Warping, Longest Common Subsequence and Edit Distance with Real Penalty, TWED has proved to be quite effective on the considered experimental task.

show abstract

Section: Distance (Ed) and Correlationmentioning

confidence: 99%

“…Financial and stock data analysis [40], moving objects identification [4], astronomy [29], medicine [20], meteorology, data mining [1], time-stamped event data processing [39], network monitoring [30] are but a few of the numerous examples that could be cited.…”

Section: Introductionmentioning

confidence: 99%

Time Warp Edit Distance with Stiffness Adjustment for Time Series Matching

Marteau

2009

IEEE Trans. Pattern Anal. Mach. Intell.

264

170

View full text Add to dashboard Cite

show abstract

“…Similarity search is expected to remain an active research area as efficient similarity query processing is of fundamental importance in various applications, such as time series [31], image retrieval [15] and text retrieval [35]. In these domains the exact matching may not always be preferable in different scenarios.…”

Section: Introductionmentioning

confidence: 99%

SubSpace Projection: A unified framework for a class of partition-based dimension reduction techniques

Cheng

Hua

2009

Information Sciences

View full text Add to dashboard Cite

Using Dynamic Programming Techniques to Detect Multi-hop Stepping-Stone Pairs in a Connection Chain

Kuo

Huang

Ding

et al. 2010

2010 24th IEEE International Conference on Advanced Information Networking and Applications

View full text Add to dashboard Cite

Stepping-stone attack in network intrusion detection are attackers who use a sequence of intermediate (or so called stepping-stone) hosts to initiate attacks in order to hide their origins. We investigate a number of dynamic programming based pattern recognition approaches and our novel algorithm for detecting correlation and similarity of two connections not only into and out of a single stepping stone host(consecutive streams), but also across multiple stepping-stone hosts. The goal of this paper is to find out which technique can be better adopted for detection applications. To evaluate their accuracy and efficiency, we conduct extensive experiments. We also evaluate how chaff packets and time skew may affect these methods. We compare the results from five methods with their false positive and false negative rates. We demonstrate that our proposed approach named OSSM returns very good performance even under a variety of complex circumstances.

show abstract

A multi-dimensional indexing approach for timestamped event sequence matching

Cited by 3 publications

References 22 publications

Time Warp Edit Distance with Stiffness Adjustment for Time Series Matching

Time Warp Edit Distance with Stiffness Adjustment for Time Series Matching

SubSpace Projection: A unified framework for a class of partition-based dimension reduction techniques

Using Dynamic Programming Techniques to Detect Multi-hop Stepping-Stone Pairs in a Connection Chain

Contact Info

Product

Resources

About