Abstract
The traditional structure learning algorithms are mainly faced with a large sample dataset. But the sample dataset practically is small. Based on it, we introduce the Probability Density Kernel Estimation (PDKE), which would achieve the expansion of the original sample sets. Then, the K2 algorithm is used to learn the Bayesian network structure. By optimizing the kernel function and window width, PDKE achieves the effective expansion of the original dataset. After the confirm of variable order based on mutual information, a small sample set of Bayesian structure learning algorithm would be established. Finally, simulation results confirm that the new algorithm is effective and practical.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
