Message assembly and distribution processing method and system based on artificial intelligence

Abstract

The artificial intelligence-based message assembly and distribution processing method and system of the present application, if the assembly distribution template of the first business message event is related to the assembly distribution template of the second business message event and the message push distribution preference of the first business message event is related to the message push distribution preference of the second business message event, then the first business message event and the second business message event are determined to be associated business message events, thereby combining the assembly distribution template and message push distribution preference of the business message events to determine whether the two groups of business message events are associated business message events, thereby improving the accuracy of determining associated business message events.

Description

Technical Field

[0001] The present application relates to the technical field of message organization and distribution, and in particular to an artificial intelligence-based message assembly and distribution processing method and system. Background Art

[0002] When analyzing business message events, how to improve the accuracy of determining related business message events is one of the current technical issues. Summary of the invention

[0003] In order to improve the technical problems existing in the related technologies, the present application provides a message assembly and distribution processing method and system based on artificial intelligence.

[0004] In a first aspect, an embodiment of the present application provides a message assembly and distribution processing method based on artificial intelligence, which is applied to a message assembly and distribution processing system, and the method includes:

[0005] Acquire a first dynamic routing rule feature and a first push channel description information of a first business message event, and acquire a second dynamic routing rule feature and a second push channel description information of a second business message event;

[0006] Determine whether the assembly distribution template of the first business message event and the assembly distribution template of the second business message event are related through the first dynamic routing rule feature and the second dynamic routing rule feature, and determine whether the message push distribution preference of the first business message event and the message push distribution preference of the second business message event are related through the first push channel description information and the second push channel description information;

[0007] In response to the fact that the assembly distribution template of the first business message event is related to the assembly distribution template of the second business message event and the message push distribution preference of the first business message event is related to the message push distribution preference of the second business message event, it is determined that the first business message event and the second business message event are associated business message events.

[0008] In some optional embodiments, determining whether the assembly distribution template of the first service message event and the assembly distribution template of the second service message event are related by using the first dynamic routing rule feature and the second dynamic routing rule feature includes:

[0009] determining a first involvement coefficient between the first dynamic routing rule characteristic and the second dynamic routing rule characteristic;

[0010] In response to the first involvement coefficient being greater than a first specified threshold, determining that the assembly distribution template of the first service message event is related to the assembly distribution template of the second service message event;

[0011] The determining, through the first push channel description information and the second push channel description information, whether the message push distribution preference of the first service message event and the message push distribution preference of the second service message event are related includes:

[0012] determining a second involvement coefficient between the first push channel description information and the second push channel description information;

[0013] In response to the second involvement coefficient being greater than a second specified threshold, it is determined that the message push distribution preference of the first service message event is related to the message push distribution preference of the second service message event.

[0014] In some optional embodiments, the response to the assembly distribution template of the first business message event and the assembly distribution template of the second business message event are related and the message push distribution preference of the first business message event and the message push distribution preference of the second business message event are related, then determining that the first business message event and the second business message event are associated business message events includes:

[0015] Determining a third involvement coefficient between the first service message event and the second service message event by using the first involvement coefficient and the second involvement coefficient;

[0016] In response to the third involvement coefficient being greater than a third specified threshold, it is determined that the first service message event and the second service message event are associated service message events.

[0017] In some optional embodiments, the first dynamic routing rule feature includes a third dynamic routing rule feature of each first business scenario node in the first business message event, the second dynamic routing rule feature includes a fourth dynamic routing rule feature of each second business scenario node in the second business message event, and each first business scenario node corresponds to a second business scenario node;

[0018] The step of obtaining a first dynamic routing rule feature of a first service message event and obtaining a second dynamic routing rule feature of a second service message event includes:

[0019] The first service message event and the second service message event are updated respectively to obtain a first updated service message event and a second updated service message event;

[0020] Respectively dividing the first updated service message event and the second updated service message event into a plurality of first service scenario nodes and a plurality of second service scenario nodes;

[0021] The third dynamic routing rule feature of each first business scenario node and the fourth dynamic routing rule feature of the second business scenario node corresponding to each first business scenario node are respectively obtained.

[0022] In some optional embodiments, determining a first involvement coefficient between the first dynamic routing rule feature and the second dynamic routing rule feature includes:

[0023] Respectively determine the involvement coefficients between the third dynamic routing rule feature of each first business scenario node and the fourth dynamic routing rule feature of the second business scenario node corresponding to each first business scenario node, to obtain a plurality of fourth involvement coefficients;

