Method for Detecting Link Spam in Hyperlinked Databases

• US 20090282081A1
• Filed: 03/24/2009
• Published: 11/12/2009
• Est. Priority Date: 08/18/2003
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Glen M. Jeh, Sepandar D. Kamvar, Taher H. Haveliwala
• Inventors: Kamvar, Sepandar D., Jeh, Glen M., Haveliwala, Taher H.
• Granted Patent: US 7,953,763 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/31 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9566 URL specific, e.g. using aliases, detecting broken or misspelled links
• CPC Class Codes: Y10S 707/99936 Pattern matching access
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99948 Application of database or data structure, e.g. distributed, multimedia, or image

Abstract

Methods for facilitating the identification of link spamming in a linked database include calculating a spam likelihood value for nodes in a directed graph of linked nodes are disclosed. The spam likelihood value is computed from an importance of the node and a derivative value of the importance function with respect to a coupling factor. The likelihood that the node'"'"'s importance is inflated by link spam is estimated by calculating the ratio of the magnitude of the derivative value for the node to the rank for the node. Alternatively, the spam likelihood may be computed directly from a component of the principal eigenvector of A evaluated at two values of the parameter c. The normalized derivative value can also be used to provide an order of importance in a list of nodes.

Claims

1. A computer-implemented method for identifying nodes that are beneficiaries of node importance inflating links in 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;

computing, for each of at least a subset of the nodes in the directed graph, a respective quantity corresponding to a derivative of a node importance function;

for each node in the subset, comparing the respective computed quantity with a threshold;

identifying, as nodes that are beneficiaries of node importance inflating links, at least a portion of the subset for which the comparison produces a predefined result; and

performing a remedial action on a plurality of the identified nodes.

2. The method of claim 1, including removing the plurality of identified nodes from the directed graph.

3. The method of claim 1, including normalizing the respective quantity in accordance with a respective rank for the node.

4. The method of claim 1, wherein the computing computes the derivative of the node importance function with respect to a coupling factor.

5. The method of claim 4, wherein the computing includes:

computing at least two intermediate quantities of the derivative of the node importance function for each of the set of nodes, each of the intermediate quantities computed using a different respective value of the coupling factor; and

averaging the intermediate quantities to produce the computed respective quantity.

6. The method of claim 4, wherein the coupling factor represents how tightly coupled the linked nodes are in the directed graph.

7. The method of claim 4, wherein the coupling factor is inversely related to a probability that a user will randomly traverse the directed graph.

8. The method of claim 4, further including:

generating an adjusted importance for at least one node of the portion.

9. The method of claim 8, wherein the generating adjusts, for the at least one node, the importance by an amount proportional to the respective computed quantity.

10. The method of claim 1, wherein the computing includes:

calculating a matrix A(c) representing the directed graph, the matrix A(c) being an N×

N matrix that is a function of a link coupling coefficient c, where N is a number of nodes in the directed graph;

calculating a principal eigenvector of A(c), denoted x(c);

calculating a derivative with respect to c of x(c), denoted x′

(c); and

for at least one node, calculating from x′

(c) and a rank for the node, an inflation likelihood value S.

11. The method of claim 10, further comprising comparing the inflation likelihood value S with a predetermined spam threshold value.

12. A computer readable storage medium storing one or more programs for execution by one or more processors of a computer system, the one or more programs comprising:

instructions for computing, for each of at least a subset of nodes in a directed graph of linked nodes, a respective quantity corresponding to a derivative of a node importance function;

instructions for comparing the respective computed quantity with a threshold for each node in the subset; and

instructions for identifying, as nodes that are beneficiaries of node importance inflating links, at least a portion of the subset for which the comparison produces a predefined result; and

instructions for performing a remedial action on a plurality of the identified nodes;

wherein the directed graph of linked nodes corresponds to a linked database, and wherein the nodes correspond to documents within the linked database.

13. The computer readable storage medium of claim 12, including instructions for normalizing the respective quantity in accordance with a respective rank for the node.

14. The computer readable storage medium of claim 12, wherein the instructions for computing include instructions for computing the derivative of the node importance function with respect to a coupling factor.

15. The computer readable storage medium of claim 14, wherein the instructions for computing include:

instructions for computing at least two intermediate quantities of the derivative of the node importance function for each of the set of nodes, each of the intermediate quantities computed using a different respective value of the coupling factor; and

instructions for averaging the intermediate quantities to produce the computed respective quantity.

16. The computer readable storage medium of claim 14, wherein the coupling factor represents how tightly coupled the linked nodes are in the directed graph.

17. The computer readable storage medium of claim 12, including:

instructions for generating an adjusted importance for at least one node of the portion.

18. The computer readable storage medium of claim 17, wherein the instructions for generating include instructions for adjusting, for the at least one node, the importance by an amount proportional to the respective computed quantity.

19. A system for identifying nodes that are beneficiaries of node importance inflating links in 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 to compute, for each of at least a subset of the nodes in the directed graph, a respective quantity corresponding to a derivative of a node importance function;

instructions to compare, for each node in the subset, the respective computed quantity with a threshold; and

instructions to identify, as nodes that are beneficiaries of node importance inflating links, at least a portion of the subset for which the comparison produces a predefined result;

instructions to perform a remedial action on a plurality of the identified nodes;

wherein the directed graph of linked nodes corresponds to a linked database, and wherein the nodes correspond to documents within the linked database.

20. A computer-implemented method for performing search engine services using 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 server 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;

computing, for each node of at least a portion of the nodes in the directed graph, a respective quantity for the respective node corresponding to a derivative of a node importance function; and

in response to a search query received from a client system, ordering a subset of the nodes in the directed graph in accordance with the respective quantities, and returning to the client system a search result in accordance with the ordered subset of the nodes.

21. The method of claim 20, wherein the computing computes the derivative of the node importance function with respect to a coupling factor.

22. A computer readable storage medium storing one or more programs for execution by one or more processors of a computer server system, the one or more programs comprising:

instructions for computing, for each node of at least a portion of the nodes in a directed graph, a respective quantity for the respective node corresponding to a derivative of a node importance function; and

instructions for responding to a search query received from a client system, including instructions for ordering a subset of the nodes in the directed graph in accordance with the respective quantities, and returning to the client system a search result in accordance with the ordered subset of the nodes;

wherein the directed graph of linked nodes corresponds to a linked database, and wherein the nodes correspond to documents within the linked database.

23. The computer readable storage medium of claim 22, wherein the instructions for computing include instructions for computing the derivative of the node importance function with respect to a coupling factor.

24. A computer system for performing search engine services using 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 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 to compute, for each of at least a subset of the nodes in the directed graph, a respective quantity corresponding to a derivative of a node importance function; and

instructions for responding to a search query received from a client system, including instructions for ordering a subset of the nodes in the directed graph in accordance with the respective quantities, and returning to the client system a search result in accordance with the ordered subset of the nodes.

25. The system of claim 24, including instructions to compute the derivative of the node importance function with respect to a coupling factor.