CN117395222A

CN117395222A - Affinity daemon method and device for online social contact

Info

Publication number: CN117395222A
Application number: CN202311671647.2A
Authority: CN
Inventors: 杨扬
Original assignee: Shenzhen Aichat Technology Co ltd
Current assignee: Shenzhen Aichat Technology Co ltd
Priority date: 2023-12-07
Filing date: 2023-12-07
Publication date: 2024-01-12
Anticipated expiration: 2043-12-07
Also published as: CN117395222B

Abstract

The present disclosure provides a method and apparatus for affinity daemon of online social contact, comprising: acquiring social affinity value of a first user to a second user; determining a target daemon value based on the social interaction data; based on the social affinity value, the social daemon value and the target daemon value, if the first user is determined to be a unidirectional daemon user of the second user, the first user is added to a social daemon list of the second user; if the social affinity value is the largest and is smaller than the preset affinity threshold, storing the social identification data of the first user into the social data of the second user; setting a daemon icon corresponding to a first user; if the social affinity value is the largest and is greater than or equal to a preset affinity threshold, determining that the first user is an affinity daemon user of the second user; and adjusting the display color of the daemon icon corresponding to the first user. Therefore, the daemon can stand out from social users of the daemon, and the presence feeling and the liveness of the users are effectively improved.

Description

Affinity daemon method and device for online social contact

Technical Field

The embodiment of the disclosure relates to the technical field of computer processing, in particular to a intimacy daemon method and device suitable for online social contact.

Background

With the rapid development of society and network, users are not restricted to online friend making when selecting social ways, and often select online friend making interaction ways.

In order to improve the user quality of social sessions, a lot of paid social software exists at present, and users can chat and communicate with other users by paying a certain fee on the paid social software, however, the users only perform social sessions singly, so that the existence feeling and liveness of the users are low.

Disclosure of Invention

Embodiments described herein provide a method and apparatus for affinity daemon of online social networking that overcomes the above-described problems.

In a first aspect, according to the present disclosure, there is provided a affinity daemon method of online social contact, comprising:

acquiring a social affinity value of a first user to a second user, wherein the social affinity value is accumulated based on social behavior data of the first user to the second user, and the social behavior data is determined based on a social payment data packet sent by the first user to the second user in an online social process;

determining a target daemon value required by the first user and the second user to establish a one-way daemon relation based on social interaction data of the first user and the second user, wherein the one-way daemon relation is used for describing the first user to one-way daemon the second user;

Determining whether the first user is a unidirectional daemon of the second user based on the social affinity value of the first user for the second user, the social daemon value the first user spends for the second user, and the target daemon value;

if the first user is determined to be a unidirectional daemon user of the second user, the first user is added into a social daemon list of the second user, the unidirectional daemon users of a plurality of active daemons are stored in the social daemon list of the second user, and the storage position of each unidirectional daemon user in the social daemon list is related to the social intimacy value of the unidirectional daemon user for the second user;

if the social affinity value of the first user to the second user is the largest in the social daemon list of the second user and the social affinity value of the first user to the second user is smaller than a preset affinity threshold, storing social identification data of the first user into social data of the second user, wherein the social identification data comprises: social image data;

setting a daemon icon corresponding to the first user in social data of the second user, wherein the daemon icon corresponding to the first user has a display color;

If the social affinity value of the first user to the second user in the social daemon list is the largest, and the social affinity value of the first user to the second user is larger than or equal to the preset affinity threshold value, determining that the first user is an intimate daemon of the second user, wherein the daemon level of the intimate daemon is larger than that of the unidirectional daemon;

and adjusting the display color of the daemon icon corresponding to the first user in the social data of the second user.

In a second aspect, according to the present disclosure, there is provided a affinity daemon device for online social contact, comprising:

the acquisition module is used for acquiring a social affinity value of a first user to a second user, wherein the social affinity value is accumulated based on social behavior data of the first user to the second user, and the social behavior data is determined based on a social payment data packet sent by the first user to the second user in an online social process;

the first determining module is used for determining a target daemon value required by the first user and the second user to establish a one-way daemon relation based on social interaction data of the first user and the second user, wherein the one-way daemon relation is used for describing the first user to one-way daemon the second user;

A second determining module, configured to determine whether the first user is a unidirectional daemon of the second user based on a social affinity of the first user for the two users, a social daemon value spent by the first user for the second user, and the target daemon value;

an adding module, configured to, if it is determined that the first user is a unidirectional daemon user of the second user, add the first user to a social daemon list of the second user, where a plurality of unidirectional daemon users of active daemons are stored in the social daemon list of the second user, and a storage location of each unidirectional daemon user in the social daemon list is related to a social affinity value of the unidirectional daemon user for the second user;

the storage module is configured to store social identification data of the first user into social data of the second user if a social affinity value of the first user to the second user in the social daemon of the second user is the largest and the social affinity value of the first user to the second user is smaller than a preset affinity threshold, where the social identification data includes: social image data;

The setting module is used for setting the daemon icon corresponding to the first user in the social data of the second user, and the daemon icon corresponding to the first user has a display color;

a third determining module, configured to determine that the first user is a close daemon user of the second user if the social affinity value of the first user for the second user in the social daemon list is the largest and the social affinity value of the first user for the second user is greater than or equal to the preset affinity threshold, where the daemon level of the close daemon user is greater than the daemon level of the unidirectional daemon user;

