Jump to content United States-English
HP.com Home Products and Services Support and Drivers Solutions How to Buy
» Contact HP

hp.com home

Technical Reports

printable version

HP Labs

» Research
» News and events
» Technical reports
» About HP Labs
» Careers @ HP Labs
» People
» Worldwide sites
» Downloads
Content starts here

  Click here for full text: PDF

Online Learning of Bayesian Network Parameters

Cohen, Ira; Bronstein, Alexandre; Cozman, Fabio G.


Keyword(s): No keywords available.

Abstract: The paper introduces Voting EM, an online learning algorithm of Bayesian network parameters that builds on the EM(n) algorithm suggested by (Bauer et al., 1997). We prove convergence properties of the algorithm in the mean and variance, and demonstrate the algorithm's behavior on synthetic data. We show the relationship between Maximum-Likelihood (ML) counting and Voting EM. We demonstrate that Voting EM is able to adapt to changes in the modelled environment and to escape local maxima of the likelihood function. Voting EM also handles both the complete and missing data cases. We use the convergence properties to further improve Voting EM by automatically adapting the learning rate n. The resultant enhanced Voting EM algorithm converges more quickly and more closely to the true CPT parameters; further, it adapts more rapidly to changes in the modelled environment.

8 Pages

Back to Index

»Technical Reports

» 2009
» 2008
» 2007
» 2006
» 2005
» 2004
» 2003
» 2002
» 2001
» 2000
» 1990 - 1999

Heritage Technical Reports

» Compaq & DEC Technical Reports
» Tandem Technical Reports
Privacy statement Using this site means you accept its terms Feedback to HP Labs
© 2009 Hewlett-Packard Development Company, L.P.