<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=129844"><dc:title>Evaluating Model Tradeoffs for Click Prediction</dc:title><dc:creator>Kalc,	Matej	(Avtor)
	</dc:creator><dc:creator>Demšar,	Jure	(Mentor)
	</dc:creator><dc:creator>Kopič,	Davorin	(Komentor)
	</dc:creator><dc:creator>Hartman,	Jan	(Komentor)
	</dc:creator><dc:subject>CTR prediction</dc:subject><dc:subject>Factorization machines</dc:subject><dc:subject>Deep learning</dc:subject><dc:subject>Online learning</dc:subject><dc:subject>Bayesian optimization</dc:subject><dc:description>In the context of online advertising, Click-Through Rate (CTR) is the probability that a user clicks on an ad. CTR prediction is done using machine learning methods, such as Factorization machines (FM) and neural networks. Various improved versions of these traditional approaches have been proposed in the last decade, the main goal of this thesis is to evaluate these upgrades. We evaluated the models in two phases: using different combinations of parameters and using Bayesian optimization for parameter tuning. In the first phase, results showed that the group of models that use neural networks achieves a higher Area Under the ROC Curve (AUC). Kernel-extended Factorization Machine, a new proposed model during the Data Science project competition at the Faculty of Computer Science, performed worse than the FM model. In the second phase, we applied Bayesian optimization to the models to achieve an even higher AUC. The second-generation of the Deep&amp;Cross model surprisingly surpassed Deep Factorization Machine with a higher AUC, which had the highest AUC in the first phase. During the evaluation, we also tested the degree of FM and concluded that there is no need for a degree higher than two.</dc:description><dc:date>2021</dc:date><dc:date>2021-09-08 16:05:01</dc:date><dc:type>Diplomsko delo/naloga</dc:type><dc:identifier>129844</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
