System and method for generating a relationship network
First Claim
Patent Images
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.
2 Assignments
0 Petitions
Accused Products
Abstract
A computer-implemented system and process for generating a relationship network is disclosed. The system provides a set of data items to be related and generates variable length data vectors to represent the relationships between the terms within each data item. The system can be used to generate a relationship network for documents, images, or any other type of file. This relationship network can then be queried to discover the relationships between terms within the set of data items.
5 Citations
21 Claims
-
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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 18, 19)
-
-
8. A system for generating relationships between data items, comprising:
-
a storage comprising a set of data items to be related, wherein each data item comprises a plurality of terms; a frame generator configured to generate a frame that selects a plurality of terms in said data items to associate; a vector generator configured to generate data vectors to represent the associations between the data items within said frame; a network generation engine configured to; receive a query term from a user; generate a query of the stored relationship network based on the received query term; and display 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 the network generator configured to generate the query of the stored relationship network further comprises instructions configured to configure a filter for use with the query;
expand the query object vector into an expanded query object vector;
generate expanded associated object vectors based on the query object vector; and
find associated terms between the expanded associated object vector and the expanded query object vector, andwherein the instructions configured to expand the query object vector into an expanded query object vector further comprise instructions configured to identify a group of strongest related terms to the query term;
add the group of strongest related terms to the query term to the beginning of the expanded query object vector;
retrieve vectors for each of the group of strongest related terms to the query term; and
insert, for each vector of the group of strongest related terms to the query term, a plurality of the strongest terms for the vector. - View Dependent Claims (9, 10, 11, 12, 13, 14, 15, 16, 17, 20, 21)
-
Specification