Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2018, Vol. 41 ›› Issue (4): 86-90.doi: 10.13190/j.jbupt.2017-229

• Reports • Previous Articles     Next Articles

FCBF Feature Selection Algorithm Based on Maximum Information Coefficient

ZHANG Li, YUAN Yu-yu, WANG Cong   

  1. Key Laboratory of Trustworthy Distributed Computing and Service(Ministry of Education), Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2017-12-05 Online:2018-08-28 Published:2018-10-09

Abstract: Based on the correlation fast Filtering Feature selection algorithm (FCBF),which is improved by the maximum correlation coefficient. Firstly, It calculates the correlation measure between each feature and label with the ‘maximum normalized information coefficient’ criterion and ‘measurement principle of symmetric uncertainty’ and sort these feature according to the calculated value.Finally, It filters irrelevant features and redundant features by the ‘maximum normalized information coefficient’ criterion and approximate Markov Blanket and obtain the optimal feature subset. Experimental results on machine learning repository of university of california irvine(UCI) eight open datasets show that NFCBF algorithm outperforms FCBF algorithm. The number of features selected by feature selection algorithm based on maximum information coefficient (NFCBF algorithm) is less than 3.625 of the selected feature subset of FCBF algorithm, and the classification accuracy is improved by 0.075%. NFCBF algorithm gives better performance than mutual information maximization algorithm(MIM), Least absolute shrinkage and selection operator algorithm(Lasso) and Ridge algorithm.

Key words: maximal information coefficient, fast correlation based feature selection, feature relevance, feature redundancy, classification

CLC Number: