<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/CINECAstyle.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-09-19T01:54:55Z</responseDate><request verb="GetRecord" identifier="oai:iris.unitn.it:11572/367731" metadataPrefix="oai_dc">https://iris.unitn.it/oai/request</request><GetRecord><record><header><identifier>oai:iris.unitn.it:11572/367731</identifier><datestamp>2026-04-03T00:48:41Z</datestamp><setSpec>com_11572_237821</setSpec><setSpec>com_11572_101871</setSpec><setSpec>col_11572_237822</setSpec><setSpec>ou_ou00002</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>Towards Uncovering the True Use of Unlabeled Data in Machine Learning</dc:title>
<dc:creator>Sansone, Emanuele</dc:creator>
<dc:contributor>Sansone, Emanuele</dc:contributor>
<dc:contributor>De Natale, Francesco</dc:contributor>
<dc:subject>Settore INF/01 - Informatica</dc:subject>
<dc:subject>Settore ING-INF/03 - Telecomunicazioni</dc:subject>
<dc:subject>Settore ING-INF/05 - Sistemi di Elaborazione delle Informazioni</dc:subject>
<dc:description>Knowing how to exploit unlabeled data is a fundamental problem in machine learning. This dissertation provides contributions in different contexts, including semi-supervised learning, positive unlabeled learning and representation learning. In particular, we ask (i) whether is possible to learn a classifier in the context of limited data, (ii) whether is possible to scale existing models for positive unlabeled learning, and (iii) whether is possible to train a deep generative model with a single minimization problem.</dc:description>
<dc:date>2018</dc:date>
<dc:type>info:eu-repo/semantics/doctoralThesis</dc:type>
<dc:identifier>https://hdl.handle.net/11572/367731</dc:identifier>
<dc:identifier>http://dx.doi.org/10.15168/11572_367731</dc:identifier>
<dc:identifier>10.15168/11572_367731</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>firstpage:1</dc:relation>
<dc:relation>lastpage:86</dc:relation>
<dc:relation>numberofpages:86</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:publisher>Università degli studi di Trento</dc:publisher>
<dc:publisher>place:TRENTO</dc:publisher>
<dc:rights>license:Tutti i diritti riservati (All rights reserved)</dc:rights>
<dc:rights>license:Tutti i diritti riservati (All rights reserved)</dc:rights>
<dc:rights>license uri:iris.PRI01</dc:rights>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>