Efficient string matching: an aid to bibliographic search
Communications of the ACM
Machine Learning
In-Depth Packet Inspection Using a Hierarchical Pattern Matching Algorithm
IEEE Transactions on Dependable and Secure Computing
Hi-index | 0.00 |
Malicious network data are becoming more and more serious nowadays. To deal with this problem, IDSs are used popularly as a security technology that helps to discover, determine and identify unauthorized use of information systems. However, the attacking technologies are becoming more complicated and require more time to detect. In order to make sure that IDS can work efficiently and accurately, novel algorithms need to be applied to adapt to the quick change of attacking technologies. There are many algorithms that are proposed to work on the matching process. Kruegel et al. generated a decision tree that is utilized to find malicious input items using as few redundant comparisons as possible [1]. In this paper, we improve Kruegel's algorithm by changing the clustering strategy for building the decision tree. The experiments show that the quality of the output decision tree could be significantly improved.