• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Wang Shuangcheng, Leng Cuiping, Cao Feng. Revising the Parameters of Bayesian Network with Multi-Father Nodes from Small Data Set[J]. Journal of Computer Research and Development, 2009, 46(5): 787-793.
Citation: Wang Shuangcheng, Leng Cuiping, Cao Feng. Revising the Parameters of Bayesian Network with Multi-Father Nodes from Small Data Set[J]. Journal of Computer Research and Development, 2009, 46(5): 787-793.

Revising the Parameters of Bayesian Network with Multi-Father Nodes from Small Data Set

More Information
  • Published Date: May 14, 2009
  • Bayesian networks are graphical representations of dependency relationships between variables. They are intuitive representations of knowledge and are akin to human reasoning paradigms. They are powerful tools to deal with uncertainties, and have been extensively used to the representation and reasoning of uncertain knowledge. In the past decades, they have been successfully applied in medical diagnoses, software intelligence, finance risk analysis, DNA functional analysis, Web mining and so on; and have become a rapidly growing field of research. Bayesian network learning is the foundation of its application. It includes structure learning and parameters learning. Research on parameters learning of Bayesian network with multi-father nodes from small data sets is important and challenging. Due to the insufficiency of information, many parameters of multi-father nodes can not be directly estimated. It is the key problem how these parameters can be effectively learned. In this paper, an effective and applied method of learning Bayesian network parameters with multi-father nodes from small data set is developed. Firstly, a small data set is extended by using bootstrap sampling. Then, Gibbs sampling is combined with maximum likelihood tree and Bayesian network respectively. Finally, the parameters of multi-father nodes are learned by revising a part of extended data in a certain proportion iteratively. Experimental results show that this method can efficiently learn a majority of parameters of multi-father nodes.
  • Related Articles

    [1]Feng Yuhong, Wu Kunhan, Huang Zhihong, Feng Yangzhou, Chen Huanhuan, Bai Jiancong, Ming Zhong. A Set Similarity Self-Join Algorithm with FP-tree and MapReduce[J]. Journal of Computer Research and Development, 2023, 60(12): 2890-2906. DOI: 10.7544/issn1000-1239.202111239
    [2]Liu Yang, Jin Peiquan. ZB+-tree: A Novel ZNS SSD-Aware Index Structure[J]. Journal of Computer Research and Development, 2023, 60(3): 509-524. DOI: 10.7544/issn1000-1239.202220502
    [3]Liu Siguang, Ouyang Dantong, Wang Yiyuan, Jia Fengyu, Zhang Liming. Algorithm of Computing Minimal Hitting Set Based on the Structural Feature of SE-Tree[J]. Journal of Computer Research and Development, 2016, 53(11): 2556-2566. DOI: 10.7544/issn1000-1239.2016.20150396
    [4]Shen Yan, Song Shunlin, Zhu Yuquan. Mining Algorithm of Association Rules Based on Disk Table Resident FP-TREE[J]. Journal of Computer Research and Development, 2012, 49(6): 1313-1322.
    [5]Zhang Liming, Ouyang Dantong, and Zeng Hailin. Computing the Minimal Hitting Sets Based on Dynamic Maximum Degree[J]. Journal of Computer Research and Development, 2011, 48(2): 209-215.
    [6]Wang Lihong, Zhao Xianjia, Wu Shuanhu. Semi-supervised Learning of Promoter Sequences Based on EM Algorithm[J]. Journal of Computer Research and Development, 2009, 46(11): 1942-1948.
    [7]Li Jianfu, Guo Maozu, and Liu Yang. An Evolutionary Tree Reconstruction Method Combining Quartet Puzzling and Neighbor Joining[J]. Journal of Computer Research and Development, 2008, 45(11): 1965-1973.
    [8]Wang Liming and Zhao Hui. Algorithms of Mining Global Maximum Frequent Itemsets Based on FP-Tree[J]. Journal of Computer Research and Development, 2007, 44(3).
    [9]Hao Yu, Ye Shiwei. Study of the Counterpropagation Network Based on the EM Algorithm and Its Application[J]. Journal of Computer Research and Development, 2006, 43(5): 856-861.
    [10]Song Yuqing, Zhu Yuquan, Sun Zhihui, Yang Hebiao. An Algorithm and Its Updating Algorithm Based on Frequent Pattern Tree for Mining Constrained Maximum Frequent Itemsets[J]. Journal of Computer Research and Development, 2005, 42(5): 777-783.

Catalog

    Article views (947) PDF downloads (641) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return