首页> 外国专利> SYSTEM AND METHOD FOR FINDING AN APPROXIMATE SHORTEST PATH CONNECTING TWO PEOPLE IN A SOCIAL NETWORK

SYSTEM AND METHOD FOR FINDING AN APPROXIMATE SHORTEST PATH CONNECTING TWO PEOPLE IN A SOCIAL NETWORK

机译:在社交网络中寻找连接两个人的最短路径的系统和方法

摘要

The present invention relates to a system and method for searching for an approximate shortest path connecting two persons in a social network. The system for searching for an approximate shortest path according to an embodiment of the present invention includes a graph generating unit for generating a graph corresponding to a social network service, an affinity calculating unit for calculating the affinity of two peak points which are adjacent to each other in the generated graph, a preprocessing unit for calculating the shortest path of a landmark connected to the peak point and the peak point of the generated graph, a path information storing unit for storing path information for each peak point including peak point information included in the shortest path and the calculated shortest path, and a path searching unit for searching for the shortest path corresponding to the two peak points based on the path information for each peak point which is stored. Accordingly, the present invention can quickly respond to inquiries of social network service users.
机译:本发明涉及一种用于在社交网络中搜索连接两个人的近似最短路径的系统和方法。根据本发明的实施例的用于搜索近似最短路径的系统包括:图生成单元,用于生成与社交网络服务相对应的图;亲和度计算单元,用于计算彼此相邻的两个峰值点的亲和度。另外,在生成的图形中,还包括用于计算与生成的图形的峰点和峰点连接的界标的最短路径的预处理单元,用于存储包括在包含在图中的峰点信息在内的每个峰点的路径信息的路径信息存储单元。最短路径和计算出的最短路径,以及路径搜索单元,用于基于所存储的每个峰值点的路径信息来搜索与两个峰值点相对应的最短路径。因此,本发明可以快速响应社交网络服务用户的询问。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号