CN110875949A - Method and device for pushing information - Google Patents

Method and device for pushing information Download PDF

Info

Publication number
CN110875949A
CN110875949A CN201811025021.3A CN201811025021A CN110875949A CN 110875949 A CN110875949 A CN 110875949A CN 201811025021 A CN201811025021 A CN 201811025021A CN 110875949 A CN110875949 A CN 110875949A
Authority
CN
China
Prior art keywords
user
pushed
information
time period
sample
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.)
Pending
Application number
CN201811025021.3A
Other languages
Chinese (zh)
Inventor
李寒
张雯
龙晓云
高志宏
张彦
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
JD Digital Technology Holdings Co Ltd
Original Assignee
JD Digital Technology Holdings Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by JD Digital Technology Holdings Co Ltd filed Critical JD Digital Technology Holdings Co Ltd
Priority to CN201811025021.3A priority Critical patent/CN110875949A/en
Publication of CN110875949A publication Critical patent/CN110875949A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/55Push-based network services
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/60Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/62Establishing a time schedule for servicing the requests

Abstract

The embodiment of the application discloses a method and a device for pushing information. One embodiment of the method comprises: acquiring information of a user to be pushed; determining whether the user to be pushed is a registered user of a preset application or not based on the information of the user to be pushed; in response to the fact that the user to be pushed is the registered user of the preset application, acquiring a historical behavior record set of the user to be pushed in the preset application; counting historical behavior record counts corresponding to preset time periods in a preset time period set on the basis of the historical behavior record set; determining a pushing time period based on the historical behavior record count corresponding to the preset time period in the preset time period set, and pushing information to a user to be pushed in the pushing time period. The embodiment can push the information to the user in a proper time period, and is beneficial to improving the reading rate and the conversion rate of the information by the user.

Description

