IDEAS home Printed from https://ideas.repec.org/a/spr/advdac/v6y2012i3p219-247.html
   My bibliography  Save this article

Clustering of functional data in a low-dimensional subspace

Author

Listed:
  • Michio Yamamoto

Abstract

To find optimal clusters of functional objects in a lower-dimensional subspace of data, a sequential method called tandem analysis, is often used, though such a method is problematic. A new procedure is developed to find optimal clusters of functional objects and also find an optimal subspace for clustering, simultaneously. The method is based on the k-means criterion for functional data and seeks the subspace that is maximally informative about the clustering structure in the data. An efficient alternating least-squares algorithm is described, and the proposed method is extended to a regularized method. Analyses of artificial and real data examples demonstrate that the proposed method gives correct and interpretable results. Copyright Springer-Verlag 2012

Suggested Citation

  • 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.
    • Handle: RePEc:spr:advdac:v:6:y:2012:i:3:p:219-247
    DOI: 10.1007/s11634-012-0113-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11634-012-0113-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11634-012-0113-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.

    References listed on IDEAS

    as
    1. Hardy, Andre, 1996. "On the number of clusters," Computational Statistics & Data Analysis, Elsevier, vol. 23(1), pages 83-96, November.
    2. 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.
    3. Douglas Steinley & Robert Henson, 2005. "OCLUS: An Analytic Method for Generating Clusters with Known Overlap," Journal of Classification, Springer;The Classification Society, vol. 22(2), pages 221-250, September.
    4. Glenn Milligan & Martha Cooper, 1985. "An examination of procedures for determining the number of clusters in a data set," Psychometrika, Springer;The Psychometric Society, vol. 50(2), pages 159-179, June.
    5. Philippe Besse & J. Ramsay, 1986. "Principal components analysis of sampled functions," Psychometrika, Springer;The Psychometric Society, vol. 51(2), pages 285-311, June.
    6. Jan Leeuw & Forrest Young & Yoshio Takane, 1976. "Additive structure in qualitative data: An alternating least squares method with optimal scaling features," Psychometrika, Springer;The Psychometric Society, vol. 41(4), pages 471-503, December.
    7. 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.
    8. J. O. Ramsay & X. Wang & R. Flanagan, 1995. "A Functional Data Analysis of the Pinch Force of Human Fingers," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 44(1), pages 17-30, March.
    9. 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.
    10. Forrest Young & Jan Leeuw & Yoshio Takane, 1976. "Regression with qualitative and quantitative variables: An alternating least squares method with optimal scaling features," Psychometrika, Springer;The Psychometric Society, vol. 41(4), pages 505-529, December.
    11. Lawrence Hubert & Phipps Arabie, 1985. "Comparing partitions," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 193-218, December.
    12. Tarpey, Thaddeus, 2007. "Linear Transformations and the k-Means Clustering Algorithm: Applications to Clustering Curves," The American Statistician, American Statistical Association, vol. 61, pages 34-40, February.
    13. Boente, Graciela & Fraiman, Ricardo, 2000. "Kernel-based functional principal components," Statistics & Probability Letters, Elsevier, vol. 48(4), pages 335-345, July.
    14. Charles Bouveyron & Julien Jacques, 2011. "Model-based clustering of time series in group-specific functional subspaces," 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. 5(4), pages 281-300, December.
    15. Besse, Philippe C. & Cardot, Herve & Ferraty, Frederic, 1997. "Simultaneous non-parametric regressions of unbalanced longitudinal data," Computational Statistics & Data Analysis, Elsevier, vol. 24(3), pages 255-270, May.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. Douglas L. Steinley & M. J. Brusco, 2019. "Using an Iterative Reallocation Partitioning Algorithm to Verify Test Multidimensionality," Journal of Classification, Springer;The Classification Society, vol. 36(3), pages 397-413, October.
    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. Michael Brusco & Douglas Steinley, 2015. "Affinity Propagation and Uncapacitated Facility Location Problems," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 443-480, October.
    6. Fordellone, Mario & Vichi, Maurizio, 2020. "Finding groups in structural equation modeling through the partial least squares algorithm," Computational Statistics & Data Analysis, Elsevier, vol. 147(C).
    7. 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.
    8. 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.
    9. Kim, Joonpyo & Oh, Hee-Seok, 2020. "Pseudo-quantile functional data clustering," Journal of Multivariate Analysis, Elsevier, vol. 178(C).
    10. 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.
    11. 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.
    12. 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.
    13. Pieter C. Schoonees & Patrick J. F. Groenen & Michel Velden, 2022. "Least-squares bilinear clustering of three-way data," 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. 16(4), pages 1001-1037, December.
    14. Kadziński, MiŁosz & Greco, Salvatore & SŁowiński, Roman, 2012. "Extreme ranking analysis in robust ordinal regression," Omega, Elsevier, vol. 40(4), pages 488-501.
    15. 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.
    16. Golovkine, Steven & Klutchnikoff, Nicolas & Patilea, Valentin, 2022. "Clustering multivariate functional data using unsupervised binary trees," Computational Statistics & Data Analysis, Elsevier, vol. 168(C).
    17. J. Fernando Vera & Rodrigo Macías, 2021. "On the Behaviour of K-Means Clustering of a Dissimilarity Matrix by Means of Full Multidimensional Scaling," Psychometrika, Springer;The Psychometric Society, vol. 86(2), pages 489-513, June.
    18. van Rosmalen, J.M. & Koning, A.J. & Groenen, P.J.F., 2007. "Optimal Scaling of Interaction Effects in Generalized Linear Models," Econometric Institute Research Papers EI 2007-44, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    19. 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.
    20. Boztug, Yasemin & Reutterer, Thomas, 2008. "A combined approach for segment-specific market basket analysis," European Journal of Operational Research, Elsevier, vol. 187(1), pages 294-312, May.

    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:advdac:v:6:y:2012:i:3:p:219-247. 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.