CN113961791A - Information pushing method and device, computer equipment and storage medium - Google Patents

Information pushing method and device, computer equipment and storage medium Download PDF

Info

Publication number
CN113961791A
CN113961791A CN202010622105.6A CN202010622105A CN113961791A CN 113961791 A CN113961791 A CN 113961791A CN 202010622105 A CN202010622105 A CN 202010622105A CN 113961791 A CN113961791 A CN 113961791A
Authority
CN
China
Prior art keywords
user
information
heat value
target
candidate information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
CN202010622105.6A
Other languages
Chinese (zh)
Inventor
陈昊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Priority to CN202111658761.2A priority Critical patent/CN114297502A/en
Priority to CN202010622105.6A priority patent/CN113961791A/en
Publication of CN113961791A publication Critical patent/CN113961791A/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9535—Search customisation based on user profiles and personalisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9536—Search customisation based on social or collaborative filtering
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/01—Social networking

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Business, Economics & Management (AREA)
  • General Health & Medical Sciences (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Primary Health Care (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • User Interface Of Digital Computer (AREA)

Abstract

The application relates to an information pushing method, an information pushing device, computer equipment and a storage medium, and relates to the technical field of information pushing, wherein the method comprises the following steps: acquiring a user social network of a first user, which comprises at least one second user having social relation with the first user; acquiring social distances between the second users and the first user; grouping the second users based on the social distance corresponding to the second users to obtain a grouping result, wherein the grouping result is used for indicating at least two user groups; selecting at least one target information from each candidate information based on the grouping result, the candidate information being information on which the other user has performed the specified operation; and pushing the target information to the first user. By the method, the information pushing result which is reasonable for the given user is screened out by combining the browsing information of other users in the social network of the user without depending on enough user data, so that the information pushing effect is improved.

Description

Information pushing method and device, computer equipment and storage medium
Technical Field
The embodiment of the application relates to the technical field of information pushing, in particular to an information pushing method and device, computer equipment and a storage medium.
Background
With the rise of short video entertainment and the continuous upgrade of terminal equipment and network technology, short video recommendation becomes an essential function of short video entertainment.
In the related art, the short video recommendation may be based on the browsing click history of the user, that is, a recommendation result is given by recommending a video most similar to the video browsed by the user, or a recommendation result is given by recommending a video browsed and clicked by the user similar to the user.
In the recommendation method, in order to obtain a more accurate recommendation result, enough user browsing click data needs to be accumulated, and the recommendation effect is poor on the occasion that enough user data is not available.
Disclosure of Invention
The embodiment of the application provides an information pushing method, an information pushing device, computer equipment and a storage medium, which can screen out a more reasonable information pushing result for a given user by combining browsing information of other users in a user social network under the condition of not depending on enough user data, so that the information pushing effect is improved, and the technical scheme is as follows:
in one aspect, an information pushing method is provided, where the method includes:
the method comprises the steps of obtaining a user social network of a first user, wherein the user social network comprises at least one second user having social relation with the first user;
grouping the second users based on the social distance corresponding to the second users to obtain a grouping result, wherein the grouping result is used for indicating at least two user groups; the social distance is a distance of the corresponding second user from the first user in the user social network;
selecting at least one target information from each candidate information based on the grouping result, the candidate information including information that any user of the second users performed a specified operation;
and pushing the target information to the first user.
In another aspect, an information pushing apparatus is provided, the apparatus including:
the system comprises a social network acquisition module, a first storage module and a second storage module, wherein the social network acquisition module is used for acquiring a user social network of a first user, and the user social network comprises at least one second user having a social relationship with the first user;
the user grouping module is used for grouping the second users based on the social distance corresponding to the second users to obtain a grouping result, and the grouping result is used for indicating at least two user groups; the social distance is a distance of the corresponding second user from the first user in the user social network;
a target information selection module configured to select at least one target information from each candidate information based on the grouping result, where the candidate information includes information that any user of the second users performed a specified operation;
and the information pushing module is used for pushing the target information to the first user.
In one possible implementation, the target information selection module includes:
a first popularity value obtaining sub-module, configured to obtain popularity values of the candidate information with respect to the second users; the heat value is used for indicating the popularity degree of the corresponding information to the corresponding user;
a second popularity value obtaining sub-module, configured to obtain popularity values of the respective candidate information with respect to the first user based on popularity values of the respective candidate information with respect to the respective second users;
and the target information selection sub-module is used for selecting at least one target information from the candidate information based on the grouping result and the heat value of the candidate information relative to the first user.
In a possible implementation manner, the first heat value obtaining sub-module includes:
an operation number obtaining unit configured to obtain the number of times that each of the second users performs the specified operation on the first information; the first information is any one of the candidate information;
a first heat value acquisition unit, configured to acquire a heat value of the first information with respect to each of the second users based on a number of times that each of the second users performs the specified operation on the first information.
In a possible implementation manner, the second heat value obtaining sub-module is configured to:
and acquiring the heat value of each candidate information relative to the first user under the influence of each second user based on the heat value of each candidate information relative to each second user and the social distance corresponding to each second user.
In a possible implementation manner, the second heat value obtaining sub-module is configured to:
acquiring a heat value of second information relative to a first user under the influence of the first target user based on the heat value of the second information relative to the first target user and a social distance corresponding to the first target user; the second information is any one of the candidate information; the first target user is any one of the second users;
the second information is inversely related to the social distance corresponding to the first target user relative to the hot value of the first user under the influence of the first target user.
In one possible implementation manner, the target information selection sub-module includes:
a third hot value obtaining unit, configured to obtain a hot value of each candidate information in each user group of at least two user groups, with respect to a hot value of the first user, under the influence of each second user on each candidate information;
a target information selecting unit configured to select at least one target information from each of the candidate information based on a heat value of each of the candidate information in each of at least two user groups.
In a possible implementation manner, the third heat value obtaining unit is configured to:
acquiring a heat value of third information relative to the first user under the influence of a second target user; the third information is any one of the candidate information; the second target user is each of the users who have performed the specified operation on the third information among the second users belonging to the first group;
and combining the third information relative to the heat value of the first user under the influence of the second target user based on the number of the users of the first group to obtain the heat value of the third information in the first group.
In a possible implementation manner, the target information selecting unit is configured to:
fusing the heat value of each candidate information in each user group of at least two user groups to obtain the total heat value of each candidate information relative to the first user;
and selecting at least one target information from each candidate information according to the total heat value of each candidate information relative to the first user.
In a possible implementation manner, the information pushing module is configured to:
and pushing the target information to the first user according to the sequence that the total heat value of at least one target information relative to the first user is from large to small.
In a possible implementation manner, the target information selecting unit is configured to:
ranking each of the candidate information within each of at least two of the user groups based on a heating value of the each of the candidate information within the each user group;
based on a sorting result of sorting each candidate information in each user group, at least one piece of information is respectively screened out from each candidate information corresponding to each user group;
and respectively screening out at least one piece of information corresponding to each user group to obtain at least one piece of target information.
In one possible implementation, each of the second users is a user whose distance from the first user in the social network is less than a distance threshold.
In one possible implementation, the apparatus further includes:
and the social distance acquisition module is used for acquiring the social distance corresponding to the second user based on the minimum hop count of the second user reaching the first user in the social network.
In another aspect, a computer device is provided, which includes a processor and a memory, where at least one instruction, at least one program, a set of codes, or a set of instructions is stored in the memory, and the at least one instruction, the at least one program, the set of codes, or the set of instructions is loaded and executed by the processor to implement the information pushing method provided in the various alternative implementations described above.
In another aspect, a computer-readable storage medium is provided, in which at least one instruction, at least one program, a set of codes, or a set of instructions is stored, which is loaded and executed by a processor to implement the information pushing method provided in the various alternative implementations described above.
In another aspect, a computer program product or computer program is provided, the computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the information pushing method provided in the above-mentioned various alternative implementations.
The technical scheme provided by the application can comprise the following beneficial effects:
the method comprises the steps of grouping other users based on the social distance between a given user and other users in a social network, and then selecting information to be pushed to the given user from information of specified operations executed by other users based on a grouping result, so that a more reasonable information pushing result for the given user is screened out by combining browsing information of other users in the social network of the user under the condition of not depending on enough user data, and the information pushing effect is improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application.
Fig. 1 shows a schematic structural diagram of an information push system provided in an exemplary embodiment of the present application;
FIG. 2 illustrates a flow chart of an information push method shown in an exemplary embodiment of the present application;
FIG. 3 illustrates a flow chart of an information push method shown in an exemplary embodiment of the present application;
FIG. 4 illustrates a schematic diagram of a packet shown in an exemplary embodiment of the present application;
FIG. 5 illustrates a schematic diagram of an information push system provided by an exemplary embodiment of the present application;
FIG. 6 illustrates a block diagram of an information pushing device in accordance with an exemplary embodiment of the present application;
FIG. 7 is a block diagram illustrating the structure of a computer device according to an example embodiment.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.
The embodiment of the application provides an information pushing method, which can be used for grouping users based on complete user social network data and different social distances and acquiring recommendation information with high popularity for target users based on the user grouping, so that the information pushing effect is improved without depending on enough user data. For ease of understanding, the terms referred to in this application are explained below.
Short video
Short video, also called short-film video, is a mode of internet content transmission, and generally refers to video transmitted on new internet media within 1 minute (not strictly defined); with the popularization of mobile terminals and the increasing speed of networks, short and fast mass flow transmission contents are gradually favored by various large platforms, fans and capital.
Referring to fig. 1, a schematic structural diagram of an information push system provided by an exemplary embodiment of the present application is shown, and as shown in fig. 1, the information push system includes a server 110 and a terminal 120.
The server 110 may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing basic cloud computing services such as a cloud service, a cloud database, cloud computing, a cloud function, cloud storage, a network service, cloud communication, a middleware service, a domain name service, a security service, a CDN, a big data and artificial intelligence platform, and the like.
The client 120 may be, but is not limited to, a smart phone, a tablet computer, a notebook computer, a desktop computer, a smart speaker, a smart watch, and the like.
The terminal and the server are connected through a communication network. Optionally, the communication network is a wired network or a wireless network.
Optionally, the wireless network or wired network described above uses standard communication techniques and/or protocols. The Network is typically the Internet, but may be any Network including, but not limited to, a Local Area Network (LAN), a Metropolitan Area Network (MAN), a Wide Area Network (WAN), a mobile, wireline or wireless Network, a private Network, or any combination of virtual private networks. In some embodiments, data exchanged over a network is represented using techniques and/or formats including Hypertext Mark-up Language (HTML), Extensible Markup Language (XML), and the like. All or some of the links may also be encrypted using conventional encryption techniques such as Secure Socket Layer (SSL), Transport Layer Security (TLS), Virtual Private Network (VPN), Internet Protocol Security (IPsec). In other embodiments, custom and/or dedicated data communication techniques may also be used in place of, or in addition to, the data communication techniques described above. The application is not limited thereto.
Referring to fig. 2, a flowchart of an information pushing method shown in an exemplary embodiment of the present application is shown, where the method may be executed by a computer device, and the computer device may be implemented as the server shown in fig. 1, and the method includes:
step 210, obtaining a user social network of the first user, where the user social network includes at least one second user having a social relationship with the first user.
In one possible implementation, the social network of the user is obtained based on a communication application of the first user, for example, the communication application may be a QQ, WeChat, MSN, Skype, ICQ, AIM, UC, Internet Expo bubble, address book, or other application capable of meeting the communication requirement between different users.
In a possible implementation manner, a direct or indirect social relationship exists between at least one second user included in the user social network and the first user, for example, for the user a, the user B has a direct friend relationship with the second user, while the user C does not have a direct friend relationship with the user a, but has a direct friend relationship with the user B, so that it can be considered that an indirect social relationship exists between the user a and the user C, and a direct social relationship exists between the user a and the user B.
In one possible implementation, the user social network is an undirected graph with users as nodes and social relationships between users as edges. For example, when there is a direct social relationship between two users, the nodes corresponding to the two users are connected by an edge in the user social network.
Step 220, grouping the second users based on the social distance corresponding to the second users to obtain a grouping result, wherein the grouping result is used for indicating at least two user groups; the social distance is a distance of the corresponding second user from the first user in the user social network.
The social distance between the second user and the first user in the same group is the same. Referring to fig. 3, which shows a schematic diagram of the groups shown in an exemplary embodiment of the present application, as shown in fig. 3, a solid circle 301 represents a first user, a solid circle 302 represents a second user in the first group 310, and a dashed circle 303 represents a second user in the second group 320, wherein the social distances between the second user and the first user in the first group 310 are both 1, and the social distances between the second user and the first user in the second group 420 are both 2.
It should be noted that the number of the above packets is only illustrative, and the application does not limit the number of the packets.
And step 230, selecting at least one target information from each candidate information based on the grouping result, wherein the candidate information comprises the information that any user in each second user performed the specified operation.
In one possible implementation manner, the candidate information may be one of text information, image information and video information, for example, the text information may be news information, movie reviews and the like, the image information may be comics, illustrations, emoticons and the like, and the video information may be short videos, art programs, movie episodes and the like.
In one possible implementation, the specifying operation includes at least one of clicking, collecting, commenting, praising, browsing, and the like.
In a possible implementation manner, when the specified operation is browsing, a browsing duration threshold is set, and when the browsing duration of the user reaches the browsing duration threshold, the browsing operation is determined as the specified operation.
Step 240, pushing the target information to the first user.
In a possible implementation manner, all the target information is pushed to the first user, or a part of the target information is recommended to the first user according to the information pushing rule.
In summary, according to the information pushing method provided by the application, the other users are grouped based on the social distance between the given user and the other users in the social network, and then the information pushed to the given user is selected from the information of the other users who perform the specified operation based on the grouping result, so that the information pushing result which is more reasonable for the given user is screened out by combining the browsing information of the other users in the social network of the user under the condition of not depending on enough user data, and the information pushing effect is improved.
Referring to fig. 4, a flowchart of an information pushing method shown in an exemplary embodiment of the present application is shown, where the method may be executed by a computer device, and the computer device may be implemented as the server shown in fig. 1, and as shown in fig. 4, the method includes:
step 410, a user social network of the first user is obtained, wherein the user social network comprises at least one second user having a social relationship with the first user.
In one possible implementation, the social relationship refers to a relationship between the first user and the second user that can be connected together through a specified one-way path. For example, taking the friend relationship as an example, if the user a and the user B are friends, and the user B and the user C are friends, it is determined that the user a and the user C have a social relationship; for another example, taking the focus relationship as an example, the user a focuses on the user B in one direction, and the user B focuses on the user C in one direction, so that for the user a, there is a social relationship with the user C, but for the user C, there is no social relationship with the user a.
In a possible implementation manner, the social distance corresponding to the second user is obtained based on the minimum hop count of the second user reaching the first user in the social network.
As shown in fig. 3, the number of connection lines from the user 301 to the user 302 is 1, so that the number of hops from the user 302 to the user 301 in the social network is 1, and the social distance corresponding to the user 302 is 1.
In one possible implementation, the social distance is determined based on a number of user nodes through which the second user is to pass when establishing the connection with the first user.
The user node is a user capable of communicating a first user and a second user, for example, for a user a, a user B has a direct friend relationship with the user B, a user C does not have a direct friend relationship with the user a, but has a direct friend relationship with the user B, the user B is a user node between the user a and the user C, when n nodes exist between the first user and the second user, a social distance between the first user and the second user is n +1, where n is a natural number, and when n is 0, the social distance between the first user and the second user is a direct friend relationship, and the social distance between the first user and the second user is 1.
In one possible implementation, social distances between different users are given different weights based on different user tags in the user's social network, such as, for example, in the social network of the user A, user tags such as family, friends, coworkers, passerby and the like exist, after the social distance between the first user and the second user with different user tags is obtained according to the user node, based on the fact that the user tags of the second users are given different weights on the basis of the social distance, assuming that the weights of family and friends are 0.5, the weight of a colleague is 1, and the weight of a passerby is 2, for each second user whose social distance to the user a is 1, the social distance of the second user with the family and friend tag is 0.5, the social distance of the second user with the colleague tag is 1, and the social distance of the second user with the passerby tag is 2.
In the embodiment of the present application, the example is described in which the weight corresponding to each user tag is 1.
In a possible implementation manner, the social distance between the second user and the first user is the shortest social distance between the second user and the first user, for example, if there is a direct social relationship between the user C and the users B and D, but there is a direct social relationship between the user B and the user a before, there is an indirect social relationship between the user D and the user a, and there is a user node user E between the user D and the user a as an example, then for the social relationship between the user a and the user C, the social distance between the user a and the user C is 2 by taking the user B as the user node, and the social distance between the user a and the user C is 3 by taking the user D as the user node, so that the shortest social distance between the user a and the user C is obtained as the social distance between the user a and the user C, which is 2.
In one possible implementation, each second user is a user in the social network whose distance from the first user is less than a distance threshold.
For example, the computer device sets the social distance between a user and the first user to positive infinity or determines the user to be a non-second user in response to the social distance between the user and the first user being greater than the distance threshold.
In the embodiment of the application, when the social distance between a certain user and the first user is greater than the distance threshold, it is determined that the social relationship between the user and the first user is far, the popularity value of the information browsed by the user to the first user is small, and in order to reduce the stress on the computer device caused by excessive computing, the social distance between the user and the first user is set to be infinite. For example, assuming that the social distance threshold is 5 and there are 7 user nodes between the user a and the user X, that is, the social distance between the user a and the user X is 8, the social distance between the user a and the user X may be set to be positive infinity, and it is considered that there is no social relationship between the user X and the user a.
In a possible implementation manner, the distance threshold is set according to actual requirements, and the value of the social distance threshold is not limited in the application.
Step 420, grouping the second users based on the social distance corresponding to the second users to obtain a grouping result, wherein the grouping result is used for indicating at least two user groups; the social distance is a distance of the corresponding second user from the first user in the user social network.
In one possible implementation, the social distance between the users in each group and the first user is the same, and the social distance between the users in different groups and the first user is different;
or each group corresponds to one social distance range, the social distance ranges corresponding to different groups do not overlap, and the user in each group is a user whose social distance to the first user is within the corresponding social distance range.
Step 430, acquiring the heat value of each candidate information relative to each second user; the heat value is used to indicate how popular the corresponding information is to the corresponding user.
In one possible implementation manner, the steps are implemented as follows:
acquiring the times of executing specified operations on the first information by each second user; the first information is any one of the respective candidate information;
and acquiring the heat value of the first information relative to each second user based on the times of executing the specified operation on the first information by each second user.
In one possible implementation manner, the number of times that each second user performs the specified operation on the first information is obtained as a heat value of the first information relative to each second user.
Or, in a possible implementation manner, the heat value of the first information relative to each second user is calculated based on the number of times that each second user performs the specified operation on the first information and the total number of times that each second user performs the specified operation on all information.
Taking the specified operation as a browsing operation as an example, acquiring the browsing times of each second user on the first information and the total information browsing times of each second user;
and calculating the heat value of the first information relative to each second user based on the browsing times of each second user to the first information and the total browsing times of each second user.
The browsing times of the same candidate information are different for different users, and the total browsing information of the information of different users is different, so the heat value of the same candidate information is different for different second users, so when calculating the heat value of the first information for each second user, the calculation can be performed based on different users, namely, the calculation is performed according to the browsing times of the candidate information corresponding to the target second user and the total browsing times of the information, the target second user is any one of the second users, and is expressed as:
hb,j＝Cb,j/Cb
wherein h isb,jRepresenting the heat value of the first information j relative to the target second user b, i.e. a reference heat value, C, of the first information jb,jRepresenting the number of times the target second user b browses the first information j, CbRepresenting the total number of information views by the targeted second user b.
Based on the above formula, the computer device calculates the heat value of each candidate information with respect to each second user, respectively.
And step 440, acquiring the heat value of each candidate information relative to the first user based on the heat value of each candidate information relative to each second user.
In a possible implementation manner, based on the heat value of each candidate information relative to each second user and the social distance corresponding to each second user, the heat value of each candidate information relative to the first user under the influence of each second user is obtained.
Taking the second information as an example, where the second information is any one of the candidate information, in a possible implementation manner, based on the heat value of the second information relative to the first target user and the social distance corresponding to the first target user, the heat value of the second information relative to the first user under the influence of the first target user is obtained, and the first target user is any one of the second users;
and the second information is inversely related to the social distance corresponding to the first target user relative to the heat value of the first user under the influence of the first target user.
In a possible implementation manner, the above process of calculating the heat value of the second information relative to the first user under the influence of the first target user is embodied as:
Heat(a,j)＝α(d-1)*hb,j
where Heat (a, j) represents the Heat value of the second information j for the first user a at the first target user b, alpha represents the Heat attenuation coefficient, 0<α<1, the heat attenuation coefficient can be set according to actual conditions, d represents the social distance between the first user a and the first target user b, and h represents the social distance between the first user a and the first target user bb,jRepresenting the heat value of the second information j for the first target user b.
According to the formula, the second information is exponentially inversely related to the social distance corresponding to the first target user relative to the hot value of the first user under the influence of the first target user.
When the social distance d between the first target user b and the first user a is 1, the heat value of the second information j to the first user a is equal to the heat value of the second information j to the first target user a;
when the social distance d between the first target user b and the first user a is greater than the distance threshold, i.e. is obtained as being positive infinity, the heat value of the second information j to the first user a is 0.
According to the formula, the computer device respectively calculates the heat value of each second information j to the first user a under the influence of different second users.
And step 450, selecting at least one target information from each candidate information based on the grouping result and the heat value of each candidate information relative to the first user.
In a possible implementation manner, based on the influence of each candidate information on each second user, obtaining a heat value of each candidate information in each user group of at least two user groups relative to a heat value of the first user;
at least one target information is selected from the respective candidate information based on a heat value of the respective candidate information within the respective user group of the at least two user groups.
Taking the third information as an example, where the third information is any one of the candidate information, in a possible implementation manner, a heat value of the third information relative to the first user under the influence of the second target user is obtained; the second target user is each user who has performed a specified operation on the third information among the second users belonging to the first group;
and combining the heat value of the third information relative to the first user under the influence of the second target user based on the number of the users in the first group to obtain the heat value of the third information in the first group.
That is, all the second users performing the designated operation on the third information in the first group are acquired as second target users, and the heat value obtained by summarizing and summing the heat values of the first user, which are obtained by the third users under the influence of the respective second target users, is acquired as the heat value of the third information in the first group. For example, the third information is browsed by the user a, the user B, and the user C in the first group, and corresponds to the heat value a, the heat value B, and the heat value C, and the heat value a, the heat value B, and the heat value C are summed and summarized, and the summarized heat value is obtained as the heat value of the third information in the first group.
In one possible implementation manner, at least one target message is selected from each candidate message based on the total heat value corresponding to each candidate message:
fusing the heat value of each candidate information in each user group of at least two user groups to obtain the total heat value of each candidate information relative to the first user;
at least one target information is selected from the candidate information according to the total heat value of the candidate information relative to the first user.
And accumulating the hot values of the same candidate information in each group to obtain the total hot value of the candidate information to the first user in the social network.
Or in each group, averaging the hot value of the same candidate information to the second user number in the group, and accumulating to obtain the total hot value of the candidate information to the first user in the social network, so as to reduce the influence of the difference of the hot values caused by the difference of the second user numbers in different groups.
The above process of calculating the total calorific value may be implemented as:
Figure BDA0002565496140000131
wherein HiRepresenting the total heat value, N, of the candidate information ikIndicates the number of second users in the k-th group, Hi,kThe heat value to the first user calculated in the K-th packet representing the candidate information i, K representing the maximum number of layers of the packet.
In a possible implementation manner, the candidate information is sorted according to the total heat value, and at least one target information is obtained from the sorted result, for example, n candidate information with top ranking is obtained as the target information.
Or, in a possible implementation manner, a total heat value threshold is set, and candidate information reaching the total heat value threshold is acquired as target information.
Wherein the total heat value threshold is a threshold preset in the server by a developer or a manager.
In one possible implementation, the computer device performs the target information selection in units of groups, and the selection is as follows:
ranking each candidate message within each user group based on a heating value of each candidate message within each user group of the at least two user groups;
based on a sorting result of sorting each candidate information in each user group, corresponding to each user group, respectively screening out at least one piece of information from each candidate information;
and respectively screening out at least one piece of information corresponding to each user group to obtain at least one piece of target information.
The higher the popularity value of the candidate information in the group is, the higher the probability that the candidate information is browsed in the group is, the higher the candidate information is, the browsing habit of the first user is met, or the probability that the candidate information is popular with the first user is, so in this embodiment of the present application, for each group, the computer device determines the candidate information whose ranking result indicates that the highest ranking is n in the same group as the target information of the group, where n is a positive integer.
In one possible implementation, the number of candidate information determined as target information in different packets is the same.
In another possible implementation manner, the number of the candidate information determined as the target information in different groups is different, and the smaller the social distance corresponding to the group is, the greater the number of the candidate information determined as the target information in the group is; the larger the social distance corresponding to a group, the smaller the number of candidate information determined as target information in the group.
Step 460, pushing the target information to the first user.
In one possible implementation, when the target information is information screened out according to the total heat value, the computer device pushes the target information to the first user according to the sequence of at least one target information from large to small relative to the total heat value of the first user.
Or, in a possible implementation manner, when the target information is information that is respectively screened according to each group, the computer device pushes the target information to the first user according to an order from near to far of a social distance between the user in the group where the target information is located and the first user.
Or, in another possible implementation manner, when the computer device selects the target information in each group according to the heat value corresponding to the candidate information in the group, the computer device may also calculate a total heat value of each target information, and then determine the push order of each target information according to the total heat value.
In a possible implementation manner, the computer device is provided with a preset social distance range, and when information push is performed, target information determined in a group within the preset social distance range is pushed to the first user, for example, if the preset social distance range is 2, target information determined according to a heat value in the group whose social distance from the first user is less than or equal to 2 is recommended to the first user.
In summary, according to the information pushing method provided by the application, the other users are grouped based on the social distance between the given user and the other users in the social network, and then the information pushed to the given user is selected from the information of the other users who perform the specified operation based on the grouping result, so that the information pushing result which is more reasonable for the given user is screened out by combining the browsing information of the other users in the social network of the user under the condition of not depending on enough user data, and the information pushing effect is improved.
The application provides an information push system, the system includes terminal and server, the server includes: the system comprises a heat transfer module, a grouping heat statistic module and a plurality of groups of heat statistic modules. Taking the information as a short video as an example, please refer to fig. 5, which shows a schematic diagram of an information pushing system according to an exemplary embodiment of the present application, as shown in fig. 5, a server of the information pushing system includes a heat transfer module 510, a grouping heat statistic module 520, and a plurality of groups of heat statistic modules 530.
The method comprises the steps that each user conducts network social activity and short video browsing activity based on a terminal, a server constructs a user social network based on the network social activity of the user, and candidate videos are determined based on the short video browsing activity of the user.
The popularity delivery module 510 is configured to obtain a user social network of a given user corresponding to the terminal, where the user social network includes at least one other user having a social relationship with the given user; wherein each other user corresponds to at least one browsed short video, and the heat transfer module acquires the short videos as candidate videos.
Under the effect of the heat transfer module, acquiring the heat value of each video under the influence of other users for a given user, as shown in fig. 5, H (1, a) is the heat value of the video 1 corresponding to the given user under the influence of the user a; h (1, b) is the heat value of video 1 for a given user under the influence of user b; h (2, a) is the heat value of video 2 corresponding to a given user a under the influence of user a.
The server groups other users based on the social distance corresponding to the other users to obtain a grouping result, wherein the grouping result is used for indicating at least two user groups; the social distance is the distance of the corresponding other user from the given user in the user's social network.
A grouping heat statistic module 520, configured to obtain a heat value of each video in each group after processing the heat value of a given user under the influence of other users based on the grouping result and each video, as shown in fig. 5, H (1, X) is the heat value of video 1 in user group X; h (1, Y), is the heat value of video 1 in user group Y, and H (2, X), is the heat value of video 2 in user group X.
And a multi-group heat statistic module 530, configured to calculate a total heat value of each video based on the heat values of each video in each group, where H (1) is the total heat value of video 1 and H (2) is the total heat value of video 2 as shown in fig. 5.
And the server screens out at least one target video from the videos based on the total heat value of each video and then pushes the target video to a terminal corresponding to a given user.
In summary, the information pushing system provided by the application groups other users based on the social distance between the given user and other users in the social network, and then selects the information to be pushed to the given user from the information of the other users who have executed the specified operation based on the grouping result, so that the information pushing result which is more reasonable for the given user is screened out by combining the browsing information of other users in the social network of the user under the condition of not depending on enough user data, and the information pushing effect is improved.
Referring to fig. 6, a block diagram of an information pushing apparatus shown in an exemplary embodiment of the present application is shown, where the apparatus may be applied to a computer device to perform all or part of the steps of the embodiments shown in fig. 2 or fig. 4, and the computer device may be implemented as the server shown in fig. 1, and as shown in fig. 6, the apparatus includes:
a social network obtaining module 610, configured to obtain a user social network of a first user, where the user social network includes at least one second user having a social relationship with the first user;
a user grouping module 620, configured to group the second users based on the social distance corresponding to each second user to obtain a grouping result, where the grouping result is used to indicate that at least two users are grouped; the social distance is the distance between the corresponding second user and the first user in the user social network;
a target information selection module 630, configured to select at least one target information from the respective candidate information based on the grouping result, where the candidate information includes information that any user of the respective second users performed the specified operation;
and the information pushing module 640 is used for pushing the target information to the first user.
In one possible implementation, the target information selection module 630 includes:
the first heat value acquisition sub-module is used for acquiring the heat value of each candidate information relative to each second user; the hot value is used for indicating the popularity degree of the corresponding information to the corresponding user;
the second heat value acquisition sub-module is used for acquiring the heat value of each candidate information relative to the first user based on the heat value of each candidate information relative to each second user;
and the target information selection sub-module is used for selecting at least one target information from the candidate information based on the grouping result and the heat value of the candidate information relative to the first user.
In a possible implementation manner, the first heat value obtaining sub-module includes:
an operation frequency acquiring unit, configured to acquire the frequency at which each second user performs a specified operation on the first information; the first information is any one of the respective candidate information;
and the first heat value acquisition unit is used for acquiring the heat value of the first information relative to each second user based on the times of executing the specified operation on the first information by each second user.
In a possible implementation manner, the second heat value obtaining sub-module is configured to:
and acquiring the heat value of each candidate information relative to the first user under the influence of each second user respectively based on the heat value of each candidate information relative to each second user and the corresponding social distance of each second user.
In a possible implementation manner, the second heat value obtaining sub-module is configured to:
acquiring a heat value of the second information relative to the first user under the influence of the first target user based on the heat value of the second information relative to the first target user and the social distance corresponding to the first target user; the second information is any one of the respective candidate information; the first target user is any one of the respective second users;
and the second information is inversely related to the social distance corresponding to the first target user relative to the hot value of the first user under the influence of the first target user.
In one possible implementation, the target information selection sub-module includes:
a third hot value obtaining unit, configured to obtain a hot value of each candidate information in each user group of the at least two user groups, with respect to the hot value of the first user, based on the influence of each candidate information on each second user, respectively;
a target information selection unit for selecting at least one target information from the respective candidate information based on a heat value of the respective candidate information within the respective user group of the at least two user groups.
In a possible implementation manner, the third heat value obtaining unit is configured to:
acquiring a heat value of the third information relative to the first user under the influence of a second target user; the third information is any one of the respective candidate information; the second target users are users who have performed specified operations on the third information among the second users belonging to the first group;
and combining the heat value of the third information relative to the first user under the influence of the second target user based on the number of the users in the first group to obtain the heat value of the third information in the first group.
In a possible implementation manner, the target information selecting unit is configured to:
fusing the heat value of each candidate information in each user group of at least two user groups to obtain the total heat value of each candidate information relative to the first user;
at least one target information is selected from the candidate information according to the total heat value of the candidate information relative to the first user.
In a possible implementation manner, the information pushing module 640 is configured to:
and pushing the target information to the first user according to the sequence that the total heat value of the at least one target information relative to the first user is from large to small.
In a possible implementation manner, the target information selecting unit is configured to:
ranking each candidate message within each user group based on a heating value of each candidate message within each user group of the at least two user groups;
based on a sorting result of sorting each candidate information in each user group, corresponding to each user group, respectively screening out at least one piece of information from each candidate information;
and respectively screening out at least one piece of information corresponding to each user group to obtain at least one piece of target information.
In one possible implementation, each second user is a user in the social network whose distance from the first user is less than a distance threshold.
In one possible implementation, the apparatus further includes:
and the social distance acquisition module is used for acquiring the social distance corresponding to the second user based on the minimum hop count of the second user reaching the first user in the social network.
In summary, the information pushing device provided by the application is applied to computer equipment, the other users are grouped based on the social distance between the given user and the other users in the social network, and then the information pushed to the given user is selected from the information of the other users who perform the specified operation based on the grouping result, so that the information pushing result which is more reasonable for the given user is screened out by combining the browsing information of the other users in the social network of the user under the condition of not depending on enough user data, and the information pushing effect is improved.
FIG. 7 is a block diagram illustrating the structure of a computer device 700 according to an example embodiment. The computer device may be implemented as the computer device in the above-mentioned aspects of the present application. The computer device may be implemented as a server, which may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing cloud computing services.
The computer device 700 includes a Central Processing Unit (CPU) 701, a system Memory 704 including a Random Access Memory (RAM) 702 and a Read-Only Memory (ROM) 703, and a system bus 705 connecting the system Memory 704 and the CPU 701. The computer device 700 also includes a basic Input/Output system (I/O system) 706, which facilitates transfer of information between devices within the computer, and a mass storage device 707 for storing an operating system 713, application programs 714, and other program modules 715.
The basic input/output system 706 comprises a display 708 for displaying information and an input device 709, such as a mouse, keyboard, etc., for a user to input information. Wherein the display 708 and input device 709 are connected to the central processing unit 701 through an input output controller 710 coupled to the system bus 705. The basic input/output system 706 may also include an input/output controller 710 for receiving and processing input from a number of other devices, such as a keyboard, mouse, or electronic stylus. Similarly, input-output controller 710 may also provide output to a display screen, a printer, or other type of output device.
The mass storage device 707 is connected to the central processing unit 701 through a mass storage controller (not shown) connected to the system bus 705. The mass storage device 707 and its associated computer-readable media provide non-volatile storage for the computer device 700. That is, the mass storage device 707 may include a computer-readable medium (not shown) such as a hard disk or Compact Disc-Only Memory (CD-ROM) drive.
Without loss of generality, the computer-readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes RAM, ROM, Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), flash Memory or other solid state Memory technology, CD-ROM, Digital Versatile Disks (DVD), or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage, or other magnetic storage devices. Of course, those skilled in the art will appreciate that the computer storage media is not limited to the foregoing. The system memory 704 and mass storage device 707 described above may be collectively referred to as memory.
The computer device 700 may also operate as a remote computer connected to a network via a network, such as the internet, in accordance with various embodiments of the present disclosure. That is, the computer device 700 may be connected to the network 712 through the network interface unit 711 connected to the system bus 705, or may be connected to other types of networks or remote computer systems (not shown) using the network interface unit 711.
The memory further includes at least one instruction, at least one program, a code set, or a set of instructions, which is stored in the memory, and the central processing unit 701 implements all or part of the steps in the information pushing method shown in the above embodiments by executing the at least one instruction, the at least one program, the code set, or the set of instructions.
In an exemplary embodiment, a non-transitory computer readable storage medium including instructions, such as a memory including at least one instruction, at least one program, set of codes, or set of instructions, executable by a processor to perform all or part of the steps of the method shown in any of the embodiments of fig. 2 or 4 described above is also provided. For example, the non-transitory computer readable storage medium may be a ROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
In an exemplary embodiment, a computer program product or a computer program is also provided, which comprises computer instructions, which are stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions to cause the computer device to perform all or part of the steps of the method shown in any of the embodiments of fig. 2 or fig. 4.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It will be understood that the present application is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.

Claims (15)

1. An information pushing method, characterized in that the method comprises:
the method comprises the steps of obtaining a user social network of a first user, wherein the user social network comprises at least one second user having social relation with the first user;
grouping the second users based on the social distance corresponding to the second users to obtain a grouping result, wherein the grouping result is used for indicating at least two user groups; the social distance is a distance of the corresponding second user from the first user in the user social network;
selecting at least one target information from each candidate information based on the grouping result, the candidate information including information that any user of the second users performed a specified operation;
and pushing the target information to the first user.
2. The method of claim 1, wherein the selecting at least one target information from the candidate information based on the grouping result comprises:
acquiring the heat value of each candidate information relative to each second user; the heat value is used for indicating the popularity degree of the corresponding information to the corresponding user;
acquiring the heat value of each candidate information relative to the first user based on the heat value of each candidate information relative to each second user;
selecting at least one target information from each candidate information based on the grouping result and a heat value of each candidate information relative to the first user.
3. The method according to claim 2, wherein the obtaining the heat value of each candidate information relative to each second user comprises:
acquiring the times of executing the specified operation on the first information by each second user; the first information is any one of the candidate information;
and acquiring the heat value of the first information relative to each second user based on the times of executing the specified operation on the first information by each second user.
4. The method of claim 2, wherein obtaining the popularity value of each candidate message relative to the first user based on the popularity value of each candidate message relative to each second user comprises:
and acquiring the heat value of each candidate information relative to the first user under the influence of each second user based on the heat value of each candidate information relative to each second user and the social distance corresponding to each second user.
5. The method according to claim 4, wherein the obtaining of the popularity value of each candidate information with respect to the first user under the influence of each second user based on the popularity value of each candidate information with respect to each second user and the corresponding social distance of each second user comprises:
acquiring a heat value of second information relative to a first user under the influence of the first target user based on the heat value of the second information relative to the first target user and a social distance corresponding to the first target user; the second information is any one of the candidate information; the first target user is any one of the second users;
the second information is inversely related to the social distance corresponding to the first target user relative to the hot value of the first user under the influence of the first target user.
6. The method of claim 4, wherein selecting at least one of the target information from each of the candidate information based on the grouping result and a heat value of each of the candidate information relative to the first user comprises:
acquiring a heat value of each candidate information in each user group of at least two user groups based on the heat value of each candidate information relative to the first user under the influence of each second user;
selecting at least one of the target information from the respective candidate information based on a heat value of the respective candidate information within a respective one of at least two of the user groups.
7. The method of claim 6, wherein obtaining the heat value of each candidate information in each of at least two user groups based on the heat value of each candidate information in relation to the heat value of the first user under the influence of each second user respectively comprises:
acquiring a heat value of third information relative to the first user under the influence of a second target user; the third information is any one of the candidate information; the second target user is each of the users who have performed the specified operation on the third information among the second users belonging to the first group;
and combining the third information relative to the heat value of the first user under the influence of the second target user based on the number of the users of the first group to obtain the heat value of the third information in the first group.
8. The method of claim 6, wherein said selecting at least one of said target information from each of said candidate information based on a heat value of said each candidate information within each of at least two of said user groups comprises:
fusing the heat value of each candidate information in each user group of at least two user groups to obtain the total heat value of each candidate information relative to the first user;
and selecting at least one target information from each candidate information according to the total heat value of each candidate information relative to the first user.
9. The method of claim 8, wherein pushing the target information to the first user comprises:
and pushing the target information to the first user according to the sequence that the total heat value of at least one target information relative to the first user is from large to small.
10. The method of claim 6, wherein said selecting at least one of said target information from each of said candidate information based on a heat value of said each candidate information within each of at least two of said user groups comprises:
ranking each of the candidate information within each of at least two of the user groups based on a heating value of the each of the candidate information within the each user group;
based on a sorting result of sorting each candidate information in each user group, at least one piece of information is respectively screened out from each candidate information corresponding to each user group;
and respectively screening out at least one piece of information corresponding to each user group to obtain at least one piece of target information.
11. The method of claim 1, wherein each of the second users is a user in the social network who has a distance from the first user that is less than a distance threshold.
12. The method of claim 1, further comprising:
and acquiring the social distance corresponding to the second user based on the minimum hop count of the second user reaching the first user in the social network.
13. An information pushing apparatus, characterized in that the apparatus comprises:
the system comprises a social network acquisition module, a first storage module and a second storage module, wherein the social network acquisition module is used for acquiring a user social network of a first user, and the user social network comprises at least one second user having a social relationship with the first user;
the user grouping module is used for grouping the second users based on the social distance corresponding to the second users to obtain a grouping result, and the grouping result is used for indicating at least two user groups; the social distance is a distance of the corresponding second user from the first user in the user social network;
a target information selection module configured to select at least one target information from each candidate information based on the grouping result, where the candidate information includes information that any user of the second users performed a specified operation;
and the information pushing module is used for pushing the target information to the first user.
14. A computer device comprising a processor and a memory, wherein the memory stores at least one instruction, at least one program, a set of codes, or a set of instructions, and the at least one instruction, the at least one program, the set of codes, or the set of instructions is loaded and executed by the processor to implement the information pushing method according to any one of claims 1 to 12.
15. A computer-readable storage medium, wherein at least one instruction, at least one program, a set of codes, or a set of instructions is stored in the storage medium, and the at least one instruction, the at least one program, the set of codes, or the set of instructions is loaded and executed by a processor to implement the information pushing method according to any one of claims 1 to 12.
CN202010622105.6A 2020-07-01 2020-07-01 Information pushing method and device, computer equipment and storage medium Withdrawn CN113961791A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202111658761.2A CN114297502A (en) 2020-07-01 2020-07-01 Information pushing method and device, computer equipment, storage medium and program product
CN202010622105.6A CN113961791A (en) 2020-07-01 2020-07-01 Information pushing method and device, computer equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010622105.6A CN113961791A (en) 2020-07-01 2020-07-01 Information pushing method and device, computer equipment and storage medium

Related Child Applications (1)

Application Number Title Priority Date Filing Date
CN202111658761.2A Division CN114297502A (en) 2020-07-01 2020-07-01 Information pushing method and device, computer equipment, storage medium and program product

Publications (1)

Publication Number Publication Date
CN113961791A true CN113961791A (en) 2022-01-21

Family

ID=79459216

Family Applications (2)

Application Number Title Priority Date Filing Date
CN202010622105.6A Withdrawn CN113961791A (en) 2020-07-01 2020-07-01 Information pushing method and device, computer equipment and storage medium
CN202111658761.2A Pending CN114297502A (en) 2020-07-01 2020-07-01 Information pushing method and device, computer equipment, storage medium and program product

Family Applications After (1)

Application Number Title Priority Date Filing Date
CN202111658761.2A Pending CN114297502A (en) 2020-07-01 2020-07-01 Information pushing method and device, computer equipment, storage medium and program product

Country Status (1)

Country Link
CN (2) CN113961791A (en)

Also Published As

Publication number Publication date
CN114297502A (en) 2022-04-08

Similar Documents

Publication Publication Date Title
US20160350675A1 (en) Systems and methods to identify objectionable content
US11521386B2 (en) Systems and methods for predicting video quality based on objectives of video producer
US20160057199A1 (en) Systems and methods for transmitting a media file in multiple portions
US10200268B2 (en) Methods and systems for congestion-based content delivery
JP6373941B2 (en) Data management method and apparatus
US20180012236A1 (en) Systems and methods for analyzing interaction-bait content based on classifier models
US10932006B2 (en) Systems and methods for previewing content
US11256774B2 (en) Systems and methods for content presentation
US10630632B2 (en) Systems and methods for ranking comments
US10949434B1 (en) User identification system
US10510165B2 (en) Systems and methods for context based image compression
US20160162503A1 (en) Systems and methods for page recommendations
US20150186492A1 (en) Systems and methods for adding users to a networked computer system
US20160092929A1 (en) Scaling user audience groups to facilitate advertisement targeting
US20170097978A1 (en) Systems and methods for accessing categorized content
US10715568B2 (en) Systems and methods for optimizing simulcast streams in group video calls
US10977297B1 (en) Ephemeral item ranking in a graphical user interface
CN108810089A (en) A kind of information-pushing method, device and storage medium
US11449185B1 (en) Systems and methods for providing content
CN113961791A (en) Information pushing method and device, computer equipment and storage medium
US9536199B1 (en) Recommendations based on device usage
US10270731B2 (en) Systems and methods for providing shared content-based minutiae post recommendations
US10524011B2 (en) Systems and methods for utilizing social metrics to provide videos in video categories
US10460323B2 (en) Systems and methods for communicating information
US20170185600A1 (en) Systems and methods for providing location-based minutiae post recommendations

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
WW01 Invention patent application withdrawn after publication

Application publication date: 20220121

WW01 Invention patent application withdrawn after publication