Method and device for pushing information
Technical Field
The embodiment of the application relates to the technical field of computers, in particular to a method and a device for pushing information.
Background
Information push, also called "network broadcast", is a technology for reducing information overload by pushing information required by users on the internet through a certain technical standard or protocol. The information push technology can reduce the time spent by the user in searching on the network by actively pushing information to the user.
The existing information pushing method is generally that a person skilled in the art manually determines a pushing time period according to experience, and pushes information to a user in the pushing time period.
Disclosure of Invention
The embodiment of the application provides a method and a device for pushing information.
In a first aspect, an embodiment of the present application provides a method for pushing information, including: acquiring information of a user to be pushed; determining whether the user to be pushed is a registered user of a preset application or not based on the information of the user to be pushed; in response to the fact that the user to be pushed is the registered user of the preset application, acquiring a historical behavior record set of the user to be pushed in the preset application; counting historical behavior record counts corresponding to preset time periods in a preset time period set on the basis of the historical behavior record set; determining a pushing time period based on the historical behavior record count corresponding to the preset time period in the preset time period set, and pushing information to a user to be pushed in the pushing time period.
In some embodiments, the method further comprises: in response to determining that the user to be pushed is not a registered user of the preset application, determining the characteristics of the user to be pushed based on the information of the user to be pushed; selecting a sample user matched with the characteristics of the user to be pushed from the sample user set; counting the sample pushing time period corresponding to the selected sample user to obtain a statistical result; and determining a pushing time period corresponding to the user to be pushed based on the statistical result, and pushing information to the user to be pushed in the pushing time period.
In some embodiments, the sample users in the sample user set are registered users of a preset application; and the sample pushing time period corresponding to the sample user in the sample user set is obtained through the following steps: for a sample user in the sample user set, acquiring a sample historical behavior record set of the sample user in a preset application; counting the historical behavior record counts of the samples corresponding to the preset time periods in the preset time period set based on the historical behavior record set of the samples; and determining a sample pushing time period corresponding to the sample user based on the sample historical behavior record count corresponding to the preset time period in the preset time period set.
In some embodiments, the step further comprises: and for the sample users in the sample user set, updating the sample historical behavior record set and the model algorithm corresponding to the sample users at regular time, and updating the sample pushing time period corresponding to the sample users at regular time according to the updated sample historical behavior record set and the updated model algorithm.
In some embodiments, determining whether the user to be pushed is a registered user of the preset application based on the information of the user to be pushed includes: matching information of a user to be pushed in a user identification set corresponding to a preset application; and if the information of the user to be pushed is successfully matched in the user identification set corresponding to the preset application, determining that the user to be pushed is a registered user of the preset application.
In some embodiments, determining whether the user to be pushed is a registered user of the preset application based on the information of the user to be pushed further includes: if the information of the user to be pushed is unsuccessfully matched in the user identification set corresponding to the preset application, matching the information of the user to be pushed in the user information set corresponding to the user identification set; if the information of the user to be pushed is successfully matched in the user information set, determining that the user to be pushed is a registered user of the preset application; and if the information of the user to be pushed is unsuccessfully matched in the user information set, determining that the user to be pushed is not a registered user of the preset application.
In some embodiments, pushing information to a user to be pushed within a push time period includes: and pushing information to the user to be pushed in a short message mode within the pushing time period.
In a second aspect, an embodiment of the present application provides an apparatus for pushing information, including: the device comprises a first acquisition unit, a second acquisition unit and a third acquisition unit, wherein the first acquisition unit is configured to acquire information of a user to be pushed; a first determination unit configured to determine whether the user to be pushed is a registered user of a preset application based on information of the user to be pushed; the second obtaining unit is configured to obtain a historical behavior record set of the user to be pushed in the preset application in response to determining that the user to be pushed is a registered user of the preset application; the first statistical unit is configured to count historical behavior record counts corresponding to preset time periods in a preset time period set on the basis of the historical behavior record set; the first pushing unit is configured to determine a pushing time period based on a historical behavior record count corresponding to a preset time period in a preset time period set, and push information to a user to be pushed in the pushing time period.
In some embodiments, the apparatus further comprises: a second determination unit configured to determine, in response to determining that the user to be pushed is not a registered user of the preset application, a characteristic of the user to be pushed based on information of the user to be pushed; the selecting unit is configured to select a sample user matched with the characteristics of the user to be pushed from the sample user set; the second statistical unit is configured to perform statistics on the sample pushing time period corresponding to the selected sample user to obtain a statistical result; and the second pushing unit is configured to determine a pushing time period corresponding to the user to be pushed based on the statistical result, and push information to the user to be pushed in the pushing time period.
In some embodiments, the sample users in the sample user set are registered users of a preset application; and the sample pushing time period corresponding to the sample user in the sample user set is obtained through the following steps: for a sample user in the sample user set, acquiring a sample historical behavior record set of the sample user in a preset application; counting the historical behavior record counts of the samples corresponding to the preset time periods in the preset time period set based on the historical behavior record set of the samples; and determining a sample pushing time period corresponding to the sample user based on the sample historical behavior record count corresponding to the preset time period in the preset time period set.
In some embodiments, the step further comprises: and for the sample users in the sample user set, updating the sample historical behavior record set and the model algorithm corresponding to the sample users at regular time, and updating the sample pushing time period corresponding to the sample users at regular time according to the updated sample historical behavior record set and the updated model algorithm.
In some embodiments, the first determination unit comprises: the first matching subunit is configured to match the information of the user to be pushed in a user identification set corresponding to a preset application; the first determining subunit is configured to determine that the user to be pushed is a registered user of the preset application if the information of the user to be pushed is successfully matched in the user identifier set corresponding to the preset application.
In some embodiments, the first determination unit comprises: the second matching subunit is configured to match the information of the user to be pushed in the user information set corresponding to the user identification set if the information of the user to be pushed is unsuccessfully matched in the user identification set corresponding to the preset application; the second determining subunit is configured to determine that the user to be pushed is a registered user of the preset application if the information of the user to be pushed is successfully matched in the user information set; and the third determining subunit is configured to determine that the user to be pushed is not a registered user of the preset application if the information of the user to be pushed is unsuccessfully matched in the user information set.
In some embodiments, the first pushing unit is further configured to: and pushing information to the user to be pushed in a short message mode within the pushing time period.
In a third aspect, an embodiment of the present application provides a server, where the server includes: one or more processors; a storage device having one or more programs stored thereon; when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the method as described in any implementation of the first aspect.
In a fourth aspect, the present application provides a computer-readable medium, on which a computer program is stored, which, when executed by a processor, implements the method as described in any implementation manner of the first aspect.
According to the method and the device for pushing the information, whether the user to be pushed is a registered user of a preset application is determined based on the information of the user to be pushed; if the user to be pushed is a registered user of the preset application, acquiring a historical behavior record set of the user to be pushed in the preset application; then, based on the historical behavior record set, counting the historical behavior record count corresponding to the preset time period in the preset time period set; then, determining a pushing time period based on the historical behavior record count corresponding to the preset time period in the preset time period set; and finally, pushing information to the user to be pushed within the pushing time period. In the case that the user is a registered user of the preset application, the information can be pushed to the user in a proper time period (usually, a time period with high user activity), which is beneficial to improving the reading rate and the conversion rate of the user on the information.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is an exemplary system architecture to which the present application may be applied;
FIG. 2 is a flow diagram of one embodiment of a method for pushing information, according to the present application;
FIG. 3 is a flow diagram of yet another embodiment of a method for pushing information according to the present application;
FIG. 4 is a schematic diagram of an application scenario of the method for pushing information provided by FIG. 3;
FIG. 5 is a schematic block diagram illustrating one embodiment of an apparatus for pushing information according to the present application;
FIG. 6 is a schematic block diagram of a computer system suitable for use in implementing a server according to embodiments of the present application.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 shows an exemplary system architecture 100 to which embodiments of the present method for pushing information or apparatus for pushing information may be applied.
As shown in fig. 1, a system architecture 100 may include a terminal device 101, a network 102, and a server 103. Network 102 is the medium used to provide communication links between terminal devices 101 and server 103. Network 102 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
A user may use terminal device 101 to interact with server 103 over network 102 to receive or send messages and the like. Various communication client applications, such as shopping applications, web browser applications, search applications, instant messaging tools, mailbox clients, social platform software, and the like, may be installed on the terminal device 101.
The terminal apparatus 101 may be hardware or software. When the terminal device 101 is hardware, it may be various electronic devices having a display screen and supporting information browsing, including but not limited to a smart phone, a tablet computer, a laptop portable computer, a desktop computer, and the like. When the terminal apparatus 101 is software, it can be installed in the electronic apparatuses listed above. It may be implemented as multiple pieces of software or software modules, or as a single piece of software or software module. And is not particularly limited herein.
The server 103 may be a server providing various services, such as an information push background server. The information pushing background server may analyze and other processes the acquired data such as the information of the user to be pushed, and push the information to the user to be pushed based on the processing result (e.g., the pushing time period).
The server 103 may be hardware or software. When the server 103 is hardware, it may be implemented as a distributed server cluster composed of a plurality of servers, or may be implemented as a single server. When the server 103 is software, it may be implemented as multiple pieces of software or software modules (e.g., to provide distributed services), or as a single piece of software or software module. And is not particularly limited herein.
It should be noted that the method for pushing information provided in the embodiment of the present application is generally performed by the server 103, and accordingly, the apparatus for pushing information is generally disposed in the server 103.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
With continued reference to fig. 2, a flow 200 of one embodiment of a method for pushing information in accordance with the present application is shown. The method for pushing the information comprises the following steps:
step 201, obtaining information of a user to be pushed.
In the present embodiment, an execution subject (e.g., the server 103 shown in fig. 1) of the method for pushing information may acquire information of a user to be pushed. Generally, if it is desired to push information to a certain user, the user may be regarded as a user to be pushed, and the information of the user to be pushed is submitted to the execution main body. The information of the user to be pushed may include, but is not limited to, a user identifier (e.g., a user account) assigned to the user to be pushed when the user to be pushed registers various applications, unique identification information of the user to be pushed, information describing characteristics of the user to be pushed, and the like. The unique identification information of the user to be pushed may include, but is not limited to, a mobile phone number of the user to be pushed, an identification number of the user to be pushed, and the like. The information describing the characteristics of the user to be pushed may include, but is not limited to, the gender of the user to be pushed, the age of the user to be pushed, the resident region of the user to be pushed, and the like.
Step 202, determining whether the user to be pushed is a registered user of a preset application based on the information of the user to be pushed.
In this embodiment, the execution subject may analyze information of the user to be pushed to determine whether the user to be pushed is a registered user of the preset application. The preset application may be a preset application. The preset applications may include, but are not limited to, shopping applications, web browser applications, search applications, instant messaging tools, mailbox clients, social platform software, and the like. Typically, the preset application may be a shopping-like application.
In some optional implementation manners of this embodiment, the execution main body may match information of a user to be pushed in a user identifier set corresponding to a preset application; if the matching is successful, determining that the user to be pushed is a registered user of the preset application; and if the matching is unsuccessful, further analyzing the information of the user to be pushed, or directly determining that the user to be pushed is not a registered user of the preset application. Generally, when a user registers a preset application, a user identifier assigned to the user may be an identifier defined according to a certain rule. For example, the user identifier may be an identifier of a first preset number of digits (e.g., 10 digits) composed of letters, numbers, and symbols. As another example, the user identification may be an identifier that begins with a letter and ends with a number that is greater than a second predetermined number of bits (e.g., 6 bits). In this way, the executing entity may first determine whether an identifier defined according to the rule exists in the information of the user to be pushed, and if so, the identifier is the user identifier of the user to be pushed. At this time, the execution main body may match the user identifier of the user to be pushed with the user identifiers in the user identifier set corresponding to the preset application one by one. If one user identifier is the same as the user identifier of the user to be pushed, the matching is successful, and at this time, the user to be pushed can be determined to be a registered user of the preset application. And if all the user identifications are different from the identifications of the users to be pushed, the matching is unsuccessful. Here, the user identities of a large number of registered users of the preset application may be obtained to generate a user identity set corresponding to the preset application. For example, the user identifications of all registered users of the preset application may be obtained to generate the user identification set.
In some optional implementation manners of this embodiment, if the information of the user to be pushed is unsuccessfully matched in the user identifier set corresponding to the preset application, the execution main body may further analyze the information of the user to be pushed. Specifically, the executing entity may match information of the user to be pushed in a user information set corresponding to the user identifier set; if the information of the user to be pushed is successfully matched in the user information set, determining that the user to be pushed is a registered user of the preset application; and if the information of the user to be pushed is unsuccessfully matched in the user information set, determining that the user to be pushed is not a registered user of the preset application. And the user information in the user information set corresponds to the user identification in the user identification set one by one. Generally, when a user registers a preset application, the user also provides some user information, and the user information generally includes unique identification information, such as an identification number, a mobile phone number, and the like. In this way, the execution body may first determine whether the unique identification information exists in the information of the user to be pushed. And if so, matching the unique identification information with the user information in the user information set corresponding to the user identification set one by one. If one user information contains the unique identification information, the matching is successful, and at this time, the user to be pushed can be determined to be a registered user of the preset application. If all the user information does not contain the unique identification information, the matching is unsuccessful, and at this time, it can be determined that the user to be pushed is not a registered user of the preset application. Here, the user information provided by a large number of registered users of the preset application may be acquired to generate a user information set corresponding to the user identification set. For example, user information provided by all registered users of a preset application may be acquired to generate a user information set.
Step 203, in response to determining that the user to be pushed is a registered user of the preset application, acquiring a historical behavior record set of the user to be pushed in the preset application.
In this embodiment, if the user to be pushed is a registered user of the preset application, the execution main body may obtain a historical behavior record set of the user to be pushed in the preset application. The historical behavior record of the user in the preset application can be an operation record generated when the user performs a preset behavior operation in the preset application. Taking the preset application as an example of a shopping application, the preset behavior operation may include, but is not limited to, a search operation, a browse operation, a click operation, a drop operation, a payment operation, a comment operation, and the like. Historical behavior records may include, but are not limited to, historical search records, historical browsing records, historical click records, historical ordering records, historical payment records, and historical review records. Generally, a user identification, a time for executing a preset behavior operation, a description of the preset behavior operation, and the like are recorded in the history behavior record. In this way, the execution subject may retrieve the historical behavior record of the user to be pushed in the preset application within the historical time period (for example, the first three months) based on the user identification of the user to be pushed, and generate the historical behavior record set.
And 204, counting the historical behavior record count corresponding to the preset time period in the preset time period set based on the historical behavior record set.
In this embodiment, the execution subject may analyze the historical behavior record set, and count a historical behavior record count corresponding to a preset time period in the preset time period set. Here, the preset time period set may include a time period obtained by dividing a preset time (e.g., 1 week) by a preset time period (e.g., 1 hour) as a granularity. For each preset time period in the preset time period set, if the historical behavior record in the preset time period exists in the historical behavior record set, the historical behavior record count corresponding to the preset time period may be set to a non-zero preset value (e.g., 1), or the number of the historical behavior records in the preset time period may be counted as the historical behavior record count corresponding to the preset time period. If the historical behavior record in the preset time period does not exist in the historical behavior record set, the historical behavior record count corresponding to the preset time period may be set to zero. In this way, the preset time period corresponding to the non-zero historical behavior record count is the time period in which the user to be pushed performs the preset behavior operation in the preset application, that is, the time period in which the user to be pushed is relatively active in the preset application. The preset time period corresponding to the historical behavior record count of zero is a time period in which the user to be pushed does not perform the preset behavior operation in the preset application, that is, a time period in which the user to be pushed is relatively inactive in the preset application.
Step 205, determining a pushing time period based on the historical behavior record count corresponding to the preset time period in the preset time period set, and pushing information to the user to be pushed in the pushing time period.
In this embodiment, the execution main body may analyze the historical behavior record count corresponding to each preset time period in the preset time period set, select at least a part of the preset time period corresponding to the historical behavior record count that is not zero, as a push time period, and push information to the user to be pushed within the push time period. At this time, the push information may be displayed on a terminal device (e.g., terminal device 101 shown in fig. 1) of the user to be pushed.
In order to verify the situation, the execution main body can select an observation day (for example, 8 month and 1 day of 2017), then extracts behavior record sets of the user in the first three months and the last one month of the observation day respectively, calculates 10 time periods with higher activity respectively marked as sets H and P, and adopts | H ∩ P | as a measurement index.
In some optional implementation manners of this embodiment, for a case that the historical behavior record count corresponding to the preset time period is set to a non-zero value, the execution main body may randomly select, as the time period to be pushed, at least a part of the preset time period corresponding to the historical behavior record count that is not zero. For the case that the historical behavior record count corresponding to the preset time period is set as the number of the historical behavior records, the execution main body may sort the preset time period set according to the size sequence of the historical behavior record count, and select the preset number of preset time periods as the time period to be pushed from the side with the large historical behavior record count.
Here, the information pushed to the user to be pushed may include, but is not limited to, information related to a preset application, asset promotion information, and the like. Taking the preset application as a shopping application as an example, the information related to the preset application may include, but is not limited to, article information, logistics information, customer service information, after-sales information, and the like. Here, the execution subject may push information to the user to be pushed in a form of a short message or a form of a system notification message of a preset application. In order to ensure timeliness of pushing information, information is usually pushed to a user to be pushed in a form of a short message.
In some optional implementation manners of this embodiment, the execution main body may further calculate, in advance, a push time period corresponding to each registered user of the preset application, and store the push time period. In this way, when the user to be pushed is a registered user of the preset application, the execution main body may directly retrieve the push time period corresponding to the user to be pushed from the stored push time periods corresponding to the registered users. Here, the operation of calculating the push time period corresponding to each registered user of the preset application is substantially the same as the operation of calculating the push time period corresponding to the user to be pushed in the embodiment shown in fig. 2 (see step 203 and 205 for details), and details are not repeated herein. Since the number of registered users of the preset application is very large, here, the user identifier of the registered user and the push time period corresponding to the registered user may be stored in the HBase (a distributed, column-oriented open database) in the form of key-value pairs (key-value). In this way, if the user to be pushed is a registered user of the preset application, the execution main body can also retrieve the HBase according to the user identifier of the user to be pushed so as to obtain a pushing time period corresponding to the user to be pushed, thereby improving the retrieval efficiency. It should be noted that the push time period corresponding to the user may gradually change with time transition, and therefore, the push time period corresponding to each registered user of the preset application may be recalculated at regular intervals (for example, one week), and the content stored in the HBase may be updated.
The method for pushing the information includes the steps that whether a user to be pushed is a registered user of a preset application is determined based on information of the user to be pushed; if the user to be pushed is a registered user of the preset application, acquiring a historical behavior record set of the user to be pushed in the preset application; then, based on the historical behavior record set, counting the historical behavior record count corresponding to the preset time period in the preset time period set; then, determining a pushing time period based on the historical behavior record count corresponding to the preset time period in the preset time period set; and finally, pushing information to the user to be pushed within the pushing time period. In the case that the user is a registered user of the preset application, the information can be pushed to the user in a proper time period (usually, a time period with high user activity), which is beneficial to improving the reading rate and the conversion rate of the user on the information.
With further reference to fig. 3, a flow 300 of yet another embodiment of a method for pushing information according to the present application is shown. The method for pushing the information comprises the following steps:
step 301, obtaining information of a user to be pushed.
Step 302, determining whether the user to be pushed is a registered user of a preset application based on the information of the user to be pushed.
In the present embodiment, the specific operations of step 301-.
Step 303, in response to determining that the user to be pushed is not a registered user of the preset application, determining the characteristics of the user to be pushed based on the information of the user to be pushed.
In this embodiment, if the user to be pushed is not a registered user of the preset application, an executing entity (for example, the server 103 shown in fig. 1) of the method for pushing information may analyze the information of the user to be pushed, so as to determine the characteristics of the user to be pushed. Here, the information of the user to be pushed may include some information describing features of the user to be pushed, such as a gender of the user to be pushed, an age of the user to be pushed, a region where the user to be pushed resides, and the like. At this time, the execution main body may extract information describing the feature of the user to be pushed from the information of the user to be pushed, so as to determine the feature of the user to be pushed.
And step 304, selecting the sample user matched with the characteristics of the user to be pushed from the sample user set.
In this embodiment, the execution subject may match the features of the sample users in the sample user set with the features of the users to be pushed one by one, and select the sample user matched with the features of the users to be pushed. Generally, if the characteristics of the sample user are the same as or similar to the characteristics of the user to be pushed, the characteristics of the sample user are considered to be matched with the characteristics of the user to be pushed.
In some alternative implementations of the present embodiment, the sample user set may be set empirically by one skilled in the art. Here, a person skilled in the art may gather information of a large number of users and perform statistical analysis on the characteristics of the users and the corresponding active time periods to obtain the corresponding active time periods of the users with various characteristics. At this time, the obtained users of various features may be taken as respective sample users to generate a sample user set. Meanwhile, the obtained active time period corresponding to the user with various characteristics is used as the pushing time period corresponding to each sample user.
In some optional implementations of the present embodiment, the sample users in the sample user set may be registered users of the preset application. In this way, the sample pushing time period corresponding to the sample user in the sample user set may be obtained according to the sample historical behavior record set and the model algorithm corresponding to the sample user. Here, a model algorithm is illustrated to obtain a sample push time period corresponding to a sample user:
firstly, for a sample user in a sample user set, obtaining a sample historical behavior record set of the sample user in a preset application.
Then, based on the sample historical behavior record set, counting the sample historical behavior record count corresponding to the preset time period in the preset time period set.
And finally, determining a sample pushing time period corresponding to the sample user based on the sample historical behavior record count corresponding to the preset time period in the preset time period set. It should be noted that the operation of obtaining the sample pushing time period corresponding to the sample user is substantially the same as the operation of obtaining the pushing time period corresponding to the user to be pushed in the embodiment shown in fig. 2 (see step 203 and 205 for details), and details are not repeated herein.
As the behavior habit of the user gradually changes along with the migration of time, correspondingly, the push time period (i.e. the active time period in the preset application) corresponding to the user also changes along with the change of the behavior habit of the user. In order to match the sample pushing time period corresponding to the sample user with the latest behavior habit of the user, for each sample user in the sample user set, the sample historical behavior record set and the model algorithm corresponding to the sample user can be updated regularly, and the sample pushing time period corresponding to the sample user can be updated regularly according to the updated sample historical behavior record set and the model algorithm. For example, the model algorithm may be deployed on a cloud computing platform and the automated scheduling script configured to periodically update the set of sample historical behavior records and the model algorithm once a week. Specifically, each time a preset update time point arrives, a historical behavior record set in a historical time period (e.g., three months before the current time) may be obtained to replace a previous sample historical behavior record set. And if the model algorithm is updated, replacing the previous model algorithm by the updated model algorithm. Therefore, the sample pushing time period corresponding to the sample user can be updated regularly according to the updated sample historical behavior record set and the model algorithm.
And 305, counting the sample pushing time period corresponding to the selected sample user to obtain a statistical result.
In this embodiment, the selected sample users are usually a large number of sample users having the same or similar characteristics as the users to be pushed, and the execution subject may perform statistics on the sample pushing time periods corresponding to the selected sample users to obtain the number of each sample pushing time period as a statistical result.
Step 306, determining a pushing time period corresponding to the user to be pushed based on the statistical result, and pushing information to the user to be pushed within the pushing time period.
In this embodiment, the execution subject may determine, based on the statistical result, a pushing time period corresponding to the user to be pushed, and push information to the user to be pushed in the pushing time period. At this time, the push information may be displayed on a terminal device (e.g., terminal device 101 shown in fig. 1) of the user to be pushed.
In general, the push time periods corresponding to the users with matched features are relatively similar. For example, the push time period corresponding to users in a south city is generally later than the push time period corresponding to users in a north city. And the pushing time periods corresponding to the users of the cities with similar economic development levels are similar. For example, the push time periods corresponding to users in cities such as Beijing, Shanghai, Guangzhou, Shenzhen, Wuhan, Tianjin and Chengdu are similar, and the push time periods corresponding to users in cities such as Qingdao, Jinan, Changsha, Dalian and Shijiazhuang are similar.
In some optional implementation manners of this embodiment, the execution subject may sort the sample push time periods according to the number of the sample push time periods, and select a preset number of sample push time periods from the side with the large number as the push time period corresponding to the user to be pushed.
In some optional implementation manners of this embodiment, the execution subject may further calculate, in advance, push time periods corresponding to sample users with various types of features in the sample user set, and store the features and the corresponding push time periods. In this way, if the user to be pushed is not a registered user of the preset application, the execution main body may also directly query the push time period corresponding to the user to be pushed from the stored characteristics and the corresponding push time period according to the characteristics of the user to be pushed. Here, if only the common features, such as age, sex, resident region, etc., are counted, a million-level search space is generated. If other characteristics, such as shopping amount and other information, are added, the retrieval space reaches the level of tens of millions or even hundreds of millions. This consumes a lot of resources. To address this problem, the features and corresponding push time periods may be stored in two ways as follows. First, if the search space is not particularly large, such as in the millions, a tree structure may be used for storage. Secondly, if the same kind of features are complex and the search space is more than ten million levels, Presto (a kind of data query engine) with better performance can be used for storage.
With continued reference to fig. 4, fig. 4 is a schematic diagram of an application scenario of the method for pushing information provided by fig. 3. In the application scenario of fig. 4, if it is desired to push information to the user a, the information of the user a may be obtained, where the information of the user a may include the mobile phone number 154 × 1234, the gender of the male, the age of the 23 year, and the resident area of the zheng. Here, since the information of the user a is not successfully matched in the user identifier set corresponding to the preset application and the user information set corresponding to the identifier set, at this time, it may be determined that the user a is not a registered user of the preset application. Subsequently, a large number of sample users of male gender, between 20-35 years of age, resident territory zheng, were selected from the sample user set. At this time, the sample pushing time periods corresponding to the selected large number of sample users may be counted to obtain a statistical result. Wherein, the statistical result can be shown in table 1:
Figure BDA0001788293970000141
TABLE 1
At this time, 10 o ' clock, 15 o ' clock, 16 o ' clock on monday, 0 o ' clock, 16 o ' clock on tuesday, 21 o ' clock on thursday, and 11 o ' clock on friday are determined as the push time period corresponding to user a according to the statistical result. In this way, whenever the push time period corresponding to the user a is reached, the sales short message of the item in the preset application may be sent to the mobile phone number 153 × 1234 of the user a in the form of a short message. For example, user a may receive a sales message for an item at 10 o' clock on monday, and the sales message displayed on his terminal device may be as shown in 401.
As can be seen from fig. 3, compared with the embodiment corresponding to fig. 2, the flow 300 of the method for pushing information in this embodiment adds a step of pushing information to the user to be pushed in the case that the user to be pushed is not a registered user of the preset application. Therefore, in the solution described in this embodiment, when the user is not a registered user of the preset application, the push time corresponding to the user is determined by analyzing the sample push information of the sample user matching the characteristics of the user, and the information can be pushed to the user in an appropriate time period (usually, in a time period with a high user activity), which is helpful to improve the reading rate and the conversion rate of the user on the information.
With further reference to fig. 5, as an implementation of the method shown in the above-mentioned figures, the present application provides an embodiment of an apparatus for pushing information, where the embodiment of the apparatus corresponds to the embodiment of the method shown in fig. 2, and the apparatus may be applied to various electronic devices.
As shown in fig. 5, the apparatus 500 for pushing information of the present embodiment may include: a first acquisition unit 501, a first determination unit 502, a second acquisition unit 503, a first statistics unit 504, and a first pushing unit 505. The first obtaining unit 501 is configured to obtain information of a user to be pushed; a first determining unit 502 configured to determine whether the user to be pushed is a registered user of a preset application based on information of the user to be pushed; a second obtaining unit 503, configured to, in response to determining that the user to be pushed is a registered user of the preset application, obtain a historical behavior record set of the user to be pushed in the preset application; a first statistical unit 504 configured to count a historical behavior record count corresponding to a preset time period in a preset time period set based on the historical behavior record set; the first pushing unit 505 is configured to determine a pushing time period based on a historical behavior record count corresponding to a preset time period in a preset time period set, and push information to a user to be pushed within the pushing time period.
In the present embodiment, in the apparatus 500 for pushing information: the detailed processing of the first obtaining unit 501, the first determining unit 502, the second obtaining unit 503, the first counting unit 504 and the first pushing unit 505 and the technical effects thereof may refer to the related descriptions of step 201, step 202, step 203, step 204 and step 205 in the corresponding embodiment of fig. 2, which are not repeated herein.
In some optional implementations of the present embodiment, the apparatus 500 for pushing information further includes: a second determining unit (not shown in the figure) configured to determine, in response to determining that the user to be pushed is not a registered user of the preset application, a characteristic of the user to be pushed based on information of the user to be pushed; a selecting unit (not shown in the figure) configured to select a sample user matching the characteristics of the user to be pushed from the sample user set; a second statistical unit (not shown in the figure), configured to perform statistics on the sample pushing time period corresponding to the selected sample user to obtain a statistical result; and the second pushing unit is configured to determine a pushing time period corresponding to the user to be pushed based on the statistical result, and push information to the user to be pushed in the pushing time period.
In some optional implementations of this embodiment, the sample users in the sample user set are registered users of a preset application; and the sample pushing time period corresponding to the sample user in the sample user set is obtained through the following steps: for a sample user in the sample user set, acquiring a sample historical behavior record set of the sample user in a preset application; counting the historical behavior record counts of the samples corresponding to the preset time periods in the preset time period set based on the historical behavior record set of the samples; and determining a sample pushing time period corresponding to the sample user based on the sample historical behavior record count corresponding to the preset time period in the preset time period set.
In some optional implementations of this embodiment, the step may further include: and for the sample users in the sample user set, updating the sample historical behavior record set and the model algorithm corresponding to the sample users at regular time, and updating the sample pushing time period corresponding to the sample users at regular time according to the updated sample historical behavior record set and the updated model algorithm.
In some optional implementations of the present embodiment, the first determining unit 502 includes: a first matching subunit (not shown in the figure), configured to match information of a user to be pushed in a user identification set corresponding to a preset application; the first determining subunit (not shown in the figure) is configured to determine that the user to be pushed is a registered user of the preset application if the information of the user to be pushed is successfully matched in the user identifier set corresponding to the preset application.
In some optional implementations of the present embodiment, the first determining unit 502 includes: a second matching subunit (not shown in the figure), configured to, if the information of the user to be pushed is unsuccessfully matched in the user identifier set corresponding to the preset application, match the information of the user to be pushed in the user information set corresponding to the user identifier set; a second determining subunit (not shown in the figure), configured to determine that the user to be pushed is a registered user of the preset application if the information of the user to be pushed is successfully matched in the user information set; and a third determining subunit (not shown in the figure) configured to determine that the user to be pushed is not a registered user of the preset application if the information of the user to be pushed is not successfully matched in the user information set.
In some optional implementations of this embodiment, the first pushing unit 505 may be further configured to: and pushing information to the user to be pushed in a short message mode within the pushing time period.
Referring now to FIG. 6, a block diagram of a computer system 600 suitable for use in implementing a server (e.g., server 103 shown in FIG. 1) according to embodiments of the present application is shown. The server shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.
As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611. The computer program performs the above-described functions defined in the method of the present application when executed by a Central Processing Unit (CPU) 601. It should be noted that the computer readable medium described herein can be a computer readable signal medium or a computer readable medium or any combination of the two. A computer readable medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present application, a computer readable medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present application may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes a first acquisition unit, a first determination unit, a second acquisition unit, a first statistics unit, and a first pushing unit. The names of the units do not in some cases form a limitation on the units themselves, and for example, the first acquiring unit may also be described as a "unit that acquires information of a user to be pushed".
As another aspect, the present application also provides a computer-readable medium, which may be contained in the server described in the above embodiments; or may exist separately and not be assembled into the server. The computer readable medium carries one or more programs which, when executed by the server, cause the server to: acquiring information of a user to be pushed; determining whether the user to be pushed is a registered user of a preset application or not based on the information of the user to be pushed; in response to the fact that the user to be pushed is the registered user of the preset application, acquiring a historical behavior record set of the user to be pushed in the preset application; counting historical behavior record counts corresponding to preset time periods in a preset time period set on the basis of the historical behavior record set; determining a pushing time period based on the historical behavior record count corresponding to the preset time period in the preset time period set, and pushing information to a user to be pushed in the pushing time period.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the invention. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.

