System and method to work with multiple pair-wise related entities
First Claim
1. A computer-implemented method for visualization of relations among data items, comprising:
- storing pair-wise relation values in a database, each of the pair-wise relation values representing a relation between two of the data items, such that the pair-wise relation values have a partial ordering;
translating the data items to a set of points in a geometric space, each point corresponding to a data item, such that the partial ordering of the pair-wise relation values is preserved by a distance metric on the geometric space;
computing a one-parameter family of graphs on the set of points, such that a graph is computed for a value of a parameter, the value of the parameter being chosen according to pre-defined performance criteria;
displaying at least one member of the one-parameter family of graphs to a user, where the at least one member is chosen according to the performance criteria.
1 Assignment
0 Petitions
Accused Products
Abstract
The invention uses pair-wise relations such as dissimilarity, similarity or correlation to identify related items by translating the relations into a set of points in a geometric space, where each point in the set of points represents an item, and where the distance between any two points directly corresponds to the dissimilarity value of the two items represented by the two points. A family of graphs is computed from the Voronoï diagram for the set of points. This family of graphs may be used for a variety of applications, including recommendation systems. For some applications, clustering may be used to assist in visualizing and identifying relations among items. In the case of recommendation systems, graphs reflecting customer preferences are clustered to identify customers with similar tastes.
62 Citations
93 Claims
-
1. A computer-implemented method for visualization of relations among data items, comprising:
-
storing pair-wise relation values in a database, each of the pair-wise relation values representing a relation between two of the data items, such that the pair-wise relation values have a partial ordering;
translating the data items to a set of points in a geometric space, each point corresponding to a data item, such that the partial ordering of the pair-wise relation values is preserved by a distance metric on the geometric space;
computing a one-parameter family of graphs on the set of points, such that a graph is computed for a value of a parameter, the value of the parameter being chosen according to pre-defined performance criteria;
displaying at least one member of the one-parameter family of graphs to a user, where the at least one member is chosen according to the performance criteria. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A computer-implemented method for recommending items to customers comprising:
-
storing pair-wise relation values for each customer in a first database, each of the pair-wise relation values representing a relation between two of the data items determined by the customer, such that the pair-wise relation values have a partial ordering;
performing for each customer the steps of;
translating the set of pair-wise relation values into a set of points in a geometric space, each point corresponding to an item, such that the partial ordering of the pair-wise relation values is preserved by a distance metric on the geometric space;
computing a one-parameter family of graphs on the set of points, such that a graph is computed for a value of a parameter, the value of the parameter being chosen according to pre-defined performance criteria;
clustering customers, where distance between two customers is the distance between the two customers identified graphs; and
providing a recommendation means for recommending items to customers based on the computed clusters of customers. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31)
-
-
32. A system for visualization of relations among data items, comprising:
-
a database for storing pair-wise relation values, each of the pair-wise relation values representing a relation between two of the data items, such that the pair-wise relation values have a partial ordering;
a translation module for translating the data items to a set of points in a geometric space, each point corresponding to a data item, such that the partial ordering of the pair-wise relation values is preserved by a distance metric on the geometric space;
a graph family module for computing a one-parameter family of graphs on the set of points, such that a graph is computed for a value of a parameter, the value of the parameter being chosen according to pre-defined performance criteria;
a display module for displaying at least one member of the one-parameter family of graphs to a user, where the at least one member is chosen according to the performance criteria. - View Dependent Claims (33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49)
-
-
50. A system for recommending items to customers comprising:
-
a database storing pair-wise relation values for each customer, each of the pair-wise relation values representing a relation between two of the data items determined by the customer, such that the pair-wise relation values have a partial ordering;
a clustering module for clustering customers by performing for each customer;
translating the set of pair-wise relation values into a set of points in a geometric space, each point corresponding to an item, such that the partial ordering of the pair-wise relation values is preserved by a distance metric on the geometric space;
computing a one-parameter family of graphs on the set of points, such that a graph is computed for a value of a parameter, the value of the parameter being chosen according to pre-defined performance criteria;
clustering customers, where distance between two customers is the distance between the two customers identified graphs; and
a recommendation module for recommending items to customers based on the computed clusters of customers. - View Dependent Claims (51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62)
-
-
63. A computer-readable medium encoding instructions for performing a method for visualization of relations among data items, comprising:
-
storing pair-wise relation values in a database, each of the pair-wise relation values representing a relation between two of the data items, such that the pair-wise relation values have a partial ordering;
translating the data items to a set of points in a geometric space, each point corresponding to a data item, such that the partial ordering of the pair-wise relation values is preserved by a distance metric on the geometric space;
computing a one-parameter family of graphs on the set of points, such that a graph is computed for a value of a parameter, the value of the parameter being chosen according to pre-defined performance criteria;
displaying at least one member of the one-parameter family of graphs to a user, where the at least one member is chosen according to the performance criteria. - View Dependent Claims (64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80)
-
-
81. A computer-readable medium encoding instructions for performing a method for recommending items to customers comprising:
-
storing pair-wise relation values for each customer in a first database, each of the pair-wise relation values representing a relation between two of the data items determined by the customer, such that the pair-wise relation values have a partial ordering;
performing for each customer the steps of;
translating the set of pair-wise relation values into a set of points in a geometric space, each point corresponding to an item, such that the partial ordering of the pair-wise relation values is preserved by a distance metric on the geometric space;
computing a one-parameter family of graphs on the set of points, such that a graph is computed for a value of a parameter, the value of the parameter being chosen according to pre-defined performance criteria;
clustering customers, where distance between two customers is the distance between the two customers identified graphs; and
providing a recommendation means for recommending items to customers based on the computed clusters of customers. - View Dependent Claims (82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93)
-
Specification