arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.1456cs.AI
收藏

结构计算的概率算法:借鉴模拟退火法

A Probabilistic Algorithm for Calculating Structure: Borrowing from Simulated Annealing

Stanford University Medical Center(斯坦福大学医学中心)

Russ B. Altman

摘要:

我们已经开发了一个通用的贝叶斯算法,用于确定在三维空间中的点的坐标。该算法将点坐标上的一组概率约束和每个点定位的先验分布作为输入。输出是每个点的位置的最大似然估计。我们使用的扩展,迭代卡尔曼滤波器,并添加了一个搜索启发式优化其解决方案在非线性条件下。该启发式算法基于与其他优化问题的模拟退火启发式算法相同的原理。我们的方法使用任何概率约束,可以表示为点坐标的函数(例如,距离,角度,二面角,平面性)。它假设所有约束都有高斯噪声。在本文中,我们描述了该算法,并显示其性能上的一组合成数据,以说明其收敛性能,其适用于领域,如NG分子结构测定。

英文摘要:

We have developed a general Bayesian algorithm for determining the coordinates of points in a three-dimensional space. The algorithm takes as input a set of probabilistic constraints on the coordinates of the points, and an a priori distribution for each point location. The output is a maximum-likelihood estimate of the location of each point. We use the extended, iterated Kalman filter, and add a search heuristic for optimizing its solution under nonlinear conditions. This heuristic is based on the same principle as the simulated annealing heuristic for other optimization problems. Our method uses any probabilistic constraints that can be expressed as a function of the point coordinates (for example, distance, angles, dihedral angles, and planarity). It assumes that all constraints have Gaussian noise. In this paper, we describe the algorithm and show its performance on a set of synthetic data to illustrate its convergence properties, and its applicability to domains such ng molecular structure determination.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