Claims (10)

1. A method for pushing information, comprising:
acquiring information of a user to be pushed;
determining whether the user to be pushed is a registered user of a preset application or not based on the information of the user to be pushed;
in response to the fact that the user to be pushed is the registered user of the preset application, acquiring a historical behavior record set of the user to be pushed in the preset application;
counting historical behavior record counts corresponding to preset time periods in a preset time period set on the basis of the historical behavior record set;
determining a pushing time period based on the historical behavior record count corresponding to the preset time period in the preset time period set, and pushing information to the user to be pushed in the pushing time period.
2. The method of claim 1, wherein the method further comprises:
in response to determining that the user to be pushed is not a registered user of the preset application, determining the characteristics of the user to be pushed based on the information of the user to be pushed;
selecting a sample user matched with the characteristics of the user to be pushed from a sample user set;
counting the sample pushing time period corresponding to the selected sample user to obtain a statistical result;
and determining a pushing time period corresponding to the user to be pushed based on the statistical result, and pushing information to the user to be pushed in the pushing time period.
3. The method of claim 2, wherein a sample user of the set of sample users is a registered user of the preset application; and the sample pushing time period corresponding to the sample user in the sample user set is obtained through the following steps:
for a sample user in the sample user set, obtaining a sample historical behavior record set of the sample user in the preset application;
counting the historical behavior record count of the sample corresponding to the preset time period in the preset time period set based on the historical behavior record set of the sample;
and determining a sample pushing time period corresponding to the sample user based on the sample historical behavior record count corresponding to the preset time period in the preset time period set.
4. The method of claim 3, wherein the steps further comprise:
and for the sample users in the sample user set, updating the sample historical behavior record set and the model algorithm corresponding to the sample users at regular time, and updating the sample pushing time period corresponding to the sample users at regular time according to the updated sample historical behavior record set and the updated model algorithm.
5. The method of claim 1, wherein the determining whether the user to be pushed is a registered user of a preset application based on the information of the user to be pushed comprises:
matching the information of the user to be pushed in a user identification set corresponding to the preset application;
and if the information of the user to be pushed is successfully matched in the user identification set corresponding to the preset application, determining that the user to be pushed is a registered user of the preset application.
6. The method of claim 5, wherein the determining whether the user to be pushed is a registered user of a preset application based on the information of the user to be pushed further comprises:
if the information of the user to be pushed is unsuccessfully matched in the user identification set corresponding to the preset application, matching the information of the user to be pushed in the user information set corresponding to the user identification set;
if the information of the user to be pushed is successfully matched in the user information set, determining that the user to be pushed is a registered user of the preset application;
and if the information of the user to be pushed is unsuccessfully matched in the user information set, determining that the user to be pushed is not the registered user of the preset application.
7. The method according to one of claims 1 to 6, wherein the pushing information to the user to be pushed in the pushing time period comprises:
and pushing information to the user to be pushed in a short message mode within the pushing time period.
8. An apparatus for pushing information, comprising:
the device comprises a first acquisition unit, a second acquisition unit and a third acquisition unit, wherein the first acquisition unit is configured to acquire information of a user to be pushed;
a first determination unit configured to determine whether the user to be pushed is a registered user of a preset application based on the information of the user to be pushed;
a second obtaining unit, configured to, in response to determining that the user to be pushed is a registered user of the preset application, obtain a historical behavior record set of the user to be pushed in the preset application;
a first statistic unit configured to count a historical behavior record count corresponding to a preset time period in a preset time period set based on the historical behavior record set;
the first pushing unit is configured to determine a pushing time period based on a historical behavior record count corresponding to a preset time period in the preset time period set, and push information to the user to be pushed in the pushing time period.
9. A server, comprising:
one or more processors;
a storage device having one or more programs stored thereon,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable medium, on which a computer program is stored, wherein the computer program, when being executed by a processor, carries out the method according to any one of claims 1-7.
CN201811025021.3A 2018-09-04 2018-09-04 Method and device for pushing information Pending CN110875949A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811025021.3A CN110875949A (en) 2018-09-04 2018-09-04 Method and device for pushing information

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811025021.3A CN110875949A (en) 2018-09-04 2018-09-04 Method and device for pushing information

