聚类分析
计算机科学
选择(遗传算法)
随机森林
熵(时间箭头)
机器学习
选型
人工智能
数据挖掘
代表(政治)
模式识别(心理学)
统计
数学
物理
政治
量子力学
法学
政治学
作者
Daniel J. Woodward,A.R. Bradley,Willem P. van Hoorn
标识
DOI:10.1021/acs.jcim.2c00258
摘要
Selecting the most appropriate compounds to synthesize and test is a vital aspect of drug discovery. Methods like clustering and diversity present weaknesses in selecting the optimal sets for information gain. Active learning techniques often rely on an initial model and computationally expensive semi-supervised batch selection. Herein, we describe a new subset-based selection method, Coverage Score, that combines Bayesian statistics and information entropy to balance representation and diversity to select a maximally informative subset. Coverage Score can be influenced by prior selections and desirable properties. In this paper, subsets selected through Coverage Score are compared against subsets selected through model-independent and model-dependent techniques for several datasets. In drug-like chemical space, Coverage Score consistently selects subsets that lead to more accurate predictions compared to other selection methods. Subsets selected through Coverage Score produced Random Forest models that have a root-mean-square-error up to 12.8% lower than subsets selected at random and can retain up to 99% of the structural dissimilarity of a diversity selection.
科研通智能强力驱动
Strongly Powered by AbleSci AI