and the adjusting module is used for adjusting the display color of the daemon icon corresponding to the first user in the social data of the second user.

In a third aspect, a computer device is provided, comprising a memory in which a computer program is stored, and a processor, which when executing the computer program, performs the steps of the affinity daemon method of online social networking as in any of the embodiments above.

In a fourth aspect, a computer readable storage medium is provided, on which a computer program is stored which, when executed by a processor, implements the steps of the affinity daemon method of online social networking as in any of the embodiments above.

According to the affinity daemon method for online social contact, a social affinity value of a first user to a second user is obtained, the social affinity value is accumulated based on social behavior data of the first user to the second user, and the social behavior data is determined based on a social payment data packet sent by the first user to the second user in an online social contact process; determining a target daemon value required by the first user and the second user to establish a one-way daemon relation based on social interaction data of the first user and the second user, wherein the one-way daemon relation is used for describing the first user and the second user; determining whether the first user is a unidirectional daemon of the second user based on the social affinity value of the first user for the second user, the social daemon value spent by the first user for the second user, and the target daemon value; if the first user is determined to be a unidirectional daemon user of the second user, the first user is added into a social daemon list of the second user, a plurality of actively daemon unidirectional daemons are stored in the social daemon list of the second user, and the storage position of each unidirectional daemon in the social daemon list is related to the social intimacy value of the unidirectional daemon user to the second user; if the social affinity value of the first user to the second user in the social daemon list of the second user is the largest, and the social affinity value of the first user to the second user is smaller than a preset affinity threshold, storing social identification data of the first user into social data of the second user, wherein the social identification data comprises: social image data; setting a daemon icon corresponding to the first user in social data of the second user, wherein the daemon icon corresponding to the first user has a display color; if the social affinity value of the first user to the second user in the social daemon list is the largest, and the social affinity value of the first user to the second user is larger than or equal to a preset affinity threshold value, determining that the first user is an intimate daemon user of the second user, wherein the daemon level of the intimate daemon user is larger than that of the unidirectional daemon user; and adjusting the display color of the daemon icon corresponding to the first user in the social data of the second user. In this way, in the online social process, based on the one-way daemon relation between two social users, the social identification data of the daemon is displayed in the social data of the daemon, so that other users can see the active daemon of the daemon, and when the active daemon is upgraded to a close daemon, the display color of the daemon icon is adjusted, so that the daemon can stand out from the social users of the daemon, and the existence sense and the liveness of the users are effectively improved.

The foregoing description is only an overview of the technical solutions of the embodiments of the present application, and may be implemented according to the content of the specification, so that the technical means of the embodiments of the present application can be more clearly understood, and the following detailed description of the present application will be presented in order to make the foregoing and other objects, features and advantages of the embodiments of the present application more understandable.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the following brief description of the drawings of the embodiments will be given, it being understood that the drawings described below relate only to some embodiments of the present disclosure, not to limitations of the present disclosure, in which:

FIG. 1 is a flow diagram of a method of affinity daemon for online social networking provided by the present disclosure.

FIG. 2 is an interface schematic of a social daemon list provided by the present disclosure.

Fig. 3 is a schematic display diagram of social identification data provided by the present disclosure.

Fig. 4 is a schematic structural diagram of a close daemon device for online social contact provided by the present disclosure.

Fig. 5 is a schematic structural diagram of a computer device provided in the present disclosure.

It is noted that the elements in the drawings are schematic and are not drawn to scale.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings. It will be apparent that the described embodiments are some, but not all, of the embodiments of the present disclosure. All other embodiments, which can be made by those skilled in the art based on the described embodiments of the present disclosure without the need for creative efforts, are also within the scope of the protection of the present disclosure.

Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which the presently disclosed subject matter belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the specification and relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein. As used herein, a statement that two or more parts are "connected" or "coupled" together shall mean that the parts are joined together either directly or joined through one or more intermediate parts.

Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment of the present application. The appearances of the phrase "an embodiment" in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments.

The term "and/or" is herein merely an association relationship describing an associated object, meaning that there may be three relationships, e.g., a and/or B, may represent: there are three cases, a, B, a and B simultaneously. In addition, the character "/" herein generally indicates that the front and rear associated objects are an "or" relationship. Terms such as "first" and "second" are used merely to distinguish one component (or portion of a component) from another component (or another portion of a component).

In the description of the present application, unless otherwise indicated, the meaning of "plurality" means two or more (including two), and similarly, "plural sets" means two or more (including two).

In order to better understand the technical solutions of the present application, the following description will clearly and completely describe the technical solutions in the embodiments of the present application with reference to the accompanying drawings.

FIG. 1 is a flow diagram of a affinity daemon method for online social networking provided in an embodiment of the present disclosure. As shown in FIG. 1, the specific process of the affinity daemon method of online social contact comprises the following steps:

s110, acquiring a social affinity value of the first user to the second user.

The social affinity value is accumulated based on social behavior data of the first user on the second user, and the social behavior data is determined based on a social payment data packet sent by the first user to the second user in an online social process.

