Efficient modeling and active learning discovery of biological responses

PLoS ONE

Volumn 8, Issue 12, 2013, Pages

  Naik, Armaghan W ^a   Kangas, Joshua D ^a   Langmead, Christopher J ^a   Murphy, Robert F ^a,b,c  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; COMPUTER MODEL; COMPUTER PREDICTION; COMPUTER SIMULATION; DRUG SCREENING; DRUG TARGETING; EXPERIMENTATION; GENE EXPRESSION; LEARNING ALGORITHM; PROBABILITY;

ALGORITHMS; MODELS, BIOLOGICAL; MODELS, STATISTICAL; REPRODUCIBILITY OF RESULTS;

EID: 84892906484     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0083996     Document Type: Article

References (27)

1. Ideker T, Galitski T, Hood L (2001) A new approach to decoding life. Systems Biology - Annu Rev Genomics Hum Genet 2: 343-372. doi: 10.1146/annurev.genom.2.1.343.
2. Kitano H (2002) Computational systems biology. Nature 420: 206-210. doi:10.1038/nature01254. PubMed: 12432404.
3. Westerhoff HV, Palsson BO (2004) The evolution of molecular biology into systems biology. Nat Biotechnol 22: 1249-1252. doi:10.1038/nbt1020. PubMed: 15470464.
4. Lounkine E, Keiser MJ, Whitebread S, Mikhailov D, Hamon J et al. (2012) Large-scale prediction and testing of drug activity on side-effect targets. Nature 486: 361-367. PubMed: 22722194.
5. Merino A, Bronowska AK, Jackson DB, Cahill DJ (2010) Drug profiling: knowing where it hits. Drug Discov Today 15: 749-756. doi:10.1016/j.drudis.2010. 06.006. PubMed: 20601095.
6. Murphy RF (2011) An active role for machine learning in drug development. Nat Chem Biol 7: 327-330. doi:10.1038/nchembio.576. PubMed: 21587249.
7. Cohn DA, Ghahramani Z, Jordan MI (1996) Active Learning with Statistical Models. Journal of Artificial Intelligence Research 4: 129-145.
8. Even-Dar E, Mannor S, Mansour Y (2002) PAC Bounds for Multi-armed Bandit and Markov Decision Processes. In: J KivinenR Sloan. Computational Learning Theory. Springer Berlin / Heidelberg. pp. 193-209.
9. Saar-Tsechansky M, Provost F (2004) Active Sampling for Class Probability Estimation and Ranking. Mach Learn 54: 153-178. doi: 10.1023/B:MACH.0000011806. 12374.c3.
10. Balcan MF, Beygelzimer A, Langford J (2009) Agnostic active learning. Journal of Computer and System Sciences 75: 78-89. doi:10.1016/j.jcss.2008.07. 003.
11. Danziger SA, Baronio R, Ho L, Hall L, Salmon K et al. (2009) Predicting positive p53 cancer rescue regions using Most Informative Positive (MIP) active learning. PLoS Comput Biol 5: e1000498. PubMed: 19756158.
12. Warmuth MK, Liao J, Rätsch G, Mathieson M, Putta S et al. (2003) Active learning with support vector machines in the drug discovery process. J Chem Inf Comput Sci 43: 667-673. doi:10.1021/ci025620t. PubMed: 12653536.
13. Fujiwara Y, Yamashita Y, Osoda T, Asogawa M, Fukushima C et al. (2008) Virtual screening system for finding structurally diverse hits by active learning. J Chem Inf Model 48: 930-940. doi:10.1021/ci700085q. PubMed: 18351729.
14. Liu Y (2004) Active learning with support vector machine applied to gene expression data for cancer classification. J Chem Inf Comput Sci 44: 1936-1941. doi:10.1021/ci049810a. PubMed: 15554662.
15. Mohamed TP, Carbonell JG, Ganapathiraju MK (2010) Active learning for human protein-protein interaction prediction. BMC Bioinformatics 11 Suppl 1: S57. doi:10.1186/1471-2105-11-S1-S57. PubMed: 20122232.
16. Pan G, Vardi MY (2004) Symbolic decision procedures for QBF. Principles and Practice of Constraint Programming-CP 2004. Springer. pp. 453-467.
17. Eén N, Sörensson N (2004) An Extensible SAT-solver. In: E GiunchigliaA Tacchella. Theory and Applications of Satisfiability Testing: Springer Berlin Heidelberg. pp. 502-518
18. Tibshirani R (1996) Regression shrinkage and selection via the lasso. J Royal Statistical Soc B: Statistical Methodology 58: 267-288.
19. Lamb J, Crawford ED, Peck D, Modell JW, Blat IC et al. (2006) The Connectivity Map: Using Gene-Expression Signatures to Connect Small Molecules, Genes, and Disease. Science 313: 1929-1935. doi: 10.1126/science.1132939. PubMed: 17008526.
20. (2013) Connectivity Map. Broad Institute.
21. Angluin D, Eisenstat D, Kontorovich L, Reyzin L (2010) Lower Bounds on Learning Random Structures with Statistical Queries. In: M HutterF StephanV VovkT Zeugmann. Algorithmic Learning Theory. Springer Berlin / Heidelberg. pp. 194-208.
22. Sahinidis NV (2003) Global Optimization and Constraint Satisfaction: The Branch-and-Reduce Approach. Lect Notes. Comp Sci 2861: 1-16.
23. Heckman J, Ichimura H, Smith J, Todd P (1998) Characterizing selection bias using experimental data. Econometrica 66: 1017-1098. doi:10.2307/2999630.
24. Candes EJ, Recht B (2009) Exact Matrix Completion via Convex. Optimization - Found Comput Math 9: 717-772. doi:10.1007/s10208-009-9045-5.
25. Chen P, Suter D (2004) Recovering the missing components in a large noisy low-rank matrix: application to SFM. Pattern Analysis and Machine Intelligence, IEEE Transactions On 26: 1051-1063. doi: 10.1109/TPAMI.2004.52.
26. Allison P (2000) Multiple imputation for missing data: A cautionary tale. Sociological Methods and Research 28: 301-309. doi: 10.1177/ 0049124100028003003.
27. Rubin DB (1976) Inference and missing data. Biometrika 63: 581-592. doi:10.1093/biomet/63.3.581.