A task sequence adjustment method, device, equipment and storage medium

Abstract

The present application relates to a kind of adjustment method, device, equipment and storage medium of task sequence, comprising: when obtaining the adjustment instruction of user to at least one original task sequence, based on the above adjustment instruction and the dependency relationship between each operation event node carried in original operation log, the operation of automatically expanding and / or shrinking task sequence is executed to unadjusted original task sequence.The present application can be based on the adjustment instruction of one or more original task sequence of user, thereby realizing the automatic adjustment of unadjusted original task sequence, can greatly improve the efficiency of automation, reduce manual intervention.

Description

Technical Field

[0001] This invention relates to the field of information processing technology, and specifically to methods, apparatus, devices, and storage media for adjusting task sequences. Background Technology

[0002] In task mining products, multiple task sequences can be automatically generated based on raw operation logs. In practical applications, users often need to adjust these automatically generated task sequences, such as adding or deleting one or more operation event nodes at the beginning or end of a sequence. Manually adjusting these multiple task sequences is inefficient and requires significant human intervention.

[0003] Therefore, in the existing technology, there is a need for a method to automatically adjust the remaining task sequences based on the user's adjustment of one task sequence, in order to improve the efficiency of automation and reduce human intervention. Summary of the Invention

[0004] This invention overcomes the shortcomings of the prior art and provides a method, apparatus, device and storage medium for adjusting task sequences. It discloses a method for automatically adjusting other task sequences based on user adjustments to one task sequence, thereby improving automation efficiency and reducing manual intervention.

[0005] To achieve the above objectives, the technical solution adopted by the present invention is: a method for adjusting a task sequence, comprising: Obtain multiple raw task sequences and corresponding raw operation logs to characterize computer desktop operations; wherein, the raw task sequence is a time series composed of operation event nodes, and the raw task sequence is extracted from the raw operation log; Obtain adjustment instructions from the user for at least one of the original task sequences; wherein the adjustment instructions include instructions to expand the task sequence and / or shrink the task sequence; Based on the aforementioned adjustment instructions and the dependencies between the various operation event nodes carried in the original operation log, the operation of expanding and / or shrinking the task sequence is performed on the unadjusted original task sequence.

[0006] In a preferred embodiment of the present invention, the instruction for extending the task sequence includes information representing a first target operation event node, wherein the first target operation event node is a node of a sub-task sequence that is extended into the original task sequence; When the adjustment instruction is an instruction to extend the task sequence, based on the aforementioned adjustment instruction and the dependencies between the various operation event nodes carried in the original operation log, the step of extending the unadjusted original task sequence includes: Based on the extended task sequence instructions and the original operation log, determine whether there is at least one first target operation event node outside the corresponding end of the unadjusted original task sequence and within one or more time windows; In the case where there is at least one first target operation event node in the instructions of the extended task sequence within one or more time windows, based on the dependency relationship between each operation event node carried in the original operation log, it is determined whether the first target operation event node has a dependency relationship with each operation event node in the unadjusted original task sequence. If the first target node has a dependency relationship with at least one operation event node in the unadjusted original task sequence, the first target operation event node and the operation event nodes between the first target operation event node and the unadjusted original task sequence are all included in the unadjusted original task sequence according to their temporal relationship based on the original operation log.

[0007] In a preferred embodiment of the present invention, the instruction for shrinking the task sequence includes information representing a second target operation event node, wherein the second target operation event node is a node of a sub-task sequence that has been removed from the original task sequence; When the adjustment instruction is a shrinking task sequence instruction, the steps of performing the shrinking task sequence operation on the unadjusted original task sequence based on the above adjustment instruction and the dependencies between the various operation event nodes carried in the original operation log include: Based on the shrinking task sequence instruction and the original operation log, determine whether there is at least one second target operation event node within one or more time windows at the corresponding end of the unadjusted original task sequence. In the case that there is at least one second target operation event node in the instructions of the shrinking task sequence within one or more time windows, based on the dependency relationship between the operation event nodes carried in the original operation log, it is determined whether the second target operation event node has a dependency relationship with the remaining operation event nodes from the second target operation event node to one end of the unadjusted original task sequence; wherein, the one end corresponds to the shrinking task sequence instruction. If the second target operation event node has dependencies on all the other operation event nodes, then the second target operation event node and the other operation event nodes are removed from the unadjusted original task sequence.

