SOCIAL NETWORK GROUPING METHOD AND SYSTEM, AND COMPUTER STORAGE MEDIUM

• US 20150074198A1
• Filed: 11/14/2014
• Published: 03/12/2015
• Est. Priority Date: 05/15/2012
• Status: Active Grant

• Current Assignee: Tencent Technology Company Limited (Tencent Holdings Limited)
• Original Assignee: Tencent Technology Company Limited (Tencent Holdings Limited)
• Inventors: Liu, Yuewen, Chen, Chuan, He, Peng, Mai, Junming, Li, Yuhuang, Chen, Weihua
• Granted Patent: US 10,462,253 B2
• Time in Patent Office: Days
• US Class Current: 709/204
• CPC Class Codes: G06Q 10/00 Administration; Management
• CPC Class Codes: G06Q 50/01 Social networking
• CPC Class Codes: H04L 67/306 User profiles
• CPC Class Codes: H04L 67/535 Tracking the activity of the user network monitoring arrangements H04L43/00; recording of computer activity G06F11/34

Abstract

A method, system and computer-readable storage medium for social network grouping are provided. The method includes: acquiring friend relation data of a first user, the friend relation data comprising one or more friend nodes; determining a weight of each of the friend nodes based on the friend relation data acquired; forming a first friend circle with a first friend node having a greatest weight among the friend nodes; traversing the friend nodes to find an optimum friend of the first friend circle; adding the optimum friend into the first friend circle; and repeating the traversing and adding until all optimum friends of the first friend circle are added into the first friend circle. The method determines the weight of each friend node based on the friend relation data and performs grouping by the weights, which is able to conduct a smart grouping with high speed, low throughput, and high efficiency.

Claims

1. A method for social network grouping implemented in a social network server or a user interactive client, comprising:

acquiring friend relation data of a first user, the friend relation data comprising one or more friend nodes;

determining a weight of each of the friend nodes based on the friend relation data acquired;

forming a first friend circle with a first friend node having a greatest weight among the friend nodes;

traversing the friend nodes to find an optimum friend of the first friend circle;

adding the optimum friend into the first friend circle; and

repeating the traversing and adding until all optimum friends of the first friend circle are added into the first friend circle.

2. The method according to claim 1, further comprising:

repeating the following until any one of the friend nodes is added into a friend circle;

detecting a second group of friend nodes, the second group comprising friend nodes not being added into the first friend circle;

forming a second friend circle with a second friend node having a greatest weight among the second group of friend nodes;

traversing the friend nodes of the second group to find an optimum friend of the second friend circle;

adding the optimum friend into the second friend circle, and

repeating the traversing and adding until all the optimum friends of the second friend circle are added into the second friend circle.

3. The method according to claim 1, further comprising:

determining proportional weights of relation chains of the friend nodes related to each friend circle, and determining whether each of the proportional weights is greater than a pre-set threshold;

if one proportional weight of relation chain of a friend node is greater than the pre-set threshold, adding the friend node into the friend circle.

4. The method according to claim 3, wherein the proportional weight of the relation chain of the friend node related to each friend circle is determined by the proportion of strength value summation of relation chains between the friend node and nodes within the friend circle to the weight of the friend node.

5. The method according to claim 1, wherein the optimum friend is a friend node of a friend circle that, of all friend nodes of the friend circle, benefits the friend circle with a maximum increment in its friend circle score upon joining the friend circle.

6. The method according to claim 5, wherein the friend circle score is determined by a ratio of difference between strength summation of relation chains among nodes in a friend circle and punishment value of connections outside the friend circle to strength summation of all relation chains related to the friend circle.

7. The method according to claim 1, further comprising:

moving a friend node selected by the user into a friend circle designated by the user according to a user adjustment instruction.

8. The method of according to claim 1, wherein the determining further comprises:

determining strength value of relation chains between each two friend nodes, and

adding up the strength value of all relation chains between a friend node and any friend nodes that are in connection relation with the friend node to obtain the weight of the friend node.

9. A system for social network grouping implemented in a social network server or a user interactive client, comprising one or more processors;

and memory having instructions stored thereon, the instructions, when executed by the one or more processors, cause the processors to perform operations comprising;

acquiring friend relation data of a first user, the friend relation data comprising one or more friend nodes;

determining a weight of each of the friend nodes based on the friend relation data acquired;

forming a first friend circle with a first friend node having a greatest weight among the friend nodes;

traversing the friend nodes to find an optimum friend of the first friend circle;

adding the optimum friend into the first friend circle; and

repeating the traversing and adding until all the optimum friends of the first friend circle are added into the first friend circle.

10. The system according to claim 9, wherein the operations further comprises:

detecting a second group of friend nodes comprising friend nodes not being added into the first circle, forming a second friend circle with a second friend node having a greatest weight among the second group of friend nodes, traversing the friend nodes of second group to find an optimum friend of the second friend circle, adding the optimum friend into the second friend circle, and repeating the traversing and adding until all the optimum friends of the second friend circle are added into the second circle and any one of the friend nodes is added into a friend circle.

11. The system according to claim 9, wherein the operations further comprise:

determining proportional weights of relation chains of the friend nodes related to each friend circle, and determining whether each of the proportional weights is greater than a pre-set threshold;

if one proportional weight of relation chain of a friend node is greater than the pre-set threshold, adding the friend node into the friend circle.

12. The system according to claim 10, wherein the operations further comprise:

determining the proportional weight of the relation chains of the friend node related to each friend circle by the proportion of strength value summation of relation chains between the friend node and nodes within the friend circle to the weight of the friend node.

13. The system according to claim 9, wherein the optimum friend is a friend node of a friend circle that, of all friend nodes of the friend circle, benefits the friend circle with a maximum increment in its friend circle score upon joining the friend circle.

14. The system according to claim 13, wherein the operations further comprise:

determining the friend circle score of a friend circle a ratio of difference between strength summation of relation chains among nodes in a friend circle and punishment value of connections outside the friend circle to strength summation of all relation chains related to the friend circle.

15. The system according to claim 9, wherein the operations further comprise:

moving a friend node selected by the user into a friend circle designated by the user according to a user adjustment instruction.

16. The system according to claim 9, wherein the operations further comprise:

determining strength value of relation chains between each two friend nodes; and

adding up the strength value of all relation chains between a friend node and any friend nodes that are in connection relation with the friend node to obtain the weight of the friend node.

17. A non-transitory computer-readable storage medium with computer executable instructions to execute a method for social network grouping, the method comprising:

acquiring friend relation data of a first user, the friend relation data comprising one or more friend nodes;

determining a weight of each of the friend nodes based on the friend relation data acquired;

forming a first friend circle with a first friend node having a greatest weight among the friend nodes;

traversing the friend nodes to find an optimum friend of the first friend circle;

adding the optimum friend into the first friend circle; and

repeating the traversing and adding until all optimum friends of the first friend circle are added into the first friend circle.