Publications (1)

Publication Number Publication Date
CN110875949A true CN110875949A (en) 2020-03-10

Family

ID=69716868

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811025021.3A Pending CN110875949A (en) 2018-09-04 2018-09-04 Method and device for pushing information

Country Status (1)

Country Link
CN (1) CN110875949A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111652312A (en) * 2020-06-03 2020-09-11 上海维外科技有限公司 Method, system and storage medium for measuring fit degree between samples or sets with selective characteristics

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104572840A (en) * 2014-12-11 2015-04-29 百度在线网络技术(北京)有限公司 Method and equipment used for providing push message
CN105610929A (en) * 2015-12-24 2016-05-25 北京奇虎科技有限公司 Personalized data pushing method and device
CN106254443A (en) * 2016-07-28 2016-12-21 乐视控股(北京)有限公司 Information push method and device
CN107111654A (en) * 2015-09-15 2017-08-29 谷歌公司 Content distribution based on event
CN107766580A (en) * 2017-11-20 2018-03-06 北京奇虎科技有限公司 The method for pushing and device of message
CN107911487A (en) * 2017-12-18 2018-04-13 广东欧珀移动通信有限公司 Information-pushing method, device, server and readable storage medium storing program for executing
US20180139294A1 (en) * 2016-11-17 2018-05-17 Facebook, Inc. Delivering notifications based on prediction of user activity
CN108259546A (en) * 2017-01-16 2018-07-06 广州市动景计算机科技有限公司 Information push method, equipment and programmable device

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104572840A (en) * 2014-12-11 2015-04-29 百度在线网络技术(北京)有限公司 Method and equipment used for providing push message
CN107111654A (en) * 2015-09-15 2017-08-29 谷歌公司 Content distribution based on event
CN105610929A (en) * 2015-12-24 2016-05-25 北京奇虎科技有限公司 Personalized data pushing method and device
CN106254443A (en) * 2016-07-28 2016-12-21 乐视控股(北京)有限公司 Information push method and device
US20180139294A1 (en) * 2016-11-17 2018-05-17 Facebook, Inc. Delivering notifications based on prediction of user activity
CN108259546A (en) * 2017-01-16 2018-07-06 广州市动景计算机科技有限公司 Information push method, equipment and programmable device
CN107766580A (en) * 2017-11-20 2018-03-06 北京奇虎科技有限公司 The method for pushing and device of message
CN107911487A (en) * 2017-12-18 2018-04-13 广东欧珀移动通信有限公司 Information-pushing method, device, server and readable storage medium storing program for executing

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111652312A (en) * 2020-06-03 2020-09-11 上海维外科技有限公司 Method, system and storage medium for measuring fit degree between samples or sets with selective characteristics
CN111652312B (en) * 2020-06-03 2023-02-07 上海维外科技有限公司 Method, system and storage medium for measuring fit degree between sets with selective characteristics

