CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
An empirical comparison of Bayesian network parameter learning algorithms for continuous data streams
Authors
MJ Druzdzel
P Ratnapinda
Publication date
1 May 2013
Publisher
Abstract
We compare three approaches to learning numerical parameters of 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. Of these, online EM is reasonably fast, and similar to the incremental EM algorithm in terms of accuracy. For small data sets, incremental EM seems to lead to better accuracy. When the data size gets large, online EM tends to be more accurate. Copyright © 2013, Association for the Advancement of Artificial Intelligence. All rights reserved
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
D-Scholarship@Pitt
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:d-scholarship.pitt.edu:191...
Last time updated on 19/07/2013
Name not available
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:d-scholarship.pitt.edu:191...
Last time updated on 15/12/2016
Name not available
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:d-scholarship.pitt.edu:191...
Last time updated on 23/11/2016