Patent ID: 7987191
Filing Date: 2011-07-26
Classification: G06F

Abstract:
1. A computer-implemented process for generating a relationship network, comprising: (a) providing a set of data items to be related, wherein said data items comprise a plurality of terms; (b) selecting a first data item to be processed; (c) applying a frame to said first data item, wherein said frame comprises a first set of terms within said data item; (d) calculating data vectors for the terms within said frame; (e) moving said frame to comprise a second set of terms within said data item; (f) creating a relationship network by repeating steps (d)-(e) until data vectors for all of the terms in said data item have been calculated; (g) storing said relationship network to a storage; (h) receiving a query term from a user; (i) generating a query of the stored relationship network based on the received query term; and (j) displaying query results, wherein the query results provide a visualization of a relationship between the query term and other terms in the set of data items, wherein generating the query of the stored relationship network comprises retrieving a query object vector for the query term; configuring a filter for use with the query; expanding the query object vector into an expanded query object vector; generating expanded associated object vectors based on the query object vector; and finding associated terms between the expanded associated object vector and the expanded query object vector, and wherein expanding the query object vector into an expanded query object vector comprises identifying a group of strongest related terms to the query term; adding the group of strongest related terms to the query term to the beginning of the expanded query object vector; retrieving vectors for each of the group of strongest related terms to the query term; and inserting, for each vector of the group of strongest related terms to the query term, a plurality of the strongest terms for the vector.