期刊文献+

Any-Cost Discovery:优化分类规则发现方法

Any-Cost Discovery: Learning Optimal Classification Rules
在线阅读 下载PDF
导出
摘要 充分利用缺失数据中所包含的信息,提出了一种新的分裂属性的选择标准建立决策树.用户提供一定的资源后,通过访问该决策树,最大限度地利用该资源,以达到在有限资源约束下的最优结果.另外,该方法还可以对于需要追加资源与否提出建议. Fully taking into account the hints possibly hidden in the missing data, this paper proposes a new criterion when selecting attributes for splitting to build a decision tree for a given dataset. When con- sumer offers finite resources, we can make the best of the finite resources and obtain optimal results by the tree. In addition, we also put forward advice about whether it is worthy of increasing resources or not.
作者 钟智
出处 《广西师范学院学报(自然科学版)》 2005年第3期76-79,84,共5页 Journal of Guangxi Teachers Education University(Natural Science Edition)
关键词 任意资源 决策树 不完备数据 代价敏感度 any cost decision tree missing data cost-sensitive
  • 相关文献

参考文献6

  • 1ZHANG Shi-chao, QIN Zhen-xing, ZHANG Cheng-qi. Cost-Sensitive Decision Trees with Multiple Cost Scales[J]. A12004: 380-390.
  • 2CHAI Xiao-yong, DENG Lin, YANG Qiang , Charles X Ling. Test-Cost Sensitive Naive Bayes Classification[J]. Proceedings of The IEEE International Conference on Data Mining, (ICDM'2004).
  • 3ZHANG Shi-chao, QIN Zhen-xing, Charles X Ling ,SHENG Sheng-li. Missing is Useful: Missing Values in Cost-sensitive Decision Trees[M]. IEEE Transactions on Knowledge and Data Engineering, 2005.
  • 4Turney P D. Cost-Seensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm [J]. Journal of Artificial Intelligence Research, 1995.
  • 5ZHANG Shi-chao YANG Qiang, WANG Jian-ning, Charles X Ling. Decision Trees with Minimal Costs[M]. Proceedings of the 21th International Conference on Machine Learning(ICML), Banff, Canada, 2004.
  • 6元昌安,唐常杰,左劼,谢方军,陈安龙,胡建军.基于基因表达式编程的函数挖掘——收敛性分析与残差制导进化算法[J].四川大学学报(工程科学版),2004,36(6):100-105. 被引量:45

二级参考文献10

  • 1Koza J R.Genetic programming II:automatic discovery of reusable programs [M].MIT Press,1994.
  • 2Szpiro G G.Forecasting chaotic time series with genetic algorithms[J]. Phys Rev,1997,E 55:2557-2568.
  • 3Ferreira C.Gene expression programming:a new adaptive algorithem for solving problems[J].Complex Systems,2001,13(2):87-129.
  • 4Ferreira C.Combinatorial optimization by gene expression programming: inversion revisited[A].Proceedings of the Argentine Symposium on Artificial Intelligence[C].2002 .160-174.
  • 5Ferreira C. Mutation, transposition, and recombination: an analysis of the evolutionary dynamics[A].Proceedings of the 6th Joint Conference on Information Sciences, 4th International Workshop on Fronties in Evolutionary Algorithms[C]. Research Triangle Pa
  • 6Ferreira C.Analyzing the founder effect in simulated evolutionary processes using gene expression programming[J].Soft Computing Systems: Design, Management and Applications, 2002.153-162.
  • 7Ferreira C.Discovery of the boolean functions to the best density-classification rules using gene expression programming[A]. Euro GP 2002 (The 4th European Conference on Genetic Programming), Lecture Notes in Computer Science[C].Springer-Verlag, Berlin, G
  • 8Zuo Jie,Tang Changjie ,Zhang Tianqing. Mining predicate association rule by gene expression programming[A].Meng Xiaofeng, Su Jianwne, Wang Yujun. LNCS(Lecture Notes In Computer science)[C]. WAIM02 (International Conference for Web Information Age 2002), S
  • 9Zhou Chi, Xiao Weimin, Tirpak T M,et al.Evolving accurate and compact classification rules with gene expression programming[J].IEEE Transactions on Evolutionary Computation, 2003, 7(6):519-531.
  • 10Yorick H.Gene expression programming and one-dimensional chaotic maps[J]. International Journal of Modern Physics C, 2002,13(1):13-24.

共引文献44

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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