Adaptive Segmentation-Based Symbolic Representations of Time Series for Better Modeling and Lower Bounding Distance Measures

  • Bernard Hugueney
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4213)


Time series data-mining algorithms usually scale poorly with regard to dimensionality. Symbolic representations have proven to be a very effective way to reduce the dimensionality of time series even using simple aggregations over episodes of the same length and a fixed set of symbols. However, computing adaptive symbolic representations would enable more accurate representations of the dataset without compromising the dimensionality reduction. Therefore we propose a new generic framework to compute adaptive Segmentation Based Symbolic Representations (SBSR) of time series. SBSR can be applied to any model but we focus on piecewise constant models (SBSRL0) which are the most commonly used. SBSR are built by computing both the episode boundaries and the symbolic alphabet in order to minimize information loss of the resulting symbolic representation. We also propose a new distance measure for SBSRL0 tightly lower bounding the euclidean distance measure.


Time Series Symbolic Representation Daily Extract Adaptive Representation Time Series Database 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Hébrail, G., Hugueney, B.: Symbolic representation of long time series. In: Conference on Applied Statistical Models and Data Analysis (ASMDA), June 2001, pp. 537–542 (2001)Google Scholar
  2. 2.
    Hugueney, B.: Expanded version of Adaptive Segmentation-Based Symbolic Representations of Time Series for BetterModeling and Lower Bounding DistanceMeasures,
  3. 3.
    Hugueney, B.: Représentations symboliques de longues series temporelles. PhD thesis, LIP6 (2003)Google Scholar
  4. 4.
    Hugueney, B., Hébrail, G., Lechevallier, Y.: Computing summaries of time series databases with clustering and segmentation. Int. Fed. of Classification Societies (2006)Google Scholar
  5. 5.
    Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Locally adaptive dimensionality reduction for indexing large time series databases. SIGMOD Record (ACM Special Interest Group on Management of Data) 30(2), 151–162 (2001)Google Scholar
  6. 6.
    Keogh, E., Pazanni, M.J.: An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback. In: Heckerman, D., Mannila, H., Pregibon, D., Uthurusamy, R. (eds.) Proceedings of the Forth International Conference on Knowledge Discovery and Data Mining (KDD 1998). AAAI Press, Menlo Park (1998)Google Scholar
  7. 7.
    Keogh, E.J., Chakrabarti, K., Pazzani, M.J., Mehrotra, S.: Dimensionality reduction for fast similarity search in large time series databases. Knowledge and Information Systems Journal (2000)Google Scholar
  8. 8.
    Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady 10(8), 707–710 (1966); Doklady Akademii Nauk SSSR 163(4), 845–848 (1965) MathSciNetGoogle Scholar
  9. 9.
    Lin, J., Keogh, E., Lonardi, S., Chiu, B.: A symbolic representation of time series, with implications for streaming algorithms. In: Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery, pp. 2–11. ACM Press, New York (2003)CrossRefGoogle Scholar
  10. 10.
    Love, P.L., Simaan, M.: Automatic recognition of primitive changes in manufacturing process signals. Pattern Recognition 21(4), 333–342 (1988)CrossRefGoogle Scholar
  11. 11.
    MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281–297 (1967)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Bernard Hugueney
    • 1
  1. 1.LAMSADE Place du Maréchal de Lattre de TassignyUniversitè PARIS-DAUPHINEPARIS

Personalised recommendations