Revealing Hidden Connections in Recommendation Networks
Rogerio Minhano, Stenio Fernandes, Carlos Kamienski

TL;DR
This paper demonstrates that online social networks can significantly enhance recommendation networks, making marketing campaigns more viral and effective compared to traditional email-based methods.
Contribution
It introduces a method to expand sparse recommendation networks using social network data, showing the effectiveness of social connections in marketing.
Findings
Social networks can densify recommendation graphs
Online social networks outperform email campaigns in viral marketing
Expanded networks lead to more effective recommendation dissemination
Abstract
Companies have been increasingly seeking new mechanisms for making their electronic marketing campaigns to become viral, thus obtaining a cascading recommendation effect similar to word-of-mouth. We analysed a dataset of a magazine publisher that uses email as the main marketing strategy and found out that networks emerging from those campaigns form a very sparse graph. We show that online social networks can be effectively used as a means to expand recommendation networks. Starting from a set of users, called seeders, we crawled Google's Orkut and collected about 20 million users and 80 million relationships. Next, we extended the original recommendation network by adding new edges using Orkut relationships that built a much denser network. Therefore, we advocate that online social networks are much more effective than email-based marketing campaigns
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
