中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Study of Highly Educated Women's Dating Willingness Based on XGboost and CART Algorithm

文献类型:会议论文

作者Haimin, Wang1,3; Ke, Zhao1,2
出版日期2023
会议名称Conference on Communications Technology and Computer Science, ACCTCS 2023
会议日期2023
会议地点不详
页码374-379
英文摘要

The willingness of highly educated women to choose a mate is discussed. First, based on the "one-to-one matching"mode of a well-known marriage platform in China, the training data set and test data set are constructed. Secondly, based on the CART decision tree algorithm, an interpretable model of the female's willingness to choose a mate with high education is constructed, which outputs the common characteristics of the female's willingness to choose a mate and the characteristics of the most popular male group. Then, based on the XGBoost algorithm, an inexplicable model of women with high academic qualifications' willingness to choose a mate is constructed, and a set of intelligent recommendation strategies is proposed, which can provide personalized member recommendation results according to the needs of different female members. The experimental results on the test data set show that the F1-Score of CART decision tree model is 78.1%, and the F1-Score of XGBoost model is 85.2%. The actual test results show that the success rate of the intelligent recommendation strategy is significantly higher than the manual recommendation of the matchmaker.

收录类别EI
会议录2023 3rd Asia-Pacific Conference on Communications Technology and Computer Science, ACCTCS 2023
ISBN号10.1109/ACCTCS58815.2023.00028
源URL[http://ir.psych.ac.cn/handle/311026/45062]  
专题心理研究所_脑与认知科学国家重点实验室
作者单位1.Chinese Academy of Sciences, State Key Laboratory of Brain and Cognitive Science, Institute of Psychology, Beijing, China
2.University of Chinese Academy of Sciences, Department of Psychology, Beijing, China
3.Tieying Hospital, Beijing, China
推荐引用方式
GB/T 7714
Haimin, Wang,Ke, Zhao. Study of Highly Educated Women's Dating Willingness Based on XGboost and CART Algorithm[C]. 见:Conference on Communications Technology and Computer Science, ACCTCS 2023. 不详. 2023.

入库方式: OAI收割

来源:心理研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。