[0008] In a preferred embodiment of the present invention, the information representing the first target operation event node and the information representing the second target operation event node include at least information representing the window title or information representing the page title.

[0009] In a preferred embodiment of the present invention, the time window is half a minute or one minute.

[0010] In a preferred embodiment of the present invention, when acquiring multiple original task sequences and corresponding original operation logs for characterizing computer desktop operations, or when acquiring user adjustment instructions for at least one of the task sequences, the method further includes: Using the original operation log as input to a preset process mining algorithm, the process mining algorithm calculates the dependency relationships of each operation event node in the original operation log; wherein, the dependency relationship is represented as having a dependency or not having a dependency.

[0011] In a preferred embodiment of the present invention, multiple original task sequences used to characterize computer desktop operations are automatically extracted from the original operation logs by a process mining algorithm; or are extracted from the original operation logs manually.

[0012] In a preferred embodiment of the present invention, a task sequence adjustment device includes: The first acquisition module is used to acquire multiple original task sequences and corresponding original operation logs that characterize computer desktop operations; wherein, the original task sequence is a time sequence composed of operation event nodes, and the original task sequence is extracted from the original operation log; The second acquisition module is used to acquire adjustment instructions from the user for at least one of the original task sequences; wherein the adjustment instructions include instructions to expand the task sequence and / or shrink the task sequence; The automatic adjustment module is used to perform operations to expand and / or shrink the original task sequence based on the adjustment instructions mentioned above and the dependencies between the various operation event nodes carried in the original operation log.

[0013] In a preferred embodiment of the present invention, an apparatus includes: a memory; a processor; and a computer program; wherein the computer program is stored in the memory and configured to be executed by the processor to implement a method for adjusting a task sequence.

[0014] In a preferred embodiment of the present invention, a storage medium is provided on which a computer program is stored, wherein the computer program, when executed by a processor, implements a method for adjusting a task sequence.

[0015] A storage medium having a computer program stored thereon, which, when executed by a processor, implements a method for adjusting a task sequence.

[0016] This invention addresses the shortcomings of the prior art, and its beneficial effects are as follows: This invention proposes a method, apparatus, device, and storage medium for adjusting task sequences. Upon receiving adjustment instructions from a user for at least one original task sequence, the method automatically expands and / or shrinks the unadjusted original task sequence based on these instructions and the dependencies between various operation event nodes carried in the original operation log. This invention can automatically adjust unadjusted original task sequences based on user adjustment instructions for one or more original task sequences, significantly improving automation efficiency and reducing manual intervention. Attached Figure Description

[0017] The present invention will be further described below with reference to the accompanying drawings and embodiments.

[0018] Figure 1 This is a schematic diagram illustrating a scenario example provided in an embodiment of the present invention; Figure 2 This is a flowchart of a task sequence adjustment method provided in an embodiment of the present invention; Figure 3 This is a block diagram of a task sequence adjustment device provided in an embodiment of the present invention; Figure 4 This is a block diagram of an electronic device provided in an embodiment of the present invention. Detailed Implementation

[0019] The present invention will now be described in further detail with reference to the accompanying drawings and embodiments. These drawings are simplified schematic diagrams, which are only used to illustrate the basic structure of the present invention and therefore only show the components relevant to the present invention.

[0020] Before detailing the embodiments of the present invention, a specific scenario example is given to illustrate the scenarios in which the technical solution of the present invention can be used. Specifically, Figure 1 This is an application scenario diagram of the task sequence adjustment method, apparatus, device and storage medium of the present invention. The application scenario may include: server and client.

[0021] The aforementioned server can be an electronic device with a certain computing power. For example, a server can be a distributed system server, or a system with multiple processors, memory, network communication modules, etc., working together. A server can also be a cloud server, or an intelligent cloud computing server or intelligent cloud host with artificial intelligence technology. A server can also be a server cluster formed by several servers. Alternatively, with the development of science and technology, a server can also be a new technological means capable of realizing the corresponding functions of the implementation method described in the specification. For example, it can be a new form of "server" based on quantum computing.

[0022] The aforementioned client can be an electronic device with network access capabilities. Specifically, for example, the client can be a desktop computer, tablet computer, laptop computer, etc. Alternatively, the client can also be software that can run on the electronic device.

