CN111191134B - Intelligent pushing method and terminal - Google Patents
Intelligent pushing method and terminal Download PDFInfo
- Publication number
- CN111191134B CN111191134B CN201911413335.5A CN201911413335A CN111191134B CN 111191134 B CN111191134 B CN 111191134B CN 201911413335 A CN201911413335 A CN 201911413335A CN 111191134 B CN111191134 B CN 111191134B
- Authority
- CN
- China
- Prior art keywords
- time period
- pushing
- user
- preset
- users
- 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.)
- Active
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 application use time periods and historical message clicking time points of each user in a user list of a first application so as to obtain an optimal pushing time period of each user; acquiring the resource occupation condition of a first pushing server capable of pushing a first application, and combining the resource occupation condition and the optimal pushing time period to acquire the optimal pushing time period of each user; message pushing is carried out on each user in the optimal pushing time period; under the ideal condition of the resource occupation condition of the pushing server, the message is pushed in the application use time period or the historical message clicking time point, and the user clicks the pushing message and checks the pushing message because the application use time period is the time period of using the application by the user, so that the probability of checking the pushing message by the user can be improved, the disturbance to the user is lower, and the pushing 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, mobile internet is actively developed, most mobile phones APP provide a message pushing function, such as hot news recommendation of news APP, chat message reminding of IM tools, e-commerce product promotion information of online shopping APP, notification and approval process of enterprise APP, and the like. Therefore, the message pushing plays an important role in improving the product activity, improving the utilization rate of the functional module, improving the user viscosity, improving the user retention rate and the like.
In many mobile applications requiring pushing, in addition to the content that needs to be pushed being important, a significant condition is a pushing time point. In addition to meeting the normal business requirements of the push system, at what push time point is pushed to the client, the user's objection caused by the disturbance to the user and whether the user opens the application to view the push message need to be considered. In traditional message pushing, in order to meet the normal service requirement of a pushing system, a general casting or fixed casting mode is used, only a unified sending time period can be selected, such as eight in the morning and eight in the evening, so that the trouble is easily caused to a user, the user cannot be pushed to open an application to view a pushing message, and the user is caused to feel opposite instead, so that the pushing effect is influenced.
Disclosure of Invention
The technical problems to be solved by the invention are as follows: the intelligent pushing method and the terminal are provided, personalized message pushing is achieved, the probability of a user looking up the pushed message is improved, and the user is disturbed less.
In order to solve the technical problems, the invention adopts the following technical scheme:
an intelligent pushing method, comprising the steps of:
s1, acquiring application use time periods and historical message clicking time points of each user in a user list of a first application to obtain an optimal pushing time period of each user;
s2, acquiring the resource occupation condition of a first pushing server capable of pushing the first application, and combining the resource occupation condition and the optimal pushing time period to obtain the optimal pushing time period of each user;
and S3, pushing the message in the optimal pushing time period of each user.
In order to solve the technical problems, the invention adopts another technical scheme that:
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 application use time periods and historical message clicking time points of each user in a user list of a first application to obtain an optimal pushing time period of each user;
s2, acquiring the resource occupation condition of a first pushing server capable of pushing the first application, and combining the resource occupation condition and the optimal pushing time period to obtain the optimal pushing time period of each user;
and S3, pushing the message in the optimal pushing time period of each user.
The invention has the beneficial effects that: an intelligent pushing method and a terminal are provided, when the resource occupation condition of a pushing server is ideal, messages are pushed in an application use time period or a historical message clicking time point, and because the application use time period is the time period of a user using the application, the historical message clicking time point is the time point when the user can click the pushing messages and check the pushing messages, the probability of checking the pushing messages by the user can be improved, and the disturbance to the user is low, so that 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 the reference numerals:
1. an intelligent push terminal; 2. a processor; 3. a memory.
Detailed Description
In order to describe the technical contents, the achieved objects and effects of the present invention in detail, the following description will be made with reference to the embodiments in conjunction with the accompanying drawings.
Referring to fig. 1, an intelligent pushing method includes the steps of:
s1, acquiring application use time periods and historical message clicking time points of each user in a user list of a first application to obtain an optimal pushing time period of each user;
s2, acquiring the resource occupation condition of a first pushing server capable of pushing the first application, and combining the resource occupation condition and the optimal pushing time period to obtain the optimal pushing time period of each user;
and S3, pushing the message in the optimal pushing time period of each user.
From the above description, the beneficial effects of the invention are as follows: under the ideal condition of the resource occupation condition of the push server, the message is pushed in the application use time period or the historical message clicking time point, and the user can click the push message and check the historical message clicking time point because the application use time period is the time period of using the application by the user, so that the probability of checking the push message by the user can be improved, the disturbance to the user is lower, and the push effect is improved.
Further, the step S1 specifically includes:
s11, counting the time period of the first application used by the user in a preset day to obtain the application use time period of the user;
s12, counting the message arrival time of the history message pushed by the first application to the client where the user is located and the click time point of the history message clicked and checked by the user in a preset number of days, and recording the history message as an unviewed state if the user does not click and check the history message;
and S13, if the user in the user list has the application use time period, the application use time period is used as an optimal pushing time period, and if the user in the user list does not have the application use time period, the time period where the historical message clicking time point is located is set as the optimal pushing time period.
From the above description, at the time when the user uses the first application, if there is a pushed message about the first application, the user's mind has the lowest degree of conflict and is most likely to view the pushed message; and the absence of the application use time period indicates that the user does not use the first application in the last period, at this time, the user checks the push message and clicks to check the push message in the time period every day, which means that the user is willing to accept the push message at this time point.
Further, the step S2 specifically includes:
s21, obtaining an A time period with the highest distribution proportion according to the distribution condition of the optimal pushing time period of all users in a preset time period, so as to obtain an A group user of the A time period and other users except the A group user in the user list, wherein the A time period is used as the preset pushing time period of the A group user;
s22, acquiring resource occupation conditions of all first pushing servers in a first pushing service system in a preset pushing time period of the previous day to acquire historical resource occupation conditions, and acquiring resource occupation conditions of all first pushing servers capable of pushing the first application in the first N minutes of the preset pushing time period of the current day to acquire current resource occupation conditions, wherein the first pushing service system comprises all first pushing servers capable of pushing the first application, and the first pushing servers comprise first preset pushing servers preset for pushing the first application in the current day;
s23, judging whether the historical resource occupation situation and the current resource occupation situation of the first preset push server are both larger than an ideal resource threshold, if so, taking the A time period as an optimal push time period of the group A users, if not, selecting a first push server with the historical resource occupation situation and the current resource occupation situation both larger than the ideal resource threshold from the first push service system as a push server for pushing the push message of the first application to the group A users on the same day, and taking the A time period as the optimal push time period of the group A users;
S24, acquiring other time periods which are lowest in resource occupation in the historical resource occupation condition of the first preset push server and do not belong to a preset non-push time period, and taking the other time periods as optimal push time periods of other users.
From the above description, the message pushing is usually a batch of pushing, so that the resource utilization rate of the server is higher, therefore, the time period a with the highest distribution proportion and the corresponding group a user are selected, and under the condition that 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 user in the time period a, and other users push normally, so that the loading pressure of the whole pushing service system is reduced on the basis of improving the pushing effect.
Further, the step S21 specifically includes:
s211, obtaining an A time period with the highest distribution proportion according to the distribution condition of the optimal pushing time period of all users in a preset time period, so as to obtain an A group user of the A time period and other users except the A group user in the user list, wherein the A time period is used as the preset pushing time period of the A group user;
S212, judging whether the proportion of the users currently provided with the preset push time period to all users reaches a preset user proportion threshold, 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 according to the distribution condition of the optimal push time period of all other users in the preset time period, so as to obtain a B group user with the optimal push time period including the B time period, wherein 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 push time period of the B group user;
s213, repeatedly executing the step S212 until the user currently set with the preset push time period exceeds the preset user proportion threshold;
and acquiring the optimal push time period of each group of users in sequence according to the step S22 and the step S23.
From the above description, if the usage situation of the users of the first application is more dispersed, and the proportion of the group users with the highest distribution proportion to the whole population is not high, continuing to screen among other users, setting a preset minimum proportion threshold to ensure the resource utilization efficiency, and finally obtaining the group B users, the group C users and the like which are in line, so that the users of different groups can be pushed according to the corresponding preset pushing time period, so that more users receive pushing messages in the appropriate time period, and the pushing effect is further improved.
Further, the 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 preset pushing time period of the current day according to the historical resource occupation conditions and the current resource occupation conditions, and using the first pushing server with the most ideal resource occupation condition of the preset pushing time period of the current day as the pushing server for pushing the pushing message of the first application to the group A user on the current day;
and removing the users with the optimal pushing time period including the corresponding time period from the group A users according to the generation sequence of each group user except other users until a pushing server which is used for pushing the pushing information of the first application to the group A users on the same day can complete the message pushing of the group A users in the preset pushing time period.
As can be seen from the above description, in the case that the resource occupation condition 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 or sequential rejection, the method and the device reject users conforming to other groups, so that the rejected users can also receive push messages in a proper time period, and therefore, the push efficiency is not influenced on the whole, and the reasonable utilization of resources of the whole push service system is ensured under the condition of not influencing the push efficiency.
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, wherein the processor implements the following steps when executing the computer program:
s1, acquiring application use time periods and historical message clicking time points of each user in a user list of a first application to obtain an optimal pushing time period of each user;
s2, acquiring the resource occupation condition of a first pushing server capable of pushing the first application, and combining the resource occupation condition and the optimal pushing time period to obtain the optimal pushing time period of each user;
and S3, pushing the message in the optimal pushing time period of each user.
From the above description, the beneficial effects of the invention are as follows: under the ideal condition of the resource occupation condition of the push server, the message is pushed in the application use time period or the historical message clicking time point, and the user can click the push message and check the historical message clicking time point because the application use time period is the time period of using the application by the user, so that the probability of checking the push message by the user can be improved, the disturbance to the user is lower, and the push effect is improved.
Further, the processor, when executing the step S1 of the computer program, specifically implements the following steps:
s11, counting the time period of the first application used by the user in a preset day to obtain the application use time period of the user;
s12, counting the message arrival time of the history message pushed by the first application to the client where the user is located and the click time point of the history message clicked and checked by the user in a preset number of days, and recording the history message as an unviewed state if the user does not click and check the history message;
and S13, if the user in the user list has the application use time period, the application use time period is used as an optimal pushing time period, and if the user in the user list does not have the application use time period, the time period where the historical message clicking time point is located is set as the optimal pushing time period.
From the above description, at the time when the user uses the first application, if there is a pushed message about the first application, the user's mind has the lowest degree of conflict and is most likely to view the pushed message; and the absence of the application use time period indicates that the user does not use the first application in the last period, at this time, the user checks the push message and clicks to check the push message in the time period every day, which means that the user is willing to accept the push message at this time point.
Further, the processor, when executing the step S2 of the computer program, specifically implements the following steps:
s21, obtaining an A time period with the highest distribution proportion according to the distribution condition of the optimal pushing time period of all users in a preset time period, so as to obtain an A group user of the A time period and other users except the A group user in the user list, wherein the A time period is used as the preset pushing time period of the A group user;
s22, acquiring resource occupation conditions of all first pushing servers in a first pushing service system in a preset pushing time period of the previous day to acquire historical resource occupation conditions, and acquiring resource occupation conditions of all first pushing servers capable of pushing the first application in the first N minutes of the preset pushing time period of the current day to acquire current resource occupation conditions, wherein the first pushing service system comprises all first pushing servers capable of pushing the first application, and the first pushing servers comprise first preset pushing servers preset for pushing the first application in the current day;
s23, judging whether the historical resource occupation situation and the current resource occupation situation of the first preset push server are both larger than an ideal resource threshold, if so, taking the A time period as an optimal push time period of the group A users, if not, selecting a first push server with the historical resource occupation situation and the current resource occupation situation both larger than the ideal resource threshold from the first push service system as a push server for pushing the push message of the first application to the group A users on the same day, and taking the A time period as the optimal push time period of the group A users;
S24, acquiring other time periods which are lowest in resource occupation in the historical resource occupation condition of the first preset push server and do not belong to a preset non-push time period, and taking the other time periods as optimal push time periods of other users.
From the above description, the message pushing is usually a batch of pushing, so that the resource utilization rate of the server is higher, therefore, the time period a with the highest distribution proportion and the corresponding group a user are selected, and under the condition that 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 user in the time period a, and other users push normally, so that the loading pressure of the whole pushing service system is reduced on the basis of improving the pushing effect.
Further, the processor, when executing the step S21 of the computer program, specifically implements the following steps:
s211, obtaining an A time period with the highest distribution proportion according to the distribution condition of the optimal pushing time period of all users in a preset time period, so as to obtain an A group user of the A time period and other users except the A group user in the user list, wherein the A time period is used as the preset pushing time period of the A group user;
S212, judging whether the proportion of the users currently provided with the preset push time period to all users reaches a preset user proportion threshold, 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 according to the distribution condition of the optimal push time period of all other users in the preset time period, so as to obtain a B group user with the optimal push time period including the B time period, wherein 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 push time period of the B group user;
s213, repeatedly executing the step S212 until the user currently set with the preset push time period exceeds the preset user proportion threshold;
and acquiring the optimal push time period of each group of users in sequence according to the step S22 and the step S23.
From the above description, if the usage situation of the users of the first application is more dispersed, and the proportion of the group users with the highest distribution proportion to the whole population is not high, continuing to screen among other users, setting a preset minimum proportion threshold to ensure the resource utilization efficiency, and finally obtaining the group B users, the group C users and the like which are in line, so that the users of different groups can be pushed according to the corresponding preset pushing time period, so that more users receive pushing messages in the appropriate time period, and the pushing effect is further improved.
Further, the processor executing the step S23 of the computer program further comprises the steps of:
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 preset pushing time period of the current day according to the historical resource occupation conditions and the current resource occupation conditions, and using the first pushing server with the most ideal resource occupation condition of the preset pushing time period of the current day as the pushing server for pushing the pushing message of the first application to the group A user on the current day;
and removing the users with the optimal pushing time period including the corresponding time period from the group A users according to the generation sequence of each group user except other users until a pushing server which is used for pushing the pushing information of the first application to the group A users on the same day can complete the message pushing of the group A users in the preset pushing time period.
As can be seen from the above description, in the case that the resource occupation condition 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 or sequential rejection, the method and the device reject users conforming to other groups, so that the rejected users can also receive push messages in a proper time period, and therefore, the push efficiency is not influenced on the whole, and the reasonable utilization of resources of the whole push service system is ensured under the condition of not influencing the push efficiency.
Referring to fig. 1, a first embodiment of the present invention is as follows:
an intelligent pushing method, comprising the steps of:
s1, acquiring application use time periods and historical message clicking time points of each user in a user list of a first application to obtain an optimal pushing time period of each user;
in this embodiment, step S1 is specifically as follows:
s11, counting the application use time period of the user in a preset day to obtain the application use time period of the user, wherein the preset day is yesterday, and in other embodiments, the preset day can be the first two days or even the first multiple days; the obtained application use time period may include a plurality of time periods, which is based on the specific use time period;
s12, counting the message arrival time of the history message pushed by the first application in the preset days to reach the client side where the user is located and the click time point of the history message clicked and checked by the user, if the user does not click to check the history message, recording the history message as an unviewed state, namely checking that the user clicks to check the push message in a time interval 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 where the historical message clicking time point is located is set as the optimal pushing time period, and if the user has neither the application use time period nor the historical message clicking time point, the first application and the pushing message are indicated to have low interest degree by the user, and the first application and the pushing message are directly attributed to other users;
S2, acquiring the resource occupation condition of a first pushing server capable of pushing the first application, and combining the resource occupation condition and the optimal pushing time period to obtain the optimal pushing time period of each user;
in this embodiment, step S2 specifically includes:
s21, according to the distribution condition of the optimal pushing time period of all users in a preset time period, obtaining an A time period with the highest distribution proportion, so as to obtain an A group user with the optimal pushing time period including the A time period and other users except the A group user in a user list, wherein the A time period is used as the preset pushing time period of the A group user, in the embodiment, the preset time period is 1 hour, for example, 12-13 noon, so that the optimal pushing time period of the users is projected onto the time period, and the A time period with the highest distribution proportion is obtained for timing pushing;
s22, acquiring resource occupation conditions of all first pushing servers in a first pushing service system in a preset pushing time period of the day, acquiring historical resource occupation conditions, acquiring resource occupation conditions of all first pushing servers capable of pushing first applications in the first N minutes of the preset pushing time period of the day, and acquiring current resource occupation conditions, wherein the first pushing service system comprises all first pushing servers capable of pushing the first applications, the first pushing servers comprise first preset pushing servers preset for pushing the first applications in the day, in the embodiment, the first N minutes are thirty minutes before, and the time period can enable the servers to complete pushing of group A users;
S23, judging whether the historical resource occupation condition and the current resource occupation condition of a first preset pushing server are both larger than an ideal resource threshold, if so, taking the A time period as the optimal pushing time period of the A group user, if not, selecting a first pushing server with the historical resource occupation condition and the current resource occupation condition both larger than the ideal resource threshold from a first pushing service system as a pushing server for pushing the pushing information of the first application to the A group user on the same day, and taking the A time period as the optimal pushing time period of the A group user, wherein the a server is originally used for presetting the information 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 more ideal, and then using the b server for pushing the information; it should be noted that, a plurality of push applications can be deployed on one server, and there is a case that the same push application is deployed on a plurality of servers so as to reasonably utilize resources;
s24, acquiring other time periods which are lowest in 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 optimal push time periods of other users, wherein at the moment, other applications select the time when the resource utilization of the system is lowest so as to reduce the load pressure of the whole push service system, and meanwhile, the preset non-push time periods which are obviously unsuitable, such as the sleeping time periods of the users at night, are required to be eliminated.
And S3, pushing the message in the optimal pushing time period of each user, so that the message is pushed in the optimal time period of the user.
Referring to fig. 1, a second embodiment of the present invention is as follows:
based on the first embodiment, if the user usage of the first application is relatively scattered, and the proportion of the group of users with the highest distribution proportion to the total number of people is not high, S21 specifically is:
s211, obtaining an A time period with the highest distribution proportion according to the distribution condition of the optimal pushing time period of all users in a preset time period, so as to obtain an A group user with the optimal pushing time period including the A time period and other users except the A group user in a user list, and taking the A time period as the preset pushing time period of the A group user;
in this embodiment, the usage period of time in the first application is higher as follows: at 12-13 noon, 18-19 pm, 19-20 pm, 20-21 pm, 21-22 pm. Wherein the first application is 35% at 12-13 noon, 15% at 18-19 pm, 20% at 19-20 pm, 25% at 20-21 pm and 30% at 21-22 pm, and the time period A is 12-13 noon and the group A user is 35%;
S212, judging whether the proportion of the users currently provided with the preset pushing time period to all users reaches a preset user proportion threshold, if so, executing a step S22, otherwise, obtaining a B time period with the highest distribution proportion and larger than a preset minimum proportion threshold 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 the other users are users except the A group user and the B group user in a user list, and the B time period is taken 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 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 at night is 10%, the proportion of 19-20 at night is 12%, the proportion of 20-21 at night is 18% and the proportion of 21-22 at night is 20%, the period B is 21-22 at night, the proportion of group B users is 20%, the sum of the proportion of group a users and group B users currently provided with the preset push period is 55%, and when the proportion exceeds the preset user proportion threshold, 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 currently set with the preset push time period exceeds a preset user proportion threshold;
in other equivalent embodiments, if the sum of the ratios of the group a users and the group B users is still lower than the preset user ratio threshold, the group a users and the group D users are further classified into the group C users and the group D users.
And (4) sequentially acquiring the optimal pushing time period of each group of users according to the step S22 and the step S23, namely carrying out message pushing by taking the resource condition into consideration.
In this embodiment, step S23 further includes:
if the historical resource occupation condition and the current resource occupation condition of all the first pushing servers of the first pushing service system are not ideal, deducing the resource occupation condition of a preset pushing time period of the day according to the historical resource occupation condition and the current resource occupation condition, and pushing the pushing information of the first application to the pushing server of the group A user by using the first pushing server with the most ideal resource occupation condition of the preset pushing time period of the day as the pushing server of the day;
and removing users with the optimal pushing time period including the corresponding time period from the group A users according to the generation sequence of each group user except other users until the pushing server which is used for pushing the pushing information of the first application to the group A users on the same day can complete the message pushing to the group A users in the preset pushing time period.
In this embodiment, the whole pushing crowd is divided into three groups: the pushing server of the group A users, the group B users and other users, such as the group A time period, can push 25% at most, 10% of 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 using time period of 10% of the group A users comprises 21-22 points at night, so that the application using time period comprises 12-13 noon and 10% of the users at 21-22 points at night are removed from the group B, so that the rest group A users can push messages normally, and the removed group A users can push messages in a proper time period, thereby having better pushing experience.
Of course, if the resource occupation condition of all the pushing servers in a certain time period is very undesirable, the pushing in the time period is abandoned, and the crowd is reclassified and the message pushing is performed according to the time period of rejection.
Referring to fig. 2, a third embodiment of the present invention is as follows:
an intelligent push terminal 1 comprises a memory 3, a processor 2 and a computer program stored in the memory 3 and capable of running on the processor 2, wherein the processor 2 implements the steps of the first or second embodiments when executing the computer program.
In summary, according to the intelligent pushing method and the terminal provided by the invention, under the ideal condition of the resource occupation condition of the pushing server, the message is pushed in the application use time period or the historical message clicking time point, and because the application use time period is the time period of the user using the application, the historical message clicking time point is the time point when the user clicks the pushing message and checks the pushing message, the probability of checking the pushing message by the user can be improved, and the disturbance to the user is lower, so that the pushing effect is improved; in addition, under the condition that the use conditions of the users of the first application are scattered, a plurality of group users are divided under the condition of ensuring the resource utilization rate, so that different group users are pushed according to corresponding preset pushing time periods, more users receive pushing messages in a proper time period, and the pushing effect is further improved; meanwhile, whether the historical resource occupation situation and the current resource occupation situation 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 conforming to other groups are removed 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 that the push efficiency is not influenced, and the probability of checking the push message by the users is greatly improved and the disturbance to the users is lower under the condition that the reasonable use of the resources of the push service system is ensured and the load pressure of the push service system is reduced to a certain extent, so that the push effect is improved to the greatest extent.
The foregoing description is only illustrative of the present invention and is not intended to limit the scope of the invention, and all equivalent changes made by the specification and drawings of the present invention, or direct or indirect application in the relevant art, are included in the scope of the present invention.
Claims (6)
1. The intelligent pushing method is characterized by comprising the following steps:
s1, acquiring application use time periods and historical message clicking time points of each user in a user list of a first application to obtain an optimal pushing time period of each user;
s2, acquiring the resource occupation condition of a first pushing server capable of pushing the first application, and combining the resource occupation condition and the optimal pushing time period to obtain the optimal pushing time period of each user;
s3, pushing the message in the optimal pushing time period of each user;
the step S1 specifically comprises the following steps:
s11, counting the time period of the first application used by the user in a preset day to obtain the application use time period of the user;
s12, counting the message arrival time of the history message pushed by the first application to the client where the user is located and the click time point of the history message clicked and checked by the user in a preset number of days, and recording the history message as an unviewed state if the user does not click and check the history message;
S13, if the user in the user list has the application use time period, the application use time period is used as an optimal pushing time period, and if the user in the user list does not have the application use time period, the time period where the historical message clicking time point is located is set as the optimal pushing time period;
the step S2 specifically comprises the following steps:
s21, obtaining an A time period with the highest distribution proportion according to the distribution condition of the optimal pushing time period of all users in a preset time period, so as to obtain an A group user of the A time period and other users except the A group user in the user list, wherein the A time period is used as the preset pushing time period of the A group user;
s22, acquiring resource occupation conditions of all first pushing servers in a first pushing service system in a preset pushing time period of the previous day to acquire historical resource occupation conditions, and acquiring resource occupation conditions of all first pushing servers capable of pushing the first application in the first N minutes of the preset pushing time period of the current day to acquire current resource occupation conditions, wherein the first pushing service system comprises all first pushing servers capable of pushing the first application, and the first pushing servers comprise first preset pushing servers preset for pushing the first application in the current day;
S23, judging whether the historical resource occupation situation and the current resource occupation situation of the first preset push server are both larger than an ideal resource threshold, if so, taking the A time period as an optimal push time period of the group A users, if not, selecting a first push server with the historical resource occupation situation and the current resource occupation situation both larger than the ideal resource threshold from the first push service system as a push server for pushing the push message of the first application to the group A users on the same day, and taking the A time period as the optimal push time period of the group A users;
s24, acquiring other time periods which are lowest in resource occupation in the historical resource occupation condition of the first preset push server and do not belong to a preset non-push time period, and taking the other time periods as optimal push time periods of other users.
2. The intelligent pushing method according to claim 1, wherein the step S21 specifically includes:
s211, obtaining an A time period with the highest distribution proportion according to the distribution condition of the optimal pushing time period of all users in a preset time period, so as to obtain an A group user of the A time period and other users except the A group user in the user list, wherein the A time period is used as the preset pushing time period of the A group user;
S212, judging whether the proportion of the users currently provided with the preset push time period to all users reaches a preset user proportion threshold, 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 according to the distribution condition of the optimal push time period of all other users in the preset time period, so as to obtain a B group user with the optimal push time period including the B time period, wherein 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 push time period of the B group user;
s213, repeatedly executing the step S212 until the user currently set with the preset push time period exceeds the preset user proportion threshold;
and acquiring the optimal push time period of each group of users in sequence according to the step S22 and the step S23.
3. The intelligent pushing method according to claim 2, wherein the 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 preset pushing time period of the current day according to the historical resource occupation conditions and the current resource occupation conditions, and using the first pushing server with the most ideal resource occupation condition of the preset pushing time period of the current day as the pushing server for pushing the pushing message of the first application to the group A user on the current day;
And removing the users with the optimal pushing time period including the corresponding time period from the group A users according to the generation sequence of each group user except other users until a pushing server which is used for pushing the pushing information of the first application to the group A users on the same day can complete the message pushing of the group A users in the preset pushing time period.
4. 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 when executing the computer program performs the steps of:
s1, acquiring application use time periods and historical message clicking time points of each user in a user list of a first application to obtain an optimal pushing time period of each user;
s2, acquiring the resource occupation condition of a first pushing server capable of pushing the first application, and combining the resource occupation condition and the optimal pushing time period to obtain the optimal pushing time period of each user;
s3, pushing the message in the optimal pushing time period of each user;
the processor, when executing the step S1 of the computer program, specifically implements the following steps:
S11, counting the time period of the first application used by the user in a preset day to obtain the application use time period of the user;
s12, counting the message arrival time of the history message pushed by the first application to the client where the user is located and the click time point of the history message clicked and checked by the user in a preset number of days, and recording the history message as an unviewed state if the user does not click and check the history message;
s13, if the user in the user list has the application use time period, the application use time period is used as an optimal pushing time period, and if the user in the user list does not have the application use time period, the time period where the historical message clicking time point is located is set as the optimal pushing time period;
the processor, when executing the step S2 of the computer program, specifically implements the following steps:
s21, obtaining an A time period with the highest distribution proportion according to the distribution condition of the optimal pushing time period of all users in a preset time period, so as to obtain an A group user of the A time period and other users except the A group user in the user list, wherein the A time period is used as the preset pushing time period of the A group user;
S22, acquiring resource occupation conditions of all first pushing servers in a first pushing service system in a preset pushing time period of the previous day to acquire historical resource occupation conditions, and acquiring resource occupation conditions of all first pushing servers capable of pushing the first application in the first N minutes of the preset pushing time period of the current day to acquire current resource occupation conditions, wherein the first pushing service system comprises all first pushing servers capable of pushing the first application, and the first pushing servers comprise first preset pushing servers preset for pushing the first application in the current day;
s23, judging whether the historical resource occupation situation and the current resource occupation situation of the first preset push server are both larger than an ideal resource threshold, if so, taking the A time period as an optimal push time period of the group A users, if not, selecting a first push server with the historical resource occupation situation and the current resource occupation situation both larger than the ideal resource threshold from the first push service system as a push server for pushing the push message of the first application to the group A users on the same day, and taking the A time period as the optimal push time period of the group A users;
S24, acquiring other time periods which are lowest in resource occupation in the historical resource occupation condition of the first preset push server and do not belong to a preset non-push time period, and taking the other time periods as optimal push time periods of other users.
5. The intelligent push terminal according to claim 4, wherein the processor performs the following steps when executing the step S21 of the computer program:
s211, obtaining an A time period with the highest distribution proportion according to the distribution condition of the optimal pushing time period of all users in a preset time period, so as to obtain an A group user of the A time period and other users except the A group user in the user list, wherein the A time period is used as the preset pushing time period of the A group user;
s212, judging whether the proportion of the users currently provided with the preset push time period to all users reaches a preset user proportion threshold, 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 according to the distribution condition of the optimal push time period of all other users in the preset time period, so as to obtain a B group user with the optimal push time period including the B time period, wherein 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 push time period of the B group user;
S213, repeatedly executing the step S212 until the user currently set with the preset push time period exceeds the preset user proportion threshold;
and acquiring the optimal push time period of each group of users in sequence according to the step S22 and the step S23.
6. The intelligent push terminal of claim 5, wherein the processor executing the step S23 of the computer program further comprises the steps of:
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 preset pushing time period of the current day according to the historical resource occupation conditions and the current resource occupation conditions, and using the first pushing server with the most ideal resource occupation condition of the preset pushing time period of the current day as the pushing server for pushing the pushing message of the first application to the group A user on the current day;
and removing the users with the optimal pushing time period including the corresponding time period from the group A users according to the generation sequence of each group user except other users until a pushing server which is used for pushing the pushing information of the first application to the group A users on the same day can complete the message pushing of the group A users in the preset pushing 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 CN111191134A (en) | 2020-05-22 |
| CN111191134B true 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) |
Families Citing this family (1)
| 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 |
Citations (1)
| 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 |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| JP6947191B2 (en) * | 2017-01-31 | 2021-10-13 | ソニーグループ株式会社 | Information processing equipment, information processing methods, and programs |
| 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 |
-
2019
- 2019-12-31 CN CN201911413335.5A patent/CN111191134B/en active Active
Patent Citations (1)
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111191134A (en) | 2020-05-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108243086B (en) | Message processing method and system | |
| EP2013763B1 (en) | Managing rich presence collections | |
| US20160065517A1 (en) | Dynamic filter generation for message management systems | |
| US9367599B2 (en) | Search based specification for data synchronization | |
| US20070100831A1 (en) | Managing rich presence collections | |
| CN108390933B (en) | Message distribution method, device, server and storage medium | |
| Okoshi et al. | Real-world product deployment of adaptive push notification scheduling on smartphones | |
| CN109547807B (en) | Information processing method and device based on live broadcast and server | |
| US9900837B2 (en) | Multi-channel communications for sending push notifications to mobile devices | |
| CN105488039A (en) | Query method and device | |
| WO2015165253A1 (en) | Method and system for account recommendation | |
| CN113055701B (en) | Data processing method and device | |
| WO2014015787A1 (en) | Method, server, and client for pushing and displaying splash screen | |
| CN111782692A (en) | Frequency control method and device | |
| CN113485806A (en) | Method, device, equipment and computer readable medium for processing task | |
| CN111191134B (en) | Intelligent pushing method and terminal | |
| US20140289335A1 (en) | Method and apparatus of configuring a data broadcast service | |
| CN111475315A (en) | Server and subscription notification push control and execution method | |
| US10645053B2 (en) | Generating a new user base using attractive e-mail addresses | |
| US20080168136A1 (en) | Message Managing System, Message Managing Method and Recording Medium Storing Program for that Method Execution | |
| CN115525834A (en) | Method for screening and displaying messages, computer device and recording medium | |
| CN112818144A (en) | Media content sharing method and device, storage medium and electronic equipment | |
| CN114116863B (en) | Method and system for fusing cross-channel consumer identities in real time | |
| CN113296968A (en) | Address list updating method, device, medium and electronic equipment | |
| CN112887189B (en) | Timed sending method and device of session message, computer equipment and storage medium |
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 |