[0024] An average of the plurality of fourth involvement coefficients is determined as a first involvement coefficient between the first dynamic routing rule feature and the second dynamic routing rule feature.

[0025] In some optional embodiments, the first dynamic routing rule feature includes a first script feature and a first routing update time in the first service message event, and the second dynamic routing rule feature includes a second script feature and a second routing update time in the second service message event;

[0026] The determining, by using the first dynamic routing rule feature and the second dynamic routing rule feature, whether the assembly distribution template of the first service message event and the assembly distribution template of the second service message event are related includes:

[0027] Determining a first matching coefficient between the first service message event and the second service message event according to the first script feature and the second script feature;

[0028] Determine a second pairing coefficient between the first service message event and the second service message event according to the first route update time and the second route update time;

[0029] Determining a first involvement coefficient between the first dynamic routing rule feature and the second dynamic routing rule feature through the first pairing coefficient and the second pairing coefficient;

[0030] In response to the first involvement coefficient being greater than a first specified threshold, it is determined that the assembly distribution template of the first service message event is related to the assembly distribution template of the second service message event.

[0031] In some optional embodiments, the first push channel description information of the first business message event includes third push channel description information of each first business message event group in the first business message event, and the second push channel description information of the second business message event includes fourth push channel description information of each second business message event group in the second business message event, and each first business message event group corresponds to one second business message event group;

[0032] The determining a second involvement coefficient between the first push channel description information and the second push channel description information includes:

[0033] Respectively determine the involvement coefficients between the third push channel description information of each first service message event group and the fourth push channel description information of the second service message event group corresponding to each first service message event group, to obtain a plurality of fifth involvement coefficients;

[0034] An average of the fifth involvement coefficients is determined as a second involvement coefficient between the first push channel description information and the second push channel description information.

[0035] In some optional embodiments, the method further includes:

[0036] Through the first push channel description information, the first dynamic routing rule characteristics, the second push channel description information and the second dynamic routing rule characteristics, it is determined through a residual network whether the first business message event and the second business message event are associated business message events.

[0037] In a second aspect, the present application also provides a message assembly and distribution processing system, comprising a processor and a memory; the processor and the memory are communicatively connected, and the processor is used to read a computer program from the memory and execute it to implement the above method.

[0038] In a third aspect, the present application also provides a computer-readable storage medium on which a program is stored, and the program implements the above method when executed by a processor.

[0039] In an embodiment of the present application, it is determined whether the assembly distribution template of the first business message event and the assembly distribution template of the second business message event are related through the first dynamic routing rule feature of the first business message event and the second dynamic routing rule feature of the second business message event, and it is determined whether the message push distribution preference of the first business message event and the message push distribution preference of the second business message event are related through the first push channel description information of the first business message event and the second push channel description information of the second business message event; if the assembly distribution template of the first business message event and the assembly distribution template of the second business message event are related and the message push distribution preference of the first business message event and the message push distribution preference of the second business message event are related, then the first business message event and the second business message event are determined to be associated business message events, thereby combining the assembly distribution template and the message push distribution preference of the business message event to determine whether the two groups of business message events are associated business message events, thereby improving the accuracy of determining associated business message events. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] The accompanying drawings herein are incorporated in the specification and constitute a part of this application, illustrate embodiments consistent with the present application, and together with the description, are used to explain the principles of the present application.

[0041] Figure 1 It is a flow chart of an artificial intelligence-based message assembly and distribution processing method provided in an embodiment of the present application.

[0042] Figure 2 It is a block diagram of a message assembly, distribution and processing system provided in an embodiment of the present application. DETAILED DESCRIPTION

[0043] The method embodiment provided in the embodiment of the present application can be executed in a message assembly distribution processing system, a message assembly distribution processing system or a similar computing device. Taking the operation on the message assembly distribution processing system as an example, the message assembly distribution processing system may include one or more processors and a memory for storing data. Optionally, the above-mentioned message assembly distribution processing system may also include a transmission device for communication functions. It can be understood by those of ordinary skill in the art that the above-mentioned structure is only for illustration and does not limit the structure of the above-mentioned message assembly distribution processing system. For example, the message assembly distribution processing system may also include more or less components than those shown above, or have a configuration different from that shown above. The memory may be used to store computer programs, for example, software programs and modules of application software, such as a computer program corresponding to the above-mentioned method in the embodiment of the present application, and the processor executes various functional applications and data processing by running the computer program stored in the memory, that is, realizing the above-mentioned method. The memory may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory may further include a memory remotely arranged relative to the processor, and these remote memories may be connected to the message assembly distribution processing system through a network. Examples of the above network include, but are not limited to, an intranet, a local area network, a mobile communication network, and combinations thereof. The transmission device is used to receive or send data via a network. Specific examples of the above network may include a wireless network provided by a communication provider of the message assembly and distribution processing system.