[0023] The aforementioned server and client interact via a network. This network can be of any type and can use any of the available protocols (including but not limited to TCP / IP, SNA, IPX, etc.) to support data communication. One or more networks can be a Local Area Network (LAN), an Ethernet-based network, a Token Ring network, a Wide Area Network (WAN), the Internet, a Virtual Network, a Virtual Private Network (VPN), an Intranet, an Extranet, the Public Switched Telephone Network (PSTN), an Infrared network, a Wireless Network (e.g., Bluetooth, Wi-Fi), and / or any combination of these and / or other networks.

[0024] Furthermore, this application scenario can also include a database, which can store pre-collected raw operation logs. The database and the server can interact via the aforementioned network. It should be noted that the task sequence adjustment method disclosed in this invention can generally be executed by the aforementioned server, and the corresponding task sequence adjustment device can also be configured within the aforementioned server. Example 1

[0025] like Figure 2 As shown, a task sequence adjustment method, which can be applied to the aforementioned server, includes: Step S100: Obtain multiple original task sequences and corresponding original operation logs used to characterize computer desktop operations; wherein, the original task sequence is a time series composed of operation event nodes, and the original task sequence is extracted from the original operation logs.

[0026] In this embodiment, the aforementioned raw operation log is obtained by collecting user computer desktop operations through a dataset collector deployed on the user terminal. The raw operation log stores multiple log records, each representing an operation event within the desktop operations. Each log record, or each operation event node, can be configured with multiple fields, such as fields storing the window title or page title, fields storing the timestamp, fields storing the event type, and fields storing element tags or names, etc. It should be noted that in this invention, operation events and operation event nodes actually refer to the same concept, simply different expressions of the same concept. For example, a log record stored in the raw operation log represents an operation event, and an operation event node in the original task sequence also represents an operation event, and the corresponding log record can be found in the raw operation log.

[0027] The aforementioned original task sequence is a time series consisting of one or more task-related operation event nodes. This original task sequence is extracted from the original operation logs, either automatically or manually by the user. For example, in a task mining product, it can be automatically extracted from the original operation logs based on a pre-configured process mining algorithm and then recommended to the user.

[0028] The aforementioned original task sequence and multiple original task sequences used to characterize computer desktop operations can be stored in a database. Therefore, the aforementioned retrieval action represents data interaction between the server and the database to retrieve the aforementioned original task sequence and multiple original task sequences used to characterize computer desktop operations.

[0029] Step S200: Obtain adjustment instructions from the user for at least one of the original task sequences; wherein the adjustment instructions include instructions to expand the task sequence and / or shrink the task sequence.

[0030] In this embodiment, the aforementioned extended task sequence refers to extending one or both ends of the original task sequence in the time series, such that the extended task sequence can accommodate more operation event nodes compared to the original task sequence. The aforementioned contracted task sequence refers to contracting one or both ends of the task sequence in the time series, such that the contracted task sequence can only accommodate fewer operation event nodes compared to the original task sequence.

[0031] In this embodiment, the instruction to expand the task sequence includes information representing a first target operation event node, which is a node of a sub-task sequence that is expanded into the original task sequence. The instruction to shrink the task sequence includes information representing a second target operation event node, which is a node of a sub-task sequence that is removed from the original task sequence.

[0032] In this embodiment, the information representing the first target operation event node and the information representing the second target operation event node may be the information carried by the first target operation event node and the information carried by the second target operation event node, such as the window title or page title of the operation event node, or the event type, element name, element tag, etc.

[0033] It is understood that, in this embodiment, the aforementioned adjustment instructions may include instructions to expand the task sequence at the beginning or end of the original task sequence, or instructions to expand the task sequence at both the beginning and end of the original task sequence. Correspondingly, the aforementioned adjustment instructions may include instructions to shrink the task sequence at the beginning or end of the original task sequence, or instructions to shrink the task sequence at both the beginning and end of the original task sequence.

[0034] It is also understood that, in this embodiment, the aforementioned adjustment instructions may also include instructions for expanding the task sequence at one end of the original task sequence and instructions for shrinking the task sequence at the other end.

[0035] Step S300: Based on the above adjustment instructions and the dependencies between the various operation event nodes carried in the original operation log, perform automatic expansion and / or contraction of the task sequence on the unadjusted original task sequence.

