期刊文献+

空间贝叶斯分类器并行化 被引量:3

A Parallel Bayesian Classifier
下载PDF
导出
摘要 分类是空间数据分析中一个非常重要的问题,采用贝叶斯网络进行分类,能够充分利用现有知识,实现对目标更精确的分类。随着实际可应用在贝叶斯网络学习中的数据样本量越来越大,贝叶斯分类器在结果更加准确的同时,其结构学习、参数学习、分类推断等每一个步骤的处理时间也会变得漫长,亟须将并行计算引入到贝叶斯网络的学习与分类预测中。该研究研发了一种海量空间数据的并行贝叶斯分类器,通过对矢量数据序列化、按空间拓扑关系分块、扩展基于MPI的并行原语等一系列设计,解决了其并行计算中不同节点矢量数据传输、负载均衡、异步IO等方面的问题。实验结果表明,并行贝叶斯分类器在保证结果一致的前提下大幅缩短了贝叶斯分类器学习与分类预测所需要的时间。 Classification is a very important problem in spatial data analysis. When Bayesian network is introduced to classifica- tion, we can make full use of existing knowledge, in order to get more accurate classification. With sample data that can be used in learning Bayesian network increasing, the classification results will become more precise. However, corresponding processing time of each step in Bayesian classifier, including structure learning, parameter learning, classification inference, will be extreme- ly long. Thus parallel computing was urgently introduced into the Bayesian network learning and classification prediction. In this paper, a parallel Bayesian classifier with mass spatial data is put forward. Also vector data serialization, spatial partition based on topology relationship, expanding MPI parallel primitives and other methods have been used to solve the spatial data transmission between different nodes, load balancing, asynchronous I/O and other problems. The experimental result shows that the parallel Bayesian classifier substantially shortens the time of spatial classification under the premise of consistent.
作者 王阳 李连发
出处 《地理与地理信息科学》 CSCD 北大核心 2013年第4期47-51,85,共6页 Geography and Geo-Information Science
基金 国家863计划项目(2011AA120305 2011AA120302 2011AA12A401-1) 国家自然科学基金项目(41171344/D010703) 海洋公益性项目(201105033-6)
关键词 并行计算 贝叶斯网络 分类 EM算法 爬山算法 朴素贝叶斯算法 parallel computing Bayesian network classification EM algorithm Hill Climbing algorithm Naive Bayes algorithm
  • 相关文献

参考文献15

  • 1ZOUBIN G. An introduction to hidden Markov models and Bayes- ian networks[J]. IJPRAI, 2001,15 (1) : 9- 42.
  • 2ZHANG L W, GUO H P. Introduction to Bayesian Networks [M]. Perking: Science Press, 2006.
  • 3DAVID M C. Optimal structure identification with greedy search [J]. Mach in eLearning Research, 2002,3 : 507- 554.
  • 4MORAN P A P. Notes on continuous stochastic phenomena[J]. Biometrika, 1950,37(1/2) : 17-23.
  • 5单冬冬,吕强,李亚飞,王磊.贝叶斯网学习中一种有效的爬山算法[J].小型微型计算机系统,2009,30(12):2457-2460. 被引量:8
  • 6SINGH M, VALTORTA 1VL Construction of Bayesian network structures form data: A brief survey and an efficient algorithm [J]. International Journal of Approximate Reasoning, 1995, 12 (2):111-131.
  • 7DAVID H, DAN G, DAVID M (2. Learning Bayesian networks: The combination of knowledge and statistical data[J]. Machine Learning, 1995,20(3) : 197-243.
  • 8GREGORY E C, EDWARD H. A Bayesian method for the in- duction of probabilistic networks from data[J]. Machine Learn- ing, 1992,9 (4) : 309- 347.
  • 9NEAL R, HINTON G. A view of the EM algorithm that justi- fies incremental, sparse, and other variants[A]. Learning in Graphical Models[C]. The Netherlands Kluwer Academic Pub- lishers, 1998. 355-371.
  • 10150 T,CHRISIZ)PHER M, DAVID H. Accelerating EM for large databases[J]. Machine Learning,2001,45(3) :279-299.

二级参考文献10

  • 1Judea Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference[ M]. Morgan Kaufmann, San Mateo, CA, 1988.
  • 2Zhang Lian-wen, Guo Hai-peng. Introduction to Bayesian networks [M]. Perking: Science Press, 2006.
  • 3David Maxwell Chickering. Learning equivalence classes of bayesian-network structures[ J]. The Journal of Machine Learning Rese arch, 2002, 2(2) :445-498.
  • 4David Maxwell Chickedng. Optimal structure identification with greedy search [ J ]. The Journal of Machine Learning Research, 2002, 3:507-554.
  • 5David Maxwell Chickefing. Learning bayesian networks is NP- complete[M]. In:Fisher D, Lenz H, editors, Learning from Data: Artificial Intelligence and Statistics V. Springer Verlag, 1996, 121-130.
  • 6David Heckerman, Dan Geiger, David Maxwell Chickering. Learning Bayesian networks: the combination of knowledge and statistical data[J]. Machine Learning, 1995, 20(3) :197-243.
  • 7Marco Dorigo, Gianni. Di Caro. Ant colony optimization: a new meta-heuristic[C]. Proceeding of the 1999 Congress on Evolutionary Computation, Washington, DC: USA, 1999, 1470-1477.
  • 8Ioannis Tsamardinos, Laura E Brown, Constantin F Aliferis. The MaxMin Hill-Climbing Bayesian network structure learning algorithm[J]. Me.achine Learning, 2006, 65(1 ) :31-78.
  • 9Luis M de Campos, Juan M Puerta. Stochastic local and distributed search algorithms for learning bayesian networks[C]. In:Proceedings of the Ⅲ International Symposium on Adaptive Systems (ISAS): Evolutionary Computation and Probabilistic Graphical Model, 2001, 109-115.
  • 10Luis M de Campos, Juan M Fernadez-Luna, Jose A Gamez, et al. Ant colony optimization for learning Bayesian networks[ J]. International Journal of Approximate Reasoning, 2002, 31 ( 3 ) : 291- 311.

共引文献7

同被引文献66

引证文献3

二级引证文献27

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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