Computer Engineering and Applications ›› 2021, Vol. 57 ›› Issue (6): 58-66.DOI: 10.3778/j.issn.1002-8331.2003-0227

Previous Articles     Next Articles

Feature Selection of Markov Blanket for High Dimensional Data

LI Jingxing, YANG Youlong   

  1. School of Mathematics and Statistics, Xidian University, Xi’an 710126, China
  • Online:2021-03-15 Published:2021-03-12



  1. 西安电子科技大学 数学与统计学院,西安 710126


For the problem of high dimensional data classification that does not satisfy the faithful distribution, a new Markov blanket feature selection algorithm based particle swarm optimization is proposed. By effectively extracting relevant features and eliminating redundant features, it can produce better classification results. In the feature preprocessing stage, this algorithm analyzes the correlation and redundancy of features by using the maximum information coefficient measurement standard to obtain the Markov blanket representative set and sub-optimal feature subset of class attributes. In the search and evaluation stage, a new fitness function is used to select the optimal feature subset by particle swarm optimization. The model is used to predict the testing set. Experimental results show that the algorithm has certain advantages on twelve datasets.

Key words: feature selection, maximal information coefficient, Markov blanket representative set, suboptimal feature subset, fitness function, particle swarm optimization



关键词: 特征选择, 最大信息系数, 马尔科夫毯代表集, 次最优特征子集, 适应度函数, 粒子群算法