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/0806", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information Systems", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "familyName": "LANCE", 
        "givenName": "G. N.", 
        "type": "Person"
      }, 
      {
        "familyName": "WILLIAMS", 
        "givenName": "W. T.", 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/s0065-2296(08)60249-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1023661559"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1093/comjnl/9.1.60", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1029095841"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.2307/2257960", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1069851279"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1966-10", 
    "datePublishedReg": "1966-10-01", 
    "description": "AGGLOMERATIVE hierarchical methods of computer classification all begin by calculating distance-measures between elements. The hierarchy is then generated by subjecting these measures to a sorting-strategy, which depends essentially on the definition of a distance-measure between groups of elements. In nearest-neighbour sorting, this is defined as the distance between the closest pair of elements, one in each group. Macnaughton-Smith has pointed out that much more intense clustering can be produced by taking the most remote pair of elements (furthest-neighbour sorting). In group-average sorting1 the distance is defined as the mean of all between-group inter-element distances; in centroid sorting it is the distance between group centroids, defined by a conventional Euclidean model. In median2 sorting the distance of a third group from two which have just fused depends on the previous three inter-group distances in the manner of Apollonius's theorem. Although the earlier of these strategies have received some comparative assessment1,3\u20135 no attempt seems to have been made to generalize them into a single system. As a result, quite different computer strategies have commonly been used, necessitating a separate computer program for each.", 
    "genre": "non_research_article", 
    "id": "sg:pub.10.1038/212218a0", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1018957", 
        "issn": [
          "0090-0028", 
          "1476-4687"
        ], 
        "name": "Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "5058", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "212"
      }
    ], 
    "name": "A Generalized Sorting Strategy for Computer Classifications", 
    "pagination": "218-218", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "818253507752dcc77eae70e9c458e2890938cc50915ad7aac4f7347db108c7e5"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1038/212218a0"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1027187332"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1038/212218a0", 
      "https://app.dimensions.ai/details/publication/pub.1027187332"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T11:51", 
    "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/0000000359_0000000359/records_29186_00000001.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://www.nature.com/articles/212218a0"
  }
]

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.

70 TRIPLES      21 PREDICATES      30 URIs      19 LITERALS      7 BLANK NODES