Abstract

We propose a new algorithm for unsupervised classification of functional data – indexed by the sites of a spatial lattice – that exploits spatial dependence by repeatedly generating random connectivity maps and by clustering, at each iteration, local representatives of neighbouring functional data. The algorithm supports different implementations – both with respect to the treatment of spatial dependence and to the employed clustering technique – consistent with different contexts arising in applications. The performance of the algorithm is tested on synthetic data. We then illustrate a case study where irradiance data are analyzed to investigate the exploitability of solar energy in different areas of the planet.

Full Text
Paper version not known

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 call

Disclaimer: 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.