Online Dating Recommendations: Matching Markets and Learning Preferences
Not on the map. Why?
Abstract (arXiv)
Recommendation systems for online dating have recently attracted much attention from the research community. In this paper we proposed a two-side matching framework for online dating recommendations and design an LDA model to learn the user preferences from the observed user messaging behavior and user profile features. Experimental results using data from a large online dating website shows that two-sided matching improves significantly the rate of successful matches by as much as 45%. Finally, using simulated matchings we show that the the LDA model can correctly capture user preferences.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 31 Jan 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 2; 2025: 1; 2026: 1.
6 papers.
- 2023No-regret Algorithms for Fair Resource Allocationcited by 9
- 2024Revisiting Reciprocal Recommender Systems: Metrics, Formulation, and Methodcited by 5
- 2025Off-Policy Evaluation and Learning for Matching Marketscited by 2
- 2021Bandit based centralized matching in two-sided markets for peer to peer lendingcited by 0
- 2024CUPID: A Real-Time Session-Based Reciprocal Recommendation System for a One-on-One Social Discovery Platformcited by 0
- 2026Learn to Match: Two-Sided Matching with Temporally Extended Feedbackcited by 0
- 2026Learn to Match: Two-Sided Matching with Temporally Extended Feedback4 Jun 2026
- 2025Off-Policy Evaluation and Learning for Matching Markets18 Jul 2025
- 2024CUPID: A Real-Time Session-Based Reciprocal Recommendation System for a One-on-One Social Discovery Platform8 Oct 2024
- 2024Revisiting Reciprocal Recommender Systems: Metrics, Formulation, and Method19 Aug 2024
- 2023No-regret Algorithms for Fair Resource Allocation11 Mar 2023
- 2021Bandit based centralized matching in two-sided markets for peer to peer lending6 May 2021