Method, apparatus, and computer-readable storage medium for grouping social network nodes

US10169476B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10169476-B2
Application numberUS-201314401271-A
CountryUS
Kind codeB2
Filing dateJan 28, 2013
Priority dateMay 15, 2012
Publication dateJan 1, 2019
Grant dateJan 1, 2019

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

According to an embodiment, a candidate node having a potential association relationship with a target node, an association node having an association relationship with the target node, and a grouping identifier of the association node are obtained. A relevance degree between the association node and the target node and a relevance degree between the candidate node and the target node within each grouping identifier are obtained. Based on the relevance degrees, the association node and the candidate node in each grouping identifier are combined for outputting.

First claim

Opening claim text (preview).

The invention claimed is: 1. A method for recommending friends to a user of a social networking group, performed by a computing device, comprising: obtaining user identifiers of members of the social networking group; dividing the members of the social networking group into a first set of members that have a direct relationship with the user and a second set of members that have no direct relationship with the user; for each of the user identifiers of the social networking group: determining a total number of members within the first set of members whose relationship with a corresponding member satisfy at least one of a set of predefined conditions including: the corresponding member being a member of the first set of members; the corresponding member having the direct relationship with a member of the first set of members; and when the corresponding member has the direct relationship with a predetermined number of members of the second set of members and the predetermined number of members of the second set of members have the direct relationship with a member of the first set of members, the corresponding member having the relationship with a member of the first set of members; dividing the total number of members within the first set of members whose relationship with the corresponding member satisfy at least one of the set of predefined conditions by a total number of members within the first set of members as a relevance degree between the corresponding member and the other members of the social networking group; displaying the user identifiers of the members in the social networking group according to their respective calculated relevance degrees, wherein at least one member in the second set of members has a relevance degree higher than that of at least one member in the first set of members; receiving a user selection of the user identifier of the at least one member in the second set of members; and establishing a direct relationship between the user and the at least one member in the second set of members. 2. The method of claim 1 , wherein the operation of displaying the user identifiers of the members in the social networking group comprises: sorting the user identifiers of the members in the social networking group based on their respective calculated relevancy degrees; and displaying the sorted user identifiers of the members in the social networking group. 3. The method of claim 2 , wherein before the operation of sorting, the method further comprises: hiding based on a preconfigured relevancy threshold, a user identifier of a member in the second set of members of which a relevancy degree is less than the relevancy threshold; wherein the operation of sorting the user identifiers of the members in the social networking group comprises: after the hiding the user identifier of the member in the second set of members of which the relevancy degree is less than the relevancy threshold, sorting remaining user identifiers of the members in the social networking group based on their respective calculated relevancy degrees. 4. The method of claim 2 , wherein the operation of sorting comprises: sorting the user identifiers of the members in the social networking group in a descending order of the relevancy degrees; wherein the operation of displaying comprises: displaying a predetermined number or a user-determined number of sorting results with high relevancy degrees. 5. The method of claim 2 , further comprising: obtaining a display setting selected by a user; and displaying the sorted user identifiers of the members in the social networking group according to the display setting. 6. An apparatus for recommending friends to a user of a social networking group, comprising: a processor and a memory which stores computer-readable instructions being executed by the processor to: obtain user identifiers of members of the social networking group; divide the members of the social networking group into a first set of members that have a direct relationship with the user and a second set of members that have no direct relationship with the user; for each of the user identifiers of the social networking group: determine a total number of members within the first set of members whose relationship with a corresponding member satisfy at least one of a set of predefined conditions including: the corresponding member being a member of the first set of members; the corresponding member having the direct relationship with a member of the first set of members; and when the corresponding member has the direct relationship with a predetermined number of members of the second set of members and the predetermined number of members of the second set of members have the direct relationship with a member of the first set of members, the corresponding member having the relationship with a member of the first set of members; divide the total number of members within the first set of members whose relationship with the corresponding member satisfy at least one of the set of predefined conditions by a total number of members within the first set of members as a relevance degree between the corresponding member and the other members of the social networking group; and display the user identifiers of the members in the social networking group according to their respective calculated relevance degrees, wherein at least one member in the second set of members has a relevance degree higher than that of at least one member in the first set of members; receive a user selection of the user identifier of the at least one member in the second set of members; and establish a direct relationship between the user and the at least one member in the second set of members. 7. The apparatus of claim 6 , wherein the instructions are executable by the processor to: sort the user identifiers of the members in the social networking group based on their respective calculated relevancy degrees; and display the sorted user identifiers of the members in the social networking group. 8. The apparatus of claim 7 , wherein the instructions are executable by the processor to: preconfigure a relevancy threshold; determine whether a relevancy degree of a member in the second set of members is less than the relevancy threshold; and hide a user identifier of the member in the second set of members of which the relevancy degree is less than the relevancy threshold; after hiding the user identifier of the member in the second set of members of which the relevancy degree is less than the relevancy threshold, sort remaining user identifiers of the members in the social networking group based on their respective calculated relevancy degrees. 9. The apparatus of claim 7 , wherein the instructions are executable by the processor to sort user identifiers of the members in the social networking group in a descending order of the relevancy degrees; and display a predetermined number or a user-determined number of sorting results with high relevancy degrees. 10. The apparatus of claim 7 , wherein the instructions are executable by the processor to: obtain a display setting selected by a user; display the sorted user identifiers of the members in the social networking group according to the display setting. 11. A non-transitory computer-readable storage medium encoded with a plurality of instructions that when executed by one or more computers cause the one or more computers to perform operations for recommending friends to a user of a social networking group, the operations comprising: obtaining user identifiers of members of the social networking group; dividing the members of the social networ

Assignees

Inventors

Classifications

  • Business processes related to social networking or social networking services · CPC title

  • Office automation; Time management · CPC title

  • Physics · mapped topic

  • Physics · mapped topic

  • Physics · mapped topic

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10169476B2 cover?
According to an embodiment, a candidate node having a potential association relationship with a target node, an association node having an association relationship with the target node, and a grouping identifier of the association node are obtained. A relevance degree between the association node and the target node and a relevance degree between the candidate node and the target node within ea…
Who is the assignee on this patent?
Tencent Tech Shenzhen Co Ltd
What technology area does this patent fall under?
Primary CPC classification G06F17/30876. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Jan 01 2019 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).