[0044] Based on the above introduction to the message assembly and distribution processing system, please refer to Figure 1 , Figure 1 This is an exemplary implementation scheme of an artificial intelligence-based message assembly and distribution processing method provided in an embodiment of the present application, and the scheme may further include steps 10 to 30.

[0045] Step 10: Obtain a first dynamic routing rule feature and a first push channel description information of a first business message event, and obtain a second dynamic routing rule feature and a second push channel description information of a second business message event.

[0046] Step 20: Determine whether the assembly distribution template of the first business message event and the assembly distribution template of the second business message event are related through the first dynamic routing rule characteristics and the second dynamic routing rule characteristics, and determine whether the message push distribution preference of the first business message event and the message push distribution preference of the second business message event are related through the first push channel description information and the second push channel description information.

[0047] Step 30: In response to the fact that the assembly distribution template of the first business message event is related to the assembly distribution template of the second business message event and the message push distribution preference of the first business message event is related to the message push distribution preference of the second business message event, it is determined that the first business message event and the second business message event are associated business message events.

[0048] Preferably, the determining whether the assembly distribution template of the first business message event and the assembly distribution template of the second business message event are related through the first dynamic routing rule feature and the second dynamic routing rule feature includes: determining a first involvement coefficient between the first dynamic routing rule feature and the second dynamic routing rule feature; in response to the first involvement coefficient being greater than a first specified threshold, determining that the assembly distribution template of the first business message event and the assembly distribution template of the second business message event are related. The determining whether the message push distribution preference of the first business message event and the message push distribution preference of the second business message event are related through the first push channel description information and the second push channel description information includes: determining a second involvement coefficient between the first push channel description information and the second push channel description information; in response to the second involvement coefficient being greater than a second specified threshold, determining that the message push distribution preference of the first business message event and the message push distribution preference of the second business message event are related.

[0049] Preferably, in response to the assembly distribution template of the first business message event and the assembly distribution template of the second business message event being related and the message push distribution preference of the first business message event and the message push distribution preference of the second business message event being related, the first business message event and the second business message event are determined to be associated business message events, including: determining a third involvement coefficient between the first business message event and the second business message event through the first involvement coefficient and the second involvement coefficient; in response to the third involvement coefficient being greater than a third specified threshold, determining that the first business message event and the second business message event are associated business message events.

[0050] Preferably, the first dynamic routing rule feature includes the third dynamic routing rule feature of each first business scenario node in the first business message event, and the second dynamic routing rule feature includes the fourth dynamic routing rule feature of each second business scenario node in the second business message event, and each first business scenario node corresponds to a second business scenario node; the obtaining of the first dynamic routing rule feature of the first business message event and the obtaining of the second dynamic routing rule feature of the second business message event include: updating the first business message event and the second business message event respectively to obtain a first updated business message event and a second updated business message event; dividing the first updated business message event and the second updated business message event into a plurality of first business scenario nodes and a plurality of second business scenario nodes respectively; obtaining the third dynamic routing rule feature of each first business scenario node and the fourth dynamic routing rule feature of the second business scenario node corresponding to each first business scenario node respectively.

[0051] Preferably, the determining of the first involvement coefficient between the first dynamic routing rule feature and the second dynamic routing rule feature includes: respectively determining the involvement coefficient between the third dynamic routing rule feature of each first business scenario node and the fourth dynamic routing rule feature of the second business scenario node corresponding to each first business scenario node, to obtain a plurality of fourth involvement coefficients; and determining an average of the involvement coefficients of the plurality of fourth involvement coefficients as the first involvement coefficient between the first dynamic routing rule feature and the second dynamic routing rule feature.

[0052] Preferably, the first dynamic routing rule feature includes a first script feature and a first routing update time in the first business message event, and the second dynamic routing rule feature includes a second script feature and a second routing update time in the second business message event; the determining whether the assembly distribution template of the first business message event and the assembly distribution template of the second business message event are related through the first dynamic routing rule feature and the second dynamic routing rule feature includes: determining a first matching coefficient between the first business message event and the second business message event through the first script feature and the second script feature; determining a second matching coefficient between the first business message event and the second business message event through the first routing update time and the second routing update time; determining a first involvement coefficient between the first dynamic routing rule feature and the second dynamic routing rule feature through the first matching coefficient and the second matching coefficient; in response to the first involvement coefficient being greater than a first specified threshold, determining that the assembly distribution template of the first business message event and the assembly distribution template of the second business message event are related.

