Abstract
AbstractWe consider the problem of clustering functional data according to their covariance structure. We contribute a soft clustering methodology based on the Wasserstein–Procrustes distance, where the in‐between cluster variability is penalized by a term proportional to the entropy of the partition matrix. In this way, each covariance operator can be partially classified into more than one group. Such soft classification allows for clusters to overlap, and arises naturally in situations where the separation between all or some of the clusters is not well‐defined. We also discuss how to estimate the number of groups and to test for the presence of any cluster structure. The algorithm is illustrated using simulated and real data. An R implementation is available in the Appendix .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
