...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Proceedings of the National Academy of Sciences of the United States of America >New method to compute R-complete enables maximum likelihood refinement for small datasets
【24h】

New method to compute R-complete enables maximum likelihood refinement for small datasets

机译：New method to compute R-complete enables maximum likelihood refinement for small datasets

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

The crystallographic reliability index R-complete is based on a method proposed more than two decades ago. Because its calculation is computationally expensive its use did not spread into the crystallographic community in favor of the cross-validation method known as R-free. The importance of R-free has grown beyond a pure validation tool. However, its application requires a sufficiently large dataset. In this work we assess the reliability of R-complete and we compare it with k-fold cross-validation, bootstrapping, and jackknifing. As opposed to proper cross-validation as realized with R-free, R-complete relies on a method of reducing bias from the structural model. We compare two different methods reducing model bias and question the widely spread notion that random parameter shifts are required for this purpose. We show that R-complete has as little statistical bias as R-free with the benefit of a much smaller variance. Because the calculation of R-complete is based on the entire dataset instead of a small subset, it allows the estimation of maximum likelihood parameters even for small datasets. R-complete enables maximum likelihood-based refinement to be extended to virtually all areas of crystallographic structure determination including high-pressure studies, neutron diffraction studies, and datasets from free electron lasers.

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号