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/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0104", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Statistics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Novo Nordisk A/S, Bagsv\u00e6rd, Denmark", 
          "id": "http://www.grid.ac/institutes/grid.425956.9", 
          "name": [
            "Novo Nordisk A/S, Bagsv\u00e6rd, Denmark"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Grage", 
        "givenName": "Halfdan", 
        "id": "sg:person.01167677057.51", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01167677057.51"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Mathematical Statistics, Lund University, Lund, Sweden", 
          "id": "http://www.grid.ac/institutes/grid.4514.4", 
          "name": [
            "Mathematical Statistics, Lund University, Lund, Sweden"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Holst", 
        "givenName": "Jan", 
        "id": "sg:person.012640460143.11", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012640460143.11"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Mathematical Statistics, Lund University, Lund, Sweden", 
          "id": "http://www.grid.ac/institutes/grid.4514.4", 
          "name": [
            "Mathematical Statistics, Lund University, Lund, Sweden"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Lindgren", 
        "givenName": "Georg", 
        "id": "sg:person.012274436413.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012274436413.00"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Visma Software AB, Limhamn, Sweden", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Visma Software AB, Limhamn, Sweden"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Saklak", 
        "givenName": "Mietek", 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/978-1-4899-3099-6_2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1089745563", 
          "https://doi.org/10.1007/978-1-4899-3099-6_2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00500-004-0435-y", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1000170180", 
          "https://doi.org/10.1007/s00500-004-0435-y"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2009-08-13", 
    "datePublishedReg": "2009-08-13", 
    "description": "A level crossing predictor or alarm system with prediction horizon k is said to be optimal if it, at time t detects that an upcrossing will occur at time t\u2009+\u2009k, with a certain high probability and simultaneously gives a minimum number of false alarms. For a Gaussian stationary process, the optimal level crossing predictor can be explicitly specified in terms of the predicted value of the process itself and of its derivative. To the authors knowledge this simple optimal solution has not been used to any substantial degree. In this paper it is shown how a neural network can be trained to approximate an optimal alarm system arbitrarily well. As in other methods of parametrization, the choice of model structure, as well as an appropriate representation of data, are crucial for a good result. Comparative studies are presented for two Gaussian ARMA-processes, for which the optimal predictor can be derived theoretically. These studies confirm that a properly trained neural network can indeed approximate an optimal alarm system quite well \u2013 with due attention paid to the problems of model structure and representation of data. The technique is also tested on a strongly non-Gaussian Duffing process with satisfactory results.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/s11009-009-9153-3", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": [
      {
        "id": "sg:journal.1043739", 
        "issn": [
          "1387-5841", 
          "1573-7713"
        ], 
        "name": "Methodology and Computing in Applied Probability", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "4", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "12"
      }
    ], 
    "keywords": [
      "optimal alarm system", 
      "neural network", 
      "certain high probability", 
      "time t", 
      "alarm system", 
      "method of parametrization", 
      "Gaussian stationary process", 
      "simple optimal solution", 
      "model structure", 
      "representation of data", 
      "stationary processes", 
      "optimal solution", 
      "horizon K", 
      "optimal predictor", 
      "minimum number", 
      "false alarms", 
      "network", 
      "appropriate representation", 
      "upcrossings", 
      "better results", 
      "high probability", 
      "representation", 
      "parametrization", 
      "system", 
      "alarms", 
      "satisfactory results", 
      "probability", 
      "problem", 
      "solution", 
      "structure", 
      "prediction", 
      "data", 
      "terms", 
      "process", 
      "results", 
      "technique", 
      "number", 
      "derivatives", 
      "method", 
      "comparative study", 
      "choice", 
      "values", 
      "attention", 
      "due attention", 
      "degree", 
      "authors", 
      "substantial degree", 
      "study", 
      "predictors", 
      "paper"
    ], 
    "name": "Level Crossing Prediction with Neural Networks", 
    "pagination": "623-645", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1035931193"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s11009-009-9153-3"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s11009-009-9153-3", 
      "https://app.dimensions.ai/details/publication/pub.1035931193"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-05-20T07:25", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/article/article_483.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/s11009-009-9153-3"
  }
]

Download the RDF metadata as:  json-ld nt turtle xml License info

This table displays all metadata directly associated to this object as RDF triples.

142 TRIPLES      22 PREDICATES      77 URIs      67 LITERALS      6 BLANK NODES