skip to main content
10.1145/1835449.1835463acmconferencesArticle/Chapter ViewAbstractPublication PagesirConference Proceedingsconference-collections
research-article

Relevance and ranking in online dating systems

Published: 19 July 2010 Publication History

Abstract

Match-making systems refer to systems where users want to meet other individuals to satisfy some underlying need. Examples of match-making systems include dating services, resume/job bulletin boards, community based question answering, and consumer-to-consumer marketplaces. One fundamental component of a match-making system is the retrieval and ranking of candidate matches for a given user. We present the first in-depth study of information retrieval approaches applied to match-making systems. Specifically, we focus on retrieval for a dating service. This domain offers several unique problems not found in traditional information retrieval tasks. These include two-sided relevance, very subjective relevance, extremely few relevant matches, and structured queries. We propose a machine learned ranking function that makes use of features extracted from the uniquely rich user profiles that consist of both structured and unstructured attributes. An extensive evaluation carried out using data gathered from a real online dating service shows the benefits of our proposed methodology with respect to traditional match-making baseline systems. Our analysis also provides deep insights into the aspects of match-making that are particularly important for producing highly relevant matches.

References

[1]
K. Balog. People Search in the Enterprise. PhD thesis, University of Amsterdam, June 2008.
[2]
B. Carterette and R. Jones. Evaluating search engines by modeling the relationship between relevance and clicks. In NIPS, 2007.
[3]
K. Chakrabarti, K. Porkaew, and S. Mehrotra. Efficient query refinement in multimedia databases. In ICDE '00: Proceedings of the 16th International Conference on Data Engineering, page 196. IEEE Computer Society, 2000.
[4]
O. Chapelle, D. Metzler, Y. Zhang, and P. Grinspan. Expected reciprocal rank for graded relevance. In CIKM 2009, 2009.
[5]
O. Chapelle and Y. Zhang. A dynamic bayesian network click model for web search ranking. In WWW 2009, pages 1--10. ACM, 2009.
[6]
S. Chaudhuri, G. Das, V. Hristidis, and G. Weikum. Probabilistic ranking of database query results. In VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases, pages 888--899. VLDB Endowment, 2004.
[7]
S. Chaudhuri, G. Das, V. Hristidis, and G. Weikum. Probabilistic information retrieval approach for ranking of database query results. ACM Trans. Database Syst., 31(3):1134--1168, 2006.
[8]
N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. In WSDM '08: Proceedings of the international conference on Web search and web data mining, pages 87--94. ACM, 2008.
[9]
B. Efron and R. Tibshirani. An Introduction to the Bootstrap. Chapman & Hall, 1993.
[10]
J. H. Friedman. Greedy function approximation: A gradient boosting machine. The Annals of Statistics, 29(5):1189--1232, 2001.
[11]
D. Gale and L. S. Shapley. College admissions and the stability of marriage. The American Mathematical Monthly, 69(1):9--15, January 1962.
[12]
G. Hitsch, A. Hortaçsu, and D. Ariely. What makes you click? an empirical analysis of online dating. 2005 Meeting Papers 207, Society for Economic Dynamics, 2005.
[13]
R. Irving. An efficient algorithm for the stable roommates problem. Journal of Algorithms, 6:577--595, 1985.
[14]
M. Karimzadehgan and C. Zhai. Constrained multi-aspect expertise matching for committee review assignment. In CIKM 2009, 2009.
[15]
M. Karimzadehgan, C. Zhai, and G. Belford. Multi-aspect expertise matching for review assignment. In CIKM 2008, pages 1113--1122. ACM, 2008.
[16]
J. Kim, X. Xue, and W. B. Croft. A probabilistic retrieval model for semistructured data. In ECIR 2009, pages 228--239. Springer-Verlag, 2009.
[17]
J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In in Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 163--170, 2000.
[18]
V. Lavrenko, X. Yi, and J. Allan. Information retrieval on empty fields. In HLT 2007, pages 89--96. Association for Computational Linguistics, April 2007.
[19]
J. Li, B. Saha, and A. Deshpande. A unified approach to ranking in probabilistic databases. PVLDB, 2(1):502--513, 2009.
[20]
T.-Y. Liu. Learning to Rank for Information Retrieval. Now Publishers, 2009.
[21]
M. Ortega-Binderberger, K. Chakrabarti, and S. Mehrotra. An approach to integrating query refinement in sql. In EDBT '02: Proceedings of the 8th International Conference on Extending Database Technology, pages 15--33. Springer-Verlag, 2002.
[22]
D. Petkova, W. B. Croft, and Y. Diao. Refining keyword queries for xml retrieval by combining content and structure. In ECIR 2009, pages 662--669. Springer-Verlag, 2009.
[23]
F. Radlinski, M. Kurup, and T. Joachims. How does clickthrough data reflect retrieval quality? In CIKM 2008, pages 43--52. ACM, 2008.
[24]
R. Ranganath, D. Jurafsky, and D. McFarland. It's not you, it's me: Detecting flirting and its misperception in speed-dates. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, pages 334--342. Association for Computational Linguistics, August 2009.
[25]
L. Wu, C. Faloutsos, K. P. Sycara, and T. R. Payne. Falcon: Feedback adaptive loop for content-based retrieval. In VLDB '00: Proceedings of the 26th International Conference on Very Large Data Bases, pages 297--306. Morgan Kaufmann Publishers Inc., 2000.
[26]
X. Yi, J. Allan, and W. B. Croft. Matching resumes and jobs based on relevance models. In SIGIR 2007, pages 809--810. ACM, 2007.
[27]
Z. Zheng, H. Zha, T. Zhang, O. Chapelle, K. Chen, and G. Sun. A general boosting method and its application to learning ranking functions for web search. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20, pages 1697--1704. MIT Press, 2008.

