IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v51y2022i21p7322-7339.html
   My bibliography  Save this article

A clustering method combining multiple range tests and K-means

Author

Listed:
  • T. J. Devika
  • J. Ravichandran

Abstract

This paper explores possibilities of applying multiple comparison tests (MCTs) that are commonly used in statistics to group the means once the analysis of variance (ANOVA) procedure rejects the hypothesis that all the means are equal. It is proposed here to apply MCT procedure to perform clustering when the data are repetitive and multidimensional. Since MCT procedure may result in overlapping clusters, we further develop an approach to first form initial clusters and then apply K-means procedure to construct non overlapping clusters. It may be noted that the choice of initial clusters for K-means procedure is still ambiguous. Accordingly, the paper is presented in a sequence covering (i) an algorithm for step-by-step implementation of K-means procedure for clustering, (ii) an algorithm for step-by-step implementation of MCT procedure for clustering and (iii) an algorithm for step-by-step implementation of a combined procedure to resolve the overlapping clusters. Numerical examples including an open data set are considered to demonstrate the algorithms and also to study their performance in terms of total mean square errors.

Suggested Citation

  • T. J. Devika & J. Ravichandran, 2022. "A clustering method combining multiple range tests and K-means," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 51(21), pages 7322-7339, November.
    • Handle: RePEc:taf:lstaxx:v:51:y:2022:i:21:p:7322-7339
    DOI: 10.1080/03610926.2021.1872639
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2021.1872639
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2021.1872639?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:lstaxx:v:51:y:2022:i:21:p:7322-7339. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.