The social payment data package is a data package paid for by the first user's interaction with the second user, which may include, but is not limited to: text chat, voice chat, video chat, gift gifting, etc., the data package may be embodied in the form of a virtual gold coin that is proportionally replaced based on the first user's recharge amount on the system. The social behavior data may be used to describe an amount paid by the first user to chat with the second user.

The social affinity value of the first user to the second user is measured based on the interaction interval duration of the first user and the second user, if the first user and the second user do not interact within a certain duration, the social affinity value of the first user to the second user is reduced, and the reduced value is related to the interaction interval duration.

S120, determining a target daemon value required by the first user and the second user to establish a one-way daemon relationship based on social interaction data of the first user and the second user.

The unidirectional daemon relationship is used for describing that the first user unidirectionally daemons the second user, namely the first user daemons the second user, wherein the first user belongs to the daemon of the second user, and also the first user is an active daemon, and the second user is a daemon.

The social interaction data of the first user and the second user may include, but is not limited to: the text chat duration and frequency, the voice chat duration and frequency, the video chat duration and frequency, the virtual gold coin number, amount and frequency of gifts, and the like of the first user and the second user.

In some embodiments, determining a target daemon value required for the first user to establish a one-way daemon relationship with the second user based on social interaction data of the first user and the second user comprises:

based on social interaction data of the first user and the second user, determining intimate daemon standard data of the first user to the second user; determining an initial daemon value required by the first user and the second user to establish a one-way daemon relationship based on the intimate daemon standard data and the popularity of the second user in online social contact; if the interaction interval duration of the first user and the second user is smaller than or equal to the preset interval duration, determining the initial daemon value as a target daemon value; if the interaction interval time length of the first user and the second user is longer than the preset interval time length, the initial daemon value is reduced based on the time length difference between the interaction interval time length and the preset interval time length, and the target daemon value is obtained.

The larger the time difference between the interaction interval time length and the preset interval time length is, the smaller the target daemon value is.

Based on social interaction data of the first user and the second user, determining affinity daemon criteria data of the first user to the second user may include: based on the social interaction data of the first user and the second user and the matching result of the mapping comparison table, intimate daemon standard data of the first user to the second user is determined, and mapping relations between meeting conditions of different social interaction data and the intimate daemon standard data are stored in the mapping comparison table, wherein the meeting conditions of the different social interaction data include but are not limited to: the text chat time and frequency, the voice chat time and frequency, the video chat time and frequency, the virtual gold coin number, the amount and frequency of gift gifts and the like corresponding to different grades. The affinity daemon criteria data may be one daemon criteria for social affinity values, e.g., 8 degrees, 50 degrees, etc., facilitating providing appropriate affinity daemons for different social users.

The popularity of the second user in online social may be used to describe the attraction value of the second user, which may be derived from statistics of other enjoyed activities such as medals, receipts, called, praise, etc.

Based on the affinity daemon criteria data and the popularity of the second user in online social interactions, determining an initial daemon value required for the first user to establish a one-way daemon relationship with the second user may include: if the popularity of the second user in the online social connection is greater than or equal to the preset degree, increasing the intimacy corresponding to the intimacy conservation standard data, and if the popularity of the second user in the online social connection is less than the preset degree, decreasing the intimacy corresponding to the intimacy conservation standard data.

Therefore, based on the fact that the interaction interval duration of the first user and the second user is smaller than or equal to the preset interval duration, the initial daemon value is adjusted, and target daemon values corresponding to different social users can be obtained conveniently.

S130, determining whether the first user is a unidirectional daemon user of the second user based on the social affinity value of the first user for the two users, the social daemon value spent by the first user for the second user and the target daemon value.

The social daemon value spent by the first user for the second user is a virtual gold coin amount/recharging amount which the first user wants to actively daemon the second user to pay to the social platform (system), and the virtual gold coin amount/recharging amount is determined based on the popularity of the second user on the basis of the social platform (system).

In some embodiments, determining whether the first user is a unidirectional daemon of the second user based on the social affinity of the first user for the second user, the social daemon value the first user spends for the second user, and the target daemon value comprises:

if the social affinity value of the first user to the second user is smaller than the target daemon value and the social daemon value spent by the first user for the second user is larger than or equal to the first preset daemon value, determining that the first user is a unidirectional daemon user of the second user; if the social affinity value of the first user to the second user is smaller than the target daemon value and the social daemon value spent by the first user for the second user is smaller than a first preset daemon threshold, determining that the first user is not a unidirectional daemon user of the second user; if the social daemon value spent by the first user for the second user is smaller than the first preset daemon value and the social affinity value of the first user for the second user is larger than or equal to the target daemon value, determining that the first user is a unidirectional daemon user of the second user.

The first user wants to daemon the second user can be realized in two ways, that is, to raise the social affinity value to the target daemon value, or to spend the social daemon value greater than or equal to the first preset daemon value. Thus, two daemons are provided for the active daemon, the daemon conditions are expanded, and the daemon function is enriched.

In addition, when the social affinity value of the first user to the second user is determined to be greater than or equal to the target daemon value, if the social daemon value of the second user, which is sent to the social platform by the first user, is received, the sent social daemon value is returned to the first user, and a social daemon message is sent to the first user so as to prompt the first user that the daemon condition of the second user is reached, and meanwhile, the daemon cost of the first user is saved.

