期刊文献+

基于多目标最优化的最小代价决策树构建与实现 被引量:2

Construction and Implementution of Minimum Cost Decision Tree Based on Multi-Objective Optimization
下载PDF
导出
摘要 提出一种基于多目标最优化的代价敏感决策树构建方法。将误分类代价、测试代价、等待时间代价和信息增益率作为四个优化目标,利用线性加权和法把多目标最优化问题转化成单目标最优化问题,作为分裂属性选择的准则。然后提出了构建最小代价决策树的具体策略和测试决策树的一个混合测试方法。最后,用该算法和其它两个算法在两个真实的数据集中进行构建、测试,实验结果表明,该方法获得的决策树具有更小的代价,效率更高,泛化能力更强。该方法在医疗诊断中表现尤为突出。 A multi-objective optimization based on the cost sensitive decision tree building method is proposed.The misclassification cost,test cost,waiting time cost and information gain rate as four optimization goal,the method of linear weighting is used to transfer the multi-objective optimization problem into single objective optimization problem,as the splitting attribute selection criterion.And then the concrete strategy of building the minimum cost decision tree and a hybrid testing decision tree method are put forward.Finally,the algorithm and two other algorithms in two real datasets are used to build decision trees and test the trees,and experimental results show that the decision tree obtained by this method has a smaller cost,more efficient and stronger generalization ability.The method is especially useful in medical diagnostic.
作者 曹礼园 李深洛 CAO Liyuan;LI Shenluo(Guangdong University of Science&Technology,Dongguan 523083;School of Computer Science and Information Engineering,Guangxi Normal University,Guilin 541004)
出处 《计算机与数字工程》 2019年第12期3020-3024,共5页 Computer & Digital Engineering
基金 国家自然科学基金项目“基于GEP的可拓策略自组织生成理论与方法研究”(编号:61503085)资助
关键词 代价敏感 误分类代价 测试代价 等待时间代价 多目标最优化 决策树 cost sensitive misclassification costs test costs wait time costs multi-objective optimization decision tree
  • 相关文献

参考文献1

二级参考文献44

  • 1葛伟平,汪卫,周皓峰,施伯乐.基于隐私保护的分类挖掘[J].计算机研究与发展,2006,43(1):39-45. 被引量:20
  • 2Herman T Tavani. Information privacy, data mining, and the intemet[ J]. Ethics and Information Technology, 1999, 1 (2) : 137 - 145.
  • 3A Cavoukian. Data mining: staking [ OL ]. http://www, ipc. on. ca/ a claim on your privacy sion-Papers/Discussion-Papers-Summary/? id = 342. 1998-01- 01/2009-09-22.
  • 4Vassilios S Verykios, Elisa Bertino, Igor Nai Fovino, Loredana P Provenza, Yucel Saygha, Yannis Theodoridis. State-of-the-art in privacy preserving data mining[J] .ACM SIGMOD Record, 2004,33(1) :50 - 57.
  • 5Elisa Bertino, Igor Nai Fovino, Loredana Parasiliti Provenza. A framework for evaluating privacy preserving data mining algorithms [J]. Data Mining and Knowledge Discovery, 2005, 11 (2) : 121 - 154.
  • 6Rakesh Agrawal,Ramakrishnan Srikant.Privacy-preserving data mining[J]. ACM SIGMOD Record, 2000,29 ( 2 ) : 439 - 450.
  • 7Dakshi Agrawal, Charu C Aggarwal. On the design and quantification of privacy preserving data mining algorithms [ A ]. In Proceedings of the Twentieth ACM SIGMOD-SIGACTSIGART Symposium on Principles of Database Systems[ C]. New York: ACM,2001.247- 255.
  • 8H Kargupta, S Datta, Q Wang, K Sivakumar. On the privacy preserving properties of random data perturbation techniques [ A]. In Proceedings of the Third IEEE International Conference on Data Mining [ C ]. Washington, DC: IEEE Computer Society, 2003.99 - 106.
  • 9H Kargupta, S Datta,Q Wang,K Sivakumar. Random-data perturbation techniques and privacy-preserving data mining[J]. Knowledge and Information System, 2005,7(4) :387 - 414.
  • 10H Dutta, H Kargupta, S Datta, K Sivakumar. Analysis of privacy preserving random perturbation techniques: further explorations[A]. In Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society[C].New York:ACM,2003. 31 - 38.

共引文献8

同被引文献26

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部