[0053] Preferably, the first push channel description information of the first business message event includes the third push channel description information of each first business message event group in the first business message event, and the second push channel description information of the second business message event includes the fourth push channel description information of each second business message event group in the second business message event, and each first business message event group corresponds to a second business message event group. Based on this, the determination of the second involvement coefficient between the first push channel description information and the second push channel description information includes: respectively determining the involvement coefficient between the third push channel description information of each first business message event group and the fourth push channel description information of the second business message event group corresponding to each first business message event group, to obtain a plurality of fifth involvement coefficients; and determining the average of the involvement coefficients of the plurality of fifth involvement coefficients as the second involvement coefficient between the first push channel description information and the second push channel description information.

[0054] In some optional embodiments, the method also includes: determining whether the first business message event and the second business message event are associated business message events through a residual network based on the first push channel description information, the first dynamic routing rule characteristics, the second push channel description information and the second dynamic routing rule characteristics.

[0055] Apply the above embodiment, write SQL scripts based on actual business scenarios, configure the dynamic routing rules of the event for messages, Groovy-based message templates, retry mechanisms, and message push channels; an event will map different message types and message contents according to different scenarios and conditions. A business operation itself can be an event, and R&D personnel only need to write simple code to push the event and push the event to the subscription center. Based on the high degree of configuration of the subscription center, R&D personnel can complete message push of various types and templates by configuring message routing, assembly, and distribution to the subscription center. In contrast, based on the functional development of the subscription center, the system complexity can be greatly reduced, and message push is more flexible.

[0056] Based on the same inventive concept, a computer-readable storage medium is also provided, on which a program is stored, and when the program is executed by a processor, the above method is implemented.

[0057] Based on the same inventive concept, please refer to Figure 2 , a message assembly and distribution processing system 200 is also provided, including a processor 210 and a memory 220; the processor 210 and the memory 200 are communicatively connected, and the processor 210 is used to read and execute a computer program from the memory 220 to implement the above method.

[0058] The algorithm and display provided herein are not inherently related to any particular computer, virtual system or other device. Various general purpose systems can also be used together with the teachings based on this. According to the above description, it is obvious that the structure required for constructing such systems. In addition, the application is not directed to any specific programming language either. It should be understood that various programming languages ​​can be utilized to realize the content of the application described herein, and the description of the specific language above is for the purpose of disclosing the best mode of implementation of the application.

[0059] In the description provided herein, a large number of specific details are described. However, it is understood that the embodiments of the present application can be practiced without these specific details. In some instances, well-known methods, structures and techniques are not shown in detail so as not to obscure the understanding of the present application.

[0060] The various component embodiments of the present application may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. It should be understood by those skilled in the art that a microprocessor or a digital signal processor (DSP) may be used in practice to implement some or all functions of some or all components of a gateway, a proxy server, or a system according to an embodiment of the present application. The present application may also be implemented as a device or apparatus program (e.g., a computer program and a computer program product) for executing part or all of the methods described herein. Such a program implementing the present application may be stored on a computer-readable medium, or may be in the form of one or more signals. Such a signal may be downloaded from an Internet website, or provided on a carrier signal, or provided in any other form.

