期刊文献+

组合与概率的连续特征权衡量化方法

Trade-off quantization method for continuous features based on combination and probability
下载PDF
导出
摘要 连续特征量化方法是数据挖掘方法中必要的预处理过程。呈现一种组合与概率的连续特征权衡量化方法。基于最小描述长度以及组合与概率理论,提出连续特征量化的权衡标准,能够在量化所导致的分类错误与量化区间信息之间得到合理的权衡;基于该权衡标准提出一种有效的动态规划量化算法,以找到最好的量化结果;量化后的数据采用naive贝叶斯分类器进行分类预测,与其他连续特征量化方法的对比实验结果表明,新方法得到了较高的平均学习精度。 Quantization methods of continuous features are a necessary preprocess of data mining methods. This paper presents a trade-off discrimination method for continuous features based on minimum description length, combination and probability theories. It proposes a quantizative trade-off criterion for continuous features which reasonably balances classification errors and interval information generated by quantization. It proposes an effective dynamic programming quantization algorithm with the aim to find the best quantization result based on the trade-off criteria. The quantized data will be sent to naive bayes classifier to establish classification and prediction model. Contrastive experimental results show that the new method achieves higher mean learning accuracy than other quantization methods.
作者 田海梅 王莹
出处 《计算机工程与应用》 CSCD 2012年第36期142-145,200,共5页 Computer Engineering and Applications
关键词 量化 最小描述长度 组合与概率 权衡标准 动态规划 quantization Minimum Description Length(MDL) combination and probability trade-off criteria Dynamic Programming (DP)
  • 相关文献

参考文献11

  • 1Fayyad U,Irani K.Multi-interval discretization of contin- uous-valued attributes for classification learning[C]//Pro- ceedings of the 13th International Joint Conference on Artificial Intelligence.San Mateo,CA:Morgan Kaufmann, 1993 : 1022-1027.
  • 2Kurgan L A,Cios K J.CAIM discretization algorithm[J]. IEEE Transactions on Knowledge and Data Engineering, 2004,16(2) : 145-153.
  • 3Liu H, Setiono R.Feature selection via discretization[J]. IEEE Transactions on Knowledge and Data Engineering, 1997,9(4) :642-645.
  • 4Boulle M.Khiops: a statistical discretization method of continuous attributes[J].Machine Learning,2004,55:53-69.
  • 5Ruiz F J, Angulo C, Agell N.IDD: a supervised interval distance-based method for discretization[J].IEEE Transac- tions on Knowledge and Data Engineering, 2008,20 (9) : 1230-1238.
  • 6Wu Q X, Bell D A,Prasad G, et al.A distribution-index- based discretizer for decision-making with symbolic AI approaches[J].IEEE Transactions on Knowledge and Da- ta Engineering, 2007,19( 1 ) : 17-28.
  • 7Dougherty J,Kohavi R, Sahami M.Supervised and unsu- pervised discretization of continuous feature[C]//Proceed- ings of the 12th International Conference of Machine Learning.San Francisco: Morgan Kaufmann, 1995 : 194-202.
  • 8Biba M, Esposito F, Ferilli S, et al.Unsupervised discreti- zation using kernel density estimation[C]//The TwentiethInternational Joint Conference on Artificial Intelligence (IJCAI), 2007 : 696-701.
  • 9Hansen M H, Yu B.Model selection and the principle of minimum description length[J].Jottmal of the American Statistical Association,2001,96(454) :746-774.
  • 10Weiss S M, Kulikowski C A.Computer systems that learn:classification and prediction methods from statis- tics, neural nets, machine learning, and expert systems[M]. San Mateo, Calif: Morgan Kaufmann, 1990.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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