A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems

Clicks: 3
ID: 291625
1967
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #30 of 36 articles by views in The Computer Journal

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
It is shown that the computational behaviour of a hierarchical sorting-strategy depends on three properties, which are established for five conventional strategies and four measures. The conventional strategies are shown to be simple variants of a single linear system defined by four parameters. A new strategy is defined, enabling continuous variation of intensity of grouping by variation in a single parameter. An Appendix provides specifications of computer programs embodying the new principles.
Reference Key
openalex_W2007995029 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors G. N. Lance, W. T. Williams
Journal The Computer Journal
Year 1967
DOI
10.1093/comjnl/9.4.373
URL
https://academic.oup.com/comjnl/article-pdf/9/4/373/1101470/9-4-373.pdf
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.