IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v36y2019i3d10.1007_s00357-019-09335-3.html
   My bibliography  Save this article

Note: t for Two (Clusters)

Author

Listed:
  • Stanley L. Sclove

    (University of Illinois at Chicago)

Abstract

The computation for cluster analysis is done by iterative algorithms. But here, a straightforward, non-iterative procedure is presented for clustering in the special case of one variable and two groups. The method is univariate but may reasonably be applied to multivariate datasets when the first principal component or a single factor explains much of the variation in the data. The t method is motivated by the fact that minimizing the within-groups sum of squares is equivalent to maximizing the between-groups sum of squares, and that Student’s t statistic measures the between-groups difference in means relative to within-groups variation. That is, the t statistic is the ratio of the difference in sample means, divided by the standard error of this difference. So, maximizing the t statistic is developed as a method for clustering univariate data into two clusters. In this situation, the t method gives the same results as the K-means algorithm. K-means tacitly assumes equality of variances; here, however, with t, equality of variances need not be assumed because separate variances may be used in computing t. The t method is applied to some datasets; the results are compared with those obtained by fitting mixtures of distributions.

Suggested Citation

  • Stanley L. Sclove, 2019. "Note: t for Two (Clusters)," Journal of Classification, Springer;The Classification Society, vol. 36(3), pages 435-441, October.
  • Handle: RePEc:spr:jclass:v:36:y:2019:i:3:d:10.1007_s00357-019-09335-3
    DOI: 10.1007/s00357-019-09335-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-019-09335-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00357-019-09335-3?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.

    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:36:y:2019:i:3:d:10.1007_s00357-019-09335-3. 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: 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.