Paper: IEEE Data Mining Conference 2007 "Detecting Subdimensional Motifs: An Efficient Algorithm for Generalized Multivariate Pattern Discovery"

Detecting Subdimensional Motifs: An Efficient Algorithm for Generalized Multivariate Pattern Discovery

• Minnen, Essa, Isbell, and Starner (2007), “Detecting Subdimensional Motifs: An Efficient Algorithm for Generalized Multivariate Pattern Discovery,” in Proceedings of IEEE International Conference on Data Mining (ICDM), 2007. [PDF] [DOI]
  [BIBTEX]

  @inproceedings{2007-Minnen-DSMEAGMPD,
    Author = {D. Minnen and I. Essa and C. Isbell and T. Starner},
    Booktitle = {Proceedings of IEEE International Conference on Data Mining (ICDM)},
    Doi = {10.1109/ICDM.2007.52},
    Month = {October},
    Pdf = {http://www.cc.gatech.edu/~irfan/p/2007-Minnen-DSMEAGMPD.pdf},
    Title = {Detecting Subdimensional Motifs: An Efficient Algorithm for Generalized Multivariate Pattern Discovery},
    Year = {2007}}

Abstract

Discovering recurring patterns in time series data is a fundamental problem for temporal data mining. This paper addresses the problem of locating subdimensional motifs in real-valued, multivariate time series, which requires the simultaneous discovery of sets of recurring patterns along with the corresponding relevant dimensions. While many approaches to motif discovery have been developed, most are restricted to categorical data, univariate time series, or multivariate data in which the temporal patterns span all of the dimensions. In this paper, we present an expected linear-time algorithm that addresses a generalization of multivariate pattern discovery in which each motif may span only a subset of the dimensions. To validate our algorithm, we discuss its theoretical properties and empirically evaluate it using several data sets including synthetic data and motion capture data collected by an on-body inertial sensor.