Please use this identifier to cite or link to this item: http://hdl.handle.net/1843/ESBF-9GMN7J
Full metadata record
DC FieldValueLanguage
dc.contributor.advisor1Nivio Zivianipt_BR
dc.contributor.advisor-co1Adriano Alonso Velosopt_BR
dc.contributor.referee1Berthier Ribeiro de Araujo Netopt_BR
dc.contributor.referee2Leandro Balby Marinhopt_BR
dc.contributor.referee3Ricardo Baeza-yatespt_BR
dc.contributor.referee4Wagner Meira Juniorpt_BR
dc.creatorAnisio Mendes Lacerdapt_BR
dc.date.accessioned2019-08-09T23:17:59Z-
dc.date.available2019-08-09T23:17:59Z-
dc.date.issued2013-12-20pt_BR
dc.identifier.urihttp://hdl.handle.net/1843/ESBF-9GMN7J-
dc.description.abstractDaily-deals sites (DDSs), such as Groupon and Peixe Urbano, attract millions of customers in the hunt for offers at significantly reduced prices. The challenge of DDSs is to find the best match between deals and customers while generating as much revenue as possible. One important objective of a DDS is to improve the aggregated value customers give to emails, which should not be seen as spam. This thesis solves three different problems in order to guarantee revenue maximization and customer satisfaction. First, a method for predicting the number of coupons a deal is going to sell is proposed. Second, we present an email prioritization approach. Third, we introduce a new strategy for deals recommendation via email. All three methods improved the results of state-of-the-art algorithms for the tasks being addressed, with gains in precision varying from 7% to 21%, while reducing the number of emails sent in 40% without affecting the number of customers clicking the deals in emails.pt_BR
dc.description.resumoDaily-deals sites (DDSs), such as Groupon and Peixe Urbano, attract millions of customers in the hunt for offers at significantly reduced prices. The challenge of DDSs is to find the best match between deals and customers while generating as much revenue as possible. One important objective of a DDS is to improve the aggregated value customers give to emails, which should not be seen as spam. This thesis solves three different problems in order to guarantee revenue maximization and customer satisfaction. First, a method for predicting the number of coupons a deal is going to sell is proposed. Second, we present an email prioritization approach. Third, we introduce a new strategy for deals recommendation via email. All three methods improved the results of state-of-the-art algorithms for the tasks being addressed, with gains in precision varying from 7% to 21%, while reducing the number of emails sent in 40% without affecting the number of customers clicking the deals in emails.pt_BR
dc.languagePortuguêspt_BR
dc.publisherUniversidade Federal de Minas Geraispt_BR
dc.publisher.initialsUFMGpt_BR
dc.rightsAcesso Abertopt_BR
dc.subjectRecommender Systemspt_BR
dc.subjectDaily-deals sitespt_BR
dc.subject.otherSistema de recomendaçãopt_BR
dc.subject.otherComputaçãopt_BR
dc.subject.otherSistemas de recuperação de informaçãopt_BR
dc.titleRevenue optimization and customer targeting in daily-deals sitespt_BR
dc.typeTese de Doutoradopt_BR
Appears in Collections:Teses de Doutorado

Files in This Item:
File Description SizeFormat 
an_siomendeslacerda.pdf1.77 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.