An index-based method for timestamped event sequence matching

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

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

This paper addresses the problem of timestamped event sequence matching, a new type of sequence matching that retrieves the occurrences of interesting patterns from a timestamped event sequence. Timestamped event sequence matching is useful for discovering temporal causal relationships among timestamped events. In this paper, we first point out the shortcomings of prior approaches to this problem and then propose a novel method that employs an R*-tree to overcome them. To build an R*-tree, it places a time window at every position of a times-tamped event sequence and represents each window as an n-dimensional rectangle by considering the first and last occurrence times of each event type. Here, n is the total number of disparate event types that may occur in a target application. When n is large, we apply a grouping technique to reduce the dimensionality of an R*-tree. To retrieve the occurrences of a query pattern from a timestamped event sequence, the proposed method first identifies a small number of candidates by searching an R*-tree and then picks out true answers from them. We prove its robustness formally, and also show its effectiveness via extensive experiments.

Original languageEnglish
Pages (from-to)493-502
Number of pages10
JournalLecture Notes in Computer Science
Volume3588
Publication statusPublished - 2005 Oct 24
Event16th International Conference on Database and Expert Systems Applications, DExa 2005 - Copenhagen, Denmark
Duration: 2005 Aug 222005 Aug 26

Fingerprint

R-tree
Experiments
Time Windows
Grouping
Rectangle
Dimensionality
n-dimensional
Query
Robustness
Target
Experiment

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Park, Sang Hyun ; Won, Jung Im ; Yoon, Jee Hee ; Kim, Sang Wook. / An index-based method for timestamped event sequence matching. In: Lecture Notes in Computer Science. 2005 ; Vol. 3588. pp. 493-502.
@article{8bdf4f9df1fc42d2bf02372f0a945397,
title = "An index-based method for timestamped event sequence matching",
abstract = "This paper addresses the problem of timestamped event sequence matching, a new type of sequence matching that retrieves the occurrences of interesting patterns from a timestamped event sequence. Timestamped event sequence matching is useful for discovering temporal causal relationships among timestamped events. In this paper, we first point out the shortcomings of prior approaches to this problem and then propose a novel method that employs an R*-tree to overcome them. To build an R*-tree, it places a time window at every position of a times-tamped event sequence and represents each window as an n-dimensional rectangle by considering the first and last occurrence times of each event type. Here, n is the total number of disparate event types that may occur in a target application. When n is large, we apply a grouping technique to reduce the dimensionality of an R*-tree. To retrieve the occurrences of a query pattern from a timestamped event sequence, the proposed method first identifies a small number of candidates by searching an R*-tree and then picks out true answers from them. We prove its robustness formally, and also show its effectiveness via extensive experiments.",
author = "Park, {Sang Hyun} and Won, {Jung Im} and Yoon, {Jee Hee} and Kim, {Sang Wook}",
year = "2005",
month = "10",
day = "24",
language = "English",
volume = "3588",
pages = "493--502",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

An index-based method for timestamped event sequence matching. / Park, Sang Hyun; Won, Jung Im; Yoon, Jee Hee; Kim, Sang Wook.

In: Lecture Notes in Computer Science, Vol. 3588, 24.10.2005, p. 493-502.

Research output: Contribution to journalConference article

TY - JOUR

T1 - An index-based method for timestamped event sequence matching

AU - Park, Sang Hyun

AU - Won, Jung Im

AU - Yoon, Jee Hee

AU - Kim, Sang Wook

PY - 2005/10/24

Y1 - 2005/10/24

N2 - This paper addresses the problem of timestamped event sequence matching, a new type of sequence matching that retrieves the occurrences of interesting patterns from a timestamped event sequence. Timestamped event sequence matching is useful for discovering temporal causal relationships among timestamped events. In this paper, we first point out the shortcomings of prior approaches to this problem and then propose a novel method that employs an R*-tree to overcome them. To build an R*-tree, it places a time window at every position of a times-tamped event sequence and represents each window as an n-dimensional rectangle by considering the first and last occurrence times of each event type. Here, n is the total number of disparate event types that may occur in a target application. When n is large, we apply a grouping technique to reduce the dimensionality of an R*-tree. To retrieve the occurrences of a query pattern from a timestamped event sequence, the proposed method first identifies a small number of candidates by searching an R*-tree and then picks out true answers from them. We prove its robustness formally, and also show its effectiveness via extensive experiments.

AB - This paper addresses the problem of timestamped event sequence matching, a new type of sequence matching that retrieves the occurrences of interesting patterns from a timestamped event sequence. Timestamped event sequence matching is useful for discovering temporal causal relationships among timestamped events. In this paper, we first point out the shortcomings of prior approaches to this problem and then propose a novel method that employs an R*-tree to overcome them. To build an R*-tree, it places a time window at every position of a times-tamped event sequence and represents each window as an n-dimensional rectangle by considering the first and last occurrence times of each event type. Here, n is the total number of disparate event types that may occur in a target application. When n is large, we apply a grouping technique to reduce the dimensionality of an R*-tree. To retrieve the occurrences of a query pattern from a timestamped event sequence, the proposed method first identifies a small number of candidates by searching an R*-tree and then picks out true answers from them. We prove its robustness formally, and also show its effectiveness via extensive experiments.

UR - http://www.scopus.com/inward/record.url?scp=26844505469&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26844505469&partnerID=8YFLogxK

M3 - Conference article

VL - 3588

SP - 493

EP - 502

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -