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": "University of Toronto", 
          "id": "https://www.grid.ac/institutes/grid.17063.33", 
          "name": [
            "Dept. of Statistics and Dept. of Computer Science, University of Toronto, Toronto, Ontario, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Neal", 
        "givenName": "Radford M.", 
        "id": "sg:person.07677172755.27", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07677172755.27"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Toronto", 
          "id": "https://www.grid.ac/institutes/grid.17063.33", 
          "name": [
            "Department of Computer Science, University of Toronto, Toronto, Ontario, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hinton", 
        "givenName": "Geoffrey E.", 
        "id": "sg:person.0615147542.17", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0615147542.17"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/0167-7152(86)90016-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1016253042"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0167-7152(86)90016-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1016253042"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1111/1467-9868.00082", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1021869359"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1998", 
    "datePublishedReg": "1998-01-01", 
    "description": "The EM algorithm performs maximum likelihood estimation for data in which some variables are unobserved. We present a function that resembles negative free energy and show that the M step maximizes this function with respect to the model parameters and the E step maximizes it with respect to the distribution over the unobserved variables. From this perspective, it is easy to justify an incremental variant of the EM algorithm in which the distribution for only one of the unobserved variables is recalculated in each E step. This variant is shown empirically to give faster convergence in a mixture estimation problem. A variant of the algorithm that exploits sparse conditional distributions is also described, and a wide range of other variant algorithms are also seen to be possible.", 
    "editor": [
      {
        "familyName": "Jordan", 
        "givenName": "Michael I.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-94-011-5014-9_12", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-94-010-6104-9", 
        "978-94-011-5014-9"
      ], 
      "name": "Learning in Graphical Models", 
      "type": "Book"
    }, 
    "name": "A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants", 
    "pagination": "355-368", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-94-011-5014-9_12"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "2d3abc1f5dad12b0910bcec46e23443c19b1f7e08be428998e4ba18d9c5a2b89"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1009494930"
        ]
      }
    ], 
    "publisher": {
      "location": "Dordrecht", 
      "name": "Springer Netherlands", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-94-011-5014-9_12", 
      "https://app.dimensions.ai/details/publication/pub.1009494930"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T17:47", 
    "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_8678_00000553.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/978-94-011-5014-9_12"
  }
]

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.

79 TRIPLES      23 PREDICATES      29 URIs      20 LITERALS      8 BLANK NODES