期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种基于NNIA多目标优化的代价敏感决策树构建方法 被引量：8

A Multi-Objective Optimization Based Constructing Cost-Sensitive Decision Trees Method
在线阅读 下载PDF
导出
摘要 本文提出了一种基于非支配邻域免疫算法(NNIA,Nondominated Neighbor Immune Algorithm)多目标优化的代价敏感决策树构建方法.将平均误分类代价和平均测试代价作为两个优化目标,然后利用NNIA对决策树进行优化,最终获取了一组Pareto最优的决策树。对多个测试集的测试结果表明,与C4.5算法和CSDB(Cost Sensitive DecisionTree)算法比较,本文方法不仅在平均误分类代价和平均测试代价两方面均可以取得优于两者的性能,而且获得的决策树具有更小的规模,泛化能力更强. A novel method of constructing the cost-sensitive decision trees based on multi-objective optimization is proposed in this paper.The average misclassification cost and the average test cost are treated as the two optimization objectives.NNIA（Nondominated Neighbor Immune Algorithm） is exploited to optimize the decision trees.And some Pareto decision trees are finally obtained.Experimental results show that,compared with the C4.5 algorithm and CSDB（Cost Sensitive Decision Tree） algorithm,the proposed method in this paper can not only outperform these two methods in terms of the two above objectives but also achieve smaller size of the decision trees and stronger generalization ability.
作者 赵士伟 卓力 王素玉 沈兰荪
机构地区 北京工业大学信号与信息处理研究室
出处 《电子学报》 EI CAS CSCD 北大核心 2011年第10期2348-2352,2396,共6页 Acta Electronica Sinica
基金 国家自然科学基金(No.61003289) 北京市自然科学基金(No.4102008) 人力资源与社会保障部留学归国人员科技活动优秀类资助 教育部留学归国人员科研启动基金
关键词 代价敏感 误分类代价 测试代价 多目标优化 决策树 cost-sensitive misclassification costs test costs multi-objective optimization decision tree
分类号 TP391 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献12

  • 1李光,王亚东,苏小红.隐私保持的决策树分类挖掘[J].电子学报,2010,38(1):204-212. 被引量：9
  • 2P D Turney. Types of cost in inductive concept learning[ A]. Proc of the Workshop on Cost-Sensitive Learning at the 17th International Conference on Machine Learning[ C]. Stanford University, Stanford, California, USA, 2000.
  • 3C X Ling, V S Sheng, Q Yang. Test strategies for cost-sensitive decision trees[ J]. IEEE Transactions on Knowledge and Data Engineering,2006.18[8]: 1055 - 1067.
  • 4Q Yang, C IAng,X Chai, et al. Test-cost sensitive classification on data with missing values[ J]. IEEE Transactions on Knowledge and Data Engineering,2006,18[ 5 ] :626 - 638.
  • 5P D Tumey. Cost-sensitive classification: empirical evahmtion of a hybrid genetic decision tree induction algorithm[J]. Journal of Artificial Intelligence Research, 1995,2: 369 - 409.
  • 6J V Davis, J Ha, C J Rossbach, et al. Cost-sensitive decision tree learning for forensic classification[A]. Proc of 17th European Conference on Machine Learning [ A ]. Berlin GER- MANY, SEP 18- 22,2006:622-629.
  • 7X Liu. Cost-sensitive decision tree with missing values and multiple cost scales[ A]. Proc of the first IITA International Joint Conference on Artificial InteUigence [ C ]. Halnan, CHINA,APR 25-MAY 26,2009:294 - 297 M Gong,L Jiao,H Du,et al.Multiobjective immune algorithm with nondominated neighbor-based selection. EvolutionaryComputation[ J] .2008,16[2] :225 - 255.
  • 8M Gong,L Jiao,H Du,et al.Multiobjective immune algorithm with nondominated neighbor-based selection. EvolutionaryComputation[ J]. 2008,16[ 2 ] : 225 - 255.
  • 9A Asuncion, D J Newmafi, UCI machine learning repository [ http://www, its. uci. edu/- mleam/MLRepository, html ]. Irvine, CA: University of California, School of Information and Computer Science,2007.
  • 10R Quinlan. CA. 5: programs for machine learning, Morgan Kaufmann Publishers, 1992.

二级参考文献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

同被引文献55

引证文献8

二级引证文献50

电子学报
2011年 第10期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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