Abstract: 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.

Abstract: A method, system and computer-readable storage medium for grouping users of an online social network application 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 as mart grouping with high speed, low throughput, and high efficiency.

Abstract: A natural person information setting method, an account information providing method, and electronic devices include: an associated set of each account is determined according to a degree of association and an exclusion index of another account with the each account; convergence processing is performed on all associated sets, such that after the convergence processing, no associated account in any one associated set appears in another associated set; and identical natural person information is set for any associated account in a same associated set having gone through the convergence processing, and a same natural person is set for any associated account in the same associated set according to the identical natural person information.

Abstract: A method, system and computer-readable storage medium for grouping users of an online social network application 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 as mart grouping with high speed, low throughput, and high efficiency.

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.

Abstract: 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.

Abstract: The current application describes adding a friend in a social network. A friend adding request corresponding to a first user identification is obtained. Further, a second user identification is obtained according to the friend adding request. The invention then obtains a group that includes the first user identification and the second user identification. A verification request is generated according to information corresponding to the first user identification and sent to a terminal corresponding to the second user identification. After a friend adding confirmation request corresponding to the second user identification is obtained, the second user identification is added to a friend list corresponding to the first user identification. The current application also describes a device and a storage medium for adding a friend in a social network. The invention of the current application improves the operation convenience of adding a friend.

Abstract: 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.

Abstract: A natural person information setting method, an account information providing method, and electronic devices include: an associated set of each account is determined according to a degree of association and an exclusion index of another account with the each account; convergence processing is performed on all associated sets, such that after the convergence processing, no associated account in any one associated set appears in another associated set; and identical natural person information is set for any associated account in a same associated set having gone through the convergence processing, and a same natural person is set for any associated account in the same associated set according to the identical natural person information.

Abstract: Disclosed are a natural person information setting method, an account information providing method, and electronic devices. The natural person information setting method includes the following steps: an associated set of each account is determined according to a degree of association and an exclusion index of another account with the each account; convergence processing is performed on all associated sets, such that after the convergence processing, no associated account in any one associated set appears in another associated set; and identical natural person information is set for any associated account in a same associated set having gone through the convergence processing, and a same natural person is set for any associated account in the same associated set according to the identical natural person information. Also disclosed are an account information providing method and electronic devices.

Abstract: Disclosed are a natural person information setting method, an account information providing method, and electronic devices. The natural person information setting method includes the following steps: an associated set of each account is determined according to a degree of association and an exclusion index of another account with the each account; convergence processing is performed on all associated sets, such that after the convergence processing, no associated account in any one associated set appears in another associated set; and identical natural person information is set for any associated account in a same associated set having gone through the convergence processing, and a same natural person is set for any associated account in the same associated set according to the identical natural person information. Also disclosed are an account information providing method and electronic devices.

Abstract: The present invention applies to an internet technology field. A method and apparatus for dividing contacts into groups are provided according to embodiments of the present invention. In the method, a contact list of a user is obtained. At least one first contact group is obtained according to the obtained contact list. A clustering operation for each of the at least one first contact group is performed to obtain at least one core contact corresponding to the first contact group. At least one recommendation contact corresponding to each of the at least one core contact is determined. A second contact group is established, wherein the second contact group comprises the at least one core contact corresponding to the first contact group and the at least one recommendation contact corresponding to each of the at least one core contact.

Abstract: It is described a communication method and system, and a computer storage medium. The method includes that: a communication account is allocated for a subscriber, personal information registered by the subscriber is received, an account of the subscriber on each communication platform is associated with the communication account; and a friend association is established for the subscriber according to the communication account and the personal information of the subscriber, and friend information of the subscriber is maintained. With the method, it is possible to facilitate friend information management by a subscriber, enhance efficiency in communication, and save communication resources.

Abstract: Disclosed are a method, system and computer storage medium for processing relationship circle. The method includes: acquiring subgroups from a relationship circle; extracting subgroup attributes shared between members of the relationship circle from the subgroups; obtaining at least one recognition result from the subgroup attributes shared between members of the relationship circle; and mapping the at least one recognition result to the relationship circle. The system includes: a subgroup acquisition module, configured to acquire subgroups within a relationship circle; an extraction module, configured to extract subgroup attributes shared between members of the relationship circle from the subgroups; and a mapping module, configured to obtain at least one recognition result by analyzing the subgroup attributes shared between members of the relationship circle and map the at least one attribute recognition result to the relationship circle.

Abstract: 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.

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.

Abstract: A method and system for dividing a user's social network relationship circle is disclosed. The method includes generating relevancy attribute information between friends of a first user according to social information of the first user's friends. A level of closeness between the friends according to the relevancy attribute information is acquired. The friends with the level of closeness greater than a first threshold are associated with a same relationship circle of the first user. The above method divides the friends of the user who have a high degree of closeness to the same relationship circle automatically. Thus, the efficiency of managing the social network for users is improved.

Abstract: The current application describes adding a friend in a social network. A friend adding request corresponding to a first user identification is obtained. Further, a second user identification is obtained according to the friend adding request. The invention then obtains a group that includes the first user identification and the second user identification. A verification request is generated according to information corresponding to the first user identification and sent to a terminal corresponding to the second user identification. After a friend adding confirmation request corresponding to the second user identification is obtained, the second user identification is added to a friend list corresponding to the first user identification. The current application also describes a device and a storage medium for adding a friend in a social network. The invention of the current application improves the operation convenience of adding a friend.

Abstract: Provided is a method, device and computer storage medium for adding information of friends, and said method includes following steps: acquiring a user ID of a user and a friend ID of a friend of the user from a first network relationship list; according to said user ID and said friend ID, acquiring second correlation information corresponding to said user and said friend from several second network relationship lists; according to said second correlation information, determining first correlation information corresponding to the user and the friend in said first network relationship list, and adding said first correlation information into said first network relationship list. The method and device for adding information of friends provided in the present disclosure can accurately recognize the correlation information corresponding to the user and the friend on the basis of existing network relationship lists, and automatically add remark information for friends of the user.