A Generalized Sorting Strategy for Computer Classifications View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1966-10

AUTHORS

G. N. LANCE, W. T. WILLIAMS

ABSTRACT

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–5 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. More... »

PAGES

218-218

Journal

TITLE

Nature

ISSUE

5058

VOLUME

212

Identifiers

URI

http://scigraph.springernature.com/pub.10.1038/212218a0

DOI

http://dx.doi.org/10.1038/212218a0

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1027187332


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

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

HOW TO GET THIS DATA PROGRAMMATICALLY:

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.1038/212218a0'

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.1038/212218a0'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1038/212218a0'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1038/212218a0'


 

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

70 TRIPLES      21 PREDICATES      30 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1038/212218a0 schema:about anzsrc-for:08
2 anzsrc-for:0806
3 schema:author Ne0ccd39c142f456a9f90bec16100aec5
4 schema:citation https://doi.org/10.1016/s0065-2296(08)60249-9
5 https://doi.org/10.1093/comjnl/9.1.60
6 https://doi.org/10.2307/2257960
7 schema:datePublished 1966-10
8 schema:datePublishedReg 1966-10-01
9 schema: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–5 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.
10 schema:genre non_research_article
11 schema:inLanguage en
12 schema:isAccessibleForFree false
13 schema:isPartOf N8fb6084163e84a6c8e17c419e99a64ad
14 Ncd3fe09fa3a949269477169c29ac69ef
15 sg:journal.1018957
16 schema:name A Generalized Sorting Strategy for Computer Classifications
17 schema:pagination 218-218
18 schema:productId N3b3babc36b6f4498a4a6429d3e1c821f
19 N718b35b508b446d797175ee9b706ae9b
20 Ncf1ab00dbe9a4cedb2206811d6f5fd50
21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027187332
22 https://doi.org/10.1038/212218a0
23 schema:sdDatePublished 2019-04-11T11:51
24 schema:sdLicense https://scigraph.springernature.com/explorer/license/
25 schema:sdPublisher N1570a457c5ee47988bd4ff75b823a02a
26 schema:url https://www.nature.com/articles/212218a0
27 sgo:license sg:explorer/license/
28 sgo:sdDataset articles
29 rdf:type schema:ScholarlyArticle
30 N1570a457c5ee47988bd4ff75b823a02a schema:name Springer Nature - SN SciGraph project
31 rdf:type schema:Organization
32 N3b3babc36b6f4498a4a6429d3e1c821f schema:name readcube_id
33 schema:value 818253507752dcc77eae70e9c458e2890938cc50915ad7aac4f7347db108c7e5
34 rdf:type schema:PropertyValue
35 N44c1a0397bdd43c9833e86e14215c792 rdf:first Nf2440939cabc4544934f63a12c47eaae
36 rdf:rest rdf:nil
37 N718b35b508b446d797175ee9b706ae9b schema:name doi
38 schema:value 10.1038/212218a0
39 rdf:type schema:PropertyValue
40 N8fb6084163e84a6c8e17c419e99a64ad schema:issueNumber 5058
41 rdf:type schema:PublicationIssue
42 N9f3c13ff34f74a7a9ce19fdb3ddf8f0f schema:familyName LANCE
43 schema:givenName G. N.
44 rdf:type schema:Person
45 Ncd3fe09fa3a949269477169c29ac69ef schema:volumeNumber 212
46 rdf:type schema:PublicationVolume
47 Ncf1ab00dbe9a4cedb2206811d6f5fd50 schema:name dimensions_id
48 schema:value pub.1027187332
49 rdf:type schema:PropertyValue
50 Ne0ccd39c142f456a9f90bec16100aec5 rdf:first N9f3c13ff34f74a7a9ce19fdb3ddf8f0f
51 rdf:rest N44c1a0397bdd43c9833e86e14215c792
52 Nf2440939cabc4544934f63a12c47eaae schema:familyName WILLIAMS
53 schema:givenName W. T.
54 rdf:type schema:Person
55 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
56 schema:name Information and Computing Sciences
57 rdf:type schema:DefinedTerm
58 anzsrc-for:0806 schema:inDefinedTermSet anzsrc-for:
59 schema:name Information Systems
60 rdf:type schema:DefinedTerm
61 sg:journal.1018957 schema:issn 0090-0028
62 1476-4687
63 schema:name Nature
64 rdf:type schema:Periodical
65 https://doi.org/10.1016/s0065-2296(08)60249-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1023661559
66 rdf:type schema:CreativeWork
67 https://doi.org/10.1093/comjnl/9.1.60 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029095841
68 rdf:type schema:CreativeWork
69 https://doi.org/10.2307/2257960 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069851279
70 rdf:type schema:CreativeWork
 




Preview window. Press ESC to close (or click here)


...