Social content matching in MapReduce
Gianmarco De Francisci Morales (IMT Lucca), Aristides Gionis (Yahoo!, Research), Mauro Sozio (MPI Saarbruecken)

TL;DR
This paper introduces two scalable MapReduce algorithms, GreedyMR and StackMR, for social media content matching that optimize relevance and activity regulation, with proven approximation guarantees and practical efficiency.
Contribution
It presents novel MapReduce algorithms with provable guarantees for social content matching, demonstrating high scalability and effectiveness on real-world datasets.
Findings
StackMR requires only poly-logarithmic MapReduce steps
Both algorithms achieve high-quality solutions in practice
Experimental results show favorable trade-offs between quality and efficiency
Abstract
Matching problems are ubiquitous. They occur in economic markets, labor markets, internet advertising, and elsewhere. In this paper we focus on an application of matching for social media. Our goal is to distribute content from information suppliers to information consumers. We seek to maximize the overall relevance of the matched content from suppliers to consumers while regulating the overall activity, e.g., ensuring that no consumer is overwhelmed with data and that all suppliers have chances to deliver their content. We propose two matching algorithms, GreedyMR and StackMR, geared for the MapReduce paradigm. Both algorithms have provable approximation guarantees, and in practice they produce high-quality solutions. While both algorithms scale extremely well, we can show that StackMR requires only a poly-logarithmic number of MapReduce steps, making it an attractive option for…
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.
Taxonomy
TopicsRecommender Systems and Techniques · Spam and Phishing Detection · Advanced Graph Neural Networks
