<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-05-28T07:45:57Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/22641" metadataPrefix="rdf">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/22641</identifier><datestamp>2026-02-03T11:58:39Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37959</setSpec></header><metadata><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:ds="http://dspace.org/ds/elements/1.1/" xmlns:ow="http://www.ontoweb.org/ontology/1#" xmlns:rdf="http://www.openarchives.org/OAI/2.0/rdf/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/rdf/ http://www.openarchives.org/OAI/2.0/rdf.xsd">
   <ow:Publication rdf:about="oai:riuma.uma.es:10630/22641">
      <dc:title>Time Series Clustering with Deep Reservoir Computing</dc:title>
      <dc:creator>Atencia-Ruiz, Miguel Alejandro</dc:creator>
      <dc:creator>Gallicchio, Claudio</dc:creator>
      <dc:creator>Joya-Caparrós, Gonzalo</dc:creator>
      <dc:creator>Micheli, Alessio</dc:creator>
      <dc:subject>Análisis cluster -- Programas de ordenador</dc:subject>
      <dc:description>This paper proposes a method for clustering of time series, based upon the ability of deep Reservoir Computing networks to grasp&#xd;
the dynamical structure of the series that is presented as input. A standard clustering algorithm, such as k-means, is applied to the network states, rather than the input series themselves. Clustering is thus embedded into the network dynamical evolution, since a clustering result is obtained at every time step, which in turn serves as initialisation at the next step. We empirically assess the performance of deep reservoir systems in time series clustering on benchmark datasets, considering the influence of crucial hyperparameters. Experimentation with the proposed model shows enhanced clustering quality, measured by the silhouette coefficient, when compared to both static clustering of data, and dynamic clustering with a shallow network.</dc:description>
      <dc:date>2021-07-14T07:56:18Z</dc:date>
      <dc:date>2021-07-14T07:56:18Z</dc:date>
      <dc:date>2021</dc:date>
      <dc:date>2020</dc:date>
      <dc:type>conference output</dc:type>
      <dc:identifier>Atencia M., Gallicchio C., Joya G., Micheli A. (2020) Time Series Clustering with Deep Reservoir Computing. In: Farkaš I., Masulli P., Wermter S. (eds) Artificial Neural Networks and Machine Learning – ICANN 2020. ICANN 2020. Lecture Notes in Computer Science, vol 12397. Springer, Cham. https://doi.org/10.1007/978-3-030-61616-8_39</dc:identifier>
      <dc:identifier>https://hdl.handle.net/10630/22641</dc:identifier>
      <dc:language>eng</dc:language>
      <dc:relation>29th International Conference on Artificial Neural Networks (ICANN 2020)</dc:relation>
      <dc:relation>Bratislava, Eslovaquia</dc:relation>
      <dc:relation>Septiembre 2020</dc:relation>
      <dc:rights>open access</dc:rights>
      <dc:publisher>Springer</dc:publisher>
   </ow:Publication>
</rdf:RDF>
</metadata></record></GetRecord></OAI-PMH>