检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张吉玉 张均胜[1] Zhang Jiyu;Zhang Junsheng(Institute of Scientific and Technical Information of China,Beijing 100038)
出 处:《图书情报工作》2022年第17期93-105,共13页Library and Information Service
基 金:国家重点研发计划项目“颠覆性技术识别理论、方法与专家预判系统”(项目编号:2019YFA0707201);中国科学技术信息研究所创新研究基金项目"科技论文原创性与新颖性评估方法研究"(项目编号:MS2022-05)研究成果之一。
摘 要:[目的/意义]结合时间序列对科技文献新颖性进行分析,从历史发展的视角评估其创新性,为科技文献代表作评价提供辅助。[方法/过程]提出一种考虑时序的科技文献问题-方法矩阵用于评估单篇文献新颖性。该方法利用模式匹配和词表匹配抽取文献中的研究问题和研究方法,再用Jaccard系数计算文本相似度进行相似文本聚类,构建问题-方法矩阵用于评估文献的时间相关新颖性,并以可视化矩阵的形式呈现评估结果。[结果/结论]实验中选取发表时间为2019-2021年,分类为TP391.1的222篇文献做数据集,验证本文所提方法的有效性和可行性,结果表明该方法可辅助代表作评价中的新颖性评估。[Purpose/Significance]This paper analyzes the novelty of scientific and technical literature in combination with time series,evaluates its innovativeness from the perspective of historical development,and assists in the evaluation of representative works of scientific and technical literature.[Method/Process]This paper proposed a question-method matrix for scientific and technical literature that considers time series and was used for novelty assessment of a single literature.First,this method used pattern matching and vocabulary matching to extract the research questions and research methods of the literature.Secondly,the Jaccard coefficient was used to calculate the text similarity to cluster similar texts.Next,the problem-method matrix was constructed for assessing the time-relevant novelty of the literature and presented the assessment results in the form of a visual matrix.[Result/Conclusion]In the experiment,222 papers published in 2019-2021 and classified as TP391.1 are selected as the dataset to verify the effectiveness and feasibility of the method proposed in this paper.The results show that the method can assist in novelty evaluation in the evaluation of representative works.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222