IDEAS home Printed from https://ideas.repec.org/a/eee/jmvana/v41y1992i2p273-296.html
   My bibliography  Save this article

Weak limit theorems for univariate k-mean clustering under a nonregular condition

Author

Listed:
  • Serinko, Regis J.
  • Babu, Gutti Jogesh

Abstract

A set of n points sampled from a common distribution F, is partitioned into k >= 2 groups that maximize the between group sum of squares. The asymptotic normality of the vector of probabilities of lying in each group and the vector of group means is known under the condition that a particular function, depending on F, has a nonsingular Hessian. This condition is not met by the double exponential distribution with k = 2. However, in this case it is shown that limiting distribution for the probability is b sign(W) [radical sign]W and for the two means it is ai sign(W) [radical sign]W, where W ~ N(0,1) and b, a1, and a2 are constants. The rate of convergence in n1/4 and the joint asymptotic disstribution for the two means is concentrated on the line x = y. A general theory is then developed for distributions with singular Hessians. It is shown that the projection of the probability vector onto some sequence of subspaces will have normal limiting distribution and that the rate of convergence is n1/2. Further, a sufficient condition is given to assure that the probability vector and vector of group means have limiting distributions, and the possible limiting distributions under this condition are characterized. The convergence is slower than n1/2.

Suggested Citation

  • Serinko, Regis J. & Babu, Gutti Jogesh, 1992. "Weak limit theorems for univariate k-mean clustering under a nonregular condition," Journal of Multivariate Analysis, Elsevier, vol. 41(2), pages 273-296, May.
  • Handle: RePEc:eee:jmvana:v:41:y:1992:i:2:p:273-296
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0047-259X(92)90070-V
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Citations

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


    Cited by:

    1. Cuesta-Albertos, J. A. & GarcĂ­a-Escudero, L. A. & Gordaliza, A., 2002. "On the Asymptotics of Trimmed Best k-Nets," Journal of Multivariate Analysis, Elsevier, vol. 82(2), pages 486-516, August.
    2. Serinko, Regis J. & Babu, Gutti Jogesh, 1995. "Asymptotics of k-mean clustering under non-i.i.d. sampling," Statistics & Probability Letters, Elsevier, vol. 24(1), pages 57-66, July.

    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:eee:jmvana:v:41:y:1992:i:2:p:273-296. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    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.