×

Scoring members of a set dependent on eliciting preference data amongst subsets selected according to a height-balanced tree

  • US 10,545,938 B2
  • Filed: 09/30/2013
  • Issued: 01/28/2020
  • Est. Priority Date: 09/30/2013
  • Status: Active Grant
First Claim
Patent Images

1. A method of scoring members of a set relative to one another, wherein the members of the set include first members for which relative preference data has been received from individuals in a group and second members for which relative preference data has not been received from individuals in the group, the first members organized according to a plurality of tree structures, wherein each tree structure corresponds to an individual'"'"'s relative preference data, the method comprising:

  • for each individual in the group, performing iterations;

    selecting subsets, using a computer, comprised of at least one of the first members and a second member of the set and eliciting from the individual the individual'"'"'s preference between members of the subsets to determine relative preference data between at least the first member and the second member of each selected subsets;

    wherein the at least one of the first members for each subset is selected by following a path in the individual'"'"'s corresponding tree structure beginning with a root node and continuing through the tree structure until a leaf node is reached according to the elicited relative preference data from any previous iterations such that in a first iteration the first member is selected as a root node in the individual'"'"'s corresponding tree structure and selecting a second member from the subset and using the relative preference data to determine if the first member or the second member is preferred, if the first member is preferred a left child node of the root node is selected for the next iteration for comparison with a second member and if a second member is preferred a right child node of the root node is selected for the next iteration for comparison with a second member,whereupon the second member becomes one of the first members,height-balancing the individual'"'"'s corresponding tree structure if height-unbalanced, andrepeating the iterative process of selecting, placing, and height-balancing for a new second member;

    assigning a score to each member of each individual'"'"'s corresponding tree structure based on the number of times each member was preferred or not preferred in the elicited relative preference data; and

    building a group score for each member of the set by combining the score corresponding to each member of all individuals in a group.

View all claims
  • 10 Assignments
Timeline View
Assignment View
    ×
    ×