Computing Information Gain in Data Streams
Alec Pawling, Nitesh V. Chawla, Amitabh Chaudhary · 2005
Computing information gain in general data streams, in which we do not make any assumptions on the underlying distributions or domains, is a hard problem, severely constrained by the limitations on memory space. We present a simple randomized solution to this problem that is time and space efficient as well as tolerates a relative error that has a theoretical upper bound. It is based on a novel method of discretization of continuous domains using quantiles. Our empirical evaluation of the technique, using standard and simulated datasets, convincinglydemonstratesits practicality and robustness. Our results include accuracy versus memory usage plots and comparisons with a popular discretization technique.