基于改进模糊c均值算法的协同过滤

Xiu Guan, Yan Jiang
{"title":"基于改进模糊c均值算法的协同过滤","authors":"Xiu Guan, Yan Jiang","doi":"10.1109/ICSESS54813.2022.9930159","DOIUrl":null,"url":null,"abstract":"This paper studies algorithms for recommending suitable companies for college graduates. Firstly, the SimRank algorithm is used to calculate the students’ similarity matrix.Secondly the students are initially clustered using canopy, the cluster center is retained, and the final clustering result is obtained by fuzzy c-means algorith(FCM). Finally the results are sorted to obtain the final recommendation result. Through the comparative experiment, the algorithm route proposed in this paper is compared with the following four situations:Use the unimproved SimRank algorithm, and other technical routes remain unchanged.Use the improved SimRank algorithm, and use the Canopy algorithm alone.Use the improved SimRank algorithm, and ues the fuzzy c-means algorithm alone. Use the improved SimRank algorithm, use the k-means clustering algorithm alone. In the end, it was found that the algorithmic route proposed in this paper has better accuracy and recommended recall index. In the end, it was found that the algorithmic route proposed in this paper has better accuracy and recommended recall index.","PeriodicalId":265412,"journal":{"name":"2022 IEEE 13th International Conference on Software Engineering and Service Science (ICSESS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Collaborative Filtering Based on Improved Fuzzy C-means Algorithm\",\"authors\":\"Xiu Guan, Yan Jiang\",\"doi\":\"10.1109/ICSESS54813.2022.9930159\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies algorithms for recommending suitable companies for college graduates. Firstly, the SimRank algorithm is used to calculate the students’ similarity matrix.Secondly the students are initially clustered using canopy, the cluster center is retained, and the final clustering result is obtained by fuzzy c-means algorith(FCM). Finally the results are sorted to obtain the final recommendation result. Through the comparative experiment, the algorithm route proposed in this paper is compared with the following four situations:Use the unimproved SimRank algorithm, and other technical routes remain unchanged.Use the improved SimRank algorithm, and use the Canopy algorithm alone.Use the improved SimRank algorithm, and ues the fuzzy c-means algorithm alone. Use the improved SimRank algorithm, use the k-means clustering algorithm alone. In the end, it was found that the algorithmic route proposed in this paper has better accuracy and recommended recall index. In the end, it was found that the algorithmic route proposed in this paper has better accuracy and recommended recall index.\",\"PeriodicalId\":265412,\"journal\":{\"name\":\"2022 IEEE 13th International Conference on Software Engineering and Service Science (ICSESS)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 13th International Conference on Software Engineering and Service Science (ICSESS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS54813.2022.9930159\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 13th International Conference on Software Engineering and Service Science (ICSESS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS54813.2022.9930159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了为大学毕业生推荐合适公司的算法。首先,使用simmrank算法计算学生的相似度矩阵。其次利用冠层对学生进行初始聚类,保留聚类中心,利用模糊c均值算法(FCM)获得最终聚类结果;最后对结果进行排序,得到最终的推荐结果。通过对比实验,将本文提出的算法路由与以下四种情况进行对比:使用未改进的simmrank算法,其他技术路由保持不变。使用改进的simmrank算法,单独使用Canopy算法。采用改进的simmrank算法,单独使用模糊c均值算法。使用改进的simmrank算法,单独使用k-means聚类算法。最后,发现本文提出的算法路线具有更好的准确率和推荐查全率。最后,发现本文提出的算法路线具有更好的准确率和推荐查全率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Collaborative Filtering Based on Improved Fuzzy C-means Algorithm
This paper studies algorithms for recommending suitable companies for college graduates. Firstly, the SimRank algorithm is used to calculate the students’ similarity matrix.Secondly the students are initially clustered using canopy, the cluster center is retained, and the final clustering result is obtained by fuzzy c-means algorith(FCM). Finally the results are sorted to obtain the final recommendation result. Through the comparative experiment, the algorithm route proposed in this paper is compared with the following four situations:Use the unimproved SimRank algorithm, and other technical routes remain unchanged.Use the improved SimRank algorithm, and use the Canopy algorithm alone.Use the improved SimRank algorithm, and ues the fuzzy c-means algorithm alone. Use the improved SimRank algorithm, use the k-means clustering algorithm alone. In the end, it was found that the algorithmic route proposed in this paper has better accuracy and recommended recall index. In the end, it was found that the algorithmic route proposed in this paper has better accuracy and recommended recall index.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信