首页> 外国专利> SELECTING AN ENTITY FROM A KNOWLEDGE GRAPH WHEN A LEVEL OF CONNECTIVITY BETWEEN ITS NEIGHBORS IS ABOVE A CERTAIN LEVEL

SELECTING AN ENTITY FROM A KNOWLEDGE GRAPH WHEN A LEVEL OF CONNECTIVITY BETWEEN ITS NEIGHBORS IS ABOVE A CERTAIN LEVEL

机译:当其相邻点之间的连通性级别高于某个特定级别时,从知识图中选择一个实体

摘要

A method may include selecting a particular entity from a knowledge graph when a level of connectivity between entities in the knowledge graph that are neighbors to the particular entity is above a certain level and determining whether the particular entity is in a character string.
机译:一种方法可以包括:当与特定实体相邻的知识图中的实体之间的连通性水平高于某个水平时,从知识图中选择特定实体;以及确定该特定实体是否在字符串中。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号