And S140, if the first user is determined to be the unidirectional daemon user of the second user, the first user is added into the social daemon list of the second user.

The social daemon list of the second user stores a plurality of active daemons of one-way daemons, and the storage position of each one-way daemons in the social daemon list is related to the social affinity value of the one-way daemons to the second user, namely the larger the social affinity value to the second user is, the more front the storage position in the social daemon list of the second user is.

As shown in fig. 2, 5 unidirectional daemon users, namely unidirectional daemon user 1, unidirectional daemon user 2, unidirectional daemon user 3, unidirectional daemon user 4 and unidirectional daemon user 5, are stored in the social daemon list of the second user, wherein the social affinity of the unidirectional daemon user 1 to the second user is greater than the social affinity of the unidirectional daemon user 2 to the second user, the social affinity of the unidirectional daemon user 2 to the second user is greater than the social affinity of the unidirectional daemon user 3 to the second user, the social affinity of the unidirectional daemon user 3 to the second user is greater than the social affinity of the unidirectional daemon user 4 to the second user, and the social affinity of the unidirectional daemon user 4 to the second user is greater than the social affinity of the unidirectional daemon user 5 to the second user.

In addition, the second user also corresponds to an active daemon list, wherein other users actively daemon the second user are stored, so that the second user can intuitively see the user daemon by the second user.

S150, if the social affinity value of the first user to the second user in the social daemon list of the second user is the largest, and the social affinity value of the first user to the second user is smaller than a preset affinity threshold, storing the social identification data of the first user into the social data of the second user.

Wherein the social identification data comprises: social image data, such as a user avatar, or a combined image of a user avatar with added virtual decoration.

If the social affinity value of the first user to the second user in the social daemon list of the second user is the largest, and the social affinity value of the first user to the second user is smaller than the preset affinity threshold value, the first user is the user with the highest social affinity value in the social daemon list of the second user, the first user is the advanced daemon of the second user, and only one advanced daemon of the daemon is used, namely only one advanced daemon of the second user is used, but the advanced daemon can be replaced.

After determining that the first user is a senior daemon of the second user, the daemon head print (i.e., the social image data of the first user) may be embedded into a profile page (social profile data) of the second user. As shown in FIG. 3, illustrated in FIG. 3 is a profile page of a second user, the avatar of the first user being embedded in the regionaThe position shown is not provided for the head portrait embedding position of the first user in the embodimentThe body defines.

By embedding the head image of the daemon into the personal data page of the daemon, other users who pay attention to the daemon can see the daemon state, so that the daemon can obtain stronger daemon existence sense and daemon participation sense, and the viscosity of the user can be improved conveniently.

S160, setting a daemon icon corresponding to the first user in social data of the second user.

The daemon icon corresponding to the first user has a display color, and if the first user is a close daemon user of the second user, the color of the daemon image displayed by the first user in the social data of the second user can be set to be red or other colors (excluding gold).

S170, if the social affinity value of the first user to the second user in the social daemon list is the largest, and the social affinity value of the first user to the second user is greater than or equal to a preset affinity threshold, determining that the first user is the intimate daemon user of the second user.

Wherein the daemon level of the intimate daemon user is greater than the daemon level of the unidirectional daemon user; the intimate daemon user describes that the first user is a lifelong daemon user of the second user, and a lifelong daemon relationship is established between the first user and the second user, which is the highest level of intimate daemon.

S180, adjusting the display color of the daemon icon corresponding to the first user in the social data of the second user.

After determining that the first user is an intimate daemon user of the second user, storing social identification data of the first user into social data of the second user, and adjusting display colors of daemon icons corresponding to the first user in the social data of the second user, wherein the display colors of the daemon icons corresponding to the first user are adjusted to be golden, so that daemon grades of the intimate daemon users can be conveniently displayed.

In some embodiments, if it is detected that the social daemon value spent by the third user for the second user is greater than or equal to the second preset daemon value, replacing the third user with an intimate daemon user for the second user; adjusting the display color of the daemon icon corresponding to the third user in the social data of the second user; the social affinity of the first user for the second user is maintained.

Wherein the second predetermined daemon value is greater than the first predetermined daemon value.

The intimate daemon user has only one, i.e. the intimate daemon user of the second user has only one user, and the intimate daemon user may be replaced by other users than the first user with a certain virtual gold coin.

If the third user is replaced by the intimate daemon of the second user, the social identification data of the third user is stored in the social data of the second user, and meanwhile, the display color of the daemon corresponding to the third user is adjusted in the social data of the second user, for example, the display color of the daemon corresponding to the first user is adjusted to be golden.

In addition, after the first user is replaced by the third user and becomes a new intimate daemon of the second user, the social intimate value of the first user to the second user is not changed or is not changed for a period of time.

In some embodiments, after the first user becomes an intimate daemon of the second user, detecting whether the first user and the second user generate social behavior data within a preset duration; if the first user and the second user do not generate social behavior data within the preset time, the social affinity value of the first user to the second user is maintained.

After the first user and the second user establish the intimate daemon, the social intimacy value of the two parties is not reduced even if the two parties are not connected for a long time, so that different social experiences are provided for the intimate daemon users, and the social viscosity of the users is further improved.