[0036] For the sake of brevity and clarity, the original task sequence that is actively modified by the user can be referred to as the first original task sequence, and the original task sequence that is automatically modified can be referred to as the second original task sequence. It is understood that the automatic expansion operation on the second original task sequence should be based on the instructions for expanding the task sequence and the aforementioned dependencies; correspondingly, the automatic contraction operation on the second original task sequence should be based on the instructions for contracting the task sequence and the aforementioned dependencies.

[0037] It is also understandable that, based on the instructions for extending the task sequence at the beginning of the first original task sequence and the aforementioned dependencies, the beginning or end of the second original task sequence can be automatically extended, or both ends can be automatically extended. Similarly, based on the instructions for extending the task sequence at the end of the first original task sequence and the aforementioned dependencies, the beginning or end of the second original task sequence can be automatically extended, or both ends can be automatically extended.

[0038] It is also understandable that, based on the instruction to shrink the task sequence at the beginning of the first original task sequence and the aforementioned dependencies, the beginning or end of the second original task sequence can be automatically shrunk, or both ends can be automatically shrunk. Similarly, based on the instruction to shrink the task sequence at the end of the first original task sequence and the aforementioned dependencies, the beginning or end of the second original task sequence can be automatically shrunk, or both ends can be automatically shrunk.

[0039] In this embodiment, the dependencies between the various operation events expressed in the original operation log can be extracted in step S100, i.e., when the original operation log is obtained. Alternatively, in step S200, the dependencies between the various operation events in the original operation log can be extracted only when the user's instruction to expand and / or shrink at least one of the task sequences is received.

[0040] The aforementioned dependencies can be extracted using process mining algorithms, such as the HeuristicsMiner algorithm, or sequence model mining algorithms, such as PrefixSpan. Specifically, when using the HeuristicsMiner algorithm with the original operation log as input, it automatically discovers the dependencies between operation events and generates a process model. This model can then be used to interpret and analyze the dependencies between operation events. Furthermore, the strength and direction of dependencies can be determined based on structures such as connections, parallelism, and selection within the model. In this implementation, only the presence of a dependency between two events needs to be considered; the specific strength and direction of the dependency can be disregarded. More specifically, the original operation log is first preprocessed. For example, operation events with the same window title or page title can be grouped together to reduce the dimensionality of data analysis. Then, a dependency matrix is ​​constructed based on the preprocessed original operation log. The rows and columns of the matrix represent different operation events, and the elements in the matrix indicate whether a dependency exists between two operation events. Finally, dependency mining involves traversing the dependency matrix and determining whether a dependency exists between two operation events based on certain rules or thresholds. For example, a threshold can be defined: if the frequency of co-occurrence between two operation events exceeds the threshold, they are considered to have a dependency relationship.

[0041] In some implementations, when the adjustment instruction is an instruction to expand the task sequence, the step of automatically expanding and / or shrinking the task sequence on the unadjusted original task sequence based on the adjustment instruction and the dependencies between the various operation event nodes carried in the original operation log may include: Step S301: Based on the extended task sequence instructions and the original operation log, determine whether there is at least one first target operation event node outside the corresponding end of the unadjusted original task sequence and within one or more time windows.

[0042] The aforementioned corresponding end refers to the end corresponding to the extended task sequence instruction. Specifically, if the extended task sequence instruction is an extension of the beginning of the first original task sequence, then in this embodiment, it is necessary to determine whether at least one first target operation event node exists outside the beginning of the second original task sequence within one or more time windows. More specifically, for example, the extended task sequence instruction is an extension of the task sequence to the beginning of the first original task sequence, where the sub-task sequence extended into the first original task sequence can be [A, B, C], where A, B, and C all represent operation event nodes and each carries a timestamp. Therefore, there is a temporal relationship between the operation event nodes. In this step, it is only necessary to determine whether A, B, or C exists outside the beginning of the second original task sequence within one or more time windows. In some cases, it can also be determined whether all three first target operation event nodes, A, B, and C, exist simultaneously outside the beginning of the second original task sequence within one or more time windows. If at least one first target operation event node exists, then proceed to step S302 and execute the processing of step S302. If it does not exist, the method ends, indicating that the second original task sequence does not have a basis for automatic adjustment. Further, in this embodiment, the criterion for determining whether a first target operation event node exists outside the beginning of the second original task sequence and within one or more time windows is: the existence of an operation event node with the same window title or page title as the first target operation event node within one or more time windows. That is, if an operation event node has the same window title or page title as the first target operation event node, it is defined as existing. In some cases, considering finer-grained matching, if the window title or page title is the same, it can be further determined that the element label or name is also the same. The window title or page title of the first target operation event exists in the instructions of the extended task sequence.

