The discretization is one of the most important steps for the application of Rough set theory. In this paper, we analyzed the shortcomings of the current relative works. Then we proposed a novel discretization algorithm based on information loss and gave its mathematical description. This algorithm used information loss as the measure so as to reduce the loss of the information entropy during discretizating. The algorithm was applied to different samples with the same attributes from KDDcup99 and intrusion detection systems. The experimental results show that this algorithm is sensitive to the samples only for parts of all attributes. But it dose not compromise the effect of intrusion detection and it improves the response performance of intrusion detection remarkably.
Chi-Square Discretization Algorithm of Continuous Attribute Based on Information Entropy
