关键词: 特征选择，条件互信息，最小联合互信息亏损，快速实现

Abstract: In this paper, a minimum joint mutual information loss-based optimal feature selection algorithm was proposed,which firstly finds a non-discriminate feature subset of the original set via a dynamic incremental searching stratagy,and then eliminates false positives by keeping minimum joint mutual information loss with class in each iteration using a minimal conditional mutual information criterion, in such a way as to obtain an approximate optimal feature subset. Furthermore, for the computationally intractable problem arising in high dimensional feature space that characterizes the existing method of conditional independence test with conditional mutual information, a fast implementation of conditional mutual information estimation was introduced and used to implement the proposed algorithm. Experimental resups for the classification task show that the proposed algorithm performs better than the representative feature selection algorithms. Experimental results for the execution task show that the proposed implementation of conditional mutual information estimation has a considerable advantage.

Key words: Feature selection,Conditional mutual information,Minimum joint mutual information loss,Fast implementation