首页> 外国专利> Resolving pairwise links to groups

Resolving pairwise links to groups

机译:解决成组的成对链接

摘要

The present invention extends to methods, systems, and computer program products for resolving pairwise links to groups. Embodiments of the invention use an iterative algorithm to transform a collection of pairwise links to groups of records that correspond to the same entity. The algorithm can be stopped after any number of iterations for an increasing accurate approximation result. The algorithm essentially guarantees a correct solution for groups of size up to the number of iterations. This algorithm scales linearly on the size of the record set, with little impact from the number of links.
机译:本发明扩展到用于解决成对的成对链接的方法,系统和计算机程序产品。本发明的实施例使用迭代算法将成对链接的集合转换为对应于同一实体的记录组。可以在任意次迭代后停止该算法,以提高精确的近似结果。该算法从根本上保证了对大小不超过迭代次数的组的正确解决方案。该算法根据记录集的大小线性缩放,而不受链接数量的影响。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号