Abstract
Learning Bayesian network structure from large-scale data sets, without any expert-specified ordering of variables, remains a difficult problem. We propose systematic improvements to automatically learn Bayesian network structure from data. (1) We propose a linear parent search method to generate candidate graph. (2) We propose a comprehensive approach to eliminate cycles using minimal likelihood loss, a short cycle first heuristic, and a cut-edge repairing. (3) We propose structure perturbation to assess the stability of the network and a stability-improvement method to refine the network structure. The algorithms are easy to implement and efficient for large networks. Experimental results on two data sets show that our new approach outperforms existing methods.
Keywords
Bayesian networkComputer scienceStability (learning theory)HeuristicGraphArtificial intelligenceVariable-order Bayesian networkNetwork structureBayesian probabilityMachine learningData miningTheoretical computer scienceBayesian inference
Affiliated Institutions
Related Publications
Model-Based Clustering, Discriminant Analysis, and Density Estimation
Cluster analysis is the automated search for groups of related observations in a dataset. Most clustering done in practice is based largely on heuristic but intuitively reasonab...
Stability-Based Validation of Clustering Solutions
Data clustering describes a set of frequently employed techniques in exploratory data analysis to extract “natural” group structure in data. Such groupings need to be validated ...
A Bayesian Morphometry Algorithm
Most methods for structure-function analysis of the brain in medical images are usually based on voxel-wise statistical tests performed on registered magnetic resonance (MR) ima...
Smooth Skyride through a Rough Skyline: Bayesian Coalescent-Based Inference of Population Dynamics
Kingman's coalescent process opens the door for estimation of population genetics model parameters from molecular sequences. One paramount parameter of interest is the effective...
Normalized cuts and image segmentation
We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach...
Publication Info
- Year
- 2004
- Type
- article
- Volume
- 1
- Pages
- 621-624
- Citations
- 22
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
22
OpenAlex
Cite This
Hanchuan Peng,
Changjiang Ding
(2004).
Structure search and stability enhancement of Bayesian networks.
, 1
, 621-624.
https://doi.org/10.1109/icdm.2003.1250992
Identifiers
- DOI
- 10.1109/icdm.2003.1250992