Method for detecting link spam in hyperlinked databases
First Claim
1. A computer-implemented method for analyzing a directed graph of linked nodes, wherein the directed graph of linked nodes corresponds to a linked database, and wherein the nodes correspond to documents within the linked database, the method comprising:
- at a computer system including one or more processors and memory storing one or more programs, the one or more processors executing the one or more programs to perform the operations of;
identifying nodes that are beneficiaries of node importance inflating links in the directed graph of linked nodes by computing, for each of at least a subset of the nodes in the directed graph, a respective quantity corresponding to a mathematical derivative of a node importance function; and
performing a remedial action on a respective node in the directed graph in accordance with the respective computed quantity computed for the respective node.
1 Assignment
0 Petitions
Accused Products
Abstract
A computer-implemented method identifies nodes that are beneficiaries of node importance inflating links in a directed graph of linked nodes. The directed graph of linked nodes corresponds to a linked database, and the nodes correspond to documents within the linked database. The method is performed by a computer system including one or more processors and memory storing one or more programs, the one or more processors executing the one or more programs to perform the method. The method includes computing, for each of at least a subset of the nodes in the directed graph, a respective quantity corresponding to a mathematical derivative of a node importance function, and performing a remedial action on a respective node in the directed graph in accordance with the respective computed quantity computed for the respective node.
-
Citations
24 Claims
-
1. A computer-implemented method for analyzing a directed graph of linked nodes, wherein the directed graph of linked nodes corresponds to a linked database, and wherein the nodes correspond to documents within the linked database, the method comprising:
-
at a computer system including one or more processors and memory storing one or more programs, the one or more processors executing the one or more programs to perform the operations of; identifying nodes that are beneficiaries of node importance inflating links in the directed graph of linked nodes by computing, for each of at least a subset of the nodes in the directed graph, a respective quantity corresponding to a mathematical derivative of a node importance function; and performing a remedial action on a respective node in the directed graph in accordance with the respective computed quantity computed for the respective node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A non-transitory computer readable storage medium storing one or more programs for analyzing a directed graph of linked nodes, wherein the directed graph of linked nodes corresponds to a linked database, and wherein the nodes correspond to documents within the linked database, the one or more programs for execution by one or more processors of a computer system, the one or more programs comprising instructions for:
-
identifying nodes that are beneficiaries of node importance inflating links in the directed graph of linked nodes by computing, for each of at least a subset of the nodes in the directed graph, a respective quantity corresponding to a mathematical derivative of a node importance function; and performing a remedial action on a respective node in the directed graph in accordance with the respective computed quantity computed for the respective node. - View Dependent Claims (12, 13, 14, 15, 16, 17)
-
-
18. A system for analyzing a directed graph of linked nodes, the system comprising:
-
memory; one or more processors; one or more programs stored in the memory and configured for execution by the one or more processors, the one or more programs including instructions which, when executed by the one or more processors, cause the system to; identify nodes that are beneficiaries of node importance inflating links in the directed graph of linked nodes by computing, for each of at least a subset of the nodes in the directed graph, a respective quantity corresponding to a mathematical derivative of a node importance function; and perform a remedial action on a respective node in the directed graph in accordance with the respective computed quantity computed for the respective node. - View Dependent Claims (19, 20, 21, 22, 23, 24)
-
Specification