In the embodiment, a social affinity value of a first user to a second user is obtained, wherein the social affinity value is accumulated based on social behavior data of the first user to the second user, and the social behavior data is determined based on a social payment data packet sent by the first user to the second user in an online social process; determining a target daemon value required by the first user and the second user to establish a one-way daemon relation based on social interaction data of the first user and the second user, wherein the one-way daemon relation is used for describing the first user and the second user; determining whether the first user is a unidirectional daemon of the second user based on the social affinity value of the first user for the second user, the social daemon value spent by the first user for the second user, and the target daemon value; if the first user is determined to be a unidirectional daemon user of the second user, the first user is added into a social daemon list of the second user, a plurality of actively daemon unidirectional daemons are stored in the social daemon list of the second user, and the storage position of each unidirectional daemon in the social daemon list is related to the social intimacy value of the unidirectional daemon user to the second user; if the social affinity value of the first user to the second user in the social daemon list of the second user is the largest, and the social affinity value of the first user to the second user is smaller than a preset affinity threshold, storing social identification data of the first user into social data of the second user, wherein the social identification data comprises: social image data; setting a daemon icon corresponding to the first user in social data of the second user, wherein the daemon icon corresponding to the first user has a display color; if the social affinity value of the first user to the second user in the social daemon list is the largest, and the social affinity value of the first user to the second user is larger than or equal to a preset affinity threshold value, determining that the first user is an intimate daemon user of the second user, wherein the daemon level of the intimate daemon user is larger than that of the unidirectional daemon user; and adjusting the display color of the daemon icon corresponding to the first user in the social data of the second user. In this way, in the online social process, based on the one-way daemon relation between two social users, the social identification data of the daemon is displayed in the social data of the daemon, so that other users can see the active daemon of the daemon, and when the active daemon is upgraded to a close daemon, the display color of the daemon icon is adjusted, so that the daemon can stand out from the social users of the daemon, and the existence sense and the liveness of the users are effectively improved.

In some embodiments, if the first user is a intimate daemon of the second user and the second user is a intimate daemon of the first user, then an interaction behavior between the first user and the second user is set without payment.

Wherein the interaction behavior between the first user and the second user without payment comprises: voice interactions and video interactions.

If the first user and the second user are advanced daemon users of each other, the two parties carry out voice communication and video communication for free, daemon information is displayed in the personal data pages of the two parties, and the daemon head portraits are embedded, so that the two parties can more effectively conduct social communication, the communication efficiency is improved, and social understanding of the two parties is quickened.

Additionally, the act of interaction between the first user and the second user without payment may further include, but is not limited to, the following: free text chat for a certain preset time length, free giving of a certain amount of virtual gold coins, and the like.

In some embodiments, a predetermined number of unidirectional daemons of the second user are stored in the social daemon list.

The method of the embodiment can further comprise the following steps:

acquiring the user storage quantity in a social daemon list of a second user; if the number of the user stores is equal to the preset number, and the social daemon value spent by the fourth user for the second user is greater than or equal to the social daemon value spent by the fifth user for the second user, or the social intimacy value of the fourth user for the second user is greater than the social intimacy value of the fifth user for the second user, the unidirectional daemon relationship of the fifth user for the second user is released, and the fifth user is deleted from the social daemon list of the second user.

The fifth user is the user with the smallest social affinity value with the second user in the social daemon list of the second user, and the fourth user is not the user in the social daemon list of the second user.

If the social daemon list of the second user is full, other users can replace one unidirectional daemon user in the social daemon list of the second user by spending a certain amount of virtual gold coins (i.e. social daemon values) or by increasing their social affinity to the second user.

If one original fifth user in the social daemon list of the second user is replaced by a fourth user outside the social daemon list, deleting the fifth user from the social daemon list of the second user, and storing the fourth user into the social daemon list of the second user based on the social affinity value of the fourth user to the second user.

Or if the social affinity value of the first user to the second user is smaller than the target daemon value, the unidirectional daemon relation of the first user to the second user is relieved, and the first user is deleted from the social daemon list of the second user. If the social affinity value of the first user to the second user is reduced to a certain standard (namely, a target daemon value), deleting the first user from the social daemon list of the second user, so that the user of the social daemon list of the second user can be updated conveniently in real time.

The guarded party in this embodiment may also actively release the daemon relationship.

The method of the embodiment can further comprise the following steps:

receiving a daemon relation release request initiated by a second user and with a first user; transmitting a daemon removal instruction to the second user, wherein the daemon removal instruction comprises: the release pay data packet needed for releasing the daemon relationship; if a payment releasing data packet sent by the second user is received, releasing the unidirectional daemon relation of the first user to the second user, and deleting the first user from the social daemon list of the second user; a daemon removal prompt is sent to the first user.

Wherein the disarmed data package required to disarm the daemon relationship is determined by the social platform based on the social welcome of the second user.

After the second user actively releases the one-way daemon relation with the first user, the first user can know the active daemon state of the first user in time by sending a daemon relation release prompt to the first user.

In addition, the system can also send a relation release data packet to the first user, so that passive release compensation is conveniently issued to the first user, and the social confidence of the first user is improved. The relationship removal data packet may be a virtual gold coin of a certain amount, social points, free social times, etc.

