关键词: 特征选择, Hellinger Distance, 数据挖掘

Abstract: To solve the feature selection problem, two kinds of definitions of Hellinger distance were studied in this paper, and the corresponding feature selection algorithms based on Hellinger distance were also proposed. The experiments on different data sets show the efficiency of the two algorithms. Compared with other feature selection algorithms, the feature selection algorithms based on Hellinger distance can get fewer features, which are useful for C4.5 and can improve the average accuracy of the classification in the learned data sets.

Key words: feature selection, Hellinger distance, data mining