发明名称 |
SCORING MEMBERS OF A SET DEPENDENT ON ELICITING PREFERENCE DATA AMONGST SUBSETS SELECTED ACCORDING TO A HEIGHT-BALANCED TREE |
摘要 |
A software voting or prediction system iteratively solicits participant preferences between members of a set, with a binary tree built used to minimize the number of iterations required. As each member of the set is considered, it is pairwise-compared with select members represented by nodes already in the binary tree, with iterations beginning at a root node of the tree and continuing to a leaf node. The newly considered member is placed as a new leaf node, and the tree is height-rebalanced as appropriate. Red-black tree coloring and tree rotation rules are optionally used for this purpose. Yes/no preference tallies are kept for each member of the set throughout the tree-building process and are ultimately used for scoring. Height-rebalancing of the tree helps minimize the number of iterations needed to precisely score each member of the set relative to its alternatives. |
申请公布号 |
WO2015047423(A1) |
申请公布日期 |
2015.04.02 |
申请号 |
WO2013US62757 |
申请日期 |
2013.09.30 |
申请人 |
MINDJET LLC |
发明人 |
HARDAS, MANAS;PURVIS, LISA;GARDNER, JAMES;BENNET, KATE |
分类号 |
G06Q50/30 |
主分类号 |
G06Q50/30 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|