"A heuristic method for simulating open-data of arbitrary complexity that ..."

Jason H. Moore et al. (2018)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-12

- view
  - electronic edition @ stanford.edu (open access)
- export record
  dblp key:
  - conf/psb/MooreSSO18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/psb/MooreSSO18
Jason H. Moore, Maksim Shestov, Peter Schmitt, Randal S. Olson:
A heuristic method for simulating open-data of arbitrary complexity that can be used to compare and evaluate machine learning methods. PSB 2018: 259-267

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.