[0043] This implementation introduces the concept of a time window. Specifically, for a given task, different users may have different execution methods. Furthermore, in most cases, a person's desktop behavior over a longer timescale, such as a day, often exhibits irregularity. For example, some users might relax by chatting on chat software or browsing news after handling work-related tasks for a period. However, user behavior over a shorter timescale often shows similarities and regularities, such as half a minute or a minute. In this implementation, the search for the first target operation event node is performed at the beginning or end of the second original task sequence (specifically, whether it's the beginning or end, depends on the extended task sequence instructions) within one or more time windows. This search method considers the actual user operation and, compared to searching from a fixed number of operation events outside the beginning or end of the second original task sequence, the time window-based method is more flexible and robust.

[0044] In this embodiment, the search for the existence of the first target operation event node at the beginning or end of the second original task sequence can specifically be as follows: First, based on the second original task sequence, locate the log record corresponding to the second original task sequence from the original operation log. Then, search outwards from the beginning or end of the log record for the existence of the first target operation event node. Searching outwards from the beginning of the log record means: starting from the log record corresponding to the operation event node at the beginning of the second original task sequence, searching for log records with earlier timestamps in the temporal sequence. Similarly, searching outwards from the end of the log record means: starting from the log record corresponding to the operation event node at the beginning of the second original task sequence, searching for log records with later timestamps in the temporal sequence.

[0045] In this implementation, whether it is one time window or multiple time windows can be determined by the following method: A maximum time window threshold can be preset, for example, 5. That is, if the first target operation event node is not found within 5 time windows, the search stops. If the aforementioned operation event node A is found within the first time window, the search can stop and proceed directly to step S302. Alternatively, the search can continue until 5 time windows have passed, determining whether there are operation event nodes B or C.

[0046] Step S302: If at least one first target operation event node is present in the instructions of the extended task sequence within one or more time windows, based on the dependency relationship between the operation event nodes carried in the original operation log, determine whether the first target operation event node has a dependency relationship with each operation event node in the unadjusted original task sequence.

[0047] In this embodiment, the Heuristic Miner algorithm can be used beforehand to mine the dependencies between various operation event nodes in the original operation log. These dependencies can be represented as either dependent or non-dependent. In this embodiment, determining whether the first target operation event node has a dependency on any operation event node in the unadjusted original task sequence can be done by determining whether the first target operation event node has a dependency on any operation event in the second original task sequence (i.e., the unadjusted original task sequence, as described above, is a simplified representation of the unadjusted original task sequence). If it has a dependency on at least one operation event, proceed to step S303; otherwise, end the process, indicating that the second original task sequence is not suitable for automatic adjustment. In some embodiments, it can also be done by determining whether the first target operation event node has a dependency on all operation events in the second original task sequence. Proceed to step S303 if and only if the first target operation event node has a dependency on all operation events; otherwise, end the process. This method considers the dependencies between the first target operation event node and all operation events in the second original task sequence, thus having higher reliability. Correspondingly, the number of sequences in the second original task sequence that can be automatically adjusted is also reduced.

[0048] Step S303: When the first target node has a dependency relationship with at least one operation event node in the unadjusted original task sequence, based on the original operation log, the first target operation event node and the operation event nodes between the first target operation event node and the unadjusted original task sequence are all included in the unadjusted original task sequence according to their temporal relationship.

[0049] In this embodiment, when the beginning of the second original task sequence is automatically adjusted, the above-mentioned method of accommodating the first target operation event node and the operation event nodes between the first target operation event node and the unadjusted original task sequence according to their temporal order based on the original operation log is expressed as follows: Locate the log record corresponding to the first target operation event node in the original operation log, and then accommodate all log records between this log record and the log record corresponding to the operation event node at the beginning of the second original task sequence (these log records exist in the original task sequence) into the second original task sequence, thereby achieving automatic expansion of the beginning of the second original task sequence. It should be noted that this must be done according to the temporal order; that is, if the temporal order of the accommodated operation event nodes in the original operation log is A→B→C, then when accommodating the above three operation event nodes at the beginning of the second original task sequence, the temporal order should also be A→B→C.

