IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v1y1984i1p75-92.html
   My bibliography  Save this article

Unclassed matrix shading and optimal ordering in hierarchical cluster analysis

Author

Listed:
  • Nathan Gale
  • William Halperin
  • C. Costanzo

Abstract

No abstract is available for this item.

Suggested Citation

  • Nathan Gale & William Halperin & C. Costanzo, 1984. "Unclassed matrix shading and optimal ordering in hierarchical cluster analysis," Journal of Classification, Springer;The Classification Society, vol. 1(1), pages 75-92, December.
    • Handle: RePEc:spr:jclass:v:1:y:1984:i:1:p:75-92
    DOI: 10.1007/BF01890117
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF01890117
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF01890117?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Richard Degerman, 1982. "Ordered binary trees constructed through an application of Kendall's tau," Psychometrika, Springer;The Psychometric Society, vol. 47(4), pages 523-527, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. repec:jss:jstsof:25:i03 is not listed on IDEAS
    2. Hahsler, Michael & Hornik, Kurt & Buchta, Christian, 2008. "Getting Things in Order: An Introduction to the R Package seriation," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 25(i03).
    3. Sulaiman Abdullah Alateyah, 2023. "Proposal of a Visualization System for a Hierarchical Clustering Algorithm: The Visualize Proximity Matrix," Computer and Information Science, Canadian Center of Science and Education, vol. 16(4), pages 1-65, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Simon Blanchard & Wayne DeSarbo, 2013. "A New Zero-Inflated Negative Binomial Methodology for Latent Category Identification," Psychometrika, Springer;The Psychometric Society, vol. 78(2), pages 322-340, April.
    2. Willem Heiser & Lawrence Hubert & Bert Green & Philip Hopke & William Day & Phipps Arabie, 1984. "Book reviews," Journal of Classification, Springer;The Classification Society, vol. 1(1), pages 271-288, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:1:y:1984:i:1:p:75-92. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.