Abstract
AbstractStatistical inference and machine learning methods are benchmarked on test data independent of the data used to train the method. Biological sequence families are highly non-independent because they are related by evolution, so the strategy for splitting data into separate training and test sets is a nontrivial choice in benchmarking sequence analysis methods. A random split is insufficient because it will yield test sequences that are closely related or even identical to training sequences. Adapting ideas from independent set graph algorithms, we describe two new methods for splitting sequence data into dissimilar training and test sets. These algorithms input a sequence family and produce a split in which each test sequence is less than p% identical to any individual training sequence. These algorithms successfully split more families than a previous approach, enabling construction of more diverse benchmark datasets.
Publisher
Cold Spring Harbor Laboratory
Reference21 articles.
1. Protein sequence comparison and fold recognition: progress and good-practice benchmarking
2. Correct Machine Learning on Protein Sequences: A Peer-Reviewing Perspective;Brief Bioinform,2015
3. Setting the Standards for Machine Learning in Biology;Nat Rev Mol Cell Bio,2019
4. Walsh I , Fishman D , Garcia-Gasulla D , Titma T , Pollastri G , ELIXIR Machine Learning Focus Group, et al. DOME: Recommendations for Supervised Machine Learning Validation in Biology. Nat Methods. 2021;p. https://doi.org/10.1038/s41592-021-01205-4.
5. Arpit D , Jastrzebski S , Ballas N , Krueger D , Bengio E , Kanwal MS , et al. A closer look at memorization in deep networks. In: Proc Int Conf Mach Learn. Proc Mach Learn Res; 2017. p. 233–242.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献