PROCESSES FOR CALCULATING ITEM DISTANCES AND PERFORMING ITEM CLUSTERING
First Claim
1. A computer-implemented method of measuring the distance between a first item and a second item represented in a hierarchical browse structure that comprises multiple levels of browse nodes, the first item being accessible via a first set of one or more paths from a root node of the hierarchical browse structure, and the second item being accessible via a second set of one or more paths from the root node, the method comprising:
- identifying a set of shared browse nodes for the first and second items, said shared browse nodes being browse nodes that occur in both the first set of paths and the second set of paths;
calculating data values for particular shared browse nodes;
calculating a distance value that represents the distance between the first item and the second item such that the distance value is dependent upon at least (a) the number of said shared browse nodes, (b) the total number of browse nodes in the first and second sets of paths, and (c) said data values; and
storing the distance value in computer storage.
1 Assignment
0 Petitions
Accused Products
Abstract
Computer-implemented processes are disclosed for clustering items and improving the utility of item recommendations. One process involves applying a clustering algorithm to a user'"'"'s collection of items. Information about the resulting clusters is then used to select items to use as recommendation sources. Another process involves displaying the clusters of items to the user via a collection management interface that enables the user to attach cluster-level metadata, such as by rating or tagging entire clusters of items. The resulting metadata may be used to improve the recommendations generated by a recommendation engine. Another process involves forming clusters of items in which a user has indicated a lack of interest, and using these clusters to filter the output of a recommendation engine. Yet another process involves applying a clustering algorithm to the output of a recommendation engine to arrange the recommended items into cluster-based categories for presentation to the user.
-
Citations
28 Claims
-
1. A computer-implemented method of measuring the distance between a first item and a second item represented in a hierarchical browse structure that comprises multiple levels of browse nodes, the first item being accessible via a first set of one or more paths from a root node of the hierarchical browse structure, and the second item being accessible via a second set of one or more paths from the root node, the method comprising:
-
identifying a set of shared browse nodes for the first and second items, said shared browse nodes being browse nodes that occur in both the first set of paths and the second set of paths; calculating data values for particular shared browse nodes; calculating a distance value that represents the distance between the first item and the second item such that the distance value is dependent upon at least (a) the number of said shared browse nodes, (b) the total number of browse nodes in the first and second sets of paths, and (c) said data values; and storing the distance value in computer storage. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A computer system, comprising:
-
a computer data repository that stores a representation of a hierarchical browse structure for browsing a repository of items, said hierarchical browse structure comprising multiple levels of browse nodes; a distance calculation system configured to use information about locations of items in the hierarchical browse structure to calculate distance values representing distances between particular items; and a clustering system configured to use at least the distance values calculated by the distance calculation system to form clusters of related items. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20, 21)
-
-
22. A computer-readable medium having stored thereon executable instructions which, when executed by a computer system, cause the computer system to:
-
identify a set of shared browse nodes for a first item and a second item that are represented in a hierarchical browse structure, said hierarchical browse structure comprising multiple levels of browse nodes, said first item being accessible via a first set of one or more paths from a root node of the hierarchical browse structure, said second item being accessible via a second set of one or more paths from the root node, said shared browse nodes being browse nodes that occur in both the first set of paths and the second set of paths; calculate data values for particular ones of said shared browse nodes; and calculate and store a distance value that represents a distance between the first item and the second item such that the distance value is dependent upon at least (a) the number of said shared browse nodes, (b) the total number of browse nodes in the first and second sets of paths, and (c) said data values. - View Dependent Claims (23, 24, 25, 26, 27, 28)
-
Specification