[0050] Accordingly, when the tail of the second original task sequence is automatically adjusted, the above-mentioned method of accommodating the first target operation event node and the operation event nodes between the first target operation event node and the unadjusted original task sequence according to the time sequence relationship in the original operation log is expressed as follows: locate the log record corresponding to the first target operation event node in the original operation log, and then accommodate the log records between the log record corresponding to the operation event node at the tail of the second original task sequence (which exist in the original task sequence) into the second original task sequence, thereby realizing the automatic expansion of the tail of the second original task sequence.

[0051] Similarly, when both ends of the second original task sequence are automatically adjusted simultaneously, the execution process is as described above.

[0052] In some implementations, when the adjustment instruction is a shrinking task sequence instruction, the steps of automatically expanding and / or shrinking the unadjusted original task sequence based on the adjustment instruction and the dependencies between the various operation event nodes carried in the original operation log include: Step S311: Based on the shrinking task sequence instruction and the original operation log, determine whether there is at least one second target operation event node within one or more time windows at the corresponding end of the unadjusted original task sequence.

[0053] As described in the above implementation, one end of step S311 requires the shrinking task sequence instruction; how exactly this corresponds is not elaborated here.

[0054] It should be noted that in step S311, "within one end" refers to the second original task sequence (that is, the unadjusted original task sequence, as described above, the second original task sequence is a simplified expression of the unadjusted original task sequence). Accordingly, the above determination of whether there is at least one second target operation event node within one end of the unadjusted original task sequence and within one or more time windows means searching for the existence of a second target operation event node within the second original task sequence, starting from one end of the second original task sequence and using the time window as the search step size.

[0055] Step S312: If at least one second target operation event node is present in the instructions of the shrinking task sequence within one or more time windows, determine whether the second target operation event node has a dependency relationship with the remaining operation event nodes from the second target operation event node to one end of the unadjusted original task sequence based on the dependency relationship between the operation event nodes carried in the original operation log; wherein, the one end corresponds to the shrinking task sequence instruction.

[0056] Step S313: If the second target operation event node has a dependency relationship with the other operation event nodes, delete the second target operation event node and the other operation event nodes from the unadjusted original task sequence.

[0057] It should be noted that this implementation removes the second target operation event node and the remaining operation event nodes from the unadjusted original task sequence when both are dependent on each other. Specifically, expanding and shrinking task sequences are different. For a task sequence, any sequence is valid only if the task is completed. There may be multiple execution processes and paths, but as long as the task is completed, it is a valid task sequence, though not necessarily the optimal one. Conversely, if any sequence cannot complete the task, it is not a valid, let alone optimal, task sequence. Therefore, when shrinking a task sequence, removing the second target operation event node and the remaining operation event nodes from the unadjusted original task sequence when both are dependent on each other provides higher reliability. Example 2

[0058] like Figure 3 As shown, based on Embodiment 1, this embodiment provides a task sequence adjustment device, including: The first acquisition module is used to acquire multiple original task sequences and corresponding original operation logs that characterize computer desktop operations; wherein, the original task sequence is a time sequence composed of operation event nodes, and the original task sequence is extracted from the original operation log; The second acquisition module is used to acquire adjustment instructions from the user for at least one of the original task sequences; wherein the adjustment instructions include instructions to expand the task sequence and / or shrink the task sequence; The automatic adjustment module is used to automatically expand and / or shrink the original task sequence based on the adjustment instructions mentioned above and the dependencies between the various operation event nodes carried in the original operation log. Example 3

[0059] like Figure 4 As shown, based on Embodiment 1, this embodiment provides a device, including a memory; a processor; and a computer program; wherein the computer program is stored in the memory and configured to be executed by the processor to implement the method described in Embodiment 1: acquiring multiple original task sequences and corresponding original operation logs for characterizing computer desktop operations; wherein the original task sequences are time series composed of operation event nodes, and the original task sequences are extracted from the original operation logs; acquiring user adjustment instructions for at least one of the original task sequences; wherein the adjustment instructions include instructions to expand and / or shrink the task sequences; and performing automatic expansion and / or shrinkage of the task sequences on the unadjusted original task sequences based on the above adjustment instructions and the dependencies between the various operation event nodes carried in the original operation logs. Example 4

