Hierarchical grouping methods and stopping rules: an evaluation

Clicks: 110
ID: 300091
1977
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
Steady

Ranked #4 of 42 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
Hierarchical clustering procedures have received a great deal of emphasis in recent years, yet research has lagged in their empirical evaluation and in objective means to aid the user in selecting good partitions (rather than good hierarchies). The present paper aims to correct both of these deficiencies, first by empirically testing selected methods which have become popular and, second by proposing and evaluating statistical stopping rules. Results indicate: 1. that methods vary widely in their performance and 2. that the proposed stopping rules can aid the user in selecting partitions.
Reference Key
openalex_W2001860992 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Richard Mojena
Are you one of these authors? Claim your profile
Journal The Computer Journal
Year 1977
DOI
10.1093/comjnl/20.4.359
URL
https://academic.oup.com/comjnl/article-pdf/20/4/359/1108679/200359.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.