Mining Delay in Streaming Time Series of Industrial Process

  • Haijie Gu
  • Gang Rong
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4093)


Time delay is a general phenomenon in industrial process. Accurate evaluation on delay is important in data preprocessing when mine manufactory process data. As typical streaming time series, sensors’ data of industrial process have attracted much attention recently. A new concept , trend similarity search, is proposed based on raw monotony between two industrial process variables. The new concept is for those two time series which are similar only in trend but dissimilar in shape, whereas similarity search may not do well in such condition. An algorithm DelayMine is also proposed to mine delay between two interrelated time series by trend similarity search. Moreover, the DelayMine is extended to online algorithm for processing streaming time series. The properties and performance of DelayMine is demonstrated through experiments both on systems with steady and time-varying delay.


Time Series Data Stream Online Algorithm Mining Delay Piecewise Linear Regression 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gaber, M.M., Zaslavsky, A., Krishnaswamy, S.: Mining Data Streams: A Review. SIGMOD Record 34(2), 18–26 (2005)CrossRefGoogle Scholar
  2. 2.
    Hulten, G., Spencer, L., Domingos, P.: Mining Time-Changing Data Streams. In: Proc. ACM SIGKDD, pp. 97–106 (2001)Google Scholar
  3. 3.
    Kifer, D., Ben-David, S., Gehrke, J.: Detecting Change in Data Streams. In: Proc. VLDB, pp. 180–191 (2004)Google Scholar
  4. 4.
    Gao, L., Wang, X.S.: Continually evaluating similarity-based pattern queries on a streaming time series. In: Proc. SIGMOD, pp. 370–381 (2002)Google Scholar
  5. 5.
    Palpanas, T., Vlachos, M., Keogh, E.J., Gunopulos, D., Truppel, W.: Online Amnesic Approximation of Streaming Time Series. In: Proc. ICDE, pp. 338–349 (2004)Google Scholar
  6. 6.
    Perng, C.S., Wang, H., Zhang, S.R., Parker, D.S.: Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases. In: Proc. ICDE, pp. 33–44 (2000)Google Scholar
  7. 7.
    Yi, B.-K., Jagadish, H., Faloutsos, C.: Efficient retrieval of similar time sequences under time warping. In: Proc. ICDE, pp. 201–208 (1998)Google Scholar
  8. 8.
    Chen, Y., Dong, G., Han, J., Wah, B.W., Wang, J.: Multi-Dimensional Regression Analysis of Time-Series Data Streams. In: Proc. VLDB, pp. 323–334 (2002)Google Scholar
  9. 9.
    Keogh, E.J., Chakrabarti, K., Mehrotra, S., Pazzani, M.J.: Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases. In: Proc. ACM SIGMOD, pp. 151–162 (2001)Google Scholar
  10. 10.
    Keogh, E.J., Pazzani, M.J.: An Enhanced Representation of Time Series Which Allows Fast and Accurate Classification, Clustering and Relevance Feedback. In: Proc. KDD, pp. 239–243 (1998)Google Scholar
  11. 11.
    Lin, J., Keogh, E., Lonardi, S., Chiu, B.: A symbolic representation of time series, with implications for streaming algorithms. In: Proc. DMKD, pp. 2–11 (2003)Google Scholar
  12. 12.
    Shatkay, H., Zdonik, S.B.: Approximate Queries and Representations for Large Data Sequences. In: Proc. ICDE, pp. 536–545 (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Haijie Gu
    • 1
  • Gang Rong
    • 1
  1. 1.National Key Laboratory of Industrial Control TechnologyZhejiang UniversityHangzhouP.R. China

Personalised recommendations