A Machine Learning Guided Path for Optimal Literature Review

TEM Journal Pub Date : 2024-02-27 DOI:10.18421/tem131-64
Denitsa Panova
{"title":"A Machine Learning Guided Path for Optimal Literature Review","authors":"Denitsa Panova","doi":"10.18421/tem131-64","DOIUrl":null,"url":null,"abstract":"This paper introduces a novel machine learning framework to address the challenge of optimizing literature research by identifying the optimal path. To create dataset and ensure the versatility of the solution for different applications, we developed an online scraping tool designed to extract articles from ResearchGate based on a specific search query. The proposed machine learning model leverages contextual embeddings and graph theory, translating intricate scholarly work into informative steps for one to go wider rather than deeper in their research. By employing a Christofides approximation of the Traveling Salesman Problem algorithm, our model efficiently navigates through more than 1000 article embeddings. We prove that the resulting path not only accelerates the knowledge gaining process, but also evidently diversifies the findings. Moreover, we evaluated multiple PDF reader libraries to arrive at the most suitable one for the purpose. This adaptability allows the framework to be applied not only to scraped articles, but also to those stored as PDF files, giving an option for multiple data sources. In conclusion, this paper presents a transformative approach for literature research optimization, equipping researchers with a potent tool to efficiently explore articles.","PeriodicalId":515899,"journal":{"name":"TEM Journal","volume":"33 11","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"TEM Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18421/tem131-64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper introduces a novel machine learning framework to address the challenge of optimizing literature research by identifying the optimal path. To create dataset and ensure the versatility of the solution for different applications, we developed an online scraping tool designed to extract articles from ResearchGate based on a specific search query. The proposed machine learning model leverages contextual embeddings and graph theory, translating intricate scholarly work into informative steps for one to go wider rather than deeper in their research. By employing a Christofides approximation of the Traveling Salesman Problem algorithm, our model efficiently navigates through more than 1000 article embeddings. We prove that the resulting path not only accelerates the knowledge gaining process, but also evidently diversifies the findings. Moreover, we evaluated multiple PDF reader libraries to arrive at the most suitable one for the purpose. This adaptability allows the framework to be applied not only to scraped articles, but also to those stored as PDF files, giving an option for multiple data sources. In conclusion, this paper presents a transformative approach for literature research optimization, equipping researchers with a potent tool to efficiently explore articles.
优化文献综述的机器学习指导路径
本文介绍了一种新颖的机器学习框架,通过确定最佳路径来应对优化文献研究的挑战。为了创建数据集并确保该解决方案在不同应用中的通用性,我们开发了一个在线搜刮工具,旨在根据特定的搜索查询从 ResearchGate 中提取文章。我们提出的机器学习模型利用上下文嵌入和图论,将错综复杂的学术工作转化为信息步骤,让人们在研究中走得更宽而不是更深。通过采用克里斯托菲德斯近似旅行推销员问题(Traveling Salesman Problem)算法,我们的模型可以高效地浏览 1000 多篇文章嵌入。我们证明,由此产生的路径不仅加快了知识获取过程,而且明显地丰富了研究结果。此外,我们还对多个 PDF 阅读器库进行了评估,最终选择了最合适的一个。这种适应性使该框架不仅适用于搜刮的文章,也适用于存储为 PDF 文件的文章,为多种数据源提供了选择。总之,本文提出了一种变革性的文献研究优化方法,为研究人员提供了一种高效探索文章的有力工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信