METHODS OF SEARCHING THROUGH INDIRECT CLUSTER CONNECTIONS

摘要

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.

主权项

1. A method of searching, comprising:
receiving a starting topic; identifying at least one starting node in an information graph based on the starting topic; traversing the information graph from a starting node identified by the starting topic to identify indirect connection clusters (ICCs) using a set of specified ICC criteria, wherein an ICC consists of the starting node, a target node that is not directly connected to the starting node, and a connection cluster of connector nodes that indirectly connect the starting node to the target node; and outputting a target article name from the target node of at least one identified ICC.