arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.01189cs.IR
收藏

一种用于分析研究和数据检索的基于自评估编译的搜索方法

A Self-Assessing Compilation Based Search Approach for Analytical Research and Data Retrieval

Ananth Goyal

摘要:

在进行元分析研究时,要从各个数据库和搜索引擎提供的大量来源中进行筛选,会非常耗时,因此降低了来源分析的特异性。本研究旨在预测面向研究的搜索算法在所有主题和搜索技术的可行性,以打击在处理大型数据集的缺陷,通过自动化元分析的三个关键组成部分:基于查询的搜索与预期的研究主题,选择给定的来源,并确定其相关性的原始查询,并提取适用的信息,包括摘录和引文。该算法使用5个关键的历史主题进行评估,结果分为4类:检索到的相关来源的总数,给定特定搜索的效率,完成一个完整周期所需的总时间,以及与当前搜索方法的结果相比,提取的来源的质量。虽然通过几次搜索的结果不同,平均而言,该程序每次搜索共收集了126个来源,平均效率为每秒19.55个来源,当比较和定性评估确定的结果时,表明在所有学科领域开发的算法将在未来的研究方法中取得进展。

英文摘要:

While meta-analytic research is performed, it becomes time-consuming to filter through the sheer amount of sources made available by individual databases and search engines and therefore degrades the specificity of source analysis. This study sought to predict the feasibility of a research-oriented searching algorithm across all topics and a search technique to combat flaws in dealing with large datasets by automating three key components of meta-analysis: a query-based search associated with the intended research topic, selecting given sources and determining their relevance to the original query, and extracting applicable information including excerpts and citations. The algorithm was evaluated using 5 key historical topics, and results were broken down into 4 categories: the total number of relevant sources retrieved, the efficiency given a particular search, the total time it takes to finish a complete cycle, and the quality of the extracted sources when compared to results from current searching methods. Although results differed through several searches, on average, the program collected a total of 126 sources per search with an average efficiency of 19.55 sources per second which, when compared and qualitatively evaluated for definitive results, indicates that an algorithm developed across all subject areas will make progress in future research methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