TRUST PROPAGATION THROUGH BOTH EXPLICIT AND IMPLICIT SOCIAL NETWORKS

• US 20130226918A1
• Filed: 04/09/2013
• Published: 08/29/2013
• Est. Priority Date: 06/28/2005
• Status: Active Grant

• Current Assignee: R2 Solutions LLC (Acacia Research Corporation)
• Original Assignee: Yahoo! Inc. (Apollo Global Management, Inc.)
• Inventors: Berkhim, Pavel, Xu, Zhichen, Mao, Jianchang, Rose, Daniel E., Taha, Abe, Maghoul, Farzin
• Granted Patent: US 9,576,029 B2
• Time in Patent Office: Days
• US Class Current: 707/734
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/313 Selection or weighting of terms for indexing
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Abstract

The present invention is directed towards systems and methods for trust propagation. The method according to one embodiment comprises calculating a first feature vector for a first user, calculating a second feature for a second user and comparing the first feature vector with the second feature vector to calculate a similarity value. A determination is made as to whether the similarity value falls within a threshold. If the similarity value falls within the threshold, a relationship is recorded between the first user and the second user in a first user profile and a second user profile.

Claims

1-12. -12. (canceled)

13. A method for propagating trust to create an implicit social network, comprising:

storing a content item in an inverted index;

receiving profile information from at least one user, the profile information relating to actions by the user to the content item including an annotation submitted by the user for the content item, the annotation including descriptive text generated b the user;

recording the profile information to a stream search queue when an update threshold is not exceeded, whether the update threshold is exceeded determined based on a last update of the inverted index;

storing the contents of the stream queue to the inverted index when the update threshold is exceeded;

calculating a first feature vector for a first user based on first user profile information;

calculating a second feature for a second feature vector for a second user based on second user profile information;

calculating a similarity value using the first feature vector and the second feature vector indicating if the actions by the first user to the content item are similar to the actions by the second user to the content item;

when the similarity value fails within a feature threshold, recording a relationship between the first user and the second user in a first user profile and a second user profile, the feature threshold based in part on features used to calculate the first feature vector and the second feature vector;

in response to a search request by the first user, determining a search result set, the search result set includes the content item, and profile information in the inverted index and the stream search queue; and

ranking the search result set based on the second user profile information related to actions by the second user to the content item when the similarity value falls within the features threshold.

14. The method of claim 13, wherein calculating the first feature vector comprises calculating on the basis of a tag by the first user for a content item.

15. The method of claim 13, wherein calculating the first feature vector comprises calculating on the basis of a save by the first user of a content item.

16. The method of claim 13, wherein determining comprises determining if the first user and the second user are related in accordance with an implicit social network.

17. The method of claim 13, wherein the first feature vector indicates that the first user saved a content item and the second feature vector indicates that the second user saved the content item.

18. The method of claim 13, wherein the first feature vector indicates that the first user tagged a content item and the second feature vector indicates that the second user tagged the content item.

19. The method of claim 13, comprising:

calculating a third feature for a third user;

comparing the first feature vector with the third feature vector to calculate a similarity value;

recording a relationship between the first user and the third user in the first user profile and a third user profile based upon the similarity value, wherein the similarity value falls within the feature threshold;

retrieving the third user profile based on the recorded relationship between the first user and the third user; and

ranking the search result set based on third user profile information relating to actions by the third user are related in accordance with an implicit social network.

20. The method of claim 19, wherein determining comprises determining if the first user and the third user a related in accordance with an implicit social network.

21. The method of claim 13, wherein ranking comprises:

selecting the content item from the result set,

selecting the second user profile,

calculating a usage total for the content item when an indicia of the content item appears in the second user profile, and

assigning a trust rank value to the content item based on the usage total.

22. The method of claim 21, wherein the trust rank value to the content item is determined based on at least trust ranks of a plurality of users and ratings of the content item by the plurality of users.