Application of multi-level compressed decision tree in computer forensics

C4.5 algorithm need scan and sort the data repeatedly before it can construct the tree and the CART algorithm doesn´t classify the data set. The Multi-level compressed algorithm overcomes the shortcomings of the above algorithms, and it optimizes the classification granularity and the scale of the tree, which highly improve the decision efficiency. Using decision classification to build multi-level decision tree not only accelerates the growth of the tree, but also can get well-structured tree, which can make it easy to get rule information.