frequent-algorithm is a Ruby implementation of the Demaine et al FREQUENT algorithm for identifying frequent items in a data stream in sliding windows (c.f Identifying Frequent Items in Sliding Windows over On-Line Packet Streams, 2003).

Required Ruby Version

>= 2.0

Authors

Willie Tong, Brooke M. Fujita

Versions

  1. 0.0.4

    1. source

      1. 0.0.4 source May 06, 2015 (9.5 KB)
  2. 0.0.3

    1. source

      1. 0.0.3 source March 23, 2015 (9 KB)
  3. 0.0.2

    1. source

      1. 0.0.2 source March 19, 2015 (9 KB)
  4. 0.0.1

    1. source

      1. 0.0.1 source March 11, 2015 (6.5 KB)

SHA 256 checksum

← Previous version