What You Like, What I Am: Online Dating Recommendation via Matching Individual Preferences With Features

Dating recommendation becomes a critical task since the rapidly development of the online dating sites and it is beneficial for users to find their ideal relationships from a large number of registered members. Different users usually have different tastes when choosing their dating partners. Theref...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on knowledge and data engineering 2023-05, Vol.35 (5), p.5400-5412
Hauptverfasser: Zheng, Xuanzhi, Zhao, Guoshuai, Zhu, Li, Zhu, Jihua, Qian, Xueming
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 5412
container_issue 5
container_start_page 5400
container_title IEEE transactions on knowledge and data engineering
container_volume 35
creator Zheng, Xuanzhi
Zhao, Guoshuai
Zhu, Li
Zhu, Jihua
Qian, Xueming
description Dating recommendation becomes a critical task since the rapidly development of the online dating sites and it is beneficial for users to find their ideal relationships from a large number of registered members. Different users usually have different tastes when choosing their dating partners. Therefore, it is necessary to distinguish the user's personal features and preferences in dating recommendation methods. However, present approaches don't capture enough user preferences from social graph and attribute data. They also ignore user attributes, which is the complementary and consistent side information of user social graphs. In this paper, we propose a Matching Individual Preferences with Features (MIPF) model to recommend dating partners jointly using user attributes and social graphs. Our specific design in the model is that user preferences and user features are completely different. User features are users' personal characteristics, while user preferences indicate which kind of other users they are seeking. We aim to model user features and preferences to identify what the user is and what the user likes. We also distinguish user preferences into explicit preference and implicit preferences. The implicit preferences are mined from social graphs, while the explicit preferences are captured from the social links. Additionally, convolutional neural networks are used to extract the latent non-linear information in user attributes. Experiments on real-world online dating datasets demonstrate our MIPF model is superior to existing methods.
doi_str_mv 10.1109/TKDE.2022.3148485
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2795804131</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9706322</ieee_id><sourcerecordid>2795804131</sourcerecordid><originalsourceid>FETCH-LOGICAL-c336t-ea3e6e6d2c8dc0933964c2f99703ea9df7f230863d1040811dc986fdba20ef9f3</originalsourceid><addsrcrecordid>eNo9kNtOwzAMhisEEmPwAIibSNzSkUMPCXfTDjAxNISGJq6ikLg0Y0shbSfx9qRs4sq2_Nv-_UXRJcEDQrC4XT6OJwOKKR0wkvCEp0dRj6QpjykR5DjkOCFxwpL8NDqr6zXGmOec9KJyVaoGvVUtmttPuEF_5QwNt3do4TbWARqrxroP9AK62m7BmVBWDu2sQk-q0WXXmzljd9a0aoOePRTgwWmo0co2JZqCaloP9Xl0UqhNDReH2I9ep5Pl6CGeL-5no-E81oxlTQyKQQaZoZobjQVjIks0LYTIMQMlTJEXlGGeMRM-wpwQowXPCvOuKIZCFKwfXe_3fvnqu4W6keuq9S6clDQXKQ8cGAkqsldpX9V18Cy_vN0q_yMJlh1Q2QGVHVB5ABpmrvYzFgD-9cFYxihlv5T-cQk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2795804131</pqid></control><display><type>article</type><title>What You Like, What I Am: Online Dating Recommendation via Matching Individual Preferences With Features</title><source>IEEE Electronic Library (IEL)</source><creator>Zheng, Xuanzhi ; Zhao, Guoshuai ; Zhu, Li ; Zhu, Jihua ; Qian, Xueming</creator><creatorcontrib>Zheng, Xuanzhi ; Zhao, Guoshuai ; Zhu, Li ; Zhu, Jihua ; Qian, Xueming</creatorcontrib><description>Dating recommendation becomes a critical task since the rapidly development of the online dating sites and it is beneficial for users to find their ideal relationships from a large number of registered members. Different users usually have different tastes when choosing their dating partners. Therefore, it is necessary to distinguish the user's personal features and preferences in dating recommendation methods. However, present approaches don't capture enough user preferences from social graph and attribute data. They also ignore user attributes, which is the complementary and consistent side information of user social graphs. In this paper, we propose a Matching Individual Preferences with Features (MIPF) model to recommend dating partners jointly using user attributes and social graphs. Our specific design in the model is that user preferences and user features are completely different. User features are users' personal characteristics, while user preferences indicate which kind of other users they are seeking. We aim to model user features and preferences to identify what the user is and what the user likes. We also distinguish user preferences into explicit preference and implicit preferences. The implicit preferences are mined from social graphs, while the explicit preferences are captured from the social links. Additionally, convolutional neural networks are used to extract the latent non-linear information in user attributes. Experiments on real-world online dating datasets demonstrate our MIPF model is superior to existing methods.</description><identifier>ISSN: 1041-4347</identifier><identifier>EISSN: 1558-2191</identifier><identifier>DOI: 10.1109/TKDE.2022.3148485</identifier><identifier>CODEN: ITKEEH</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Artificial neural networks ; Bayes methods ; Collaboration ; Data mining ; dating recommendation ; Dating techniques ; Feature extraction ; Graphs ; Matching ; Optimization ; preference embedding ; Recommender system ; Recommender systems ; social network ; Social networking (online) ; Task analysis</subject><ispartof>IEEE transactions on knowledge and data engineering, 2023-05, Vol.35 (5), p.5400-5412</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c336t-ea3e6e6d2c8dc0933964c2f99703ea9df7f230863d1040811dc986fdba20ef9f3</citedby><cites>FETCH-LOGICAL-c336t-ea3e6e6d2c8dc0933964c2f99703ea9df7f230863d1040811dc986fdba20ef9f3</cites><orcidid>0000-0003-4392-8450 ; 0000-0002-3173-6307 ; 0000-0002-3081-8781</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9706322$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9706322$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zheng, Xuanzhi</creatorcontrib><creatorcontrib>Zhao, Guoshuai</creatorcontrib><creatorcontrib>Zhu, Li</creatorcontrib><creatorcontrib>Zhu, Jihua</creatorcontrib><creatorcontrib>Qian, Xueming</creatorcontrib><title>What You Like, What I Am: Online Dating Recommendation via Matching Individual Preferences With Features</title><title>IEEE transactions on knowledge and data engineering</title><addtitle>TKDE</addtitle><description>Dating recommendation becomes a critical task since the rapidly development of the online dating sites and it is beneficial for users to find their ideal relationships from a large number of registered members. Different users usually have different tastes when choosing their dating partners. Therefore, it is necessary to distinguish the user's personal features and preferences in dating recommendation methods. However, present approaches don't capture enough user preferences from social graph and attribute data. They also ignore user attributes, which is the complementary and consistent side information of user social graphs. In this paper, we propose a Matching Individual Preferences with Features (MIPF) model to recommend dating partners jointly using user attributes and social graphs. Our specific design in the model is that user preferences and user features are completely different. User features are users' personal characteristics, while user preferences indicate which kind of other users they are seeking. We aim to model user features and preferences to identify what the user is and what the user likes. We also distinguish user preferences into explicit preference and implicit preferences. The implicit preferences are mined from social graphs, while the explicit preferences are captured from the social links. Additionally, convolutional neural networks are used to extract the latent non-linear information in user attributes. Experiments on real-world online dating datasets demonstrate our MIPF model is superior to existing methods.</description><subject>Artificial neural networks</subject><subject>Bayes methods</subject><subject>Collaboration</subject><subject>Data mining</subject><subject>dating recommendation</subject><subject>Dating techniques</subject><subject>Feature extraction</subject><subject>Graphs</subject><subject>Matching</subject><subject>Optimization</subject><subject>preference embedding</subject><subject>Recommender system</subject><subject>Recommender systems</subject><subject>social network</subject><subject>Social networking (online)</subject><subject>Task analysis</subject><issn>1041-4347</issn><issn>1558-2191</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kNtOwzAMhisEEmPwAIibSNzSkUMPCXfTDjAxNISGJq6ikLg0Y0shbSfx9qRs4sq2_Nv-_UXRJcEDQrC4XT6OJwOKKR0wkvCEp0dRj6QpjykR5DjkOCFxwpL8NDqr6zXGmOec9KJyVaoGvVUtmttPuEF_5QwNt3do4TbWARqrxroP9AK62m7BmVBWDu2sQk-q0WXXmzljd9a0aoOePRTgwWmo0co2JZqCaloP9Xl0UqhNDReH2I9ep5Pl6CGeL-5no-E81oxlTQyKQQaZoZobjQVjIks0LYTIMQMlTJEXlGGeMRM-wpwQowXPCvOuKIZCFKwfXe_3fvnqu4W6keuq9S6clDQXKQ8cGAkqsldpX9V18Cy_vN0q_yMJlh1Q2QGVHVB5ABpmrvYzFgD-9cFYxihlv5T-cQk</recordid><startdate>20230501</startdate><enddate>20230501</enddate><creator>Zheng, Xuanzhi</creator><creator>Zhao, Guoshuai</creator><creator>Zhu, Li</creator><creator>Zhu, Jihua</creator><creator>Qian, Xueming</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0003-4392-8450</orcidid><orcidid>https://orcid.org/0000-0002-3173-6307</orcidid><orcidid>https://orcid.org/0000-0002-3081-8781</orcidid></search><sort><creationdate>20230501</creationdate><title>What You Like, What I Am: Online Dating Recommendation via Matching Individual Preferences With Features</title><author>Zheng, Xuanzhi ; Zhao, Guoshuai ; Zhu, Li ; Zhu, Jihua ; Qian, Xueming</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c336t-ea3e6e6d2c8dc0933964c2f99703ea9df7f230863d1040811dc986fdba20ef9f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Artificial neural networks</topic><topic>Bayes methods</topic><topic>Collaboration</topic><topic>Data mining</topic><topic>dating recommendation</topic><topic>Dating techniques</topic><topic>Feature extraction</topic><topic>Graphs</topic><topic>Matching</topic><topic>Optimization</topic><topic>preference embedding</topic><topic>Recommender system</topic><topic>Recommender systems</topic><topic>social network</topic><topic>Social networking (online)</topic><topic>Task analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zheng, Xuanzhi</creatorcontrib><creatorcontrib>Zhao, Guoshuai</creatorcontrib><creatorcontrib>Zhu, Li</creatorcontrib><creatorcontrib>Zhu, Jihua</creatorcontrib><creatorcontrib>Qian, Xueming</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on knowledge and data engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zheng, Xuanzhi</au><au>Zhao, Guoshuai</au><au>Zhu, Li</au><au>Zhu, Jihua</au><au>Qian, Xueming</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>What You Like, What I Am: Online Dating Recommendation via Matching Individual Preferences With Features</atitle><jtitle>IEEE transactions on knowledge and data engineering</jtitle><stitle>TKDE</stitle><date>2023-05-01</date><risdate>2023</risdate><volume>35</volume><issue>5</issue><spage>5400</spage><epage>5412</epage><pages>5400-5412</pages><issn>1041-4347</issn><eissn>1558-2191</eissn><coden>ITKEEH</coden><abstract>Dating recommendation becomes a critical task since the rapidly development of the online dating sites and it is beneficial for users to find their ideal relationships from a large number of registered members. Different users usually have different tastes when choosing their dating partners. Therefore, it is necessary to distinguish the user's personal features and preferences in dating recommendation methods. However, present approaches don't capture enough user preferences from social graph and attribute data. They also ignore user attributes, which is the complementary and consistent side information of user social graphs. In this paper, we propose a Matching Individual Preferences with Features (MIPF) model to recommend dating partners jointly using user attributes and social graphs. Our specific design in the model is that user preferences and user features are completely different. User features are users' personal characteristics, while user preferences indicate which kind of other users they are seeking. We aim to model user features and preferences to identify what the user is and what the user likes. We also distinguish user preferences into explicit preference and implicit preferences. The implicit preferences are mined from social graphs, while the explicit preferences are captured from the social links. Additionally, convolutional neural networks are used to extract the latent non-linear information in user attributes. Experiments on real-world online dating datasets demonstrate our MIPF model is superior to existing methods.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TKDE.2022.3148485</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0003-4392-8450</orcidid><orcidid>https://orcid.org/0000-0002-3173-6307</orcidid><orcidid>https://orcid.org/0000-0002-3081-8781</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1041-4347
ispartof IEEE transactions on knowledge and data engineering, 2023-05, Vol.35 (5), p.5400-5412
issn 1041-4347
1558-2191
language eng
recordid cdi_proquest_journals_2795804131
source IEEE Electronic Library (IEL)
subjects Artificial neural networks
Bayes methods
Collaboration
Data mining
dating recommendation
Dating techniques
Feature extraction
Graphs
Matching
Optimization
preference embedding
Recommender system
Recommender systems
social network
Social networking (online)
Task analysis
title What You Like, What I Am: Online Dating Recommendation via Matching Individual Preferences With Features
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T22%3A54%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=What%20You%20Like,%20What%20I%20Am:%20Online%20Dating%20Recommendation%20via%20Matching%20Individual%20Preferences%20With%20Features&rft.jtitle=IEEE%20transactions%20on%20knowledge%20and%20data%20engineering&rft.au=Zheng,%20Xuanzhi&rft.date=2023-05-01&rft.volume=35&rft.issue=5&rft.spage=5400&rft.epage=5412&rft.pages=5400-5412&rft.issn=1041-4347&rft.eissn=1558-2191&rft.coden=ITKEEH&rft_id=info:doi/10.1109/TKDE.2022.3148485&rft_dat=%3Cproquest_RIE%3E2795804131%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2795804131&rft_id=info:pmid/&rft_ieee_id=9706322&rfr_iscdi=true