Skip to main navigation Skip to search Skip to main content

A data streams clustering algorithm based on interval data

  • Yan Li*
  • , Ming Ye
  • , Huiwen Wang
  • , Dan Liu
  • , Yin Che
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Data stream mining has become a new research direction in recent years, and clustering analysis based on data stream has become a hot spot. Based on Squeezer cluster algorithm, ID-Squeezer, a new algorithm, is proposed, which scores clustering results by interval data and adjusts the upper and lower limits dynamically according to new data within threshold. The algorithm effectively reduces the storage space and retains information of cluster result. The experiment demonstrates the effectiveness of the algorithm we proposed. Copyright

Original languageEnglish
Title of host publication38th International Conference on Computers and Industrial Engineering 2008
Pages2775-2778
Number of pages4
StatePublished - 2008

Publication series

Name38th International Conference on Computers and Industrial Engineering 2008
Volume3

Keywords

  • Clustering analysis
  • Data stream
  • Interval data
  • Squeezer

Fingerprint

Dive into the research topics of 'A data streams clustering algorithm based on interval data'. Together they form a unique fingerprint.

Cite this