When learning the structure of a Bayesian network,the search space expands significantly as the network size and the number of nodes increase,leading to a noticeable decrease in algorithm efficiency.Traditional constr...When learning the structure of a Bayesian network,the search space expands significantly as the network size and the number of nodes increase,leading to a noticeable decrease in algorithm efficiency.Traditional constraint-based methods typically rely on the results of conditional independence tests.However,excessive reliance on these test results can lead to a series of problems,including increased computational complexity and inaccurate results,especially when dealing with large-scale networks where performance bottlenecks are particularly evident.To overcome these challenges,we propose a Markov blanket discovery algorithm based on constrained local neighborhoods for constructing undirected independence graphs.This method uses the Markov blanket discovery algorithm to refine the constraints in the initial search space,sets an appropriate constraint radius,thereby reducing the initial computational cost of the algorithm and effectively narrowing the initial solution range.Specifically,the method first determines the local neighborhood space to limit the search range,thereby reducing the number of possible graph structures that need to be considered.This process not only improves the accuracy of the search space constraints but also significantly reduces the number of conditional independence tests.By performing conditional independence tests within the local neighborhood of each node,the method avoids comprehensive tests across the entire network,greatly reducing computational complexity.At the same time,the setting of the constraint radius further improves computational efficiency while ensuring accuracy.Compared to other algorithms,this method can quickly and efficiently construct undirected independence graphs while maintaining high accuracy.Experimental simulation results show that,this method has significant advantages in obtaining the structure of undirected independence graphs,not only maintaining an accuracy of over 96%but also reducing the number of conditional independence tests by at least 50%.This significant performance improvement is due to the effective constraint on the search space and the fine control of computational costs.展开更多
最大信息系数(Maximum information coefficient,MIC)可以对变量间的线性和非线性关系,以及非函数依赖关系进行有效度量.本文首先根据最大信息系数理论,提出了一种评价各维特征间以及每维特征与类别间相关性的度量标准,然后提出了基于...最大信息系数(Maximum information coefficient,MIC)可以对变量间的线性和非线性关系,以及非函数依赖关系进行有效度量.本文首先根据最大信息系数理论,提出了一种评价各维特征间以及每维特征与类别间相关性的度量标准,然后提出了基于新度量标准的近似马尔科夫毯特征选择方法,删除冗余特征.在此基础上提出了基于特征排序和近似马尔科夫毯的两阶段特征选择方法,分别对特征的相关性和冗余性进行分析,选择有效的特征子集.在UCI和ASU上的多个公开数据集上的对比实验表明,本文提出的方法总体优于快速相关滤波(Fast correlation-based filter,FCBF)方法,与Relief F,FAST,Lasso和RFS方法相比也具有优势.展开更多
基金This work is supported by the National Natural Science Foundation of China(62262016,61961160706,62231010)14th Five-Year Plan Civil Aerospace Technology Preliminary Research Project(D040405)the National Key Laboratory Foundation 2022-JCJQ-LB-006(Grant No.6142411212201).
文摘When learning the structure of a Bayesian network,the search space expands significantly as the network size and the number of nodes increase,leading to a noticeable decrease in algorithm efficiency.Traditional constraint-based methods typically rely on the results of conditional independence tests.However,excessive reliance on these test results can lead to a series of problems,including increased computational complexity and inaccurate results,especially when dealing with large-scale networks where performance bottlenecks are particularly evident.To overcome these challenges,we propose a Markov blanket discovery algorithm based on constrained local neighborhoods for constructing undirected independence graphs.This method uses the Markov blanket discovery algorithm to refine the constraints in the initial search space,sets an appropriate constraint radius,thereby reducing the initial computational cost of the algorithm and effectively narrowing the initial solution range.Specifically,the method first determines the local neighborhood space to limit the search range,thereby reducing the number of possible graph structures that need to be considered.This process not only improves the accuracy of the search space constraints but also significantly reduces the number of conditional independence tests.By performing conditional independence tests within the local neighborhood of each node,the method avoids comprehensive tests across the entire network,greatly reducing computational complexity.At the same time,the setting of the constraint radius further improves computational efficiency while ensuring accuracy.Compared to other algorithms,this method can quickly and efficiently construct undirected independence graphs while maintaining high accuracy.Experimental simulation results show that,this method has significant advantages in obtaining the structure of undirected independence graphs,not only maintaining an accuracy of over 96%but also reducing the number of conditional independence tests by at least 50%.This significant performance improvement is due to the effective constraint on the search space and the fine control of computational costs.
