Skip to main content

Mining Delay in Streaming Time Series of Industrial Process

  • Conference paper
Advanced Data Mining and Applications (ADMA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4093))

Included in the following conference series:

  • 2971 Accesses

Abstract

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.

This work is supported by National Natural Science Foundation of China (60421002).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Gaber, M.M., Zaslavsky, A., Krishnaswamy, S.: Mining Data Streams: A Review. SIGMOD Record 34(2), 18–26 (2005)

    Article  Google Scholar 

  2. Hulten, G., Spencer, L., Domingos, P.: Mining Time-Changing Data Streams. In: Proc. ACM SIGKDD, pp. 97–106 (2001)

    Google Scholar 

  3. Kifer, D., Ben-David, S., Gehrke, J.: Detecting Change in Data Streams. In: Proc. VLDB, pp. 180–191 (2004)

    Google Scholar 

  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. 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. 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. 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. 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. 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. 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. 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. Shatkay, H., Zdonik, S.B.: Approximate Queries and Representations for Large Data Sequences. In: Proc. ICDE, pp. 536–545 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gu, H., Rong, G. (2006). Mining Delay in Streaming Time Series of Industrial Process. In: Li, X., Zaïane, O.R., Li, Z. (eds) Advanced Data Mining and Applications. ADMA 2006. Lecture Notes in Computer Science(), vol 4093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11811305_79

Download citation

  • DOI: https://doi.org/10.1007/11811305_79

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37025-3

  • Online ISBN: 978-3-540-37026-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics