Pre-Grant Publication Number: 20110213801
Filing Date: March 01, 2010Priority Date: March 01, 2010
Inventors: Bin He
Assignee(s): INTERNATIONAL BUSINESS MACHINES CORPORATION
Current U.S. Classification: 707, 707/770000, 707/E17017
View Prior Art for Claim 00015
The method of Claim 12, wherein said aggregation operation is a summing operation or an averaging operation, and wherein said pruning said one or more neighboring nodes includes:for each neighboring node v within h-hops of said u, iteratively performing the following steps:if said aggregation operation is said summing operation then determining an upper bound of an aggregate score of said v as:
min(F(u)+delta(v−u),N(v)−1+ƒ(v));else if said aggregation operation is said averaging operation then determining said upper bound of said aggregate score of said v as:wherein said F(u) is said aggregate score of said u, said delta(v−u) is said differential index, said N(v) is a number of neighboring nodes within h-hops of said v, and said ƒ(v) is an initial score of said v, wherein said differential index is a number of nodes in S(v) but not in S(u), wherein said S(v) is a set of distinct neighboring nodes within h-hops from said v, and wherein said S(u) is a set of distinct neighboring nodes within h-hops from said u; andif said upper bound of said aggregate score of said v is less than or equal to said lower bound of said aggregate scores of said k nodes then adding said v into said list of pruned nodes.