A Feature Selection Algorithm of Dynamic Data-Stream Based on Hoeffding Inequality

With the rapid development of the Internet, the application of data mining in the Internet is becoming more and more extensive. However, the complex data source's features are making the data mining process become very inefficient. In order to make data mining more efficient and simple, feature selection research is essential. In this paper, a new metric of mutual information based on mutual information is proposed (measure the correlation degree of the internal features of the collection), additionally Hoeffding inequality is also introduced to construct the HSF algorithm. The HSF is compared with the BIF (based on mutual information feature selection algorithm), the C4.5 classification algorithm is used as the testing algorithm for the experiments. Experiments show that HSF has better performance than BIF [1] in classification accuracy and error rate.