Cited By

View all
  • (2023)DODA: A Decentralized Online Dating Application2023 Eleventh International Symposium on Computing and Networking Workshops (CANDARW)10.1109/CANDARW60564.2023.00061(323-327)Online publication date: 27-Nov-2023
  • (2021)Exploring the Experiences of Student Volunteer and Student Volunteer Chair Communities at Academic ConferencesProceedings of the ACM on Human-Computer Interaction10.1145/34795995:CSCW2(1-23)Online publication date: 18-Oct-2021
  • (2019)Effects of Relationship Goal on Linguistic Behavior in Online Dating Profiles: A Multi-Method ApproachFrontiers in Communication10.3389/fcomm.2019.000224Online publication date: 28-May-2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGIR '10: Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
July 2010
944 pages
ISBN:9781450301534
DOI:10.1145/1835449
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 July 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. dating systems
  2. relevance

Qualifiers

  • Research-article

Conference

SIGIR '10
Sponsor:

Acceptance Rates

SIGIR '10 Paper Acceptance Rate 87 of 520 submissions, 17%;
Overall Acceptance Rate 792 of 3,983 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)32
  • Downloads (Last 6 weeks)1
Reflects downloads up to 22 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)DODA: A Decentralized Online Dating Application2023 Eleventh International Symposium on Computing and Networking Workshops (CANDARW)10.1109/CANDARW60564.2023.00061(323-327)Online publication date: 27-Nov-2023
  • (2021)Exploring the Experiences of Student Volunteer and Student Volunteer Chair Communities at Academic ConferencesProceedings of the ACM on Human-Computer Interaction10.1145/34795995:CSCW2(1-23)Online publication date: 18-Oct-2021
  • (2019)Effects of Relationship Goal on Linguistic Behavior in Online Dating Profiles: A Multi-Method ApproachFrontiers in Communication10.3389/fcomm.2019.000224Online publication date: 28-May-2019
  • (2019)Demonstrating Requirement Search on a University Degree Search ApplicationProceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3331184.3331402(1365-1368)Online publication date: 18-Jul-2019
  • (2019)Incorporating facial attractiveness in photos for online dating recommendationElectronic Commerce Research10.1007/s10660-018-9308-919:2(285-310)Online publication date: 1-Jun-2019
  • (2019)Mentor-spotting: recommending expert mentors to mentees for live trouble-shooting in CodementorKnowledge and Information Systems10.1007/s10115-018-1298-361:2(799-820)Online publication date: 1-Nov-2019
  • (2018)Online reciprocal recommendation with theoretical performance guaranteesProceedings of the 32nd International Conference on Neural Information Processing Systems10.5555/3327757.3327919(8267-8277)Online publication date: 3-Dec-2018
  • (2018)Community-Based Recommendation for Cold-Start Problem: A Case Study of Reciprocal Online Dating RecommendationSocial Network Based Big Data Analysis and Applications10.1007/978-3-319-78196-9_10(201-222)Online publication date: 11-May-2018
  • (2017)If It’s ConvenientProceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies10.1145/31309131:3(1-28)Online publication date: 11-Sep-2017
  • (2016)'MASTerful' Matchmaking in Service TransactionsProceedings of the 2016 CHI Conference on Human Factors in Computing Systems10.1145/2858036.2858263(1644-1655)Online publication date: 7-May-2016
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media