针对经典MCMC(Markov chain Monte Carlo)算法求解河流水污染源信息(排放量、排放时间和排放位置)时初始点的选取和接受率不高导致的计算效率低下问题,通过COMSOL仿真软件构建污染物二维扩散模型,利用不同算法对比分析了上述两方面对水...针对经典MCMC(Markov chain Monte Carlo)算法求解河流水污染源信息(排放量、排放时间和排放位置)时初始点的选取和接受率不高导致的计算效率低下问题,通过COMSOL仿真软件构建污染物二维扩散模型,利用不同算法对比分析了上述两方面对水污染溯源结果的影响,并由此提出了基于等距随机抽样方法(equidistant random sampling)的两阶段多链Metropolis Hastings算法(ERS-TSMH).仿真结果表明,传统的MH算法和TSMH算法在求解时易陷入局部最优值或不收敛的情况,前者接受率在20%左右,后者却达到近50%;多链ERS-MH算法提高了反演的准确性,但经过10 000次左右迭代后收敛,效率低下;多链ERS-TSMH算法在保证溯源精度的同时,在5 000次左右迭代后收敛,效率显著提高且表现出高稳定性和可靠性.展开更多
Boosting is one of the most representational ensemble prediction methods. It can be divided into two se-ries: Boost-by-majority and Adaboost. This paper briefly introduces the research status of Boosting and one of it...Boosting is one of the most representational ensemble prediction methods. It can be divided into two se-ries: Boost-by-majority and Adaboost. This paper briefly introduces the research status of Boosting and one of its seri-als-AdaBoost,analyzes the typical algorithms of AdaBoost.展开更多
文摘针对经典MCMC(Markov chain Monte Carlo)算法求解河流水污染源信息(排放量、排放时间和排放位置)时初始点的选取和接受率不高导致的计算效率低下问题,通过COMSOL仿真软件构建污染物二维扩散模型,利用不同算法对比分析了上述两方面对水污染溯源结果的影响,并由此提出了基于等距随机抽样方法(equidistant random sampling)的两阶段多链Metropolis Hastings算法(ERS-TSMH).仿真结果表明,传统的MH算法和TSMH算法在求解时易陷入局部最优值或不收敛的情况,前者接受率在20%左右,后者却达到近50%;多链ERS-MH算法提高了反演的准确性,但经过10 000次左右迭代后收敛,效率低下;多链ERS-TSMH算法在保证溯源精度的同时,在5 000次左右迭代后收敛,效率显著提高且表现出高稳定性和可靠性.
文摘Boosting is one of the most representational ensemble prediction methods. It can be divided into two se-ries: Boost-by-majority and Adaboost. This paper briefly introduces the research status of Boosting and one of its seri-als-AdaBoost,analyzes the typical algorithms of AdaBoost.
