<?xml version="1.0" encoding="UTF-8" ?>
<oai_dc:dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>A general framework for cost-sensitive boosting</dc:title>
<dc:creator>Landesa Vazquez, Iago</dc:creator>
<dc:subject>1203.04 Inteligencia Artificial</dc:subject>
<dc:subject>1209.04 Teoría y Proceso de decisión</dc:subject>
<dc:description>Boosting algorithms have been widely used to tackle a plethora of problems. Among them, cost-sensitive classification stands out as one of the scenarios in which Boosting is most frequently applied in practice. In the last few years, a lot of approaches have been proposed in the literature to provide standard AdaBoost with asymmetric capabilities, each with a different focus. However, for the researcher, these algorithms shape a confusing heap with diffuse differences and properties, lacking a unified framework to jointly compare, classify, analyze and discuss the approaches on a common basis. Motivated by the preeminent role of AdaBoost in the Viola-Jones framework for object detection in images, a markedly asymmetric learning problem, in this thesis we try to untangle the different Cost-Sensitive AdaBoost alternatives presented in the literature, demystifying some preconceptions and making novel proposals (Cost- Generalized AdaBoost and AdaBoostDB) with a full theoretical derivation. We try to classify, analyze, compare and discuss this family of algorithms in order to build a general framework unifying them. Our final goal is, thus, being able to find a definitive scheme to translate any cost-sensitive learning problem to the AdaBoost framework while shedding light on which algorithm ensures the best performance and formal guarantees.</dc:description>
<dc:publisher>Teoría do sinal e comunicacións</dc:publisher>
<dc:publisher>Grupo de Tecnoloxías Multimedia</dc:publisher>
<dc:publisher>Programa Oficial de Doutoramento en Teoría do Sinal e Comunicacións (RD 1393/2007)</dc:publisher>
<dc:contributor>Alba Castro, Jose Luis</dc:contributor>
<dc:date>2016-06-08T08:12:31Z</dc:date>
<dc:date>2016-06-08T08:12:31Z</dc:date>
<dc:date>2014-07-28</dc:date>
<dc:date>2014-06-06</dc:date>
<dc:date>2014-07-28</dc:date>
<dc:date>2016-06-08T08:10:56Z</dc:date>
<dc:type>doctoralThesis</dc:type>
<dc:identifier>http://hdl.handle.net/11093/259</dc:identifier>
<dc:identifier>V05D038P01-36096380L</dc:identifier>
<dc:language>eng</dc:language>
<dc:rights>openAccess</dc:rights>
</oai_dc:dc>
<?xml version="1.0" encoding="UTF-8" ?>
<atom:entry>
<atom:id>http://www.investigo.biblioteca.uvigo.es/oai/metadata/handle/11093/259/ore.xml</atom:id>
<atom:published>2018-03-14T00:34:34.475+01:00</atom:published>
<atom:updated>2018-03-14T00:34:34.475+01:00</atom:updated>
<atom:source>
<atom:generator uri="http://www.investigo.biblioteca.uvigo.es/oai">Investigo</atom:generator>
</atom:source>
<atom:title>A general framework for cost-sensitive boosting</atom:title>
<atom:author>
<atom:name>Landesa Vazquez, Iago</atom:name>
</atom:author>
<oreatom:triples>
<rdf:Description about="http://www.investigo.biblioteca.uvigo.es/oai/metadata/handle/11093/259/ore.xml">
<dcterms:modified>2018-03-13T12:56:09.849+01:00</dcterms:modified>
</rdf:Description>
<rdf:Description about="http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/259/A%20General%20Framework%20for%20Cost-Sensitive%20Boosting.pdf.txt?sequence=4">
<dcterms:description>TEXT</dcterms:description>
</rdf:Description>
<rdf:Description about="http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/259/sword.zip?sequence=3">
<dcterms:description>SWORD</dcterms:description>
</rdf:Description>
<rdf:Description about="http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/259/license.txt?sequence=2">
<dcterms:description>LICENSE</dcterms:description>
</rdf:Description>
<rdf:Description about="http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/259/A%20General%20Framework%20for%20Cost-Sensitive%20Boosting.pdf?sequence=1">
<dcterms:description>ORIGINAL</dcterms:description>
</rdf:Description>
</oreatom:triples>
</atom:entry>
<?xml version="1.0" encoding="UTF-8" ?>
<dcterms:dateAccepted lang="" schemaLocation="http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd">2016-06-08T08:12:31Z</dcterms:dateAccepted>
<?xml version="1.0" encoding="UTF-8" ?>
<dcterms:dateAccepted lang="" schemaLocation="http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd">2016-06-08T08:12:31Z</dcterms:dateAccepted>
<?xml version="1.0" encoding="UTF-8" ?>
<rdf:RDF schemaLocation="http://www.w3.org/1999/02/22-rdf-syntax-ns# http://www.openarchives.org/OAI/2.0/rdf.xsd">
<ow:Publication about="oai:investigo.biblioteca.uvigo.es:11093/259">
<dc:contributor>Alba Castro, Jose Luis</dc:contributor>
<dc:creator>Landesa Vazquez, Iago</dc:creator>
<dc:date>2016-06-08T08:12:31Z</dc:date>
<dc:date>2014-07-28</dc:date>
<dc:date>2014-06-06</dc:date>
<dc:identifier>http://hdl.handle.net/11093/259</dc:identifier>
<dc:description>Boosting algorithms have been widely used to tackle a plethora of problems. Among them, cost-sensitive classification stands out as one of the scenarios in which Boosting is most frequently applied in practice. In the last few years, a lot of approaches have been proposed in the literature to provide standard AdaBoost with asymmetric capabilities, each with a different focus. However, for the researcher, these algorithms shape a confusing heap with diffuse differences and properties, lacking a unified framework to jointly compare, classify, analyze and discuss the approaches on a common basis. Motivated by the preeminent role of AdaBoost in the Viola-Jones framework for object detection in images, a markedly asymmetric learning problem, in this thesis we try to untangle the different Cost-Sensitive AdaBoost alternatives presented in the literature, demystifying some preconceptions and making novel proposals (Cost- Generalized AdaBoost and AdaBoostDB) with a full theoretical derivation. We try to classify, analyze, compare and discuss this family of algorithms in order to build a general framework unifying them. Our final goal is, thus, being able to find a definitive scheme to translate any cost-sensitive learning problem to the AdaBoost framework while shedding light on which algorithm ensures the best performance and formal guarantees.</dc:description>
<dc:language>eng</dc:language>
<dc:rights>Attribution-NonCommercial-NoDerivs 3.0 Spain</dc:rights>
<dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/es/</dc:rights>
<dc:title>A general framework for cost-sensitive boosting</dc:title>
<dc:type>doctoralThesis</dc:type>
<dc:rights>openAccess</dc:rights>
<dc:publisher>Teoría do sinal e comunicacións</dc:publisher>
<dc:identifier>V05D038P01-36096380L</dc:identifier>
<dc:publisher>Grupo de Tecnoloxías Multimedia</dc:publisher>
<dc:publisher>Programa Oficial de Doutoramento en Teoría do Sinal e Comunicacións (RD 1393/2007)</dc:publisher>
<dc:subject>1203.04 Inteligencia Artificial</dc:subject>
<dc:subject>1209.04 Teoría y Proceso de decisión</dc:subject>
<dc:authorID>5031</dc:authorID>
<dc:date>2014-07-28</dc:date>
<dc:date>2016-06-08T08:10:56Z</dc:date>
<dc:numberID>5757d30fd5a167.95933693</dc:numberID>
<dc:rights>Si</dc:rights>
<dc:advisorID>4</dc:advisorID>
<dc:source>Comunidad</dc:source>
<dc:source>Tesis</dc:source>
</ow:Publication>
</rdf:RDF>
<?xml version="1.0" encoding="UTF-8" ?>
<dcterms:dateAccepted lang="">2016-06-08T08:12:31Z</dcterms:dateAccepted>