CN115114032A - Message checking method, device, equipment, storage medium and product - Google Patents
Message checking method, device, equipment, storage medium and product Download PDFInfo
- Publication number
- CN115114032A CN115114032A CN202210869002.9A CN202210869002A CN115114032A CN 115114032 A CN115114032 A CN 115114032A CN 202210869002 A CN202210869002 A CN 202210869002A CN 115114032 A CN115114032 A CN 115114032A
- Authority
- CN
- China
- Prior art keywords
- historical
- message
- messages
- type
- value
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5021—Priority
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention discloses a message checking method, a device, equipment, a storage medium and a product, wherein the method comprises the following steps: receiving a plurality of messages to be checked simultaneously, and determining the type of each message to be checked; judging whether the number of the plurality of messages to be checked exceeds a set number; if yes, predicting a grade corresponding to each type, sequencing a plurality of messages to be verified which are received simultaneously according to the grade, and acquiring the messages to be verified one by one according to the sequencing, wherein the grade is used for representing the verification failure rate of the messages to be verified; if not, acquiring the messages to be checked one by one according to a preset sequence; and verifying the message to be verified, and pushing the message to the user side after the verification is successful.
Description
Technical Field
The present invention relates to the field of message verification technologies, and in particular, to a message verification method, apparatus, device, storage medium, and product.
Background
Various social media software now can push a wide variety of messages to users, but before pushing a message to a user end, further verification of the message is required to ensure the true validity of the message.
When a plurality of messages to be checked are simultaneously and concurrently transmitted, the problem of low checking efficiency often exists in the prior art when the messages are checked. Therefore, a message verification method is needed to improve the efficiency of message verification.
Disclosure of Invention
The embodiment of the invention provides a message checking method, a device, equipment, a storage medium and a product, which are used for improving the message checking efficiency, and the method comprises the following steps:
receiving a plurality of messages to be checked simultaneously, and determining the type of each message to be checked;
judging whether the number of the plurality of messages to be checked exceeds a set number;
if yes, predicting a grade corresponding to each type, sequencing a plurality of messages to be verified which are received simultaneously according to the grade, and acquiring the messages to be verified one by one according to the sequencing, wherein the grade is used for representing the verification failure rate of the messages to be verified;
if not, acquiring the messages to be checked one by one according to a preset sequence;
and verifying the message to be verified, and pushing the message to the user side after the verification is successful.
Preferably, the predicting the grade corresponding to each type further comprises:
determining the historical verification failure rate of each type according to the historical verification result of the historical message corresponding to each type;
classifying a plurality of different types of historical verification failure rates within a set difference value into the same grade to obtain a plurality of different grades;
calculating the historical verification failure rate average value of the historical information corresponding to each level;
and sequencing the historical verification failure rate mean values corresponding to the multiple different levels to obtain the high and low sequences of the multiple different levels.
Preferably, the method for determining the preset sequence includes:
acquiring the attention of each type of user;
and sequencing the plurality of messages to be checked which are received simultaneously according to the attention degree from high to low to obtain a preset sequence.
Preferably, the acquiring the attention of each type of user further includes:
acquiring historical click quantity, historical browsing time and historical participation times of each type;
and calculating the comprehensive value respectively corresponding to each type through different preset weights respectively corresponding to the historical click quantity, the historical browsing time and the historical participation times to obtain the user attention of each type.
Preferably, the calculating, according to different preset weights respectively corresponding to the historical click rate, the historical browsing time, and the historical participation frequency, a comprehensive value respectively corresponding to each type, and obtaining the user attention of each type further includes:
respectively standardizing historical click quantity, historical browsing time and historical participation times according to the click quantity standard value, the browsing time standard value and the participation time standard value to obtain a click quantity relative value, a browsing time relative value and a participation time relative value;
and calculating a comprehensive value corresponding to each type of message according to the click rate relative value and the preset weight of the click rate, the preset weight of the browsing time relative value and the browsing time and the preset weight of the participation times relative value and the participation times to obtain the user attention of each type.
Preferably, the method for determining the click quantity standard value, the browsing time standard value and the participation number standard value comprises the following steps:
calculating the average value of historical click rate of all types, and taking the average value of the historical click rate as a click rate standard value;
calculating the average value of historical browsing time of all types, and taking the average value of the historical browsing time as a standard browsing time value;
and calculating the average value of all types of historical participation times, and taking the average value of the historical participation times as a participation time standard value.
Preferably, the step of respectively standardizing the historical click quantity, the historical browsing time and the historical participation times according to the click quantity standard value, the browsing time standard value and the participation time standard value to obtain a click quantity relative value, a browsing time relative value and a participation time relative value further comprises:
dividing the historical click rate by the click rate standard value to obtain a click rate relative value;
dividing the historical browsing time by the browsing time standard value to obtain a browsing time relative value;
and dividing the historical participation times by the participation time standard value to obtain a participation time relative value.
An embodiment of the present invention further provides a message verification apparatus, including:
the receiving module is used for receiving a plurality of messages to be checked simultaneously and determining the type of each message to be checked;
the judging module is used for judging whether the number of the plurality of messages to be checked exceeds a set number;
if yes, predicting a grade corresponding to each type, sequencing a plurality of messages to be verified which are received simultaneously according to the grade, and acquiring the messages to be verified one by one according to the sequencing, wherein the grade is used for representing the verification failure rate of the messages to be verified;
if not, acquiring the messages to be checked one by one according to a preset sequence;
and the pushing module is used for verifying the message to be verified and pushing the message to the user side after the verification is successful.
An embodiment of the present invention further provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the processor implements any one of the methods described above.
An embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the computer program implements any one of the methods described above.
An embodiment of the present invention further provides a computer program product, where the computer program product includes a computer program, and when the computer program is executed by a processor, the computer program implements any of the methods described above.
In the embodiment of the invention, when a plurality of messages to be checked are received simultaneously, if the number of the plurality of messages to be checked exceeds the set number, the number of the messages to be checked is excessive, the grade corresponding to the type of each message to be checked can be predicted, the plurality of messages to be checked are sequenced, and the messages to be checked are acquired one by one according to the sequencing. The grade is used for representing the check failure rate of the message to be checked, the higher the grade is, the lower the check failure rate of the message to be checked is, the processing is preferentially carried out, and the message processing efficiency can be improved by the method for processing the message to be checked according to the grade.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts. In the drawings:
fig. 1 is a schematic flowchart of a message verification method provided in an embodiment of the present invention;
FIG. 2 is a schematic flow chart illustrating the steps for predicting the corresponding level of each type according to an embodiment of the present invention;
fig. 3 is a schematic flowchart of a method for determining a predetermined sequence according to an embodiment of the present invention;
FIG. 4 is a schematic flow chart illustrating the process of obtaining the attention of each type of user according to the embodiment of the present invention;
FIG. 5 is a schematic flow chart of obtaining the attention of each type of user according to the embodiment of the present invention;
FIG. 6 is a flowchart illustrating a method for determining a click quantity criterion value, a browsing time criterion value, and a participation number criterion value according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of a message checking apparatus according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a computer device provided in an embodiment of the present invention.
Description of the symbols of the drawings:
100. a receiving module;
200. a judgment module;
300. a push module;
802. a computer device;
804. a processor;
806. a memory;
808. a drive mechanism;
810. an input/output module;
812. an input device;
814. an output device;
816. a presentation device;
818. a graphical user interface;
820. a network interface;
822. a communication link;
824. a communication bus.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the embodiments of the present invention are further described in detail below with reference to the accompanying drawings. The exemplary embodiments and descriptions of the present invention are provided to explain the present invention, but not to limit the present invention.
Various social media software can now push a wide variety of messages to users, but before pushing a message to a user end, further verification of the message is required to ensure the true validity of the message.
When a plurality of messages to be checked are concurrent, the problem of low checking efficiency often exists in the prior art when the messages are checked.
In order to solve the above problem, embodiments herein provide a message checking method. Fig. 1 is a flow chart of a message verification method provided in an embodiment herein, and the present specification provides the method operation steps as described in the embodiment or the flow chart, but may include more or less operation steps based on conventional or non-inventive labor. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of sequences, and does not represent a unique order of performance. When an actual system or apparatus product executes, it can execute sequentially or in parallel according to the method shown in the embodiment or the figures.
It should be noted that the terms "first," "second," and the like in the description and claims herein and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments herein described are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, apparatus, article, or device that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or device.
Referring to fig. 1, a message verification method is provided herein, including:
s101: receiving a plurality of messages to be checked simultaneously, and determining the type of each message to be checked;
s102: judging whether the number of the plurality of messages to be checked exceeds a set number;
s103: if yes, predicting a grade corresponding to each type, sequencing a plurality of messages to be verified received simultaneously according to the grade, and acquiring the messages to be verified one by one according to the sequencing, wherein the grade is used for representing the messages to be verified
Checking a check failure rate of the message;
s104: if not, acquiring the messages to be checked one by one according to a preset sequence;
s105: and verifying the message to be verified, and pushing the message to the user side after the verification is successful.
The message verification method described herein is applied on the premise that a message to be verified sent by one or more senders is received at the same time, the message to be verified needs to be verified, and the message is pushed to a user side after verification is successful.
When a plurality of messages to be verified are received simultaneously, the type of each message to be verified needs to be determined, for example, the type of the message to be verified may be a winning message, a hot message, a transaction message, or the like.
Specific verification methods may include non-null verification, data logic verification, and data format verification.
When a plurality of messages to be checked are received simultaneously, if the number of the plurality of messages to be checked exceeds the set number, the number of the messages to be checked is excessive, the grade corresponding to the type of each message to be checked can be predicted, the plurality of messages to be checked are sequenced, and the messages to be checked are acquired one by one according to the sequencing. The grade is used for representing the check failure rate of the message to be checked, the higher the grade is, the lower the check failure rate of the message to be checked is, the processing is preferentially carried out, and the message processing efficiency can be improved by the method for processing the message to be checked according to the grade.
If the number of the plurality of messages to be verified does not exceed the set number, which indicates that the number of the messages to be verified is small, the messages to be verified can be acquired one by one according to a preset sequence, and the preset sequence can be a randomly determined acquisition sequence or can be determined by other methods.
Referring to fig. 2, the predicting the level corresponding to each type further includes:
s201: determining the historical verification failure rate of each type according to the historical verification result of the historical message corresponding to each type;
s202: classifying a plurality of different types of historical verification failure rates within a set difference value into the same grade to obtain a plurality of different grades;
s203: calculating the historical verification failure rate average value of the historical information corresponding to each level;
s204: and sequencing the historical verification failure rate mean values corresponding to the multiple different levels to obtain the high and low sequences of the multiple different levels.
For each type of history message, the history message may be the last month message or the last quarter message.
Taking the historical message a as an example, the historical verification result is generally a message verification failure/success, if the historical message corresponding to the type a is the message of the latest month, for example, the historical message includes historical messages a, b, c, and the like, the historical verification failure rate of the type a can be obtained by dividing the number of the verification failure messages (for example, a and c) in the type a of the latest month by the total number of the verification messages of the type a, and all the different types of historical verification failure rates can be obtained by this method.
And classifying a plurality of different types of messages with historical verification failure rates within a set difference value into the same grade, wherein the set difference value can be determined according to the actual working condition.
After obtaining a plurality of different grades, the high-low order of the plurality of different grades needs to be further determined according to the average value of the historical check failure rates of the historical messages corresponding to each grade, wherein the lower the average value of the historical check failure rates is, the higher the corresponding grade is, the higher the average value of the historical check failure rates is, and the lower the corresponding grade is.
For example, 10 messages a-j to be checked are received simultaneously, corresponding to five types, the five types are respectively type A (a) and type B (C) and type C (E, f), type D (g, h) and type E (i, j), the historical check failure rates of the type A and the type C are similar, and therefore the messages are in the same level, and the historical check failure rates of the type D and the type E are similar, and therefore the messages are in the same level. The multiple different grades are sequenced according to the historical verification failure rate average values corresponding to the multiple different grades, for example, the grades of the obtained A-type messages and the C-type messages are 1, the grades of the D-type messages and the E-type messages are 2, and the grade of the B-type messages is 3, so that 10 messages to be verified can be sequenced according to the grades 1-3, namely a, B, E and f are parallel and sequenced forward, g, h, i and j are parallel and sequenced in the middle, and C and D are parallel and sequenced backward, so that when the messages a-j to be verified are verified, the messages a-j are verified one by one according to the sequencing.
Therefore, the lower the historical verification failure rate, the lower the level of the message to be verified corresponding to the type, and the lower the verification efficiency after the sequencing during verification, thereby reversely promoting the message sender to improve the accuracy of the message, further reducing the verification failure rate of the message to be verified, and further improving the efficiency of the message to be verified during verification.
In this embodiment, referring to fig. 3, the method for determining the preset order includes:
s301: acquiring the attention of each type of user;
s302: and sequencing the plurality of messages to be checked which are received simultaneously according to the attention degree from high to low to obtain a preset sequence.
Specifically, referring to fig. 4, the acquiring the attention of each type of user further includes:
s401: acquiring historical click quantity, historical browsing time and historical participation times of each type;
s402: and calculating a comprehensive value corresponding to each type through different preset weights corresponding to the historical click rate, the historical browsing time and the historical participation times respectively to obtain the user attention of each type.
The historical click rate, the historical browsing time and the historical participation frequency of each type can be the click rate, the browsing time and the participation frequency of the last month of each type, or the click rate, the browsing time and the participation frequency of the last quarter. Taking the last month as an example, the historical click rate of the type A is the frequency of clicking the historical information of the type A by the user in the last month, the historical browsing time of the type A is the time length of browsing the historical information of the type A by the user in the last month, and the historical participation frequency of the type A is the frequency of participating in the historical information of the type A by the user in the last month.
In this embodiment, referring to fig. 5, the calculating, according to different preset weights respectively corresponding to the historical click amount, the historical browsing time, and the historical participation frequency, a comprehensive value respectively corresponding to each type, and obtaining the user attention of each type further includes:
s501: respectively standardizing historical click quantity, historical browsing time and historical participation times according to the click quantity standard value, the browsing time standard value and the participation time standard value to obtain a click quantity relative value, a browsing time relative value and a participation time relative value;
s502: and calculating a comprehensive value corresponding to each type of message according to the click rate relative value and the preset weight of the click rate, the preset weight of the browsing time relative value and the browsing time and the preset weight of the participation times relative value and the participation times to obtain the user attention of each type.
Because the magnitudes of the click volume, the browsing time and the participation times are different, in order to better calculate the comprehensive value corresponding to each type, the historical click volume, the historical browsing time and the historical participation times can be firstly subjected to standardization processing, the obtained click volume relative value, browsing time relative value and participation time relative value are values with unified magnitudes, and then the comprehensive value corresponding to each type of message can be calculated through the preset weights of the click volume relative value and the click volume, the preset weights of the browsing time relative value and the browsing time and the preset weights of the participation time relative value and the participation times, so that the user attention of each type can be obtained.
The preset weight of the click rate, the preset weight of the browsing time and the preset weight of the participation times can be determined according to the actual working condition, and the sum of the preset weight of the click rate, the preset weight of the browsing time and the preset weight of the participation times is 100%.
Referring to fig. 6, the method for determining the click quantity criterion value, the browsing time criterion value, and the participation number criterion value includes:
s601: calculating the average value of historical click rate of all types, and taking the average value of the historical click rate as a click rate standard value;
s602: calculating the average value of historical browsing time of all types, and taking the average value of the historical browsing time as a standard browsing time value;
s603: and calculating the average value of all types of historical participation times, and taking the average value of the historical participation times as a participation time standard value.
All types in the embodiments of the present disclosure refer to all types corresponding to a plurality of messages to be checked that are received simultaneously, taking a last month as an example, the average value of the historical click amounts of all types refers to the total number of times that a user clicks all types of historical messages in the last month, the historical browsing time of all types is the total duration that the user browses all types of historical messages in the last month, and the historical participation number of all types is the total number of times that the user participates in all types of historical messages in the last month.
In this embodiment, the normalizing the historical click quantity, the historical browsing time and the historical participation number according to the click quantity standard value, the browsing time standard value and the participation number standard value respectively to obtain a click quantity relative value, a browsing time relative value and a participation number relative value further includes:
dividing the historical click rate by the click rate standard value to obtain a click rate relative value;
dividing the historical browsing time by the browsing time standard value to obtain a browsing time relative value;
and dividing the historical participation times by the participation time standard value to obtain a participation time relative value.
Thus, the comprehensive values corresponding to each type can be obtained, for example, 3 messages a, B and c to be checked are received simultaneously, the two corresponding types are type a (a and B) and type B (c), if the comprehensive value of type a is greater than the comprehensive value of type B, the user attention of type a and type B is greater than type c, the preset sequence is that type a and type B are parallel and the sequence is forward, and the sequence of type c is backward. Therefore, when the message to be verified is verified and pushed to the user, the message with high user attention can be verified in advance and pushed, so that the user experience is improved.
It should be noted that, the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, presented data, etc.) referred to in the present application are information and data authorized by the user or sufficiently authorized by each party. In addition, the technical scheme described in the embodiment of the application conforms to relevant regulations of national laws and regulations in terms of data acquisition, storage, use, processing and the like.
Referring to fig. 7, an embodiment of the present invention further provides a message checking apparatus, as described in the following embodiments. Because the principle of solving the problem of the system is similar to a message checking method, the implementation of the system can refer to the implementation of the message checking method, and repeated parts are not described again.
A message checking apparatus comprising: the system comprises a receiving module 100, a judging module 200 and a pushing module 300;
a receiving module 100, configured to receive multiple messages to be checked at the same time, and determine a type of each of the messages to be checked;
a determining module 200, configured to determine whether the number of the multiple messages to be checked exceeds a set number;
if yes, predicting a grade corresponding to each type, sequencing a plurality of messages to be verified which are received simultaneously according to the grade, and acquiring the messages to be verified one by one according to the sequencing, wherein the grade is used for representing the verification failure rate of the messages to be verified;
if not, acquiring the messages to be checked one by one according to a preset sequence;
the pushing module 300 is configured to verify the message to be verified, and push the message to the user side after the message to be verified is successfully verified.
The embodiment of the present invention further provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and capable of running on the processor, and when the processor executes the computer program, the message verification method is implemented.
Referring to FIG. 8, a message verification method as described above is shown running on a computer device 802. Computer device 802 may include one or more processors 804, such as one or more Central Processing Units (CPUs) or Graphics Processors (GPUs), each of which may implement one or more hardware threads. The computer device 802 may also include any memory 806 for storing any kind of information, such as code, settings, data, etc., and in a particular embodiment a computer program on the memory 806 and executable on the processor 804, which computer program when executed by the processor 804 may perform instructions according to the above-described method. For example, and without limitation, memory 806 may include any one or more of the following in combination: any type of RAM, any type of ROM, flash memory devices, hard disks, optical disks, etc. More generally, any memory may use any technology to store information. Further, any memory may provide volatile or non-volatile retention of information. Further, any memory may represent fixed or removable components of computer device 802. In one case, when the processor 804 executes the associated instructions, which are stored in any memory or combination of memories, the computer device 802 can perform any of the operations of the associated instructions. The computer device 802 also includes one or more drive mechanisms 808, such as a hard disk drive mechanism, an optical disk drive mechanism, etc., for interacting with any memory.
An embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the message verification method is implemented.
An embodiment of the present invention further provides a computer program product, where the computer program product includes a computer program, and when the computer program is executed by a processor, the message verification method is implemented.
It should be understood that, in various embodiments herein, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments herein.
It should also be understood that, in the embodiments herein, the term "and/or" is only one kind of association relation describing an associated object, meaning that three kinds of relations may exist. For example, a and/or B, may represent: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
To clearly illustrate this interchangeability of hardware and software, various illustrative components and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In the several embodiments provided herein, it should be understood that the disclosed system, apparatus, and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may also be an electric, mechanical or other form of connection.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purposes of the embodiments herein.
In addition, functional units in the embodiments herein may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (11)
1. A message verification method, comprising:
receiving a plurality of messages to be checked simultaneously, and determining the type of each message to be checked;
judging whether the number of the plurality of messages to be checked exceeds a set number;
if yes, predicting a grade corresponding to each type, sequencing a plurality of messages to be verified which are received simultaneously according to the grade, and acquiring the messages to be verified one by one according to the sequencing, wherein the grade is used for representing the verification failure rate of the messages to be verified;
if not, acquiring the messages to be checked one by one according to a preset sequence;
and verifying the message to be verified, and pushing the message to the user side after the verification is successful.
2. The message verification method of claim 1, wherein the predicting the level corresponding to each type further comprises:
determining the historical verification failure rate of each type according to the historical verification result of the historical message corresponding to each type;
classifying a plurality of different types of historical verification failure rates within a set difference value into the same grade to obtain a plurality of different grades;
calculating the historical verification failure rate average value of the historical information corresponding to each level;
and sequencing the historical verification failure rate mean values corresponding to the multiple different levels to obtain the high and low sequences of the multiple different levels.
3. The message verification method as claimed in claim 1, wherein the predetermined order determination method comprises:
acquiring the attention of each type of user;
and sequencing the plurality of messages to be checked which are received simultaneously according to the attention degree from high to low to obtain a preset sequence.
4. The message verification method of claim 3, wherein the obtaining each type of user attention further comprises:
acquiring historical click quantity, historical browsing time and historical participation times of each type;
and calculating the comprehensive value respectively corresponding to each type through different preset weights respectively corresponding to the historical click quantity, the historical browsing time and the historical participation times to obtain the user attention of each type.
5. The message verification method according to claim 4, wherein the calculating of the comprehensive value corresponding to each type according to the different preset weights corresponding to the historical click rate, the historical browsing time and the historical participation frequency respectively further comprises:
respectively standardizing historical click quantity, historical browsing time and historical participation times according to the click quantity standard value, the browsing time standard value and the participation time standard value to obtain a click quantity relative value, a browsing time relative value and a participation time relative value;
and calculating a comprehensive value corresponding to each type of message according to the click rate relative value and the preset weight of the click rate, the preset weight of the browsing time relative value and the browsing time and the preset weight of the participation times relative value and the participation times to obtain the user attention of each type.
6. The message verification method as claimed in claim 5, wherein the determination method of the click quantity standard value, the browsing time standard value and the participation number standard value comprises:
calculating the average value of historical click rate of all types, and taking the average value of the historical click rate as a click rate standard value;
calculating the average value of historical browsing time of all types, and taking the average value of the historical browsing time as a standard browsing time value;
and calculating the average value of all types of historical participation times, and taking the average value of the historical participation times as a participation time standard value.
7. The message verification method as claimed in claim 6, wherein the normalizing the historical click-through amount, the historical browsing time and the historical participation number according to the click-through amount standard value, the browsing time standard value and the participation number standard value respectively to obtain a click-through amount relative value, a browsing time relative value and a participation number relative value further comprises:
dividing the historical click rate by the click rate standard value to obtain a click rate relative value;
dividing the historical browsing time by the browsing time standard value to obtain a browsing time relative value;
and dividing the historical participation times by the participation time standard value to obtain a participation time relative value.
8. A message verification apparatus, comprising:
the receiving module is used for receiving a plurality of messages to be checked simultaneously and determining the type of each message to be checked;
the judging module is used for judging whether the number of the plurality of messages to be checked exceeds a set number;
if yes, predicting a grade corresponding to each type, sequencing a plurality of messages to be verified which are received simultaneously according to the grade, and acquiring the messages to be verified one by one according to the sequencing, wherein the grade is used for representing the verification failure rate of the messages to be verified;
if not, acquiring the messages to be checked one by one according to a preset sequence;
and the pushing module is used for verifying the message to be verified and pushing the message to the user side after the verification is successful.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 7 when executing the computer program.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which, when executed by a processor, implements the method of any one of claims 1 to 7.
11. A computer program product, characterized in that the computer program product comprises a computer program which, when being executed by a processor, carries out the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210869002.9A CN115114032A (en) | 2022-07-21 | 2022-07-21 | Message checking method, device, equipment, storage medium and product |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210869002.9A CN115114032A (en) | 2022-07-21 | 2022-07-21 | Message checking method, device, equipment, storage medium and product |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115114032A true CN115114032A (en) | 2022-09-27 |
Family
ID=83333932
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210869002.9A Pending CN115114032A (en) | 2022-07-21 | 2022-07-21 | Message checking method, device, equipment, storage medium and product |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115114032A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116881210A (en) * | 2023-09-08 | 2023-10-13 | 四维世景科技(北京)有限公司 | Data verification method and device |
-
2022
- 2022-07-21 CN CN202210869002.9A patent/CN115114032A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116881210A (en) * | 2023-09-08 | 2023-10-13 | 四维世景科技(北京)有限公司 | Data verification method and device |
| CN116881210B (en) * | 2023-09-08 | 2023-11-17 | 四维世景科技(北京)有限公司 | Data verification method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105610654B (en) | Server, and method and system for policy online testing | |
| CN109272219B (en) | Performance assessment method, device, computer equipment and storage medium | |
| CN115114032A (en) | Message checking method, device, equipment, storage medium and product | |
| CN109544014B (en) | Anti-fraud method and device based on historical data playback | |
| CN110221948A (en) | Test script generation method, device, computer installation and storage medium | |
| CN111083013A (en) | Test method and device based on flow playback, electronic equipment and storage medium | |
| CN106390451B (en) | Method and device for testing capacity of game server | |
| CN103440460A (en) | Application system change validation method and system | |
| CN111078560B (en) | Test method and device based on flow pruning, electronic equipment and storage medium | |
| CN114924784A (en) | Method, system, equipment, storage medium and product for compatibility of new and old interfaces | |
| CN113469668A (en) | Block chain-based method and device for limiting public customer transaction | |
| CN112148621A (en) | Test method and device and electronic equipment | |
| CN111198986B (en) | Information transmission method, device, electronic equipment and storage medium | |
| CN115118528B (en) | Block chain security evaluation method, device, equipment and storage medium | |
| CN114138786A (en) | Method, device, medium, product and equipment for duplicate removal of online transaction message | |
| CN112988591A (en) | Charging logic verification method, device, equipment and storage medium | |
| CN110955464A (en) | Service processing method and device, computer equipment and storage medium | |
| CN115309581B (en) | Method and device for analyzing cross-chain transaction running state of heterogeneous block chain | |
| CN113194039B (en) | Method and device for segmenting system data flow, electronic equipment and storage medium | |
| CN116796075B (en) | Method and device for analyzing problem data | |
| CN108763871A (en) | Filling-up hole method and device based on third generation sequencing sequence | |
| CN115994172B (en) | Method, device, equipment and medium for determining service access relation | |
| CN113434379A (en) | Method, device, equipment and storage medium for log diagnosis | |
| CN115525789A (en) | Picture management method and picture management device for iOS application development | |
| CN115631047A (en) | Method and device for purchasing household financial products |
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 |