Skip to main content

A New Clustering Algorithm for Time Series Analysis

  • Chapter
Intelligent Control and Automation

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 344))

  • 107 Accesses

Abstract

Conventional model-based clustering algorithms for time series data are limited in improving the clustering performance and also their computation complexity is high. In order to tackle this problem, a new model-based clustering algorithm with a certainty factor is proposed to evaluate the certainty degree of time series data being in a cluster. The new algorithm can be used to show a reasonable result for time series data clustering and reduce the computation complexity greatly. Performance of the algorithm is verified by the experiments on both synthetic data and real data.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zhong S., Ghosh, J.: A Unified Framework for Model-based Clustering. Journal of Machine Learning Research, 4 (2003) 1001–1037

    Article  MathSciNet  Google Scholar 

  2. Bicego, M., Murino, V., Figueiredo, M. A. T.: Similarity-based Clustering of Sequences Using Hidden Markov Models. Machine Learning and Data Mining, 12 (2003) 86–95

    Google Scholar 

  3. Zhong S.: Probabilistic Model-based Clustering of Complex Data. The University of Texas at Austin. Ph.D. Thesis, USA (2003)

    Google Scholar 

  4. Tobias, S., Christian, D., Stefan, W.: Mining the Web with Active Hidden Markov Models. Proceedings of IEEE International Conference on Data Mining, (2001) 645–646

    Google Scholar 

  5. Buchanan, G., Shortliffe, E.: Rule-Based Expert Systems:The MYCIN Experiments of the Stanford Heuristic Programming Project. Addison-Wesley Publishing Co., New York (1984) 90–104

    Google Scholar 

  6. Shao, J. L., Zhang, J., Wang, C. H.: Fundament of Artificial Intelligence. Electrics industry press of China, Beijing (2003) 97–99

    Google Scholar 

  7. Rabiner, L. R.: A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proceedings of. IEEE. 77(2) (1989) 257–286

    Article  Google Scholar 

  8. Ujjwal, M., Sanghamitra, B.: Performance Evaluation of Some Clustering Algorithms and Validity Indices. IEEE Transaction on pattern analysis and machine intelligence, 12 (2002) 1650–1654

    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 chapter

Cite this chapter

Zeng, J., Guo, D. (2006). A New Clustering Algorithm for Time Series Analysis. In: Huang, DS., Li, K., Irwin, G.W. (eds) Intelligent Control and Automation. Lecture Notes in Control and Information Sciences, vol 344. Springer, Berlin, Heidelberg . https://doi.org/10.1007/978-3-540-37256-1_93

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-37256-1_93

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37255-4

  • Online ISBN: 978-3-540-37256-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics