aHUGIN: a system creating adaptive causal probabilistic networks
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Principles of Systems Programming
Principles of Systems Programming
A Permutation Genetic Algorithm For Variable Ordering In Learning Bayesian Networks From Data
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Large-Sample Learning of Bayesian Networks is NP-Hard
The Journal of Machine Learning Research
A Hellinger-based discretization method for numeric attributes in classification learning
Knowledge-Based Systems
Dynamic memory management in the loci framework
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
| Hi-index | 0.00 |
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our 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, we 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 our configurable actuators into the learning process to reduce the computational complexity of modeling Bayesian networks to a minimum acceptable level.