Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424874 | Journal of Applied Logic | 2015 | 15 Pages |
Abstract
We compare three approaches to learning numerical parameters of discrete Bayesian networks from continuous data streams: (1) the EM algorithm applied to all data, (2) the EM algorithm applied to data increments, and (3) the online EM algorithm. Our results show that learning from all data at each step, whenever feasible, leads to the highest parameter accuracy and model classification accuracy. When facing computational limitations, incremental learning approaches are a reasonable alternative. While the differences in speed between incremental algorithms are not large (online EM is slightly slower), for all but small data sets online EM tends to be more accurate than incremental EM.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Parot Ratnapinda, Marek J. Druzdzel,