Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency

@article{Novak2012GenericSM,
  title={Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency},
  author={David Novak and Petr Volny and Pavel Zezula},
  journal={ArXiv},
  year={2012},
  volume={abs/1206.2510}
}
  • David Novak, Petr Volny, Pavel Zezula
  • Published 2012
  • Computer Science
  • ArXiv
  • Subsequence matching has appeared to be an ideal approach for solving many problems related to the fields of data mining and similarity retrieval. It has been shown that almost any data class (audio, image, biometrics, signals) is or can be represented by some kind of time series or string of symbols, which can be seen as an input for various subsequence matching approaches. The variety of data types, specific tasks and their solutions is so wide that their proper comparison and combination… CONTINUE READING
    3
    Twitter Mentions

    Figures, Tables, and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 34 REFERENCES

    Fast Subsequence Matching in Time-Series Databases

    • Clu-istos Foutsos, M. llanganatan, Yanais Maaolopoulo
    • 1994
    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    Duality-based subsequence matching in time-series databases

    VIEW 3 EXCERPTS

    Discovering similar multidimensional trajectories

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    Fast Time Sequence Indexing for Arbitrary Lp Norms

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    Robust and fast similarity search for moving object trajectories

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL