<?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-04-18T03:37:06Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2445/119121" metadataPrefix="oai_dc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2445/119121</identifier><datestamp>2025-12-05T09:55:18Z</datestamp><setSpec>com_2072_1057</setSpec><setSpec>col_2072_478917</setSpec><setSpec>col_2072_478920</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>Generalized multi-scale stacked sequential learning for multi-class classification</dc:title>
   <dc:creator>Puertas i Prats, Eloi</dc:creator>
   <dc:creator>Escalera Guerrero, Sergio</dc:creator>
   <dc:creator>Pujol Vila, Oriol</dc:creator>
   <dc:subject>Algorismes</dc:subject>
   <dc:subject>Aprenentatge</dc:subject>
   <dc:subject>Algorithms</dc:subject>
   <dc:subject>Learning</dc:subject>
   <dc:description>In many classification problems, neighbor data labels have inherent sequential relationships. Sequential learning algorithms take benefit of these relationships in order to improve generalization. In this paper, we revise the multi-scale sequential learning approach (MSSL) for applying it in the multi-class case (MMSSL). We introduce the error-correcting output codesframework in the MSSL classifiers and propose a formulation for calculating confidence maps from the margins of the base classifiers. In addition, we propose a MMSSL compression approach which reduces the number of features in the extended data set without a loss in performance. The proposed methods are tested on several databases, showing significant performance improvement compared to classical approaches.</dc:description>
   <dc:date>2018-01-18T13:43:24Z</dc:date>
   <dc:date>2018-01-18T13:43:24Z</dc:date>
   <dc:date>2015-04-30</dc:date>
   <dc:date>2018-01-18T13:43:24Z</dc:date>
   <dc:type>info:eu-repo/semantics/article</dc:type>
   <dc:type>info:eu-repo/semantics/acceptedVersion</dc:type>
   <dc:identifier>1433-7541</dc:identifier>
   <dc:identifier>https://hdl.handle.net/2445/119121</dc:identifier>
   <dc:identifier>622017</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>Versió postprint del document publicat a: https://doi.org/10.1007/s10044-013-0333-y</dc:relation>
   <dc:relation>Pattern Analysis and Applications, 2015, vol. 18, num. 2, p. 247-261</dc:relation>
   <dc:relation>https://doi.org/10.1007/s10044-013-0333-y</dc:relation>
   <dc:rights>(c) Springer Verlag, 2015</dc:rights>
   <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
   <dc:format>15 p.</dc:format>
   <dc:format>application/pdf</dc:format>
   <dc:publisher>Springer Verlag</dc:publisher>
   <dc:source>Articles publicats en revistes (Matemàtiques i Informàtica)</dc:source>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>