科研项目相似度判别算法

IF 3.6 3区 管理学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Chong Li, Jinjie Zhang, Anyu Wang, Xuemin Liu, Yunchsun Sun, Shibo Zhang, Zhixia Ji, Justin Z. Zhang
{"title":"科研项目相似度判别算法","authors":"Chong Li, Jinjie Zhang, Anyu Wang, Xuemin Liu, Yunchsun Sun, Shibo Zhang, Zhixia Ji, Justin Z. Zhang","doi":"10.4018/joeuc.332008","DOIUrl":null,"url":null,"abstract":"An enormous challenge for project management is to identify similar research projects accurately and efficiently among numerous proposals. To address this challenge, this paper proposes an algorithm to calculate the similarity between research projects using an improved generating method for fused word order sentence vectors based on USIF (unsupervised random walk sentence embeddings). The experimental results show that the proposed algorithm is about 15.8% more accurate than the existing approaches. The authors also propose a pre-checking algorithm by introducing a complex research cooperation graph to enhance query efficiency. The results show the pre-checking method reduces the query time cost by 96% on average.","PeriodicalId":49029,"journal":{"name":"Journal of Organizational and End User Computing","volume":"57 1","pages":"0"},"PeriodicalIF":3.6000,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Similarity Discriminating Algorithm for Scientific Research Projects\",\"authors\":\"Chong Li, Jinjie Zhang, Anyu Wang, Xuemin Liu, Yunchsun Sun, Shibo Zhang, Zhixia Ji, Justin Z. Zhang\",\"doi\":\"10.4018/joeuc.332008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An enormous challenge for project management is to identify similar research projects accurately and efficiently among numerous proposals. To address this challenge, this paper proposes an algorithm to calculate the similarity between research projects using an improved generating method for fused word order sentence vectors based on USIF (unsupervised random walk sentence embeddings). The experimental results show that the proposed algorithm is about 15.8% more accurate than the existing approaches. The authors also propose a pre-checking algorithm by introducing a complex research cooperation graph to enhance query efficiency. The results show the pre-checking method reduces the query time cost by 96% on average.\",\"PeriodicalId\":49029,\"journal\":{\"name\":\"Journal of Organizational and End User Computing\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":3.6000,\"publicationDate\":\"2023-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Organizational and End User Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/joeuc.332008\",\"RegionNum\":3,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Organizational and End User Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/joeuc.332008","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

项目管理面临的一个巨大挑战是在众多提案中准确有效地识别相似的研究项目。为了解决这一挑战,本文提出了一种基于USIF(无监督随机行走句子嵌入)的融合词序句子向量的改进生成方法来计算研究项目之间的相似度的算法。实验结果表明,该算法的准确率比现有方法提高了15.8%左右。通过引入复杂的研究合作图,提出了一种预检算法,以提高查询效率。结果表明,预检查方法平均减少了96%的查询时间开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Similarity Discriminating Algorithm for Scientific Research Projects
An enormous challenge for project management is to identify similar research projects accurately and efficiently among numerous proposals. To address this challenge, this paper proposes an algorithm to calculate the similarity between research projects using an improved generating method for fused word order sentence vectors based on USIF (unsupervised random walk sentence embeddings). The experimental results show that the proposed algorithm is about 15.8% more accurate than the existing approaches. The authors also propose a pre-checking algorithm by introducing a complex research cooperation graph to enhance query efficiency. The results show the pre-checking method reduces the query time cost by 96% on average.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Organizational and End User Computing
Journal of Organizational and End User Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
6.00
自引率
9.20%
发文量
77
期刊介绍: The Journal of Organizational and End User Computing (JOEUC) provides a forum to information technology educators, researchers, and practitioners to advance the practice and understanding of organizational and end user computing. The journal features a major emphasis on how to increase organizational and end user productivity and performance, and how to achieve organizational strategic and competitive advantage. JOEUC publishes full-length research manuscripts, insightful research and practice notes, and case studies from all areas of organizational and end user computing that are selected after a rigorous blind review by experts in the field.
×
引用
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学术官方微信