The method of the embodiment can further comprise the following steps: receiving a daemon relation release request initiated by a first user to a second user; releasing the unidirectional daemon relation of the first user to the second user, deleting the second user from the social daemon list of the first user, and storing a plurality of daemon unidirectional daemon users in the social daemon list of the first user; and sending a daemon relation release prompt to the second user.

The active daemon can apply for releasing the one-way daemon relation with the daemon to the social platform, and the social platform can send a daemon relation release prompt to the daemon, so that the daemon can know the daemon state in time.

In addition, the system can also send a relation release data packet to the second user, so that passive release compensation can be conveniently issued to the second user, and the social confidence of the second user is improved. The relationship removal data packet may be a virtual gold coin of a certain amount, social points, free social times, etc.

After the first user is a close daemon of the second user, the first user or the second user may also apply for a disarming relationship from the social platform.

For example, receiving a second user initiated another daemon removal request with the first user; transmitting another daemon release instruction to the second user, wherein the other daemon release instruction comprises: another disarming pay data packet required for disarming the daemon relationship; if another payment releasing data packet sent by the second user is received, releasing the intimate daemon relation of the first user to the second user, and deleting the first user from the social daemon list of the second user; and sending a daemon relation release prompt to the first user so as to inform the first user that the second user has released the intimate daemon relation with your user.

The unpaid packets required to disarm the intimate daemons are larger than the one-way daemons.

Receiving another daemon relation release request initiated by a first user to a second user; releasing the intimate daemon of the first user to the second user, and deleting the second user from the social daemon list of the first user; and sending a daemon relation release prompt to the second user so as to inform the second user that the first user has released the intimate daemon relation with your user.

After the first user and the second user no longer have the unidirectional daemon or the intimate daemon, the social intimate values of both parties are all 0, and correspondingly, the interaction authority, the voice and video call authority and the like related to the social intimate values are lost.

Fig. 4 is a schematic structural diagram of an online social affinity daemon device according to the present embodiment. The affinity daemon of online social may include: the acquisition module 410, the first determination module 420, the second determination module 430, the addition module 440, the storage module 450, the setting module 460, the third determination module 470, and the adjustment module 480.

The obtaining module 410 is configured to obtain a social affinity value of the first user for the second user, where the social affinity value is accumulated based on social behavior data of the first user for the second user, and the social behavior data is determined based on a social payment data packet sent by the first user to the second user in an online social process.

The first determining module 420 is configured to determine a target daemon value required for the first user to establish a unidirectional daemon with the second user based on social interaction data of the first user and the second user, where the unidirectional daemon is used to describe the first user and the second user.

The second determining module 430 is configured to determine whether the first user is a unidirectional daemon of the second user based on the social affinity of the first user for the second user, the social daemon value spent by the first user for the second user, and the target daemon value.

The adding module 440 is configured to, if it is determined that the first user is a unidirectional daemon user of the second user, add the first user to a social daemon list of the second user, store a plurality of unidirectional daemons of active daemons in the social daemon list of the second user, and store a position of each unidirectional daemons in the social daemon list in association with a social affinity value of the unidirectional daemons to the second user.

The storage module 450 is configured to store social identification data of the first user into social profile data of the second user if the social affinity value of the first user to the second user in the social daemon of the second user is the largest and the social affinity value of the first user to the second user is smaller than a preset affinity threshold, where the social identification data includes: social image data.

The setting module 460 is configured to set a daemon icon corresponding to the first user in social data of the second user, where the daemon icon corresponding to the first user has a display color.

The third determining module 470 is configured to determine that the first user is a intimate daemon of the second user if the social affinity of the first user to the second user in the social daemon list is the largest and the social affinity of the first user to the second user is greater than or equal to a preset affinity threshold, where the daemon level of the intimate daemon is greater than the daemon level of the unidirectional daemon.

The adjustment module 480 is configured to adjust a display color of the daemon icon corresponding to the first user in the social data of the second user.

In this embodiment, optionally, the first determining module 420 is specifically configured to:

based on social interaction data of the first user and the second user, determining intimate daemon standard data of the first user to the second user; determining an initial daemon value required by the first user and the second user to establish a one-way daemon relationship based on the intimate daemon standard data and the popularity of the second user in online social contact; if the interaction interval duration of the first user and the second user is smaller than or equal to the preset interval duration, determining the initial daemon value as a target daemon value; if the interaction interval time length of the first user and the second user is longer than the preset interval time length, reducing the initial daemon value based on the time length difference between the interaction interval time length and the preset interval time length to obtain a target daemon value; the larger the time difference between the interaction interval time length and the preset interval time length is, the smaller the target daemon value is.

In this embodiment, the optional second determining module 430 is specifically configured to:

In this embodiment, optionally, the method further includes: and a first processing module.

The first processing module is used for replacing the third user with an intimate daemon user of the second user if the social daemon value spent by the third user for the second user is detected to be greater than or equal to a second preset daemon value, wherein the second preset daemon value is greater than the first preset daemon value; adjusting the display color of the daemon icon corresponding to the third user in the social data of the second user; the social affinity of the first user for the second user is maintained.

In this embodiment, optionally, the method further includes: and a second processing module.

The second processing module is used for setting interaction behavior between the first user and the second user without payment if the first user is a intimate daemon of the second user and the second user is the intimate daemon of the first user; wherein the interaction behavior between the first user and the second user without payment comprises: voice interactions and video interactions.

