.png){kind=icon}
返回
Error Bounds on the SCISSORS Approximation Method
.png){kind=icon}
OA
AI
DOI：10.1021/ci200251a.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The SCISSORS method for approximating chemical similarities has shown excellent empirical performance on a number of real-world chemical data sets but lacks theoretically proven bounds on its worst-case error performance. This paper first proves reductions showing SCISSORS to be equivalent to two previous kernel methods: kernel principal components analysis and the rank-k Nystrom approximation of a Gram matrix. These reductions allow the use of generalization bounds on these techniques to show that the expected error in SCISSORS approximations of molecular similarity kernels is bounded in expected pairwise inner product error, in matrix 2-norm and Frobenius norm for full kernel matrix approximations and in root-mean-square deviation for approximated matrices. Finally, we show that the actual performance of SCISSORS is significantly better than these worst-case bounds, indicating that chemical space is well-structured for chemical sampling algorithms.
Keyword:
CHEMICAL SIMILARITIES
NYSTROM METHOD
GRAM MATRIX
KERNEL
LINGO
期刊
IF:
5.3
论文数:
9.1K
被引数:
4.0W
机构
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容