DocumentCode :
2639337
Title :
Application of multi-level compressed decision tree in computer forensics
Author :
Guo-Cheng, Zheng ; Shu-Fen, Liu ; Long, Wu
Author_Institution :
Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China
fYear :
2010
fDate :
16-17 Aug. 2010
Firstpage :
323
Lastpage :
330
Abstract :
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.
Keywords :
computer forensics; data compression; decision trees; pattern classification; C4.5 algorithm; CART algorithm; classification granularity; computer forensics; decision classification; decision efficiency; multilevel compressed decision tree; Algorithm design and analysis; Classification algorithms; Classification tree analysis; Computers; Entropy; Forensics; C4.5; Computer Forensics; Decision Tree; Multi-level Compression Algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Web Society (SWS), 2010 IEEE 2nd Symposium on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-6356-5
Type :
conf
DOI :
10.1109/SWS.2010.5607431
Filename :
5607431
Link To Document :
بازگشت