IDEAS home Printed from https://ideas.repec.org/a/bla/scjsta/v41y2014i4p913-931.html
   My bibliography  Save this article

Strong Consistency of Reduced K-means Clustering

Author

Listed:
  • Yoshikazu Terada

Abstract

type="main" xml:id="sjos12074-abs-0001"> Reduced k-means clustering is a method for clustering objects in a low-dimensional subspace. The advantage of this method is that both clustering of objects and low-dimensional subspace reflecting the cluster structure are simultaneously obtained. In this paper, the relationship between conventional k-means clustering and reduced k-means clustering is discussed. Conditions ensuring almost sure convergence of the estimator of reduced k-means clustering as unboundedly increasing sample size have been presented. The results for a more general model considering conventional k-means clustering and reduced k-means clustering are provided in this paper. Moreover, a consistent selection of the numbers of clusters and dimensions is described.

Suggested Citation

  • Yoshikazu Terada, 2014. "Strong Consistency of Reduced K-means Clustering," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 41(4), pages 913-931, December.
  • Handle: RePEc:bla:scjsta:v:41:y:2014:i:4:p:913-931
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1111/sjos.12074
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. C. Abraham & P. A. Cornillon & E. Matzner‐Løber & N. Molinari, 2003. "Unsupervised Curve Clustering using B‐Splines," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 30(3), pages 581-595, September.
    2. Wei‐Chien Chang, 1983. "On Using Principal Components before Separating a Mixture of Two Multivariate Normal Distributions," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 32(3), pages 267-275, November.
    3. Lawrence Hubert & Phipps Arabie, 1985. "Comparing partitions," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 193-218, December.
    4. Timmerman, Marieke E. & Ceulemans, Eva & Kiers, Henk A.L. & Vichi, Maurizio, 2010. "Factorial and reduced K-means reconsidered," Computational Statistics & Data Analysis, Elsevier, vol. 54(7), pages 1858-1871, July.
    5. Vichi, Maurizio & Kiers, Henk A. L., 2001. "Factorial k-means analysis for two-way data," Computational Statistics & Data Analysis, Elsevier, vol. 37(1), pages 49-64, July.
    6. R. C. H. Cheng & W. B. Liu, 2001. "The Consistency of Estimators in Finite Mixture Models," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 28(4), pages 603-616, December.
    7. Junhui Wang, 2010. "Consistent selection of the number of clusters via crossvalidation," Biometrika, Biometrika Trust, vol. 97(4), pages 893-904.
    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. Gautier Marti & S'ebastien Andler & Frank Nielsen & Philippe Donnat, 2016. "Clustering Financial Time Series: How Long is Enough?," Papers 1603.04017, arXiv.org, revised Apr 2016.
    2. Gautier Marti & Frank Nielsen & Philippe Donnat & S'ebastien Andler, 2016. "On clustering financial time series: a need for distances between dependent random variables," Papers 1603.07822, arXiv.org.
    3. Yoshikazu Terada, 2015. "Strong consistency of factorial $$K$$ K -means clustering," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 67(2), pages 335-357, April.
    4. Gautier Marti & Sébastien Andler & Frank Nielsen & Philippe Donnat, 2016. "Clustering Financial Time Series: How Long is Enough?," Post-Print hal-01400395, HAL.
    5. Matteo Barigozzi, 2023. "Quasi Maximum Likelihood Estimation of High-Dimensional Factor Models: A Critical Review," Papers 2303.11777, arXiv.org, revised Dec 2023.
    6. Jiangtao Duan & Wei Gao & Hao Qu & Hon Keung Tony, 2019. "Subspace Clustering for Panel Data with Interactive Effects," Papers 1909.09928, arXiv.org, revised Feb 2021.
    7. Chakraborty, Saptarshi & Das, Swagatam, 2021. "On uniform concentration bounds for Bi-clustering by using the Vapnik–Chervonenkis theory," Statistics & Probability Letters, Elsevier, vol. 175(C).

    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. Michael C. Thrun & Alfred Ultsch, 2021. "Using Projection-Based Clustering to Find Distance- and Density-Based Clusters in High-Dimensional Data," Journal of Classification, Springer;The Classification Society, vol. 38(2), pages 280-312, July.
    2. Michio Yamamoto, 2012. "Clustering of functional data in a low-dimensional subspace," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 6(3), pages 219-247, October.
    3. Kensuke Tanioka & Hiroshi Yadohisa, 2019. "Simultaneous Method of Orthogonal Non-metric Non-negative Matrix Factorization and Constrained Non-hierarchical Clustering," Journal of Classification, Springer;The Classification Society, vol. 36(1), pages 73-93, April.
    4. Roberto Rocci & Stefano Gattone & Maurizio Vichi, 2011. "A New Dimension Reduction Method: Factor Discriminant K-means," Journal of Classification, Springer;The Classification Society, vol. 28(2), pages 210-226, July.
    5. Masaki Mitsuhiro & Hiroshi Yadohisa, 2015. "Reduced $$k$$ k -means clustering with MCA in a low-dimensional space," Computational Statistics, Springer, vol. 30(2), pages 463-475, June.
    6. Yoshikazu Terada, 2015. "Strong consistency of factorial $$K$$ K -means clustering," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 67(2), pages 335-357, April.
    7. Luca Greco & Antonio Lucadamo & Pietro Amenta, 2020. "An Impartial Trimming Approach for Joint Dimension and Sample Reduction," Journal of Classification, Springer;The Classification Society, vol. 37(3), pages 769-788, October.
    8. Li, Pai-Ling & Chiou, Jeng-Min, 2011. "Identifying cluster number for subspace projected functional data clustering," Computational Statistics & Data Analysis, Elsevier, vol. 55(6), pages 2090-2103, June.
    9. Uno, Kohei & Satomura, Hironori & Adachi, Kohei, 2016. "Fixed factor analysis with clustered factor score constraint," Computational Statistics & Data Analysis, Elsevier, vol. 94(C), pages 265-274.
    10. DeSarbo, Wayne S. & Selin Atalay, A. & Blanchard, Simon J., 2009. "A three-way clusterwise multidimensional unfolding procedure for the spatial representation of context dependent preferences," Computational Statistics & Data Analysis, Elsevier, vol. 53(8), pages 3217-3230, June.
    11. Naoto Yamashita & Shin-ichi Mayekawa, 2015. "A new biplot procedure with joint classification of objects and variables by fuzzy c-means clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 9(3), pages 243-266, September.
    12. Dirk Depril & Iven Mechelen & Tom Wilderjans, 2012. "Lowdimensional Additive Overlapping Clustering," Journal of Classification, Springer;The Classification Society, vol. 29(3), pages 297-320, October.
    13. Donatella Vicari & Paolo Giordani, 2023. "CPclus: Candecomp/Parafac Clustering Model for Three-Way Data," Journal of Classification, Springer;The Classification Society, vol. 40(2), pages 432-465, July.
    14. M. Velden & A. Iodice D’Enza & F. Palumbo, 2017. "Cluster Correspondence Analysis," Psychometrika, Springer;The Psychometric Society, vol. 82(1), pages 158-185, March.
    15. Julian Rossbroich & Jeffrey Durieux & Tom F. Wilderjans, 2022. "Model Selection Strategies for Determining the Optimal Number of Overlapping Clusters in Additive Overlapping Partitional Clustering," Journal of Classification, Springer;The Classification Society, vol. 39(2), pages 264-301, July.
    16. van de Velden, M. & Iodice D' Enza, A. & Palumbo, F., 2014. "Cluster Correspondence Analysis," Econometric Institute Research Papers EI 2014-24, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    17. Kim, Joonpyo & Oh, Hee-Seok, 2020. "Pseudo-quantile functional data clustering," Journal of Multivariate Analysis, Elsevier, vol. 178(C).
    18. Ja‐Yoon Jang & Hee‐Seok Oh & Yaeji Lim & Ying Kuen Cheung, 2021. "Ensemble clustering for step data via binning," Biometrics, The International Biometric Society, vol. 77(1), pages 293-304, March.
    19. Tin Lok James Ng & Thomas Brendan Murphy, 2021. "Model-based Clustering of Count Processes," Journal of Classification, Springer;The Classification Society, vol. 38(2), pages 188-211, July.
    20. Lazhar Labiod & Mohamed Nadif, 2021. "Efficient regularized spectral data embedding," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 15(1), pages 99-119, March.

    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:bla:scjsta:v:41:y:2014:i:4:p:913-931. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0303-6898 .

    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.