期刊文献+

操作风险等级预测的朴素贝叶斯方法研究

Naive Bayes method in operational risk level prediction
下载PDF
导出
摘要 操作风险数据积累比较困难,而且往往不完整,朴素贝叶斯分类器是目前进行小样本分类最优秀的分类器之一,适合于操作风险等级预测。在对具有完整数据朴素贝叶斯分类器学习和分类的基础上,提出了基于星形结构和Gibbs sampling的具有丢失数据朴素贝叶斯分类器学习方法,能够避免目前常用的处理丢失数据方法所带来的局部最优、信息丢失和冗余等方面的问题。 It is difficult to accumulate a large number of data with high quality in operational risk.Naive Bayes classifier is the one of best classifiers used to small data set classification.It is suitable for operational risk level prediction.In this paper,firstly,the process of learning and classing is presented on naive Bayes classifier with complete data sets.Then,a method naive Bayes classifier learning with missing data is developed based on star structure and Gibbs sampling.The existing problems can be avoided in local optimization,information losing and redundancy.
出处 《计算机工程与应用》 CSCD 北大核心 2008年第12期26-28,94,共4页 Computer Engineering and Applications
基金 国家自然科学基金(the National Natural Science Foundation of China under Grant No.60675036) 上海市重点学科(No.P1601) 上海市教委重点项目(No.05zz66)
关键词 操作风险 等级预测 朴素贝叶斯分类器 丢失数据 GIBBS抽样 operational risk level prediction naive Bayes classifier missing data Gibbs sampling
  • 相关文献

参考文献11

  • 1杰克.L.金.运作风险度量与建模[M].陈剑,柳克俊,陈剑锋,泽.北京:中国人民大学出版社,2005:181-194.
  • 2Ramoni M,Sebastiani P.Robust Bayes classifiers[J].Artificial Intelligence, 2001,125 ( 1/2 ) : 209-226.
  • 3Friedman N,Geiger D,Goldszmidt M,Bayesian network classifiers[J]. Machine Learning, 1997,29(2/3) : 131-161.
  • 4Ramoni M,Sebastiani P.Robust learning with missing data[J].Machine Learning, 2001,45( 2 ) : 147-170.
  • 5Lauritzen S LThe EM algorithm for graphical association models with missing data[J].Computational Statistics and Data Analysis, 1995,19(2) : 191-201.
  • 6王双成,苑森淼.具有丢失数据的可分解马尔可夫网络结构学习[J].计算机学报,2004,27(9):1221-1228. 被引量:19
  • 7王双成,苑森淼.具有丢失数据的贝叶斯网络结构学习研究[J].软件学报,2004,15(7):1042-1048. 被引量:62
  • 8Geman S,Geman D.Stochastic relaxation,Gibbs distributions and the Bayesian restoration of images[J].lEEE Transactions on Pattern Analysis and Machine Intelligence,1984,6:721-742.
  • 9Domingos P,Pazzani M.On the optimality of the simple Bayesian classifier under zero-one loss[J].Machine Learning, 1997,29(2/3): 103-130.
  • 10Murphy S L,Aha D W.UC1 repository, of machine learning databases[OL].http ://www.ics.uci.edu/-mlearn/MLRepository.html.

二级参考文献13

  • 1Pearl J.. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, California: Morgan Kaufmann, 1988, 117~133
  • 2Xiang Y., Wong S.K.M., Cercone N.. A 'Microscopic' study of minimum entropy search in learning decomposable Markov networks. Machine Learning, 1997, 26(1): 65~92
  • 3Zhen Z., Yeung R.W.. On characterization of entropy function via information inequalities. IEEE Transactions on Information Theory, 1998, 44(4): 1440~1452
  • 4Buntine W.L.. Chain graphs for learning. In: Proceedings of the 17th Conference Artificial Intelligence, San Francisco, Morgan Kaufmann, 1995, 46~54
  • 5Heckerman D.. Bayesian networks for data mining. Data Mining and Knowledge Discovery, 1997, 1(1): 79~119
  • 6Chow C.K., Liu C.N.. Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 1968, 14(3): 462~467
  • 7Mao S.S., Wang J.L., Pu X.L.. Advanced Mathematical Statistics. Beijing: Higher Education Press, 1998(in Chinese)(茆诗松, 王静龙, 濮晓龙. 高等数理统计. 北京: 高等教育出版社, 1998)
  • 8Geman S., Geman D.. Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1984, 6(6): 721~742
  • 9Domingos P., Pazzani M.. On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning, 1997, 29(2~3): 103~130
  • 10Cheng J., Greiner R., Kelly J.. Learning Bayesian networks from data: An efficient approach based on information-theory. Artificial Intelligence, 2002, 137(1~2): 43~90

共引文献65

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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