In this embodiment, optionally, a preset number of unidirectional daemon users are stored in the social daemon list of the second user, and further including: and a third processing module.

The third processing module is used for acquiring the user storage quantity in the social daemon list of the second user; if the number of the user stores is equal to the preset number, and the social daemon value spent by the fourth user for the second user is greater than or equal to the social daemon value spent by the fifth user for the second user, or the social intimacy value of the fourth user for the second user is greater than the social intimacy value of the fifth user for the second user, the unidirectional daemon relation of the fifth user for the second user is relieved, the fifth user is deleted from the social daemon list of the second user, the fifth user is the user with the smallest social intimacy value with the second user in the social daemon list of the second user, and the fourth user is not the user in the social daemon list of the second user; or if the social affinity value of the first user to the second user is smaller than the target daemon value, the unidirectional daemon relation of the first user to the second user is relieved, and the first user is deleted from the social daemon list of the second user.

In this embodiment, optionally, the method further includes: and a fourth processing module.

The fourth processing module is used for receiving a daemon relation release request initiated by the second user and connected with the first user; transmitting a daemon removal instruction to the second user, wherein the daemon removal instruction comprises: the release pay data packet needed for releasing the daemon relationship; if a payment releasing data packet sent by the second user is received, releasing the unidirectional daemon relation of the first user to the second user, and deleting the first user from the social daemon list of the second user; a daemon removal prompt is sent to the first user.

In this embodiment, optionally, the method further includes: and a fifth processing module.

A fifth processing module, configured to receive a daemon relation release request initiated by the first user for the second user; releasing the unidirectional daemon relation of the first user to the second user, deleting the second user from the social daemon list of the first user, and storing a plurality of daemon unidirectional daemon users in the social daemon list of the first user; and sending a daemon relation release prompt to the second user.

In this embodiment, optionally, the method further includes: and a sixth processing module.

The sixth processing module is used for detecting whether the first user and the second user generate social behavior data within a preset duration after the first user becomes an intimate daemon of the second user; if the first user and the second user do not generate social behavior data within the preset time, the social affinity value of the first user to the second user is maintained.

The intimate daemon device of online social provided by the present disclosure may execute the above method embodiment, and the specific implementation principle and technical effects of the intimate daemon device may refer to the above method embodiment, which is not described herein.

The embodiment of the application also provides computer equipment. Referring specifically to fig. 5, fig. 5 is a basic structural block diagram of a computer device according to the present embodiment.

The computer device includes a memory 510 and a processor 520 communicatively coupled to each other via a system bus. It should be noted that only a computer device having a memory 510 and a processor 520 is shown in the figures, but it should be understood that not all of the illustrated components need be implemented and that more or fewer components may be implemented instead. It will be appreciated by those skilled in the art that the computer device herein is a device capable of automatically performing numerical calculations and/or information processing in accordance with predetermined or stored instructions, the hardware of which includes, but is not limited to, microprocessors, application specific integrated circuits (Application Specific Integrated Circuit, ASICs), programmable gate arrays (fields-ProgrammableGate Array, FPGAs), digital processors (Digital Signal Processor, DSPs), embedded devices, etc.

The computer device may be a desktop computer, a notebook computer, a palm computer, a cloud server, or the like. The computer device can perform man-machine interaction with a user through a keyboard, a mouse, a remote controller, a touch pad or voice control equipment and the like.

The memory 510 includes at least one type of readable storage medium including non-volatile memory (non-volatile memory) or volatile memory, such as flash memory (flash memory), hard disk, multimedia card, card memory (e.g., SD or DX memory, etc.), random access memory (random accessmemory, RAM), read-only memory (ROM), erasable programmable read-only memory (erasableprogrammable read-only memory, EPROM), electrically erasable programmable read-only memory (electrically erasable programmable read-only memory, EEPROM), programmable read-only memory (programmable read-only memory, PROM), magnetic memory, RAM, optical disk, etc., which may include static or dynamic. In some embodiments, the memory 510 may be an internal storage unit of a computer device, such as a hard disk or memory of the computer device. In other embodiments, the memory 510 may also be an external storage device of a computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, or a Flash Card (Flash Card) provided on the computer device. Of course, memory 510 may also include both internal storage units for computer devices and external storage devices. In this embodiment, the memory 510 is typically used to store an operating system installed on a computer device and various types of application software, such as program codes of the above-described methods. In addition, the memory 510 may also be used to temporarily store various types of data that have been output or are to be output.

Processor 520 is typically used to perform the overall operations of the computer device. In this embodiment, the memory 510 is configured to store program codes or instructions, the program codes include computer operation instructions, and the processor 520 is configured to execute the program codes or instructions stored in the memory 510 or process data, such as the program codes for executing the above-mentioned method.

Herein, the bus may be an industry standard architecture (Industry Standard Architecture, ISA) bus, a peripheral component interconnect (Peripheral Component Interconnect, PCI) bus, or an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, among others. The bus system may be classified as an address bus, a data bus, a control bus, etc. For ease of illustration, the figures are shown with only one bold line, but not with only one bus or one type of bus.

Another embodiment of the present application also provides a computer-readable medium, which may be a computer-readable signal medium or a computer-readable medium. A processor in a computer reads computer readable program code stored in a computer readable medium, such that the processor is capable of performing the functional actions specified in each step or combination of steps in the above-described method; a means for generating a functional action specified in each block of the block diagram or a combination of blocks.

