Supporting scalable Bayesian networks using configurable discretizer actuators

Abstract

The authors propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Their solution is based on a concurrent distribution of the actuators and uses dynamic memory management schemes to provide a complete scalable basis for the optimization strategy. This prevents the limited memory from halting while minimizing the discretization time and adapting new observations without re-scanning the entire old data. Using different discretization algorithms on publicly available massive datasets, the auhtors conducted a number of experiments which showed that using our discretizer actuators with the Hellinger’s algorithm results in better performance compared to using conventional discretization algorithms implemented in the Hugin and Weka in terms of memory and computational resources. By showing that massive numerical datasets can be discretized within limited memory and time, these results suggest the integration of their configurable actuators into the learning process to reduce the computational complexity of modeling Bayesian networks to a minimum acceptable level.