收藏本站
收藏 | 手机打开
二维码
手机客户端打开本文

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.

知网文化
【相似文献】
中国重要会议论文全文数据库 前1条
1 ;Application of Multi-level Compressed Decision Tree in Computer Forensics[A];Proceedings 2010 IEEE 2nd Symposium on Web Society[C];2010年
中国硕士学位论文全文数据库 前1条
1 于翔;基层派出所民警激励机制研究[D];山东大学;2012年
中国知网广告投放
 快捷付款方式  订购知网充值卡  订购热线  帮助中心
  • 400-819-9993
  • 010-62982499
  • 010-62783978