会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • METHODS OF SEARCHING THROUGH INDIRECT CLUSTER CONNECTIONS
    • 通过间接串联连接搜索的方法
    • US20160267166A1
    • 2016-09-15
    • US14977281
    • 2015-12-21
    • Microsoft Technology Licensing, LLC
    • Bernhard S.J. KohlmeierPradeep ChilakamarriSirui Sun
    • G06F17/30
    • G06F16/285G06F16/22G06F16/24578G06F16/358G06F16/36G06F16/9024
    • By applying a set of simple geometric rules to the connections within a connected graph of ‘topics’ it is possible to uncover hidden relationships that are otherwise inaccessible to the lay person. Interesting, potentially non-obvious threads of content, termed indirect connection clusters (ICCs), can be found from an online encyclopedia or other graph of articles that are not directly connected to a starting topic, but instead are connected via an intermediate clique of articles. A system performing a search of an information graph can receive a request for identifying relevant content, identify (in a traversal of the information graph) one or more ICCs using a starting topic associated with the request, refine the one or more ICCs (eliminating certain ICCs) and generate a refined set of ICCs, and rank ICCs within the refined set. The ranked ICCs can be provided in response to the request for identifying relevant content.
    • 通过将一组简单的几何规则应用于“主题”的连接图中的连接,可以发现否定的无关人员的隐藏关系。 可以从在线百科全书或其他不直接连接到起始主题的文章图找到有趣的,潜在的非明显的内容线索,称为间接连接集群(ICC),而是通过中间文章集合 。 执行信息图的搜索的系统可以接收用于识别相关内容的请求,使用与请求相关联的起始主题识别(遍历信息图)一个或多个ICC,细化一个或多个ICC(消除某些 ICC),并产生一组精细的ICC,并对精细集中的ICC进行排名。 可以响应于识别相关内容的请求来提供排名的ICC。