Incremental Discretization Algorithm (IDA)

Incremental Discretization Algorithm (IDA) approximates quantile-based discretization on the entire data stream encountered to date by maintaining a random sample of the data which is used to calculate the cut points. IDA uses the reservoir sampling algorithm to maintain a sample drawn uniformly at random from the entire stream up until the current time.

Status

Use

val ida = IDADiscretizerTransformer()
  .setBins(5)
val discretizedIris = ida transform dataSet

Release

The latest version is : 0.1.0 / Date: 2018-09-28  / Scala version: 2.11.12

Reference

G. I. Webb. 2014. Contrary to Popular Belief Incremental Discretization can be Sound, Computationally Efficient and Extremely Useful for Streaming Data. In Proceedings of the 2014 IEEE International Conference on Data Mining (ICDM ‘14). IEEE Computer Society, Washington, DC, USA, 1031-1036.