首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A classification updating procedure motivated by high-content screening data
Authors:R M Jacques  N RJ Fieller  E K Ainscow
Institution:1. School of Health and Related Research , University of Sheffield , Regent Court, 30 Regent Street, Sheffield, S1 4DA, UK;2. Department of Probability and Statistics , University of Sheffield , Hicks Building, Sheffield, S3 7RH, UK;3. Advanced Science and Techology Laboratory, AstraZeneca R&4. D Charnwood , Bakewell Road, Loughborough, LE11 5RH, UK
Abstract:The current paradigm for the identification of candidate drugs within the pharmaceutical industry typically involves the use of high-throughput screens. High-content screening (HCS) is the term given to the process of using an imaging platform to screen large numbers of compounds for some desirable biological activity. Classification methods have important applications in HCS experiments, where they are used to predict which compounds have the potential to be developed into new drugs. In this paper, a new classification method is proposed for batches of compounds where the rule is updated sequentially using information from the classification of previous batches. This methodology accounts for the possibility that the training data are not a representative sample of the test data and that the underlying group distributions may change as new compounds are analysed. This technique is illustrated on an example data set using linear discriminant analysis, k-nearest neighbour and random forest classifiers. Random forests are shown to be superior to the other classifiers and are further improved by the additional updating algorithm in terms of an increase in the number of true positives as well as a decrease in the number of false positives.
Keywords:classification  updating algorithm  high-content screening experiments  batch learning  random forests  linear discriminant analysis  k-nearest neighbour
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号