CN111191134A - Intelligent pushing method and terminal - Google Patents
Intelligent pushing method and terminal Download PDFInfo
- Publication number
- CN111191134A CN111191134A CN201911413335.5A CN201911413335A CN111191134A CN 111191134 A CN111191134 A CN 111191134A CN 201911413335 A CN201911413335 A CN 201911413335A CN 111191134 A CN111191134 A CN 111191134A
- Authority
- CN
- China
- Prior art keywords
- time period
- user
- push
- pushing
- preset
- 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.)
- Granted
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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses an intelligent pushing method and a terminal, which are used for acquiring an application use time period and a historical message click time point of each user in a user list of a first application so as to obtain the optimal pushing time period of each user; acquiring a resource occupation condition of a first push server capable of pushing a first application, and combining the resource occupation condition and an optimal push time period to acquire an optimal push time period of each user; carrying out message pushing on each user within the optimal pushing time period of each user; the invention pushes the message in the application use time period or the historical message click time point under the condition that the resource occupation condition of the push server is ideal, and the application use time period is the time period when the user uses the application, and the historical message click time point is the time point when the user clicks the push message and checks the push message, so that the probability of checking the push message by the user can be improved, the disturbance to the user is low, and the push effect is improved.
Description
Technical Field
The invention relates to the technical field of data pushing, in particular to an intelligent pushing method and a terminal.
Background
Today of mobile internet explosion development, most mobile phone APP all provide the message push function, like news APP's hot news recommendation, IM instrument chat message remind, the E-commerce product promotion information of online shopping APP and enterprise APP's notice and approval process etc.. Therefore, the message pushing plays an important role in the aspects of improving the activity of products, the utilization rate of functional modules, the viscosity of users, the retention rate of users and the like.
In many mobile phone applications requiring push, besides the importance of the content to be pushed, an important condition is the push time point. In addition to meeting the normal service requirement of the push system, at what push time point, the push is pushed to the client, and whether the user will be disturbed to cause the user's repugnance and whether the user will open the application to view the push message or not needs to be considered. In the traditional message pushing, in order to meet the normal business requirements of a pushing system, a general-purpose or fixed-purpose mode is generally used, only a uniform sending time period can be selected, for example, eight morning spots and eight night spots are used, so that troubles are easily caused to a user, the user can not be pushed to open an application to check the pushing message, and the user's reaction is caused to influence the pushing effect.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the intelligent pushing method and the intelligent pushing terminal are provided, so that personalized message pushing is realized, the probability of viewing the pushed message by a user is improved, and the user is less disturbed.
In order to solve the technical problems, the invention adopts the technical scheme that:
an intelligent pushing method comprises the following steps:
s1, acquiring the application use time period and the historical message click time point of each user in the user list of the first application to obtain the optimal push time period of each user;
s2, acquiring a resource occupation situation of a first push server capable of pushing the first application, and combining the resource occupation situation and the optimal push time period to obtain an optimal push time period of each user;
and S3, pushing the message within the optimal pushing time period of each user.
In order to solve the technical problem, the invention adopts another technical scheme as follows:
an intelligent push terminal comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
s1, acquiring the application use time period and the historical message click time point of each user in the user list of the first application to obtain the optimal push time period of each user;
s2, acquiring a resource occupation situation of a first push server capable of pushing the first application, and combining the resource occupation situation and the optimal push time period to obtain an optimal push time period of each user;
and S3, pushing the message within the optimal pushing time period of each user.
The invention has the beneficial effects that: an intelligent pushing method and a terminal thereof push messages in an application use time period or a historical message click time point under the condition that the resource occupation condition of a pushing server is ideal, and because the application use time period is the time period when a user uses the application and the historical message click time point is the time point when the user can click and check the pushed messages, the probability of checking the pushed messages by the user can be improved, the disturbance to the user is low, and the pushing effect is improved.
Drawings
Fig. 1 is a schematic flow chart of an intelligent pushing method according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an intelligent push terminal according to an embodiment of the present invention.
Description of reference numerals:
1. an intelligent push terminal; 2. a processor; 3. a memory.
Detailed Description
In order to explain technical contents, achieved objects, and effects of the present invention in detail, the following description is made with reference to the accompanying drawings in combination with the embodiments.
Referring to fig. 1, an intelligent pushing method includes the steps of:
s1, acquiring the application use time period and the historical message click time point of each user in the user list of the first application to obtain the optimal push time period of each user;
s2, acquiring a resource occupation situation of a first push server capable of pushing the first application, and combining the resource occupation situation and the optimal push time period to obtain an optimal push time period of each user;
and S3, pushing the message within the optimal pushing time period of each user.
From the above description, the beneficial effects of the present invention are: under the condition that the resource occupation condition of the push server is ideal, the message is pushed in the application use time period or the historical message clicking time point, and the application use time period is the time period when the user uses the application, and the historical message clicking time point is the time point when the user clicks the push message and checks the push message, so that the probability of checking the push message by the user can be improved, the disturbance to the user is low, and the push effect is improved.
Further, the step S1 is specifically:
s11, counting the time period of the first application used by the user in preset days to obtain the application use time period of the user;
s12, counting the message arrival time of the historical message pushed by the first application to the client where the user is located and the historical message click time point clicked and checked by the user within preset days, and recording the historical message as an unviewed state if the user does not click and check the historical message;
and S13, if the application use time period exists in the user list, taking the application use time period as an optimal push time period, and if the application use time period does not exist in the user list, setting the time period of the historical message click time point as the optimal push time period.
As can be seen from the above description, at the time when the user uses the first application, if there is a push message related to the first application, the user's mental conflict is the least and most likely to view the pushed message; and if the application use time period does not exist, the fact that the user does not use the first application in the latest period is indicated, at the moment, the user clicks the push message in the time period every day, the user clicks and views the push message, and the fact that the user is willing to accept the push message at the time point is indicated, therefore, under the condition that the application use time period does not exist, the historical message clicking time point is selected as the optimal push time period, the probability that the user views the push message can be improved, the user is less disturbed, and the push effect is improved.
Further, the step S2 is specifically:
s21, obtaining a time period A with the highest distribution proportion according to the distribution condition of the optimal pushing time periods of all users in a preset time period, so as to obtain a group A user with the optimal pushing time period including the time period A and other users of the user list except the group A user, and taking the time period A as the preset pushing time period of the group A user;
s22, obtaining resource occupation statuses of all first push servers in a first push service system in the preset push time period of the previous day, obtaining historical resource occupation statuses, obtaining resource occupation statuses of all first push servers capable of pushing the first application in the previous N minutes of the preset push time period of the current day, obtaining current resource occupation statuses, where the first push service system includes all first push servers capable of pushing the first application, and the first push servers include a first preset push server preset for pushing the first application in the current day;
s23, determining whether the historical resource occupation status and the current resource occupation status of the first preset push server are both greater than an ideal resource threshold, if so, taking the time period a as an optimal push time period for the group a user, if not, selecting a first push server from the first push service system, where the historical resource occupation status and the current resource occupation status are both greater than the ideal resource threshold, as a push server for pushing the push message of the first application to the group a user on the same day, and taking the time period a as the optimal push time period for the group a user;
s24, acquiring other time periods which have the lowest resource occupation and do not belong to preset non-push time periods in the historical resource occupation condition of the first preset push server, and taking the other time periods as the optimal push time periods of other users.
As can be seen from the above description, message pushing is usually a batch of pushing, so that the resource utilization rate of the server is high, and therefore, the time period a with the highest distribution ratio and the corresponding group a users are selected, and under the condition that both the historical resource occupation condition and the current resource occupation condition are ideal, the pushing server pushes the pushing message of the first application to the group a users in the time period a, and other users push the pushing message normally, so that the load pressure of the whole pushing service system is also reduced on the basis of improving the pushing effect.
Further, the step S21 is specifically:
s211, obtaining a time period A with the highest distribution proportion according to the distribution condition of the optimal pushing time periods of all users in a preset time period, so as to obtain a group A user with the optimal pushing time period including the time period A and other users of the user list except the group A user, and taking the time period A as the preset pushing time period of the group A user;
s212, determining whether the ratio of the user currently set with the preset push time period to all users reaches a preset user ratio threshold, if so, executing step S22, otherwise, according to the distribution condition of the optimal push time period of all other users in the preset time period, obtaining a time period B with the highest distribution ratio and greater than a preset lowest ratio threshold, so as to obtain a group B user with the optimal push time period including the time period B, where the other users are users in the user list except the group a user and the group B user, and using the time period B as the preset push time period of the group B user;
s213, repeatedly executing the step S212 until the user currently provided with the preset pushing time period exceeds the preset user proportion threshold;
and sequentially acquiring the optimal push time period of each group user according to the step S22 and the step S23.
It can be known from the above description that if the user usage of the first application is relatively dispersed, and the proportion of the group of users with the highest distribution proportion to the total number of people is not high, the users continue to be screened among other users, a preset minimum proportion threshold is set to ensure the resource utilization efficiency, and finally, the group B users, the group C users and the like which are in accordance with the preset proportion threshold are obtained, so that different group users are pushed according to the corresponding preset push time periods, so that more users receive push messages in the appropriate time periods, and the push effect is further improved.
Further, the step S23 further includes:
if the historical resource occupation conditions and the current resource occupation conditions of all first pushing servers of the first pushing service system are not ideal, deducing the resource occupation conditions of the preset pushing time period on the same day according to the historical resource occupation conditions and the current resource occupation conditions, and taking the first pushing server with the optimal resource occupation conditions of the preset pushing time period on the same day as the pushing server of the group A users on the same day to push the pushing message of the first application;
and sequentially removing the users with the optimal push time period including the corresponding time period from the group A users according to the generation sequence of each group user except other users to the corresponding group user until the push server which is used for pushing the push message of the first application to the group A user on the current day can finish the message push to the group A user in the preset push time period.
From the above description, in the case that the resource occupation situation in the time period is not ideal, part of users are removed to ensure that the users can be pushed normally; meanwhile, compared with the existing random rejection or sequential rejection, the users meeting other groups are rejected to other groups, so that the rejected users can also receive the push message in a proper time period, and therefore, the push efficiency cannot be influenced on the whole, and the reasonable utilization of resources of the whole push service system is ensured under the condition that the push efficiency is not influenced.
Referring to fig. 2, an intelligent push terminal includes a memory, a processor, and a computer program stored in the memory and capable of running on the processor, where the processor executes the computer program to implement the following steps:
s1, acquiring the application use time period and the historical message click time point of each user in the user list of the first application to obtain the optimal push time period of each user;
s2, acquiring a resource occupation situation of a first push server capable of pushing the first application, and combining the resource occupation situation and the optimal push time period to obtain an optimal push time period of each user;
and S3, pushing the message within the optimal pushing time period of each user.
From the above description, the beneficial effects of the present invention are: under the condition that the resource occupation condition of the push server is ideal, the message is pushed in the application use time period or the historical message clicking time point, and the application use time period is the time period when the user uses the application, and the historical message clicking time point is the time point when the user clicks the push message and checks the push message, so that the probability of checking the push message by the user can be improved, the disturbance to the user is low, and the push effect is improved.
Further, when the processor executes the step S1 of the computer program, the following steps are specifically implemented:
s11, counting the time period of the first application used by the user in preset days to obtain the application use time period of the user;
s12, counting the message arrival time of the historical message pushed by the first application to the client where the user is located and the historical message click time point clicked and checked by the user within preset days, and recording the historical message as an unviewed state if the user does not click and check the historical message;
and S13, if the application use time period exists in the user list, taking the application use time period as an optimal push time period, and if the application use time period does not exist in the user list, setting the time period of the historical message click time point as the optimal push time period.
As can be seen from the above description, at the time when the user uses the first application, if there is a push message related to the first application, the user's mental conflict is the least and most likely to view the pushed message; and if the application use time period does not exist, the fact that the user does not use the first application in the latest period is indicated, at the moment, the user clicks the push message in the time period every day, the user clicks and views the push message, and the fact that the user is willing to accept the push message at the time point is indicated, therefore, under the condition that the application use time period does not exist, the historical message clicking time point is selected as the optimal push time period, the probability that the user views the push message can be improved, the user is less disturbed, and the push effect is improved.
Further, when the processor executes the step S2 of the computer program, the following steps are specifically implemented:
s21, obtaining a time period A with the highest distribution proportion according to the distribution condition of the optimal pushing time periods of all users in a preset time period, so as to obtain a group A user with the optimal pushing time period including the time period A and other users of the user list except the group A user, and taking the time period A as the preset pushing time period of the group A user;
s22, obtaining resource occupation statuses of all first push servers in a first push service system in the preset push time period of the previous day, obtaining historical resource occupation statuses, obtaining resource occupation statuses of all first push servers capable of pushing the first application in the previous N minutes of the preset push time period of the current day, obtaining current resource occupation statuses, where the first push service system includes all first push servers capable of pushing the first application, and the first push servers include a first preset push server preset for pushing the first application in the current day;
s23, determining whether the historical resource occupation status and the current resource occupation status of the first preset push server are both greater than an ideal resource threshold, if so, taking the time period a as an optimal push time period for the group a user, if not, selecting a first push server from the first push service system, where the historical resource occupation status and the current resource occupation status are both greater than the ideal resource threshold, as a push server for pushing the push message of the first application to the group a user on the same day, and taking the time period a as the optimal push time period for the group a user;
s24, acquiring other time periods which have the lowest resource occupation and do not belong to preset non-push time periods in the historical resource occupation condition of the first preset push server, and taking the other time periods as the optimal push time periods of other users.
As can be seen from the above description, message pushing is usually a batch of pushing, so that the resource utilization rate of the server is high, and therefore, the time period a with the highest distribution ratio and the corresponding group a users are selected, and under the condition that both the historical resource occupation condition and the current resource occupation condition are ideal, the pushing server pushes the pushing message of the first application to the group a users in the time period a, and other users push the pushing message normally, so that the load pressure of the whole pushing service system is also reduced on the basis of improving the pushing effect.
Further, when the processor executes the step S21 of the computer program, the following steps are specifically implemented:
s211, obtaining a time period A with the highest distribution proportion according to the distribution condition of the optimal pushing time periods of all users in a preset time period, so as to obtain a group A user with the optimal pushing time period including the time period A and other users of the user list except the group A user, and taking the time period A as the preset pushing time period of the group A user;
s212, determining whether the ratio of the user currently set with the preset push time period to all users reaches a preset user ratio threshold, if so, executing step S22, otherwise, according to the distribution condition of the optimal push time period of all other users in the preset time period, obtaining a time period B with the highest distribution ratio and greater than a preset lowest ratio threshold, so as to obtain a group B user with the optimal push time period including the time period B, where the other users are users in the user list except the group a user and the group B user, and using the time period B as the preset push time period of the group B user;
s213, repeatedly executing the step S212 until the user currently provided with the preset pushing time period exceeds the preset user proportion threshold;
and sequentially acquiring the optimal push time period of each group user according to the step S22 and the step S23.
It can be known from the above description that if the user usage of the first application is relatively dispersed, and the proportion of the group of users with the highest distribution proportion to the total number of people is not high, the users continue to be screened among other users, a preset minimum proportion threshold is set to ensure the resource utilization efficiency, and finally, the group B users, the group C users and the like which are in accordance with the preset proportion threshold are obtained, so that different group users are pushed according to the corresponding preset push time periods, so that more users receive push messages in the appropriate time periods, and the push effect is further improved.
Further, the processor, when executing the step S23 of the computer program, further includes implementing the following steps:
if the historical resource occupation conditions and the current resource occupation conditions of all first pushing servers of the first pushing service system are not ideal, deducing the resource occupation conditions of the preset pushing time period on the same day according to the historical resource occupation conditions and the current resource occupation conditions, and taking the first pushing server with the optimal resource occupation conditions of the preset pushing time period on the same day as the pushing server of the group A users on the same day to push the pushing message of the first application;
and sequentially removing the users with the optimal push time period including the corresponding time period from the group A users according to the generation sequence of each group user except other users to the corresponding group user until the push server which is used for pushing the push message of the first application to the group A user on the current day can finish the message push to the group A user in the preset push time period.
From the above description, in the case that the resource occupation situation in the time period is not ideal, part of users are removed to ensure that the users can be pushed normally; meanwhile, compared with the existing random rejection or sequential rejection, the users meeting other groups are rejected to other groups, so that the rejected users can also receive the push message in a proper time period, and therefore, the push efficiency cannot be influenced on the whole, and the reasonable utilization of resources of the whole push service system is ensured under the condition that the push efficiency is not influenced.
Referring to fig. 1, a first embodiment of the present invention is:
an intelligent pushing method comprises the following steps:
s1, acquiring the application use time period and the historical message click time point of each user in the user list of the first application to obtain the optimal push time period of each user;
in this embodiment, step S1 is specifically as follows:
s11, counting a time period of the first application used by the user within preset days to obtain an application use time period of the user, wherein in the embodiment, the preset days are yesterday one day, and in other embodiments, the preset days can be the first two days or even the first multiple days; wherein, the obtained application use time period may include a plurality of time periods, based on the specific use time;
s12, counting the message arrival time of the historical message pushed by the first application to the client where the user is located within the preset number of days and the historical message click time point clicked and checked by the user, and if the user does not click and check the historical message, recording the historical message as an unchecked state, namely checking the time period within which the user clicks and checks the pushed message every day;
s13, if the user in the user list has the application use time period, the application use time period is used as the optimal pushing time period, if the user in the user list does not have the application use time period, the time period of the historical message click time point is set as the optimal pushing time period, and if the application use time period and the historical message click time point of the user do not exist, the user is indicated to have low interest degree on the first application and the pushing message thereof, and the first application and the pushing message thereof are directly classified to other users;
s2, acquiring the resource occupation condition of a first push server capable of pushing the first application, and combining the resource occupation condition with the optimal push time period to obtain the optimal push time period of each user;
in this embodiment, step S2 specifically includes:
s21, obtaining a time period a with the highest distribution ratio according to the distribution of the optimal push time periods of all users in a preset time period, so as to obtain a group a user whose optimal push time period includes the time period a and other users except the group a user in the user list, and taking the time period a as the preset push time period of the group a user, in this embodiment, the preset time period is 1 hour, for example, 12-13 pm, so that the optimal push time period of the user is projected onto the time period, so as to obtain the time period a with the highest distribution ratio, so as to perform the timed push;
s22, obtaining resource occupation statuses of all first push servers in the first push service system in a preset push time period of the previous day, obtaining historical resource occupation statuses, obtaining resource occupation statuses of all first push servers capable of pushing the first application in the previous N minutes of the preset push time period of the current day, obtaining current resource occupation statuses, where the first push service system includes all first push servers capable of pushing the first application, and the first push servers include a first preset push server preset for pushing the first application in the current day, and in this embodiment, the previous N minutes is the previous thirty minutes, and the time period enables the servers to complete pushing to the group a users;
s23, judging whether the historical resource occupation condition and the current resource occupation condition of a first preset push server are both larger than an ideal resource threshold value, if so, taking the A time period as the optimal push time period of the A group user, if not, selecting a first push server from the first push service system, wherein the historical resource occupation condition and the current resource occupation condition of the first push server are both larger than the ideal resource threshold value, as the push server for pushing the push message of the first application to the A group user on the same day, and taking the A time period as the optimal push time period of the A group user, for example, the original a server is used for presetting the message for pushing the first application, the resource occupation condition of the a server is not ideal, and the resource occupation condition of the b server is ideal, and then using the b server for message push; it should be noted here that a plurality of push applications may be deployed on one server, and the same push application may also be deployed on a plurality of servers to reasonably utilize resources;
s24, obtaining other time periods with the lowest resource occupation and not belonging to the preset non-push time period in the historical resource occupation situation of the first preset push server, and using the other time periods as the optimal push time periods of other users, at this time, other applications select the time when the resource utilization of the system is the lowest, so as to reduce the load pressure of the whole push service system, and at the same time, obviously unsuitable preset non-push time periods, such as the sleep time period of the user at night, need to be excluded.
And S3, pushing the message in the optimal pushing time period of each user, so that the message is pushed in the most appropriate time period of the user.
Referring to fig. 1, the second embodiment of the present invention is:
in the foregoing embodiment, if the user usage of the first application is more dispersed, and the proportion of the group of users with the highest distribution ratio to the total number of users is not high, S21 specifically includes:
s211, obtaining a time period A with the highest distribution proportion according to the distribution condition of the optimal pushing time periods of all the users in a preset time period, so as to obtain a group A user with the optimal pushing time period including the time period A and other users except the group A user in the user list, and taking the time period A as the preset pushing time period of the group A user;
in this embodiment, the higher usage period in the first application is: 12-13 pm, 18-19 pm, 19-20 pm, 20-21 pm and 21-22 pm. Wherein the proportion of the first application at 12-13 pm is 35%, the proportion at 18-19 pm is 15%, the proportion at 19-20 pm is 20%, the proportion at 20-21 pm is 25% and the proportion at 21-22 pm is 30%, at this time, the A time period is 12-13 pm, and the proportion of the A group of users is 35%;
s212, judging whether the proportion of the users currently provided with the preset pushing time period to all the users reaches a preset user proportion threshold value, if so, executing a step S22, otherwise, obtaining a B time period with the highest distribution proportion and larger than a preset lowest proportion threshold value according to the distribution condition of the optimal pushing time period of all other users in the preset time period so as to obtain a B group user with the optimal pushing time period including the B time period, wherein at the moment, the other users are users except the A group user and the B group user in the user list, and the B time period is used as the preset pushing time period of the B group user;
in this embodiment, the preset user proportion threshold is 50%, the preset minimum proportion threshold is 10%, the proportion of the group a users is smaller than the preset user proportion threshold, then the rest 65% of other users need to be divided into groups, at this time, the proportion of 18-19 pm is 10%, the proportion of 19-20 pm is 12%, the proportion of 20-21 pm is 18% and the proportion of 21-22 pm is 20%, the time period B is 21-22 pm, the proportion of the group B users is 20%, the sum of the proportions of the group a users and the group B users currently set with the preset push time period is 55%, and if the preset user proportion threshold is exceeded, the whole push group is divided into three groups: group A users, group B users and other users;
s213, repeatedly executing the step S212 until the user with the preset pushing time period exceeds a preset user proportion threshold value;
in other equivalent embodiments, if the sum of the proportions of the group a users and the group B users is still lower than the preset user proportion threshold, the group a users and the group B users are continuously divided into group C users, group D users, and the like.
And sequentially acquiring the optimal push time period of each group user according to the step S22 and the step S23, namely, carrying out message push by considering the resource condition as well.
In this embodiment, step S23 further includes:
if the historical resource occupation conditions and the current resource occupation conditions of all the first pushing servers of the first pushing service system are not ideal, deducing the resource occupation condition of the current preset pushing time period according to the historical resource occupation condition and the current resource occupation condition, and taking the first pushing server with the most ideal resource occupation condition of the current preset pushing time period as a pushing server for pushing the pushing message of the first application to the group A users on the current day;
and sequentially removing users with the optimal push time period including the corresponding time period from the group A users according to the generation sequence of each group user except other users to the corresponding group user until the push server which is used for pushing the push message of the first application to the group A user on the current day can finish the message push of the group A user in the preset push time period.
In this embodiment, the whole push population is divided into three groups: the group A users, the group B users and other users, for example, the push server in the period A can only push 25% at most, and then 10% of the users need to be removed, wherein the proportion of the group A users is 35%, the original proportion of the group B users is 30%, the proportion of the group B users except the group A users is 20%, and the application use time period of 10% of the group A users includes 21-22 pm, so that the users in the application use time period including 12-13 pm and 21-22 pm 10% are removed from the group B, so that the rest group A users can push normally, and the removed group pushes messages in the appropriate time period, and therefore, the better push experience can be achieved.
Of course, if the resource occupation of all the push servers in a certain time period is not ideal, the push in the time period is abandoned, and the crowd is subdivided and the message push is performed according to the elimination of the time period.
Referring to fig. 2, a third embodiment of the present invention is:
an intelligent push terminal 1 comprises a memory 3, a processor 2 and a computer program which is stored on the memory 3 and can run on the processor 2, and the steps of the first embodiment or the second embodiment are realized when the processor 2 executes the computer program.
In summary, according to the intelligent push method and the terminal provided by the present invention, under the condition that the resource occupation of the push server is ideal, the message is pushed in the application use time period or the historical message click time point, since the application use time period is the time period when the user uses the application, and the historical message click time point is the time point when the user can click and check the push message, the probability of checking the push message by the user can be improved, and the disturbance to the user is low, so as to improve the push effect; in addition, under the condition that the user use condition of the first application is dispersed, a plurality of group users are divided under the condition that the resource utilization rate is ensured, so that different group users are pushed according to corresponding preset pushing time periods, more users can receive pushing messages in proper time periods, and the pushing effect is further improved; meanwhile, whether the historical resource occupation condition and the current resource occupation condition are ideal or not is considered in the corresponding pushing time period, so that the load pressure of the whole pushing service system is reduced on the basis of improving the pushing effect; if the resource occupation condition in the time period is not ideal, users meeting other groups are rejected to the user group which can also receive the push message in the proper time period, so that the reasonable utilization of the resources of the whole push service system is ensured under the condition of not influencing the push efficiency, the probability of viewing the push message by the users can be greatly improved and the disturbance to the users is reduced to the greatest extent under the condition of ensuring the reasonable use of the resources of the push service system and reducing the load pressure of the push service system to a certain extent, and the push effect is improved to the greatest extent.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all equivalent changes made by using the contents of the present specification and the drawings, or applied directly or indirectly to the related technical fields, are included in the scope of the present invention.
Claims (10)
1. An intelligent pushing method is characterized by comprising the following steps:
s1, acquiring the application use time period and the historical message click time point of each user in the user list of the first application to obtain the optimal push time period of each user;
s2, acquiring a resource occupation situation of a first push server capable of pushing the first application, and combining the resource occupation situation and the optimal push time period to obtain an optimal push time period of each user;
and S3, pushing the message within the optimal pushing time period of each user.
2. The intelligent pushing method according to claim 1, wherein the step S1 specifically comprises:
s11, counting the time period of the first application used by the user in preset days to obtain the application use time period of the user;
s12, counting the message arrival time of the historical message pushed by the first application to the client where the user is located and the historical message click time point clicked and checked by the user within preset days, and recording the historical message as an unviewed state if the user does not click and check the historical message;
and S13, if the application use time period exists in the user list, taking the application use time period as an optimal push time period, and if the application use time period does not exist in the user list, setting the time period of the historical message click time point as the optimal push time period.
3. The intelligent pushing method according to claim 2, wherein the step S2 specifically includes:
s21, obtaining a time period A with the highest distribution proportion according to the distribution condition of the optimal pushing time periods of all users in a preset time period, so as to obtain a group A user with the optimal pushing time period including the time period A and other users of the user list except the group A user, and taking the time period A as the preset pushing time period of the group A user;
s22, obtaining resource occupation statuses of all first push servers in a first push service system in the preset push time period of the previous day, obtaining historical resource occupation statuses, obtaining resource occupation statuses of all first push servers capable of pushing the first application in the previous N minutes of the preset push time period of the current day, obtaining current resource occupation statuses, where the first push service system includes all first push servers capable of pushing the first application, and the first push servers include a first preset push server preset for pushing the first application in the current day;
s23, determining whether the historical resource occupation status and the current resource occupation status of the first preset push server are both greater than an ideal resource threshold, if so, taking the time period a as an optimal push time period for the group a user, if not, selecting a first push server from the first push service system, where the historical resource occupation status and the current resource occupation status are both greater than the ideal resource threshold, as a push server for pushing the push message of the first application to the group a user on the same day, and taking the time period a as the optimal push time period for the group a user;
s24, acquiring other time periods which have the lowest resource occupation and do not belong to preset non-push time periods in the historical resource occupation condition of the first preset push server, and taking the other time periods as the optimal push time periods of other users.
4. The intelligent pushing method according to claim 3, wherein the step S21 specifically comprises:
s211, obtaining a time period A with the highest distribution proportion according to the distribution condition of the optimal pushing time periods of all users in a preset time period, so as to obtain a group A user with the optimal pushing time period including the time period A and other users of the user list except the group A user, and taking the time period A as the preset pushing time period of the group A user;
s212, determining whether the ratio of the user currently set with the preset push time period to all users reaches a preset user ratio threshold, if so, executing step S22, otherwise, according to the distribution condition of the optimal push time period of all other users in the preset time period, obtaining a time period B with the highest distribution ratio and greater than a preset lowest ratio threshold, so as to obtain a group B user with the optimal push time period including the time period B, where the other users are users in the user list except the group a user and the group B user, and using the time period B as the preset push time period of the group B user;
s213, repeatedly executing the step S212 until the user currently provided with the preset pushing time period exceeds the preset user proportion threshold;
and sequentially acquiring the optimal push time period of each group user according to the step S22 and the step S23.
5. The intelligent pushing method according to claim 4, wherein the step S23 further includes:
if the historical resource occupation conditions and the current resource occupation conditions of all first pushing servers of the first pushing service system are not ideal, deducing the resource occupation conditions of the preset pushing time period on the same day according to the historical resource occupation conditions and the current resource occupation conditions, and taking the first pushing server with the optimal resource occupation conditions of the preset pushing time period on the same day as the pushing server of the group A users on the same day to push the pushing message of the first application;
and sequentially removing the users with the optimal push time period including the corresponding time period from the group A users according to the generation sequence of each group user except other users to the corresponding group user until the push server which is used for pushing the push message of the first application to the group A user on the current day can finish the message push to the group A user in the preset push time period.
6. An intelligent push terminal, comprising a memory, a processor and a computer program stored on the memory and operable on the processor, wherein the processor implements the following steps when executing the computer program:
s1, acquiring the application use time period and the historical message click time point of each user in the user list of the first application to obtain the optimal push time period of each user;
s2, acquiring a resource occupation situation of a first push server capable of pushing the first application, and combining the resource occupation situation and the optimal push time period to obtain an optimal push time period of each user;
and S3, pushing the message within the optimal pushing time period of each user.
7. The intelligent push terminal according to claim 6, wherein the processor, when executing the step S1 of the computer program, implements the following steps:
s11, counting the time period of the first application used by the user in preset days to obtain the application use time period of the user;
s12, counting the message arrival time of the historical message pushed by the first application to the client where the user is located and the historical message click time point clicked and checked by the user within preset days, and recording the historical message as an unviewed state if the user does not click and check the historical message;
and S13, if the application use time period exists in the user list, taking the application use time period as an optimal push time period, and if the application use time period does not exist in the user list, setting the time period of the historical message click time point as the optimal push time period.
8. The intelligent push terminal according to claim 7, wherein the processor, when executing the step S2 of the computer program, implements the following steps:
s21, obtaining a time period A with the highest distribution proportion according to the distribution condition of the optimal pushing time periods of all users in a preset time period, so as to obtain a group A user with the optimal pushing time period including the time period A and other users of the user list except the group A user, and taking the time period A as the preset pushing time period of the group A user;
s22, obtaining resource occupation statuses of all first push servers in a first push service system in the preset push time period of the previous day, obtaining historical resource occupation statuses, obtaining resource occupation statuses of all first push servers capable of pushing the first application in the previous N minutes of the preset push time period of the current day, obtaining current resource occupation statuses, where the first push service system includes all first push servers capable of pushing the first application, and the first push servers include a first preset push server preset for pushing the first application in the current day;
s23, determining whether the historical resource occupation status and the current resource occupation status of the first preset push server are both greater than an ideal resource threshold, if so, taking the time period a as an optimal push time period for the group a user, if not, selecting a first push server from the first push service system, where the historical resource occupation status and the current resource occupation status are both greater than the ideal resource threshold, as a push server for pushing the push message of the first application to the group a user on the same day, and taking the time period a as the optimal push time period for the group a user;
s24, acquiring other time periods which have the lowest resource occupation and do not belong to preset non-push time periods in the historical resource occupation condition of the first preset push server, and taking the other time periods as the optimal push time periods of other users.
9. The intelligent push terminal according to claim 8, wherein the processor, when executing the step S21 of the computer program, implements the following steps:
s211, obtaining a time period A with the highest distribution proportion according to the distribution condition of the optimal pushing time periods of all users in a preset time period, so as to obtain a group A user with the optimal pushing time period including the time period A and other users of the user list except the group A user, and taking the time period A as the preset pushing time period of the group A user;
s212, determining whether the ratio of the user currently set with the preset push time period to all users reaches a preset user ratio threshold, if so, executing step S22, otherwise, according to the distribution condition of the optimal push time period of all other users in the preset time period, obtaining a time period B with the highest distribution ratio and greater than a preset lowest ratio threshold, so as to obtain a group B user with the optimal push time period including the time period B, where the other users are users in the user list except the group a user and the group B user, and using the time period B as the preset push time period of the group B user;
s213, repeatedly executing the step S212 until the user currently provided with the preset pushing time period exceeds the preset user proportion threshold;
and sequentially acquiring the optimal push time period of each group user according to the step S22 and the step S23.
10. The intelligent push terminal according to claim 8, wherein the processor, when executing the step S23 of the computer program, further comprises implementing the following steps:
if the historical resource occupation conditions and the current resource occupation conditions of all first pushing servers of the first pushing service system are not ideal, deducing the resource occupation conditions of the preset pushing time period on the same day according to the historical resource occupation conditions and the current resource occupation conditions, and taking the first pushing server with the optimal resource occupation conditions of the preset pushing time period on the same day as the pushing server of the group A users on the same day to push the pushing message of the first application;
and sequentially removing the users with the optimal push time period including the corresponding time period from the group A users according to the generation sequence of each group user except other users to the corresponding group user until the push server which is used for pushing the push message of the first application to the group A user on the current day can finish the message push to the group A user in the preset push time period.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911413335.5A CN111191134B (en) | 2019-12-31 | 2019-12-31 | Intelligent pushing method and terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911413335.5A CN111191134B (en) | 2019-12-31 | 2019-12-31 | Intelligent pushing method and terminal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111191134A true CN111191134A (en) | 2020-05-22 |
| CN111191134B CN111191134B (en) | 2023-06-16 |
Family
ID=70707944
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911413335.5A Active CN111191134B (en) | 2019-12-31 | 2019-12-31 | Intelligent pushing method and terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111191134B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114004630A (en) * | 2021-10-13 | 2022-02-01 | 福建福诺移动通信技术有限公司 | APP intelligent pushing engine and method based on prediction model |
| CN114004630B (en) * | 2021-10-13 | 2024-11-05 | 福建福诺移动通信技术有限公司 | APP intelligent pushing engine and method based on prediction model |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104462593A (en) * | 2014-12-29 | 2015-03-25 | 北京奇虎科技有限公司 | Method and device for providing user personalized resource message pushing |
| CN105260393A (en) * | 2015-09-15 | 2016-01-20 | 北京金山安全软件有限公司 | Information pushing method and device and electronic equipment |
| CN105610929A (en) * | 2015-12-24 | 2016-05-25 | 北京奇虎科技有限公司 | Personalized data pushing method and device |
| CN108197215A (en) * | 2017-12-28 | 2018-06-22 | 努比亚技术有限公司 | A kind of recommendation method, server and computer readable storage medium |
| CN108920651A (en) * | 2018-06-29 | 2018-11-30 | 百度在线网络技术（北京）有限公司 | Information-pushing method, device, server and storage medium |
| EP3579168A4 (en) * | 2017-01-31 | 2019-12-11 | Sony Corporation | Information processing device, information processing method, and program |
-
2019
- 2019-12-31 CN CN201911413335.5A patent/CN111191134B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104462593A (en) * | 2014-12-29 | 2015-03-25 | 北京奇虎科技有限公司 | Method and device for providing user personalized resource message pushing |
| CN105260393A (en) * | 2015-09-15 | 2016-01-20 | 北京金山安全软件有限公司 | Information pushing method and device and electronic equipment |
| CN105610929A (en) * | 2015-12-24 | 2016-05-25 | 北京奇虎科技有限公司 | Personalized data pushing method and device |
| EP3579168A4 (en) * | 2017-01-31 | 2019-12-11 | Sony Corporation | Information processing device, information processing method, and program |
| CN108197215A (en) * | 2017-12-28 | 2018-06-22 | 努比亚技术有限公司 | A kind of recommendation method, server and computer readable storage medium |
| CN108920651A (en) * | 2018-06-29 | 2018-11-30 | 百度在线网络技术（北京）有限公司 | Information-pushing method, device, server and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114004630A (en) * | 2021-10-13 | 2022-02-01 | 福建福诺移动通信技术有限公司 | APP intelligent pushing engine and method based on prediction model |
| CN114004630B (en) * | 2021-10-13 | 2024-11-05 | 福建福诺移动通信技术有限公司 | APP intelligent pushing engine and method based on prediction model |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111191134B (en) | 2023-06-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8108345B2 (en) | Managing rich presence collections in a single request | |
| US8234559B2 (en) | Managing rich presence collections | |
| CN108243086B (en) | Message processing method and system | |
| WO2015055067A1 (en) | Method and apparatus for pushing messages | |
| US20070100831A1 (en) | Managing rich presence collections | |
| CN104579912B (en) | Data pushing method and device | |
| US20080281935A1 (en) | Intelligent delayed broadcast method and apparatus | |
| US20050138108A1 (en) | Ability to scope awareness to your current task | |
| CN108520471B (en) | Overlapping community discovery method, device, equipment and storage medium | |
| CN113055701B (en) | Data processing method and device | |
| CN105488039A (en) | Query method and device | |
| CN113643070A (en) | Intelligent information pushing method and system based on big data | |
| CN111782692A (en) | Frequency control method and device | |
| CN116662376B (en) | Data query method, device, electronic equipment and storage medium | |
| CN111131841A (en) | Live indirect access method and device, electronic equipment and storage medium | |
| CN110738436A (en) | method and device for determining available stock | |
| CN112381514A (en) | Service data reminding method and device and server | |
| US11425084B2 (en) | Data processing for multi-objective communication engagement | |
| CN117557214A (en) | Approval aging early warning method and device for approval process information and storage medium | |
| CN111191134B (en) | Intelligent pushing method and terminal | |
| CN111124209A (en) | Interface display adjustment method and device | |
| CN116170502A (en) | Message service system, method and message service platform | |
| CN112422746A (en) | Push message processing method and device, storage medium and electronic device | |
| CN118094015A (en) | Network content recommendation method based on big data | |
| CN114625531A (en) | Service processing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |