Child pages
  • Burst Detection

Versions Compared


  • This line was added.
  • This line was removed.
  • Formatting was changed.

This Burst burst detection algorithm is implemented based on the Jon Kleinberg's, Bursty and Heirarchical Structure in Stream. A burst is a period of increased activity, determined by minimizing a cost function that assumes a set of possible states (not bursting and various degrees of burstiness) with increasing event frequencies, where it is expensive (costly) to go up a level and cheap (zero-cost) to decrease a level. It is useful for text stream analysis (such as emails, corpus, publication) where you want to know the activity of the stream in a period of time.