The computer readable medium includes, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared memory or semiconductor system, apparatus or device, or any suitable combination of the foregoing, the memory storing program code or instructions, the program code including computer operating instructions, and the processor executing the program code or instructions of the above-described methods stored by the memory.

The definition of memory and processor may refer to the description of the embodiments of the computer device described above, and will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of modules or units is merely a logical functional division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.

The functional units or modules in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.

The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in part or all or part of the technical solution contributing to the prior art or in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform all or part of the steps of the methods of the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.

In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps other than those listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The application may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The use of first, second, third, etc. does not denote any order, and the words are to be interpreted as names. The steps in the above embodiments should not be construed as limiting the order of execution unless specifically stated.

The above embodiments are only for illustrating the technical solution of the present application, and are not limiting thereof; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the corresponding technical solutions.

Claims

1. A method of affinity daemon of online social contact, comprising:

2. The method of claim 1, wherein the determining a target daemon value required for the first user to establish a one-way daemon relationship with the second user based on social interaction data of the first user and the second user comprises:

Determining affinity daemon standard data of the first user for the second user based on social interaction data of the first user and the second user;

determining an initial daemon value required by the first user to establish a one-way daemon relationship with the second user based on the intimate daemon criteria data and the popularity of the second user in online social contact;

if the interaction interval duration of the first user and the second user is smaller than or equal to the preset interval duration, determining the initial daemon value as the target daemon value;

if the interaction interval time length of the first user and the second user is longer than the preset interval time length, the initial daemon value is reduced based on the time length difference between the interaction interval time length and the preset interval time length, and the target daemon value is obtained;

the larger the time difference between the interaction interval time and the preset interval time, the smaller the target daemon value.

3. The method of claim 1, wherein the determining whether the first user is a unidirectional daemon of the second user based on the social affinity of the first user for the two users, the social daemon value spent by the first user for the second user, and the target daemon value comprises:

If the social affinity value of the first user to the second user is smaller than the target daemon value and the social daemon value spent by the first user for the second user is larger than or equal to a first preset daemon value, determining that the first user is a unidirectional daemon user of the second user;

if the social affinity value of the first user to the second user is smaller than the target daemon value and the social daemon value spent by the first user for the second user is smaller than the first preset daemon threshold, determining that the first user is not a unidirectional daemon user of the second user;

and if the social daemon value spent by the first user for the second user is smaller than the first preset daemon value and the social affinity value of the first user for the second user is larger than or equal to the target daemon value, determining that the first user is a unidirectional daemon user of the second user.

4. A method according to claim 3, further comprising:

if the social daemon value spent by the third user for the second user is detected to be greater than or equal to a second preset daemon value, replacing the third user with an intimate daemon user of the second user, wherein the second preset daemon value is greater than the first preset daemon value;

Adjusting the display color of the daemon icon corresponding to the third user in the social data of the second user;

maintaining a social affinity of the first user for the second user.

5. The method as recited in claim 1, further comprising:

if the first user is a intimate daemon of the second user and the second user is a intimate daemon of the first user, setting interaction behavior between the first user and the second user without payment;

6. The method of claim 1, wherein a predetermined number of unidirectional daemons of users are stored in the social daemon list of the second user;

the method further comprises the steps of:

acquiring the user storage quantity in the social daemon list of the second user;

if the number of the stored users is equal to the preset number, and the social daemon value spent by the fourth user for the second user is greater than or equal to the social daemon value spent by the fifth user for the second user, or the social intimacy value of the fourth user for the second user is greater than the social intimacy value of the fifth user for the second user, the unidirectional daemon relation of the fifth user for the second user is relieved, the fifth user is deleted from the social daemon list of the second user, the fifth user is the user with the smallest social intimacy value with the second user in the social daemon list of the second user, and the fourth user is not the user in the social daemon list of the second user;

Or if the social affinity value of the first user to the second user is smaller than the target daemon value, the unidirectional daemon relation of the first user to the second user is relieved, and the first user is deleted from the social daemon list of the second user.

7. The method as recited in claim 1, further comprising:

receiving a daemon relation release request initiated by the second user and with the first user;

sending a daemon relation release instruction to the second user, wherein the daemon relation release instruction comprises: the release pay data packet needed for releasing the daemon relationship;

if the payment releasing data packet sent by the second user is received, the unidirectional daemon relation of the first user to the second user is released, and the first user is deleted from the social daemon list of the second user;

and sending a daemon relation release prompt to the first user.

8. The method as recited in claim 1, further comprising:

receiving a daemon relation release request initiated by the first user to the second user;

releasing the unidirectional daemon relation of the first user to the second user, deleting the second user from the social daemon list of the first user, and storing a plurality of daemon unidirectional daemon users in the social daemon list of the first user;

And sending a daemon relation release prompt to the second user.

9. The method as recited in claim 1, further comprising:

after the first user becomes an intimate daemon of the second user, detecting whether the first user and the second user generate social behavior data within a preset duration;

and if the first user and the second user do not generate social behavior data within the preset time, maintaining the social affinity value of the first user to the second user.

10. An affinity daemon device for online social contact, comprising: