Node order is one of the most important factors in learning the structure of a Bayesian network(BN)for probabilistic reasoning.To improve the BN structure learning,we propose a node order learning algorithmbased on th...Node order is one of the most important factors in learning the structure of a Bayesian network(BN)for probabilistic reasoning.To improve the BN structure learning,we propose a node order learning algorithmbased on the frequently used Bayesian information criterion(BIC)score function.The algorithm dramatically reduces the space of node order and makes the results of BN learning more stable and effective.Specifically,we first find the most dependent node for each individual node,prove analytically that the dependencies are undirected,and then construct undirected subgraphs UG.Secondly,the UG-is examined and connected into a single undirected graph UGC.The relation between the subgraph number and the node number is analyzed.Thirdly,we provide the rules of orienting directions for all edges in UGC,which converts it into a directed acyclic graph(DAG).Further,we rank the DAG’s topology order and describe the BIC-based node order learning algorithm.Its complexity analysis shows that the algorithm can be conducted in linear time with respect to the number of samples,and in polynomial time with respect to the number of variables.Finally,experimental results demonstrate significant performance improvement by comparing with other methods.展开更多
Based on a node group <img src="Edit_effba4ca-e855-418a-8a72-d70cb1ec3470.png" width="240" height="46" alt="" />, the Newman type rational operator is constructed in the p...Based on a node group <img src="Edit_effba4ca-e855-418a-8a72-d70cb1ec3470.png" width="240" height="46" alt="" />, the Newman type rational operator is constructed in the paper. The convergence rate of approximation to a class of non-smooth functions is discussed, which is <img src="Edit_174e8f70-651b-4abb-a8f3-a16a576536dc.png" width="85" height="50" alt="" /> regarding to <em>X</em>. Moreover, if the operator is constructed based on further subdivision nodes, the convergence rate is <img src="Edit_557b3a01-7f56-41c0-bb67-deab88b9cc63.png" width="85" height="45" alt="" />. The result in this paper is superior to the approximation results based on equidistant nodes, Chebyshev nodes of the first kind and Chebyshev nodes of the second kind.展开更多
基金The work partially supported by the National Natural Science Foundation of China(Grant Nos.61432011,U1435212,61322211 and 61672332)the Postdoctoral Science Foundation of China(2016M591409)+1 种基金the Natural Science Foundation of Shanxi Province,China(201801D121115 and 2013011016-4)Research Project Supported by Shanxi Scholarship Council of China(2020-095).
文摘Node order is one of the most important factors in learning the structure of a Bayesian network(BN)for probabilistic reasoning.To improve the BN structure learning,we propose a node order learning algorithmbased on the frequently used Bayesian information criterion(BIC)score function.The algorithm dramatically reduces the space of node order and makes the results of BN learning more stable and effective.Specifically,we first find the most dependent node for each individual node,prove analytically that the dependencies are undirected,and then construct undirected subgraphs UG.Secondly,the UG-is examined and connected into a single undirected graph UGC.The relation between the subgraph number and the node number is analyzed.Thirdly,we provide the rules of orienting directions for all edges in UGC,which converts it into a directed acyclic graph(DAG).Further,we rank the DAG’s topology order and describe the BIC-based node order learning algorithm.Its complexity analysis shows that the algorithm can be conducted in linear time with respect to the number of samples,and in polynomial time with respect to the number of variables.Finally,experimental results demonstrate significant performance improvement by comparing with other methods.
文摘Based on a node group <img src="Edit_effba4ca-e855-418a-8a72-d70cb1ec3470.png" width="240" height="46" alt="" />, the Newman type rational operator is constructed in the paper. The convergence rate of approximation to a class of non-smooth functions is discussed, which is <img src="Edit_174e8f70-651b-4abb-a8f3-a16a576536dc.png" width="85" height="50" alt="" /> regarding to <em>X</em>. Moreover, if the operator is constructed based on further subdivision nodes, the convergence rate is <img src="Edit_557b3a01-7f56-41c0-bb67-deab88b9cc63.png" width="85" height="45" alt="" />. The result in this paper is superior to the approximation results based on equidistant nodes, Chebyshev nodes of the first kind and Chebyshev nodes of the second kind.