Ontology type: schema:ScholarlyArticle
2001-01
AUTHORSPaul C. Kainen, Věra Kůrková, Andrew Vogt
ABSTRACT
Devices such as neural networks typically approximate the elements of some function space X by elements of a nontrivial finite union M of finite-dimensional spaces. It is shown that if X=Lp(Ω) (1
143-147
http://scigraph.springernature.com/pub.10.1023/a:1010916406274
DOIhttp://dx.doi.org/10.1023/a:1010916406274
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1028487750
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0103",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Numerical and Computational Mathematics",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Mathematical Sciences",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Georgetown University",
"id": "https://www.grid.ac/institutes/grid.213910.8",
"name": [
"Department of Mathematics, Georgetown University, 20057, Washington, DC, USA"
],
"type": "Organization"
},
"familyName": "Kainen",
"givenName": "Paul C.",
"id": "sg:person.013607306243.38",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013607306243.38"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Institute of Computer Science",
"id": "https://www.grid.ac/institutes/grid.448092.3",
"name": [
"Institute of Computer Science, Academy of Sciences of the Czech Republic, P.O. Box 5, 182 07 Prague 8, Czech Republic"
],
"type": "Organization"
},
"familyName": "K\u016frkov\u00e1",
"givenName": "V\u011bra",
"id": "sg:person.0627676237.51",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0627676237.51"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Georgetown University",
"id": "https://www.grid.ac/institutes/grid.213910.8",
"name": [
"Department of Mathematics, Georgetown University, 20057, Washington, DC, USA"
],
"type": "Organization"
},
"familyName": "Vogt",
"givenName": "Andrew",
"id": "sg:person.011266447107.50",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011266447107.50"
],
"type": "Person"
}
],
"citation": [
{
"id": "https://doi.org/10.1006/jath.2000.3467",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1010569842"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/s0925-2312(99)00111-3",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1025764884"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/bf01171759",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1036571198",
"https://doi.org/10.1007/bf01171759"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/bf01171759",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1036571198",
"https://doi.org/10.1007/bf01171759"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1006/jath.1996.3018",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1045342432"
],
"type": "CreativeWork"
}
],
"datePublished": "2001-01",
"datePublishedReg": "2001-01-01",
"description": "Devices such as neural networks typically approximate the elements of some function space X by elements of a nontrivial finite union M of finite-dimensional spaces. It is shown that if X=Lp(\u03a9) (1\u2016f\u2212M\u2016+\u0393 for some f in X. Thus, no continuous finite neural network approximation can be within any positive constant of a best approximation in the Lp-norm.",
"genre": "research_article",
"id": "sg:pub.10.1023/a:1010916406274",
"inLanguage": [
"en"
],
"isAccessibleForFree": false,
"isPartOf": [
{
"id": "sg:journal.1048429",
"issn": [
"0254-5330",
"1572-9338"
],
"name": "Annals of Operations Research",
"type": "Periodical"
},
{
"issueNumber": "1-4",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "101"
}
],
"name": "Continuity of Approximation by Neural Networks in Lp Spaces",
"pagination": "143-147",
"productId": [
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"87b535c379551373ae6d30be245d8474e336fab34fbaade9956b2a0e641c9f29"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1023/a:1010916406274"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1028487750"
]
}
],
"sameAs": [
"https://doi.org/10.1023/a:1010916406274",
"https://app.dimensions.ai/details/publication/pub.1028487750"
],
"sdDataset": "articles",
"sdDatePublished": "2019-04-10T20:44",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8684_00000500.jsonl",
"type": "ScholarlyArticle",
"url": "http://link.springer.com/10.1023/A:1010916406274"
}
] Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1023/a:1010916406274'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1023/a:1010916406274'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1023/a:1010916406274'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1023/a:1010916406274'
This table displays all metadata directly associated to this object as RDF triples.
91 TRIPLES
21 PREDICATES
31 URIs
19 LITERALS
7 BLANK NODES