Please use this identifier to cite or link to this item:
http://hdl.handle.net/1843/ESBF-9GMN7J
Type: | Tese de Doutorado |
Title: | Revenue optimization and customer targeting in daily-deals sites |
Authors: | Anisio Mendes Lacerda |
First Advisor: | Nivio Ziviani |
First Co-advisor: | Adriano Alonso Veloso |
First Referee: | Berthier Ribeiro de Araujo Neto |
Second Referee: | Leandro Balby Marinho |
Third Referee: | Ricardo Baeza-yates |
metadata.dc.contributor.referee4: | Wagner Meira Junior |
Abstract: | Daily-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. |
Abstract: | Daily-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. |
Subject: | Sistema de recomendação Computação Sistemas de recuperação de informação |
language: | Português |
Publisher: | Universidade Federal de Minas Gerais |
Publisher Initials: | UFMG |
Rights: | Acesso Aberto |
URI: | http://hdl.handle.net/1843/ESBF-9GMN7J |
Issue Date: | 20-Dec-2013 |
Appears in Collections: | Teses de Doutorado |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
an_siomendeslacerda.pdf | 1.77 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.