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

GitHub 仓库去重数据集:扩展描述

A Dataset for GitHub Repository Deduplication: Extended Description

Diomidis Spinellis, Zoe Kotti, Audris Mockus

AI总结:

本文构建了一个包含 1060 万个 GitHub 重复项目的数据集,通过六项指标排名和去噪图连通分量识别副本并关联最终父项目,为实证软件工程提供去重参考。

摘要:

GitHub 项目可以通过站点的 fork 过程或 Git clone-push 序列被轻易复制。这对实证软件工程而言是一个问题,因为它可能导致结果偏差或机器学习模型训练不当。我们提供了一个包含 1060 万个 GitHub 项目的数据集,这些项目是其他项目的副本,并将每条记录与该项目的最终父项目关联。最终父项目是根据六项指标的排名推导得出的。相关项目被计算为一个去噪图的连通分量,该图包含 1820 万个节点和 1200 万条边,通过将边指向最终父项目而创建。该图是通过过滤掉 30 多个手工挑选的和 230 万个模式匹配的聚集项目而创建的。引入不必要聚集的项目是通过反复可视化不相关重要项目之间的最短路径距离来识别的。我们的数据集在现有的包含 180 万个项目的流行参考数据集中识别出了 3 万个重复项目。将我们的数据集与另一个使用不同方法独立创建的数据集进行评估比较,发现了显著的重叠,但也存在差异,这些差异归因于对哪些项目被视为相关的操作性定义。

英文摘要:

GitHub projects can be easily replicated through the site's fork process or through a Git clone-push sequence. This is a problem for empirical software engineering, because it can lead to skewed results or mistrained machine learning models. We provide a dataset of 10.6 million GitHub projects that are copies of others, and link each record with the project's ultimate parent. The ultimate parents were derived from a ranking along six metrics. The related projects were calculated as the connected components of an 18.2 million node and 12 million edge denoised graph created by directing edges to ultimate parents. The graph was created by filtering out more than 30 hand-picked and 2.3 million pattern-matched clumping projects. Projects that introduced unwanted clumping were identified by repeatedly visualizing shortest path distances between unrelated important projects. Our dataset identified 30 thousand duplicate projects in an existing popular reference dataset of 1.8 million projects. An evaluation of our dataset against another created independently with different methods found a significant overlap, but also differences attributed to the operational definition of what projects are considered as related.

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

↑