[0060] Based on Embodiment 1, this embodiment provides a storage medium storing a computer program. When the computer program is executed by a processor, it implements the method described in Embodiment 1: acquiring multiple original task sequences and corresponding original operation logs characterizing computer desktop operations; wherein the original task sequences are time series composed of operation event nodes, and the original task sequences are extracted from the original operation logs; acquiring user adjustment instructions for at least one of the original task sequences; wherein the adjustment instructions include instructions to expand and / or shrink the task sequences; based on the above adjustment instructions and the dependencies between the various operation event nodes carried in the original operation logs, automatically expanding and / or shrinking the task sequences are performed on the unadjusted original task sequences. Example 5

[0061] Based on Embodiment 1, this embodiment also provides a computer program product containing instructions that, when executed by a computer, cause the computer to perform a task sequence adjustment method as described in Embodiment 1.

[0062] It is understood that the specific examples in this document are only intended to help those skilled in the art better understand the embodiments described herein, and are not intended to limit the scope of the invention.

[0063] It is understood that in the various embodiments described in this specification, the sequence number of each process does not imply the order of execution. The execution order of each process should be determined by its function and internal logic. This should not be construed as limiting the implementation process of the embodiments described in this specification.

[0064] It is understood that the various implementation methods described in this specification can be implemented individually or in combination, and the implementation methods in this specification are not limited in this respect.

[0065] Unless otherwise stated, all technical and scientific terms used in the embodiments of this specification have the same meaning as commonly understood by one of ordinary skill in the art. The terminology used in this specification is for the purpose of describing particular embodiments only and is not intended to limit the scope of this specification.

[0066] The term “and / or” as used in this specification includes any and all combinations of one or more of the associated listed items. The singular forms “a,” “the,” and “the” as used in the embodiments of this specification and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise.

[0067] It is understood that the processor in the embodiments of this specification can be an integrated circuit chip with signal processing capabilities. In implementation, each step of the above method embodiments can be completed by integrated logic circuits in the processor's hardware or by instructions in software form. The processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this specification. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this specification can be directly implemented by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above methods.

[0068] It is understood that the memory in the embodiments of this specification may be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. Non-volatile memory may be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. Volatile memory may be random access memory (RAM). It should be noted that the memory in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0069] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this specification.

[0070] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the aforementioned method implementations, and will not be repeated here.

[0071] In the several embodiments provided in this specification, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0072] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment, depending on actual needs.

[0073] In addition, the functional units in the various embodiments of this specification can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0074] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of this specification, in essence, or the parts that contribute to the prior art, or parts of the technical solutions, can be embodied in the form of software products. These computer software products are stored in a storage medium and include several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this specification. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0075] Based on the preferred embodiments of the present invention described above, those skilled in the art can make various changes and modifications without departing from the inventive concept. The technical scope of this invention is not limited to the contents of the specification, but must be determined according to the scope of the claims.

Claims

1. A method for adjusting a task sequence, characterized in that, include: Obtain multiple raw task sequences and corresponding raw operation logs to characterize computer desktop operations; wherein, the raw task sequence is a time series composed of operation event nodes, and the raw task sequence is extracted from the raw operation log; Obtain adjustment instructions from the user for at least one of the original task sequences; wherein the adjustment instructions include instructions to expand the task sequence and / or shrink the task sequence; The instructions for extending the task sequence include information representing a first target operation event node, which is a node of a sub-task sequence that is extended into the original task sequence. The instruction to shrink the task sequence includes information representing a second target operation event node, which is a node of a sub-task sequence that has been removed from the original task sequence; Based on the above adjustment instructions and the dependencies between the various operation event nodes carried in the original operation log, the operation of expanding and / or shrinking the task sequence is performed on the unadjusted original task sequence. When the adjustment instruction is an instruction to extend the task sequence, based on the extended task sequence instruction and the original operation log, it is determined whether there is at least one first target operation event node outside the corresponding end of the unadjusted original task sequence and within one or more time windows. In the case where there is at least one first target operation event node in the instructions of the extended task sequence within one or more time windows, based on the dependency relationship between each operation event node carried in the original operation log, it is determined whether the first target operation event node has a dependency relationship with each operation event node in the unadjusted original task sequence. If the first target operation event node has a dependency relationship with at least one operation event node in the unadjusted original task sequence, the first target operation event node and the operation event nodes between the first target operation event node and the unadjusted original task sequence are all included in the unadjusted original task sequence according to their temporal relationship based on the original operation log. When the adjustment instruction is a shrinking task sequence instruction, based on the shrinking task sequence instruction and the original operation log, it is determined whether there is at least one second target operation event node within one or more time windows at the corresponding end of the unadjusted original task sequence. In the case that there is at least one second target operation event node in the instructions of the shrinking task sequence within one or more time windows, based on the dependency relationship between the operation event nodes carried in the original operation log, it is determined whether the second target operation event node has a dependency relationship with the remaining operation event nodes from the second target operation event node to one end of the unadjusted original task sequence; wherein, the one end corresponds to the shrinking task sequence instruction. If the second target operation event node has dependencies on all the other operation event nodes, then the second target operation event node and the other operation event nodes are removed from the unadjusted original task sequence.