[0061] The above description is only the preferred embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A message assembly and distribution processing method based on artificial intelligence, characterized in that: Applied to a message assembly distribution processing system, the method comprises: Acquire a first dynamic routing rule feature and a first push channel description information of a first business message event, and acquire a second dynamic routing rule feature and a second push channel description information of a second business message event; Determine whether the assembly distribution template of the first business message event and the assembly distribution template of the second business message event are related through the first dynamic routing rule feature and the second dynamic routing rule feature, and determine whether the message push distribution preference of the first business message event and the message push distribution preference of the second business message event are related through the first push channel description information and the second push channel description information; In response to the fact that the assembly distribution template of the first business message event is related to the assembly distribution template of the second business message event and the message push distribution preference of the first business message event is related to the message push distribution preference of the second business message event, determining that the first business message event and the second business message event are associated business message events; The determining, by using the first dynamic routing rule feature and the second dynamic routing rule feature, whether the assembly distribution template of the first service message event and the assembly distribution template of the second service message event are related includes: determining a first involvement coefficient between the first dynamic routing rule characteristic and the second dynamic routing rule characteristic; In response to the first involvement coefficient being greater than a first specified threshold, determining that the assembly distribution template of the first service message event is related to the assembly distribution template of the second service message event; The determining, through the first push channel description information and the second push channel description information, whether the message push distribution preference of the first service message event and the message push distribution preference of the second service message event are related includes: determining a second involvement coefficient between the first push channel description information and the second push channel description information; In response to the second involvement coefficient being greater than a second specified threshold, determining that the message push distribution preference of the first service message event is related to the message push distribution preference of the second service message event; The first dynamic routing rule feature includes a first script feature and a first routing update time in the first service message event, and the second dynamic routing rule feature includes a second script feature and a second routing update time in the second service message event; The determining, by using the first dynamic routing rule feature and the second dynamic routing rule feature, whether the assembly distribution template of the first service message event and the assembly distribution template of the second service message event are related includes: Determining a first matching coefficient between the first service message event and the second service message event according to the first script feature and the second script feature; Determine a second pairing coefficient between the first service message event and the second service message event according to the first route update time and the second route update time; Determining a first involvement coefficient between the first dynamic routing rule feature and the second dynamic routing rule feature through the first pairing coefficient and the second pairing coefficient; In response to the first involvement coefficient being greater than a first specified threshold, determining that the assembly distribution template of the first service message event is related to the assembly distribution template of the second service message event; The first push channel description information of the first business message event includes the third push channel description information of each first business message event group in the first business message event, and the second push channel description information of the second business message event includes the fourth push channel description information of each second business message event group in the second business message event, and each first business message event group corresponds to one second business message event group; The determining a second involvement coefficient between the first push channel description information and the second push channel description information includes: Respectively determine the involvement coefficients between the third push channel description information of each first service message event group and the fourth push channel description information of the second service message event group corresponding to each first service message event group, to obtain a plurality of fifth involvement coefficients; An average of the fifth involvement coefficients is determined as a second involvement coefficient between the first push channel description information and the second push channel description information.

2. The method according to claim 1, characterized in that The assembly distribution template in response to the first business message event is related to the assembly distribution template of the second business message event and the message push distribution preference of the first business message event is related to the message push distribution preference of the second business message event, then determining that the first business message event and the second business message event are associated business message events includes: Determining a third involvement coefficient between the first service message event and the second service message event by using the first involvement coefficient and the second involvement coefficient; In response to the third involvement coefficient being greater than a third specified threshold, it is determined that the first service message event and the second service message event are associated service message events.

3. The method according to claim 1, characterized in that The first dynamic routing rule feature includes a third dynamic routing rule feature of each first business scenario node in the first business message event, the second dynamic routing rule feature includes a fourth dynamic routing rule feature of each second business scenario node in the second business message event, and each first business scenario node corresponds to a second business scenario node; The step of obtaining a first dynamic routing rule feature of a first service message event and obtaining a second dynamic routing rule feature of a second service message event includes: The first service message event and the second service message event are updated respectively to obtain a first updated service message event and a second updated service message event; Respectively dividing the first updated service message event and the second updated service message event into a plurality of first service scenario nodes and a plurality of second service scenario nodes; The third dynamic routing rule feature of each first business scenario node and the fourth dynamic routing rule feature of the second business scenario node corresponding to each first business scenario node are respectively obtained.

4. The method according to claim 3, characterized in that The determining a first involvement coefficient between the first dynamic routing rule feature and the second dynamic routing rule feature comprises: Respectively determine the involvement coefficients between the third dynamic routing rule feature of each first business scenario node and the fourth dynamic routing rule feature of the second business scenario node corresponding to each first business scenario node, to obtain a plurality of fourth involvement coefficients; An average of the plurality of fourth involvement coefficients is determined as a first involvement coefficient between the first dynamic routing rule feature and the second dynamic routing rule feature.

5. The method according to claim 1, characterized in that The method further comprises: Through the first push channel description information, the first dynamic routing rule characteristics, the second push channel description information and the second dynamic routing rule characteristics, it is determined through a residual network whether the first business message event and the second business message event are associated business message events.

6. A message assembly and distribution processing system, characterized in that: It comprises a processor and a memory; the processor and the memory are communicatively connected, and the processor is used to read a computer program from the memory and execute it to implement the method described in any one of claims 1 to 5.

7. A computer-readable storage medium, characterized in that: A program is stored thereon, and when the program is executed by a processor, the method described in any one of claims 1 to 5 is implemented.

Images