A heuristic method for simulating open-data of arbitrary complexity that can be used to compare and evaluate machine learning methods

Created by W.Langdon from gp-bibliography.bib Revision:1.8120

@InProceedings{Moore:2018:PSB,

• author = "Jason H. Moore and Maksim Shestov and Peter Schmitt and Randal S. Olson",
• title = "A heuristic method for simulating open-data of arbitrary complexity that can be used to compare and evaluate machine learning methods",
• booktitle = "Pacific Symposium on Biocomputing",
• year = "2018",
• editor = "Russ B. Altman and A. Keith Dunker and Lawrence Hunter and Marylyn D. Ritchie and Tiffany Murray and Teri E. Klein",
• pages = "259--267",
• address = "Hawaii, USA",
• month = "3-7 " # jan,
• organisation = "Institute for Computational Biology",
• keywords = "genetic algorithms, genetic programming, simulation, machine learning, open data",
• isbn13 = "978-981-3235-53-3",
• URL = "https://pubmed.ncbi.nlm.nih.gov/29218887/",
• URL = "http://psb.stanford.edu/psb-online/proceedings/psb18/moore.pdf",
• size = "9 pages",
• abstract = "A central challenge of developing and evaluating artificial intelligence and machine learning methods for regression and classification is access to data that illuminates the strengths and weaknesses of different methods. Open data plays an important role in this process by making it easy for computational researchers to easily access real data for this purpose. Genomics has in some examples taken a leading role in the open data effort starting with DNA microarrays. While real data from experimental and observational studies is necessary for developing computational methods it is not sufficient. This is because it is not possible to know what the ground truth is in real data. This must be accompanied by simulated data where that balance between signal and noise is known and can be directly evaluated. Unfortunately, there is a lack of methods and software for simulating data with the kind of complexity found in real biological and biomedical systems. We present here the Heuristic Identification of Biological Architectures for simulating Complex Hierarchical Interactions (HIBACHI) method and prototype software for simulating complex biological and biomedical data. Further, we introduce new methods for developing simulation models that generate data that specifically allows discrimination between different machine learning methods",
• notes = "A heuristic method for simulating open-data of arbitrary complexity that can be used to compare and evaluate machine learning methods*Jason H. Moore, Maksim Shestov, Peter Schmitt, Randal S. Olson Institute for Biomedical Informatics, University of Pennsylvania, D202 Richards Building, 3700 Hamilton Walk, Philadelphia, PA 19104

  https://psb.stanford.edu/previous/psb18/",

}

Genetic Programming entries for Jason H Moore Maksim Shestov Peter Schmitt Randal S Olson

Citations