Similar Documents

Publication Publication Date Title
CN109460513B (en) Method and apparatus for generating click rate prediction model
CN111372130B (en) User online time counting method and device, electronic equipment and storage medium
CN110866040A (en) User portrait generation method, device and system
CN111190512A (en) Message processing method and device
CN111339495B (en) Method and device for counting number of people online in live broadcast room, electronic equipment and storage medium
CN107247798B (en) Method and device for constructing search word bank
CN110554951A (en) Method and device for managing embedded points
CN109409419B (en) Method and apparatus for processing data
CN108011936B (en) Method and device for pushing information
CN113190558A (en) Data processing method and system
CN113590756A (en) Information sequence generation method and device, terminal equipment and computer readable medium
CN110737691B (en) Method and apparatus for processing access behavior data
CN113761565B (en) Data desensitization method and device
CN108985805B (en) Method and device for selectively executing push task
CN110895591A (en) Method and device for positioning self-picking point
CN110875949A (en) Method and device for pushing information
CN113220705A (en) Slow query identification method and device
CN109214846B (en) Information storage method and device
CN111949678A (en) Method and device for processing non-accumulation indexes across time windows
CN115423030A (en) Equipment identification method and device
CN113377604B (en) Data processing method, device, equipment and storage medium
CN111464820B (en) Sampling method and device for pulling message record, electronic equipment and storage medium
CN109785178B (en) Method and apparatus for generating information
CN113139082A (en) Multimedia content processing method, apparatus, device and medium
CN111131354B (en) Method and apparatus for generating information

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
CB02 Change of applicant information
CB02 Change of applicant information

Address after: Room 221, 2nd floor, Block C, 18 Kechuang 11th Street, Daxing Economic and Technological Development Zone, Beijing, 100176

Applicant after: Jingdong Technology Holding Co.,Ltd.

Address before: Room 221, 2nd floor, Block C, 18 Kechuang 11th Street, Daxing Economic and Technological Development Zone, Beijing, 100176

Applicant before: Jingdong Digital Technology Holding Co.,Ltd.

Address after: Room 221, 2nd floor, Block C, 18 Kechuang 11th Street, Daxing Economic and Technological Development Zone, Beijing, 100176

Applicant after: Jingdong Digital Technology Holding Co.,Ltd.

Address before: Room 221, 2nd floor, Block C, 18 Kechuang 11th Street, Daxing Economic and Technological Development Zone, Beijing, 100176

Applicant before: JINGDONG DIGITAL TECHNOLOGY HOLDINGS Co.,Ltd.

RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20200310