A heuristic method for simulating open-data of arbitrary complexity that can be used to compare and evaluate machine learning methods.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/psb/MooreSSO18
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/psb/MooreSSO18
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jason_H._Moore
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Maksim_Shestov
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Schmitt
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Randal_S._Olson
>
foaf:
homepage
<
http://psb.stanford.edu/psb-online/proceedings/psb18/moore.pdf
>
dc:
identifier
DBLP conf/psb/MooreSSO18
(xsd:string)
dcterms:
issued
2018
(xsd:gYear)
rdfs:
label
A heuristic method for simulating open-data of arbitrary complexity that can be used to compare and evaluate machine learning methods.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jason_H._Moore
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Maksim_Shestov
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Schmitt
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Randal_S._Olson
>
swrc:
pages
259-267
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/psb/2018
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/psb/MooreSSO18/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/psb/MooreSSO18
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/psb/psb2018.html#MooreSSO18
>
rdfs:
seeAlso
<
http://psb.stanford.edu/psb-online/proceedings/psb18/moore.pdf
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/psb
>
dc:
title
A heuristic method for simulating open-data of arbitrary complexity that can be used to compare and evaluate machine learning methods.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document