Methods and systems for correlating connections between users and links between articles

• US 8,521,591 B1
• Filed: 10/11/2011
• Issued: 08/27/2013
• Est. Priority Date: 12/31/2004
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google Inc. (Alphabet Inc.)
• Inventors: Lawrence, Stephen R.
• Primary Examiner(s): VANDERHORST, MARIA VICTORIA
• Application Number:
  US13/270,930
• Time in Patent Office: 686 Days
• Field of Search: None
• US Class Current: 705/14.54
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0256 User search

Abstract

Methods and systems for correlating connections between users and links between articles to identify search and/or ad spamming are disclosed. Social networks can be used to identify connections between users for correlation with links between articles, which can be identified through searches of article contents and/or back tracing accesses to articles. One disclosed method comprises identifying first associations between a plurality of users in a network of associated users; identifying second associations between one or more users and one or more articles; identifying third associations between at least some of the articles or between some of the users and access to some of the articles; and determining at least one of the third associations is correlated with one or more of the first associations.

Claims

1. A computer-implemented method comprising:

identifying, with one or more processors, a first connection between a first user and a second user in a social network and a second connection between the first user and a third user in the social network, each of the first and second connections including an association type and a degree of separation that identifies a fewest number of common characteristic associations separating the users;

applying, with the one or more processors, a first association weight to the first connection that is higher than a second association weight applied to the second connection based on at least one of the association type and the degree of separation;

identifying, with the one or more processors, the first user as a first administrator of a first article, the first article comprising a first link to a second article;

identifying, with the one or more processors, that the second user and the third user access the first article;

identifying, with the one or more processors, that the second user is a second administrator of the second article; and

determining, with the one or more processors, a first importance score for the first link based on the first association weight,

wherein the higher association weight indicates that the first connection is more biased.

2. The method of claim 1, further comprising:

searching the content of the first article to identify that the first article includes a second link to a third article;

identifying that the third user is a third administrator of the third article; and

determining a second importance score for the second link based on the second association weight,

wherein the first importance score is lower than the second importance score because of the higher association weight between the first and the second user.

3. The method of claim 1, wherein the second article is an advertisement and further comprising:

receiving a click-through of the advertisement from the second user; and

discounting the click-through based on the bias between the first user and the second user.

4. The method of claim 1, wherein the association type comprises at least one of a friendship association, a business association, an activity partner association, a community association, a common characteristic association, a common interest association and a family association.

5. The method of claim 4, wherein the association type is a friendship association and the first and second association weights are also based on an association level that comprises at least one of a have not met level, an acquaintance level, a friend level, a good friend level and a best friend level.

6. The method of claim 1, further comprising locating the article based at least in part on a request from the first user.

7. The method of claim 1, further comprising creating an article index for the article, the administrator, the first connection and the second connection.

8. A system comprising:

one or more processors;

a social network engine stored in a memory and executable by the one or more processors, the social network engine for identifying a first connection between a first user and a second user in a social network and a second connection between the first user and a third user in the social network, each of the first and second connection including an association type and a degree of separation that identifies a fewest number of common characteristic associations separating the users and for applying a first association weight to the first connection that is higher than a second association weight applied to the second connection based on at least one of the association type and the degree of separation; and

a search engine executable by the one or more processors, the search engine for identifying the first user as a first administrator of a first article, the first article comprising a first link to a second article, identifying that the second user and the third user access the first article, identifying that the second user is a second administrator of the second article and determining a first importance score for the first link based on the first association weight, wherein the higher association weight indicates that the first connection is more biased.

9. The system of claim 8, wherein the search engine:

searches the content of the first article to identify that the first article includes a second link to a third article;

identifies that the third user is the third administrator of the third article; and

determines a second importance score for the second link based on the second association weight,

wherein the first importance score is lower than the second importance score because of the higher association weight between the first and the second user.

10. The system of claim 8, wherein the second article is an advertisement and the search engine:

receives a click-through of the advertisement from the second user; and

discounts the click-through based on the bias between the first user and the second user.

11. The system of claim 8, wherein the association type comprises at least one of a friendship association, a business association, an activity partner association, a community association, a common characteristic association, a common interest association and a family association.

12. The system of claim 11, wherein the association type is a friendship association and the first and second association weights are also based on an association level that comprises at least one of a have not met level, an acquaintance level, a friend level, a good friend level and a best friend level.

13. The system of claim 8, wherein the search engine locates the article based at least in part on a request from the first user.

14. A non-transitory computer program product comprising a computer useable medium including a computer readable program, wherein the computer readable program when executed on a computer causes the computer to:

identify a first connection between a first user and a second user in a social network and a second connection between the first user and a third user in the social network, each of the first and second connection including an association type and a degree of separation that identifies a fewest number of common characteristic associations separating the users;

apply a first association weight to the first connection that is higher than a second association weight applied to the second connection based on at least one of the association type and the degree of separation;

identify the first user as a first administrator of a first article, the first article comprising a first link to a second article;

identify that the second user and the third user access the first article;

identify that the second user is a second administrator of the second article; and

determine a first importance score for the first link based on the first association weight,

wherein the higher association weight indicates that the first connection is more biased.

15. The non-transitory computer program product of claim 14, wherein the computer readable program when executed on the computer further causes the computer to:

search the content of the first article to identify that the first article includes a second link to a third article;

identify that the third user is the administrator of the third article; and

determine a second importance score for the second link based on the second association weight,

wherein the first importance score is lower than the second importance score because of the higher association weight between the first and the second user.

16. The non-transitory computer program product of claim 14, wherein the second article is an advertisement and the computer readable program when executed on the computer further causes the computer to:

receive a click-through of the advertisement from the second user; and

discount the click-through based on the bias between the first user and the second user.

17. The non-transitory computer program product of claim 14, wherein the association type comprises at least one of a friendship association, a business association, an activity partner association, a community association, a common characteristic association, a common interest association and a family association.

18. The non-transitory computer program product of claim 17, wherein the association type is a friendship association and the first and second association weights are also based on an association level that comprises at least one of a have not met level, an acquaintance level, a friend level, a good friend level and a best friend level.

19. The non-transitory computer program product of claim 14, wherein the computer readable program when executed on the computer further causes the computer to locate the article based at least in part on a request from the first user.

20. The non-transitory computer program product of claim 14, wherein the computer readable program when executed on the computer further causes the computer to create an article index for the article, the administrator, the first connection and the second connection.