【24h】

Duplication removal for a search-based recommendation system

机译:基于搜索的推荐系统的重复删除

获取原文
获取原文并翻译 | 示例

摘要

A search-based recommendation system looks, in the code repository, for programs that are relevant to the program being edited. Storing a large amount of open source programs into the repository will make the search results better, but also causes the code clone problem; i.e., recommending a set of program fragments that are almost idential. To tackle this problem, we propose a novel approach that ranks recommended programs by taking their “freshness” count into account. This short paper discusses the background of the problem, and illustrates the proposed algorithm.
机译:基于搜索的推荐系统在代码存储库中查找与正在编辑的程序相关的程序。将大量的开源程序存储到存储库中将使搜索结果更好,但也会导致代码克隆问题。即,建议一组几乎是虚假的程序片段。为了解决这个问题,我们提出了一种新颖的方法,通过考虑推荐程序的“新鲜度”来对推荐程序进行排名。这篇简短的文章讨论了问题的背景,并说明了所提出的算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号