2. The task sequence adjustment method according to claim 1, characterized in that, The information representing the first target operation event node and the information representing the second target operation event node include at least information representing the window title or information representing the page title.

3. The task sequence adjustment method according to claim 2, characterized in that, The time window is half a minute or one minute.

4. The task sequence adjustment method according to claim 1, characterized in that, When acquiring multiple raw task sequences and corresponding raw operation logs used to characterize computer desktop operations, or when acquiring user adjustment instructions for at least one of the task sequences, the method further includes: Using the original operation log as input to a preset process mining algorithm, the process mining algorithm calculates the dependency relationships of each operation event node in the original operation log; wherein, the dependency relationship is represented as having a dependency or not having a dependency.

5. The method for adjusting the task sequence according to claim 1, characterized in that, The multiple original task sequences used to characterize computer desktop operations are automatically extracted from the original operation logs by a process mining algorithm; or they are extracted from the original operation logs manually.

6. A task sequence adjustment device, characterized in that, include: The first acquisition module is used to acquire multiple original task sequences and corresponding original operation logs that characterize computer desktop operations; wherein, the original task sequence is a time sequence composed of operation event nodes, and the original task sequence is extracted from the original operation log; The second acquisition module is used to acquire adjustment instructions from the user for at least one of the original task sequences; wherein the adjustment instructions include instructions to expand the task sequence and / or shrink the task sequence; The instructions for extending the task sequence include information representing a first target operation event node, which is a node of a sub-task sequence that is extended into the original task sequence. The instruction to shrink the task sequence includes information representing a second target operation event node, which is a node of a sub-task sequence that has been removed from the original task sequence; The automatic adjustment module is used to perform operations to expand and / or shrink the original task sequence based on the adjustment instructions mentioned above and the dependencies between the various operation event nodes carried in the original operation log. When the adjustment instruction is an instruction to extend the task sequence, based on the extended task sequence instruction and the original operation log, it is determined whether there is at least one first target operation event node outside the corresponding end of the unadjusted original task sequence and within one or more time windows. In the case where there is at least one first target operation event node in the instructions of the extended task sequence within one or more time windows, based on the dependency relationship between each operation event node carried in the original operation log, it is determined whether the first target operation event node has a dependency relationship with each operation event node in the unadjusted original task sequence. If the first target operation event node has a dependency relationship with at least one operation event node in the unadjusted original task sequence, the first target operation event node and the operation event nodes between the first target operation event node and the unadjusted original task sequence are all included in the unadjusted original task sequence according to their temporal relationship based on the original operation log. When the adjustment instruction is a shrinking task sequence instruction, based on the shrinking task sequence instruction and the original operation log, it is determined whether there is at least one second target operation event node within one or more time windows at the corresponding end of the unadjusted original task sequence. In the case that there is at least one second target operation event node in the instructions of the shrinking task sequence within one or more time windows, based on the dependency relationship between the operation event nodes carried in the original operation log, it is determined whether the second target operation event node has a dependency relationship with the remaining operation event nodes from the second target operation event node to one end of the unadjusted original task sequence; wherein, the one end corresponds to the shrinking task sequence instruction. If the second target operation event node has dependencies on all the other operation event nodes, then the second target operation event node and the other operation event nodes are removed from the unadjusted original task sequence.

7. A device, characterized in that, include: Memory; processor; as well as Computer programs; The computer program is stored in the memory and configured to be executed by the processor to implement the method as described in any one of claims 1 to 5.

8. A storage medium, characterized in that, It stores a computer program thereon, which, when executed by a processor, implements the method described in any one of claims 1 to 5.

Images