Cross-page task processing method and device

Abstract

One or more embodiments of the invention provide a cross-page task processing method and device. According to the method, each actual access moving line corresponding to a target task is obtained based on a page log of the target task, a pre-configured target access moving line corresponding to the target task is compared and matched, and the deviation degree of the actual access moving lines relative to the target access moving line is evaluated according to a matching result. And reference is provided for optimization of the target task. According to the method, sequence verification is carried out on the actual access page sequence in the actual access moving line, whether the actual access moving line contains the preset key event or not is verified, and the actual execution state of the target task is determined based on verification results of the two aspects. According to the method, when actual access page sequences are obtained on the basis of page logs, available actual access page sequences are screened on the basis of a first target page in target page sequences, and starting point alignment between the actual access page sequences is achieved.

Description

Technical Field

[0001] This specification relates to the field of data processing technology in one or more embodiments, and in particular to a method and apparatus for cross-page task processing. Background Technology

[0002] With the development of internet technology, more and more service providers are offering diverse online services to users through applications such as web applications and mobile applications, providing convenience for both users and service providers.

[0003] In these applications, the online services to be implemented are typically designed as cross-page tasks, meaning tasks that involve multiple pages. For example, in an online shopping platform, to list a new product, a seller needs to sequentially visit the "Seller Center" page, the "Product Management" page, and the "Publish Product" page, etc. On the "Publish Product" page, the seller also needs to enter relevant information such as the category, price, inventory, and images of the product to be published, following the navigation prompts.

[0004] It is evident that cross-page tasks require users to visit multiple pages sequentially to complete. If the relevant pages are poorly designed, such as cluttered content or unclear navigation, users can easily become lost, unable to find the information they need, repeatedly visiting multiple pages, or struggling to reach the final page, thus negatively impacting their experience with the online service. Summary of the Invention

[0005] This specification provides one or more embodiments of a cross-page task processing method and apparatus to analyze the actual access situation of cross-page tasks, to assess the degree to which cross-page tasks cause user disorientation, thereby enabling adaptive optimization of cross-page tasks and improving user experience.

[0006] Firstly, one or more embodiments of this specification provide a cross-page task processing method, including: Obtain the target access path of the target task, wherein the target access path includes a target page sequence, and the target page sequence includes multiple target pages that need to be accessed sequentially to complete the target task; Obtain the page logs of the target task, and determine at least one actual access path corresponding to the target task based on the page logs, wherein the actual access path includes an actual access page sequence, and the actual access page sequence includes at least one target page; Each of the actual access routes is matched with the target access route to determine a preset evaluation index corresponding to the actual access route. The preset evaluation index is used to evaluate the degree to which the actual access route deviates from the target access route.

[0007] In the above technical solution, a sequence of actual accessed pages is generated based on page logs, forming the actual access page sequence for each actual access to the target task. By matching each actual access page sequence with the target page sequence corresponding to the target task, it can be determined not only whether the corresponding actual access process reached the endpoint page of the target task, but also whether each actual access process completely accessed all target pages. This allows for a more accurate determination of whether the corresponding actual access process truly completed the target task. Furthermore, based on the actual number of visits that did not complete the target task, the degree or probability of the target task causing user disorientation can be assessed, and it can be determined whether the target task needs to be optimized. Therefore, based on the above embodiments, target tasks that are prone to causing user disorientation can be identified in a timely manner, allowing for timely optimization, reducing the probability of user disorientation, and improving the user experience.

[0008] Furthermore, based on the above embodiments, cross-product user disorientation assessment and comparison can be achieved. That is, for different applications or different versions of the same application with the same or similar cross-page tasks, the above cross-page task processing method can be executed separately based on the same target page sequence and the page logs of each application. The degree of user disorientation caused by different implementations of the cross-page task in different applications can be evaluated, thereby comparing the advantages and disadvantages of different implementations of the cross-page task and guiding relevant personnel to optimize different applications as needed.

[0009] In one possible implementation, the target access path further includes: a preset key event, wherein the preset key event is an event indicating that the target task has been successfully executed; The preset evaluation indicators include task execution status, which indicates whether the actual access path successfully executes the target task. Each actual access path is matched with the target access path to determine a preset evaluation index corresponding to the actual access path, including: Determine whether the actual accessed page sequence matches the target page sequence; Determine whether the preset key event exists in the actual access route; If the actual access page sequence matches the target page sequence and the preset key event exists in the actual access path, the task execution state corresponding to the actual access path is determined to be a successful state; otherwise, the task execution state corresponding to the actual access path is determined to be a failed state.

[0010] In the above technical solution, determining whether each actual access path has successfully executed the target task is based not only on whether the corresponding actual access process accessed each target page corresponding to the target task in sequence, i.e., whether the sequence of actual accessed pages matches the sequence of target pages, but also on whether the corresponding actual access process triggered preset key events. This allows for a more accurate determination of the task execution status corresponding to each actual access process, avoiding misjudgments in pseudo-completion situations such as "reaching the final target page but not submitting," and thus allowing for a more accurate assessment of the degree and probability of the target task causing user disorientation.

[0011] In one possible implementation, determining whether the actual accessed page sequence matches the target page sequence includes: Determine whether the actual accessed page sequence contains all of the target pages; Determine whether the order of the target pages contained in the actual accessed page sequence is consistent with the target page sequence.

[0012] In the above technical solution, sequence matching is used to determine whether the actual accessed page sequence contains all the target pages, and whether the order of the target pages in the two sequences is consistent. This allows us to know whether all the target pages were accessed in order during each actual access process, thereby improving the accuracy of the determined task execution status, improving the accuracy of the assessment of the user's disorientation level of the target task, and ensuring the accurate optimization of the target task in the future.

[0013] In one possible implementation, each actual access path is matched with the target access path to determine a preset evaluation index corresponding to the actual access path, including: Based on the actual page access sequence, the total number of pages S and the number of unique pages N corresponding to each actual access path are counted. Based on the total number of pages S, the number of unique pages N, and the number of target pages R, the user disorientation degree corresponding to each of the actual access paths is evaluated, wherein the number of target pages R is the number of target pages contained in the target page sequence.

[0014] In the above technical solution, the total number of pages S and the number of unique pages N corresponding to each actual access path are statistically analyzed, and the user disorientation degree L is calculated based on this as a preset evaluation index. This quantifies the degree of deviation of the actual access path from the target access path. Based on the user disorientation degree L corresponding to each actual access path, the degree and probability of user disorientation caused by the target task are comprehensively analyzed. The analysis process is highly interpretable, making it easy for relevant personnel to understand and take corresponding optimization strategies.

[0015] In one possible implementation, the page log includes multiple page operation events and their corresponding occurrence times; Based on the page logs, at least one actual access path corresponding to the target task is determined, including: Based on a preset inactivity interval, at least one session corresponding to the target task is filtered from the page log. The session includes multiple page operation events sorted according to the event occurrence time. The page operation events in the session include a first entry event indicating entry into the starting target page. The starting target page is the first target page in the target page sequence. Starting from the first entry event, construct the sequence of actual accessed pages corresponding to the session.

[0016] The above technical solution not only realizes page logs based on the target task to obtain the actual page sequence corresponding to each historical access process of the user to the target task, but also realizes that each actual page sequence is aligned with the starting target page. This ensures that the constructed actual page sequence all points to the target task, and removes irrelevant pages before entering the starting target page, reducing the workload of subsequent sequence matching steps, ensuring the accuracy of the total number of pages S and the number of non-repeating pages N obtained by statistics, and also ensuring the accuracy of the user disorientation degree L obtained by further calculation.

[0017] In one possible implementation, determining at least one actual access path corresponding to the target task based on the page logs further includes: Before constructing the actual page access sequence, the page operation events in the session are cleaned.

[0018] In the above technical solution, noise reduction is achieved through data cleaning, removing events and parameters that are irrelevant to the analysis of the actual access path, and retaining only events and parameters that are relevant to the analysis of the actual access path. This can improve the processing efficiency and accuracy of subsequent steps.

[0019] In one possible implementation, the method further includes: generating an optimization strategy for the target task based on the preset evaluation index.

[0020] In the above technical solution, based on the degree to which the target task causes user disorientation as reflected by the preset evaluation indicators, it is possible to determine whether optimization is needed or the urgency of optimization. It is also possible to determine which target pages are returned to more frequently, which target pages lead to non-target pages more often, etc. This allows for more targeted guidance to relevant personnel to optimize these pages, preventing them from making aimless modifications to the target task, improving optimization effectiveness and efficiency, increasing the conversion rate of the corresponding target task, and enhancing the user experience.

[0021] Secondly, one or more embodiments of this specification provide a cross-page task processing apparatus, including: The target movement path determination module is used to obtain the target access movement path of the target task, wherein the target access movement path includes a target page sequence, and the target page sequence includes multiple target pages that need to be accessed to complete the target task; The actual access path determination module is used to obtain the page log of the target task and determine at least one actual access path corresponding to the target task based on the page log, wherein the actual access path includes an actual access page sequence, and the actual access page sequence includes at least one target page. The path matching module is used to match each of the actual access paths with the target access path, and determine the preset evaluation index corresponding to the actual access path based on the matching result. The preset evaluation index is used to evaluate the degree to which the actual access path deviates from the target access path.

[0022] In one possible implementation, the target access path further includes: a preset key event, wherein the preset key event is an event indicating that the target task has been successfully executed; The preset evaluation indicators include task execution status, which indicates whether the actual access path successfully executes the target task. The movement path matching module is used to perform the following operations: Determine whether the actual accessed page sequence matches the target page sequence; Determine whether the preset key event exists in the actual access route; If the actual access page sequence matches the target page sequence and the preset key event exists in the actual access path, the task execution state corresponding to the actual access path is determined to be a successful state; otherwise, the task execution state corresponding to the actual access path is determined to be a failed state.

[0023] In one possible implementation, the movement matching module is used to perform the following operations: Based on the actual page access sequence, the total number of pages S and the number of unique pages N corresponding to each actual access path are counted. Based on the total number of pages S, the number of unique pages N, and the number of target pages R, the user disorientation degree corresponding to each of the actual access paths is evaluated, wherein the number of target pages R is the number of target pages contained in the target page sequence.

[0024] In one possible implementation, the page log includes multiple page operation events and their corresponding occurrence times; The actual movement path determination module is used to perform the following operations: Based on a preset inactivity interval, at least one session corresponding to the target task is filtered from the page log. The session includes multiple page operation events sorted according to the event occurrence time. The page operation events in the session include at least a first entry event indicating entry into the starting target page. The starting target page is the first target page in the target page sequence. Starting from the first entry event, construct the sequence of actual accessed pages corresponding to the session.

[0025] Thirdly, one or more embodiments of this specification also provide an electronic device, which includes a memory and a processor; the memory is used to store a computer program; the processor is used to execute the computer program stored in the memory, and when the computer program is executed, it implements the method of the first aspect described above.

[0026] Fourthly, one or more embodiments of this specification also provide a computer-readable storage medium storing computer program instructions that, when executed, implement the method described in the first aspect.

[0027] Based on the implementation methods provided above, the embodiments of this application can be further combined to provide more implementation methods.

[0028] It is understood that the solutions provided in the second to fourth aspects correspond to the solutions provided in the first aspect. Therefore, the beneficial effects of the second to fourth aspects can be referred to the beneficial effects of the first aspect, and repeated details will not be repeated. Attached Figure Description

[0029] To more clearly illustrate the technical solutions of one or more embodiments of this specification, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of one or more embodiments of this specification. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0030] Figure 1 This specification provides a schematic diagram of an application scenario for one or more embodiments. Figure 2 This specification provides a schematic diagram of an application scenario for one or more embodiments. Figure 3A flowchart illustrating a cross-page task processing method provided in one or more embodiments of this specification; Figure 4 This specification provides a schematic diagram of an application scenario for one or more embodiments. Figure 5 A flowchart illustrating a cross-page task processing method provided in one or more embodiments of this specification; Figure 6 A flowchart illustrating a cross-page task processing method provided in one or more embodiments of this specification; Figure 7 A flowchart illustrating a cross-page task processing method provided in one or more embodiments of this specification; Figure 8 A flowchart illustrating a cross-page task processing method provided in one or more embodiments of this specification; Figure 9 A structural block diagram of a cross-page task processing device provided for one or more embodiments of this specification; Figure 10 This is a structural block diagram of an electronic device provided for one or more embodiments of this specification. Detailed Implementation

[0031] The present specification describes one or more embodiments in further detail below with reference to the accompanying drawings and examples. Through these descriptions, the features and advantages of one or more embodiments of the present specification will become clearer and more apparent.

[0032] The term “exemplary” as used herein means “serving as an example, embodiment, or illustration.” Any embodiment illustrated herein as “exemplary” is not necessarily to be construed as superior to or better than other embodiments. Although various aspects of embodiments are shown in the accompanying drawings, the drawings are not necessarily drawn to scale unless specifically indicated otherwise.

[0033] Furthermore, the technical features described below in one or more embodiments of this specification may be combined with each other as long as they do not conflict with each other.

[0034] To facilitate understanding, the application scenarios of the technical solutions provided in one or more embodiments of this specification will be described below.

[0035] With the development of internet technology, more and more service providers are offering diverse online services to users through applications, providing convenience for both users and service providers. These applications include those running on PCs or mobile devices, web applications accessed through browsers, and lightweight applications (i.e., mini-programs) running within other applications. Since applications often need to integrate multiple services, and the content displayed on each page of an application is limited, these services are usually designed as cross-page tasks.

[0036] Cross-page tasks refer to sequential operations with a clear objective, completed across multiple pages. This means that when a user visits a site, they can start from the entry page and click through to the next page in sequence until they reach the destination page and complete the corresponding task objective, such as listing a new product or registering for an event.

[0037] If some pages in a cross-page task are poorly designed, such as cluttered content or unclear navigation, it can easily lead to users getting lost, such as not being able to find the information they need, repeatedly visiting multiple pages, or having difficulty reaching the final page, thus affecting the user experience of the relevant online services.

[0038] Figure 1 This diagram illustrates an application scenario provided by one or more embodiments of this specification. For example... Figure 1 As shown, a certain service S provided by an application has a corresponding cross-page task, Task-1, which requires accessing four pages: Page-A, Page-B, Page-C, and Page-D in sequence. If the navigation in Page-B is unclear, making it difficult for users to find the controls associated with Page-C, then during the actual access process, users may mistakenly enter pages unrelated to service S, such as Page-E, deviating from the access path corresponding to the cross-page task, Task-1. This can cause users to become lost and unable to return to the correct path to Page-C, negatively impacting their user experience of service S.

[0039] In view of this, one or more embodiments of this specification provide a cross-page task processing method and apparatus for analyzing the actual access situation of cross-page tasks to assess the degree to which cross-page tasks cause user disorientation, thereby enabling adaptive optimization of cross-page tasks, reducing the possibility and degree of user disorientation, and improving user experience.

[0040] Figure 2 This diagram illustrates an implementation environment for a cross-page task processing method provided in one or more embodiments of this specification. (Refer to...) Figure 2 The implementation environment may include terminal device 11, server 12 and processing device 13.

[0041] Terminal device 11 can interact with the user, allowing the user to access various cross-page tasks provided by the application running on terminal device 11.

[0042] For example, the terminal device 11 mentioned above may be a smartphone, personal computer, tablet computer, e-book reader, VR (Virtual Reality) device, vehicle terminal, IoT (Internet of Things) device, wearable smart device, etc.

[0043] Server 12 can interact with terminal device 11, such as receiving page access requests sent by terminal device 11 and returning corresponding page data to terminal device 11, so that terminal device 11 can load the corresponding page.

[0044] In addition, server 12 can also collect user operation data on various pages, such as page ID, entry time, and exit time, based on technologies like event tracking, forming and storing page logs. Event tracking refers to the technique of inserting code into the application to collect data on page entry, exit, and click operations on the application's client side.

[0045] For example, the server 12 mentioned above can be a single server, a server cluster consisting of multiple servers, or one or more cloud servers in a cloud computing platform.

[0046] The processing device 13 can analyze the actual user access status of each cross-page task based on the page logs stored in the server 12, that is, execute the cross-page task processing method provided in one or more embodiments of this specification to assess the degree to which each cross-page task causes user disorientation and provide optimization directions for the relevant cross-page tasks.

[0047] For example, the processing device 13 described above may be a desktop computer, laptop computer, notebook computer, tablet computer, smartphone, e-book reader, VR device, in-vehicle terminal, IoT device, wearable smart device, etc. The processing device 13 may be a standalone device or a processing unit integrated into the server 12 in the form of hardware or software.

[0048] Figure 3 This is a flowchart illustrating a cross-page task processing method according to one embodiment of this specification; see also... Figure 3 The cross-page task processing method includes the following steps.

[0049] Step 120: Obtain the target access path for the target task.

[0050] Any cross-page task in any application can be used as a target task. By executing the cross-page task processing method provided in this embodiment, the degree of user disorientation can be evaluated.

[0051] The aforementioned target access path includes a target page sequence (standard_line), which consists of multiple target pages that need to be accessed sequentially to complete the target task.

[0052] by Figure 1 Taking the application scenario shown as an example, the target pages in the target page sequence corresponding to the cross-page task Task-1 of service S are as follows: Page-A→Page-B→Page-C→Page-D. Among them, Page-A, Page-B, etc. are unique identifiers of the corresponding pages, such as page ID (page_ID) or scene ID (scene_ID), etc.

[0053] For example, the design logic for each cross-page task can be configured in a pre-defined database, specifying the target page sequence for each task. Different cross-page tasks may require accessing different numbers of pages, and the length of the corresponding target page sequence may also differ.

[0054] For example, the sequence of target pages corresponding to each cross-page task, Task-1, Task-2, Task-3, etc., can be stored in the database as a list, as shown below: standard_line_task-1=[Page-A, Page-B, Page-C, Page-D]; standard_line_task-2=[Page-E, Page-B, Page-F]; standard_line_task-3=[Page-A, Page-B, Page-F, Page-G, Page-H].

[0055] It should be noted that the target page sequence can also be stored in the preset database in other forms, and this embodiment does not limit this.

[0056] Based on this, obtaining the target access path of the target task in step 120 above may include reading the target page sequence corresponding to the target task from a preset database.

[0057] Step 140: Obtain the page logs of the target task, and determine at least one actual access path corresponding to the target task based on the page logs.

[0058] The page logs mentioned above are data collected using techniques such as event tracking, recording various actions performed by users while accessing the application. Based on this, each user action in the application, such as entering Page-A, clicking control 'a' in Page-A, leaving Page-A, or entering Page-B, can be recorded as an event in the page logs.

[0059] Based on this, in step 140, the page logs corresponding to the target task can be filtered from the entire application's log library, and processed to obtain at least one actual access path; each actual access path can represent which operation events occurred sequentially during a user's actual access to the target task. Since multiple users may access the target task at the same or different times, and the same user may also access the target task multiple times at different times, for the same target task, multiple actual access paths may be determined through the above step 140.

[0060] For example, the aforementioned actual access path may specifically include an actual access page sequence; this actual access page sequence is a sequence of pages accessed during the actual access to the target task, formed based on time order.

[0061] The actual page access sequence described above may include the target page, non-target pages, and duplicate pages. Taking the target task Task-1 as an example, the actual page access sequence user_line-1 formed during a user's access to it might be user_line-1=[Page-A, Page-B, Page-E, Page-B, Page-C, Page-D]. Referring to the target page sequence standard_line_task-1 of the target task Task-1 described above, this actual page access sequence includes the non-target page Page-E and the duplicate page Page-B (Page-B appears twice).

[0062] It is understandable that if the actual page access sequence does not contain the target page, then the actual page access sequence is irrelevant to the target task and does not need to be analyzed. Therefore, the actual page access sequence determined in step 140 includes at least one target page.

[0063] Step 160: Match each actual access path with the target access path, and determine the preset evaluation index corresponding to the actual access path based on the matching results.

[0064] The aforementioned preset evaluation indicators are used to assess the degree to which each actual access path deviates from the target access path. For example, the aforementioned preset evaluation indicators may include task execution status; the task execution status indicates whether the corresponding actual access path has successfully executed the target task, and may include two states: success and failure.

[0065] For example, in step 160 above, each actual access path is matched with the target access path, which may specifically include: matching each actual access page sequence with the target page sequence.

[0066] Based on this, if the actual accessed page sequence matches the target page sequence, the task execution status corresponding to the actual access path can be determined as a successful state; conversely, if the actual accessed page sequence does not match the target page sequence, the task execution status corresponding to the actual access path can be determined as a failed state.

[0067] Understandably, the more actual access paths that are identified as failures, the more likely users are to stray from their target when accessing the target task, meaning they are more likely to get lost, which indicates that the target task needs more optimization.

[0068] In the above embodiments, a sequence of actual accessed pages is generated based on page logs, forming the actual page sequence for each actual access to the target task. By matching each actual page sequence with the target page sequence corresponding to the target task, it can be determined not only whether the corresponding actual access process reached the endpoint page of the target task, but also whether each actual access process completely accessed all target pages. This allows for a more accurate determination of whether the corresponding actual access process truly completed the target task. Furthermore, based on the actual number of visits that did not complete the target task, the degree or probability of the target task causing user disorientation can be assessed, and it can be determined whether the target task needs to be optimized. Therefore, based on the above embodiments, target tasks that are prone to causing user disorientation can be identified in a timely manner, allowing for timely optimization, reducing the probability of user disorientation, and improving the user experience.

[0069] Furthermore, based on the above embodiments, cross-product user disorientation assessment and comparison can be achieved. That is, for different applications or different versions of the same application with the same or similar cross-page tasks, such as multiple e-commerce applications that are configured with cross-page tasks to implement the listing of new products, but with different specific implementation methods such as page content and navigation methods, the above-mentioned cross-page task processing method can be executed separately based on the same target page sequence and the page logs of each application. The degree of user disorientation caused by the different implementation methods of the cross-page task in different applications can be evaluated, thereby comparing the advantages and disadvantages of the different implementation methods of the cross-page task and guiding relevant personnel to optimize different applications as needed.

[0070] In some embodiments, determining whether the actual accessed page sequence matches the target page sequence may specifically include: determining whether the actual accessed page sequence contains all the target pages in the target page sequence; and determining whether the order of the target pages contained in the actual accessed page sequence is consistent with the target page sequence.

[0071] Taking the target task Task-1 as an example, its target page sequence standard_line_task-1 is [Page-A, Page-B, Page-C, Page-D]. Assume that the target task Task-1 has the following multiple actual page access sequences: user_line-1=[Page-A, Page-B, Page-E, Page-B, Page-C, Page-D]; user_line-2=[Page-A, Page-B, Page-E, Page-F, Page-E, Page-B, Page-C, Page-D]; user_line-3=[Page-A, Page-B, Page-E, Page-B, Page-E, Page-F]; user_line-4=[Page-A, Page-C, Page-B, Page-D]…….

[0072] For the actual accessed page sequence user_line-1, by matching it with the target page sequence standard_line_task-1, it can be seen that although user_line-1 contains the non-target page Page-E, it also contains all four target pages in standard_line_task-1, and the order is consistent. Therefore, it can be determined that user_line-1 and standard_line_task-1 match, and the task execution status corresponding to user_line-1 can be set to the success status.

[0073] For the actual accessed page sequence user_line-2 mentioned above, by matching it with the target page sequence standard_line_task-1, it can be seen that although user_line-2 contains non-target pages Page-E and Page-F, it also contains all four target pages in standard_line_task-1, and the order is consistent. Therefore, it can be determined that user_line-2 and standard_line_task-1 match, and the task execution status corresponding to user_line-2 can be set to the success status.

[0074] For the actual accessed page sequence user_line-3, by matching it with the target page sequence standard_line_task-1, it can be seen that user_line-3 only contains the two target pages Page-A and Page-B from standard_line_task-1, and does not contain the other two target pages Page-C and Page-D. Therefore, it can be determined that user_line-3 and standard_line_task-1 do not match, and the task execution status corresponding to user_line-3 can be set to a failed state.

[0075] For the actual accessed page sequence user_line-4, by matching it with the target page sequence standard_line_task-1, it can be seen that although user_line-4 contains all four target pages in standard_line_task-1, their order is different from standard_line_task-1. The order of Page-B and Page-C is reversed. Therefore, it can be determined that user_line-4 and standard_line_task-1 do not match. Accordingly, the task execution status corresponding to user_line-4 can be set to a failed state.

[0076] Since each actual access path corresponds to one actual access process of the target task, the aforementioned target page sequence not only limits which target pages need to be accessed to complete the target task, but also limits the access order of these target pages. Therefore, if an actual access page sequence does not contain all the target pages, or if the order of the target pages it contains is inconsistent with the target page sequence, it indicates that the corresponding actual access path is different from the target access path, which may lead to the failure of the target task. Furthermore, the more actual accesses that fail to execute the target task, the higher the probability that the target task will cause users to get lost, and the more it needs to be optimized.

[0077] Therefore, in the above embodiments, sequence matching is used to determine whether the actual accessed page sequence contains all the target pages, and whether the order of the target pages in the two sequences is consistent. This allows us to know whether all the target pages were accessed in order during each actual access process, thereby improving the accuracy of the determined task execution status, improving the accuracy of the assessment of the user's disorientation level of the target task, and ensuring the accurate optimization of the target task in the future.

[0078] In some embodiments, the target access path obtained in step 120 above may include, in addition to the target page sequence, preset key events; the preset key events are events that indicate the completion of the target task.

[0079] For example, the aforementioned preset key events may include at least one of the following: a click event on a preset control on the last target page, receiving a preset prompt message after entering the last target page, etc.

[0080] Taking the task of listing new products in an e-commerce application as an example, the last target page in its target page sequence could be, for example, a target page like this: Figure 4 The product preview page 400 is shown below. After verifying that all preview information is correct, the user can click the interactive control 401 on the product preview page 400, namely the "Confirm and Publish" button. The corresponding e-commerce platform server can then complete the listing and publication of the new product based on the user's confirmed preview information. In addition, the server can also provide a notification message indicating successful publication, which can be displayed in the corresponding application. Figure 4 The pop-up window, such as 402, is displayed to the user.

[0081] based on Figure 4 In the scenario shown, for the task of listing new products, the corresponding preset key event can be set as a click event on the interactive control 401 or a display event on the pop-up window 402.

[0082] In some embodiments, reference is made to Figure 5 Based on the aforementioned preset key events, step 160 matches each actual access path with the target access path, and determines the preset evaluation indicators corresponding to the actual access paths based on the matching results. Specifically, this may include: Step 1612: Determine whether the actual accessed page sequence matches the target page sequence; Step 1614: Determine whether there are any preset key events in the actual visit path; Step 1616: If the actual access page sequence matches the target page sequence and there is a preset key event in the actual access path, determine that the task execution status corresponding to the actual access path is a successful state; otherwise, determine that the task execution status corresponding to the actual access path is a failed state.

[0083] Taking the target task Task-1 mentioned above as an example, based on the above embodiment, steps 1612, 1614 and 1616 are executed for each actual access path.

[0084] In other words, for the first actual access path corresponding to the above-mentioned actual access page sequence user_line-1, not only is user_line-1 and standard_line_task-1 matched in step 1612, but also, in step 1614, it is determined whether there is a preset key event in the first actual access path. Then, in step 1616, based on the execution results of steps 1612 and 1614, the task execution status corresponding to the first actual access path is determined: if the judgment results of steps 1612 and 1614 are both yes (i.e., user_line-1 and standard_line_task-1 match, and there is a preset key event in the first actual access path), the task execution status corresponding to the first actual access path is set to a successful state; if the judgment result of either step 1612 or 1614 is no (i.e., user_line-1 and standard_line_task-1 do not match, or there is no preset key event in the first actual access path), the task execution status corresponding to the first actual access path is set to a failed state.

[0085] Similarly, for the second actual access path corresponding to another actual access page sequence user_line-2, and for each of the other actual access paths determined in step 140, the corresponding task execution status can be determined based on the above steps 1612, 1614 and 1616, which will not be elaborated here.

[0086] For example, the execution status of the above task can be represented by the parameter "is_completed", where is_completed=true indicates a successful status and is_completed=false indicates a failed status.

[0087] It should be noted that the determination of whether each actual accessed page sequence matches the target page sequence in step 1612 above can be referred to the relevant embodiments above, and will not be repeated here.

[0088] In real-world applications, even if a user visits the last target page of a task, the corresponding task may not necessarily be successfully executed. Figure 4 Taking the scenario shown as an example, suppose that after accessing the product preview page 400, the user does not click the interactive control 401 but directly closes the product preview page 400. Obviously, in this case, the product cannot be successfully published, and the task execution status should be a failure. In this situation, the task execution status cannot be accurately determined solely based on whether the last target page has been reached.

[0089] Therefore, in the above embodiments, determining whether each actual access path has successfully executed the target task is based not only on whether the corresponding actual access process accesses each target page corresponding to the target task in sequence, i.e., whether the sequence of actual accessed pages matches the sequence of target pages, but also on whether the corresponding actual access process triggers a preset key event. This allows for a more accurate determination of the task execution status corresponding to each actual access process, and thus a more accurate assessment of the degree and probability of the target task causing user disorientation.

[0090] In some embodiments, reference is made to Figure 6 In step 160 above, each actual access route is matched with the target access route, and the preset evaluation index corresponding to the actual access route is determined based on the matching result. Specifically, this may include the following steps.

[0091] Step 1622: Based on the actual page access sequence, count the total number of pages S and the number of unique pages N corresponding to each actual access path.

[0092] For example, for the actual page sequence user_line-1=[Page-A, Page-B, Page-E, Page-B, Page-C, Page-D] corresponding to the target task Task-1 mentioned above, statistics show that the total number of pages accessed during the actual access process of successfully executing the target task is S_user_line-1=6, and the number of non-repeating pages accessed is N_user_line-1=5.

[0093] For example, for the actual page sequence user_line-2=[Page-A, Page-B, Page-E, Page-F, Page-E, Page-B, Page-C, Page-D] corresponding to the target task Task-1 mentioned above, statistics show that the total number of pages accessed during the actual access process of successfully executing the target task is S_user_line-2=8, and the number of non-repeating pages accessed is N_user_line-2=6.

[0094] Step 1624: Based on the total number of pages S, the number of unique pages N, and the number of target pages R, evaluate the user disorientation level corresponding to each actual access path.

[0095] The target page number R mentioned above is the number of target pages contained in the target page sequence, which is also the minimum number of pages required to complete the target task. In other words, the page access path represented by the target page sequence is the shortest path required to complete the target task. For example, if the target page sequence corresponding to the target task Task-1 mentioned above is standard_line_task-1=[Page-A, Page-B, Page-C, Page-D], then its target page number R=4.

[0096] It is understandable that, given a fixed number of target pages R, the more total pages S accessed to complete the target task, the more pages are traversed or repeated during the actual access process, indicating a more severe degree of user disorientation. The greater the difference between the total number of pages S and the number of non-repeating pages N, the more pages are repeated during the actual access process, also indicating a more severe degree of user disorientation.

[0097] For example, the user disorientation level L corresponding to each actual access path can be calculated using a preset function L=f(S, N, R). For instance, the function L=f(S, N, R) = sqrt[(N / S - 1)] can be used. 2 + (R / N - 1) 2 ].

[0098] Taking the target task Task-1 mentioned earlier as an example, its corresponding target page number R=4, the total number of pages in the actual accessed page sequence user_line-1 S_user_line-1=6, and the number of unique pages N_user_line-1=5. Therefore, the user disorientation degree corresponding to user_line-1 L_user_line-1=sqrt[(N / S - 1)] 2 + (R / N - 1) 2 ]=sqrt[(5 / 6 -1) 2 + (4 / 5 - 1) 2 ]≈0.2603; The total number of pages in the other actual accessed page sequence user_line-2 is S_user_line-2=8, and the number of unique pages is N_user_line-2=6. Therefore, the user disorientation degree corresponding to user_line-4 is L_user_line-2=sqrt[(N / S - 1) 2 + (R / N - 1) 2 = sqrt[(6 / 8 - 1)] 2+ (4 / 6 - 1) 2 ]≈0.4167; Since L_user_line-1<L_user_line-2, it can be determined that, relative to the actual access page sequence user_line-1, the user disorientation during the actual access process corresponding to the actual access page sequence user_line-2 is more severe, which is consistent with the actual access situation reflected by user_line-1 and user_line-2. That is, the above-mentioned user disorientation degree L is interpretable and comparable.

[0099] In the above embodiments, in addition to the task execution status, the user disorientation degree L can also be used as a preset evaluation index to quantify the deviation of the actual access path from the target access path. Based on the user disorientation degree L corresponding to each actual access path, the degree and probability of the target task causing user disorientation can be comprehensively analyzed. The analysis process is highly interpretable, making it easy for relevant personnel to understand and adopt corresponding optimization strategies. For example, if the user disorientation degree L corresponding to each actual access path is small, it can be determined that the target task is unlikely to cause user disorientation and can be temporarily left unoptimized; however, if the user disorientation degree L corresponding to most actual access paths is large, it can be determined that the target task is highly likely to cause user disorientation, and the target task urgently needs optimization.

[0100] Therefore, in the above embodiments, by statistically analyzing the total number of pages S and the number of non-repeating pages N corresponding to each actual access page sequence, and combining them with the target number of pages R, the user disorientation degree corresponding to the actual access path can be comprehensively evaluated. Thus, for actual access paths with different degrees of detour or repetition, different user disorientation degrees can be evaluated, achieving a fine evaluation of different actual access paths, which helps to optimize the target task in a targeted manner in the future.

[0101] Furthermore, for different applications with similar target tasks, they can be evaluated based on the same target page sequence, i.e., the same R, through the above embodiments to achieve cross-product comparison. That is, to determine the user disorientation degree L corresponding to each actual access path of the target task in different applications, and to evaluate the merits and demerits of different applications in terms of user disorientation based on the magnitude of the user disorientation degree L, so as to provide a basis for the optimization strategy of different applications.

[0102] In some embodiments, during the sequence matching process in step 1612, the total number of pages S and the number of unique pages N can be counted in step 1622. See below for further details. Figure 7 The sequence matching process in step 1612 and the specific methods for calculating S and N in step 1622 are illustrated by example.

[0103] Reference Figure 7For any actual accessed page sequence user_line, step 701 can be used to compare its length with that of the target page sequence standard_line, i.e., determine whether len(user_line) is less than len(standard_line). If len(user_line) is not less than len(standard_line), then proceed to subsequent steps such as step 703.

[0104] If len(user_line) is less than len(standard_line), then the actual accessed page sequence user_line cannot contain all the target pages, and the corresponding actual access process cannot successfully execute the target task. In this case, step 702 can be executed to generate a matching result, that is, the task execution status is_completed=false corresponding to the actual accessed page sequence user_line. For the actual access process that fails to execute the target task, its corresponding user disorientation degree L can be regarded as the maximum. There is no need to continue to count its corresponding total number of pages S and the number of unique pages N. Therefore, it can be directly set to zero. That is, the matching result generated in step 702 can also include the total number of pages S=0 and the number of unique pages N=0 corresponding to the actual accessed page sequence user_line.

[0105] In step 703, the actual page node to be matched and the target page can be determined, and an access list visit_nodes can be created to record the actual page nodes participating in the matching.

[0106] For example, the first target page in the target page sequence standard_line can be used as the current target page to be matched, and the first actual page in the actual access page sequence user_line can be used as the current actual page node to be matched. Subsequently, the next target page in the target page sequence standard_line and the next actual page in the actual access page sequence can be selected as the current target page to be matched, and the next actual page in the actual access page sequence can be selected as the current actual page node to be matched, depending on the matching situation.

[0107] For example, in step 703 above, the position of the target page to be matched in the target page sequence standard_line can be recorded by setting the position tracking parameter current_index, where current_index={0, 1, 2, ...}. Accordingly, the target page to be matched can be represented as standard_line[current_index]. Based on this, during the matching process, by updating the value of the position tracking parameter current_index, i.e., current_index=current_index+1, the target page to be matched can be updated to the next target page in the target page sequence standard_line. For example, when current_index=0, the target page to be matched is standard_line[0], which represents the first element in the target page sequence standard_line, i.e., the first target page; by updating current_index=current_index+1=0+1=1, the target page to be matched can be updated to standard_line[1], i.e., the second element in the target page sequence standard_line, i.e., the second target page, and so on.

[0108] In step 704, it is determined whether the actual page node to be matched is the same as the target page standard_line[current_index].

[0109] If the result of step 704 is negative, that is, the current actual page node to be matched is different from the current target page standard_line[current_index] to be matched, then step 705 can be executed to determine whether there is a next actual page to be matched in the actual accessed page sequence user_line.

[0110] If there is a next actual page to be matched in the actual page sequence user_line, it can be used as the current actual page node to be matched, and the process returns to step 704 to rematch the current target page standard_line[current_index].

[0111] If there is no next actual page to be matched in the actual accessed page sequence user_line, it means that all actual pages in the actual accessed page sequence user_line have participated in the matching. However, there is still a current target page standard_line[current_index] that has not been successfully matched. Therefore, it means that the actual accessed page sequence user_line does not match the target page sequence standard_line. This also means that the corresponding actual access process failed to access all target pages in order. Thus, step 702 can be executed to generate the matching result. That is, the task execution status is the identification status is_completed=false. The corresponding total number of pages S and the number of unique pages N do not need to be counted and can be directly set to zero.

[0112] If the judgment result in step 704 is yes, that is, the current actual page node to be matched is the same as the current target page standard_line[current_index] to be matched, then step 706 can be executed to determine whether there is a next target page to be matched in the target page sequence standard_line. If there is, it can be used as the current target page to be matched, and the next actual page to be matched can be obtained through step 705.

[0113] If there is no next target page to be matched in the target page sequence standard_line, it means that all target pages in the target page sequence standard_line have been successfully matched. At this time, regardless of whether there are any actual pages in the actual accessed page sequence that have not participated in the matching, the matching process can be ended, and step 707 can be executed to generate the matching result, including the task execution status is_completed=true corresponding to the actual accessed page sequence user_line, the total number of pages S, and the number of unique pages N.

[0114] For example, in step 706, determining whether there is a next target page to be matched in the target page sequence standard_line can be done as follows: first update current_index = current_index + 1, then determine whether the updated current_index reaches the length len(standard_line) of the target page sequence; if current_index = len(standard_line), it means that the target page involved in the matching in step 704 is the last target page in the target page sequence standard_line, that is, there is no next target page to be matched; conversely, if current_index is not equal to len(standard_line) (actually it should be current_index < len(standard_line)), it means that there is a next target page to be matched in the target page sequence standard_line, and the updated current_index represents the position of the next target page to be matched in the target page sequence standard_line.

[0115] For example, regardless of the matching result obtained in step 704, the actual page node involved in the matching can be recorded in the pre-created visit list visited_nodes. That is, the visit list visited_nodes records both actual pages belonging to the target page and actual pages that do not belong to the target page, which is used to count S and N in step 707.

[0116] Specifically, the method for determining S and N in step 707 can be as follows: Since the visited list `visited_nodes` records the actual pages involved in the matching, the total number of pages S corresponding to the actual visited page sequence `user_line` is the length of the visited list `visited_nodes`, i.e., S = len(visited_nodes); further, by removing duplicates from the visited list `visited_nodes`, a unique visited list `unique_visited_nodes` is obtained, and the number of unique pages N corresponding to the actual visited page sequence `user_line` is also the length of `unique_visited_nodes`, i.e., N = len(unique_visited_nodes).

[0117] In the above embodiments, by Figure 7The process shown can match any actual access page sequence user_line with the target page sequence standard_line, determine whether the corresponding actual access process has accessed all target pages in order, that is, determine the corresponding task execution status is_completed, and if it is determined that the actual access process has accessed all target pages in order, it can also determine the corresponding total number of pages S and the number of unique pages N, so as to further calculate the corresponding user disorientation degree L.

[0118] It should be noted that in some embodiments, when using... Figure 7 The process shown indicates that if the actual access process does not access all target pages in sequence (i.e., is_completed=false), it is equivalent to the user being completely lost and unable to successfully execute the target task. In this case, there is no need to count the total number of pages S and the number of unique pages N in the corresponding actual access page sequence. S and N can be directly set to zero and output through step 702. Then, when determining the user's degree of disorientation L in step 1624, for the actual access page sequence where S or N is 0, the corresponding user degree of disorientation L can be set to the default value or empty, such as L=null or L=none.

[0119] In some embodiments, after a successful match on the last target page in the target page sequence, there may still be pages in the actual accessed page sequence that have not been matched. Since the current matching result indicates that the corresponding actual access process has accessed the last target page corresponding to the target task in sequence, the remaining pages in the actual accessed page sequence that have not been matched are irrelevant to the current access process of the target task (they may be generated because the user continues to access other tasks or accesses the target task again). Therefore, in step 707, it is only necessary to count the total number of pages S and the number of unique pages N based on the pages that participated in the matching recorded in the access list visited_nodes, without considering the remaining pages in the actual accessed page sequence that have not been matched.

[0120] In some embodiments, to ensure the accuracy of the final total number of pages S and the number of unique pages N, the system can start from the actual page that successfully matches the first target page in the target page sequence and record the matched actual pages through the visited list_nodes.

[0121] For example, based on the target page sequence standard_line_task-1 in the previous embodiment, for the following actual accessed page sequence user_line-5=[Page-F, Page-A, Page-B, Page-E, Page-B, Page-C, Page-D, Page-E], the first actual page Page-F does not match the first target page Page-A and will not be recorded in the access list visited_nodes; after the sixth actual page Page-D successfully matches the last target page, the matching process is completed, and the pages in user_line-5 after the sixth actual page Page-D will no longer be matched. Therefore, the access list visited_nodes will no longer record other actual pages after the sixth actual page Page-D, such as the seventh actual page Page-E.

[0122] In other words, for the aforementioned user_line-5, based on Figure 7 The matching process shown results in a final recorded visit list: visited_nodes = [Page-A, Page-B, Page-E, Page-B, Page-C, Page-D]. By removing duplicates from this visited list, we can obtain a unique visit list: unique_visited_nodes = [Page-A, Page-B, Page-E, Page-C, Page-D]. Based on this, we can further determine the total number of pages corresponding to user_line-5: S = len(visited_nodes) = 6, and the number of unique pages: N = len(unique_visited_nodes) = 5.

[0123] In practical application scenarios, based on Figure 7 The process shown can be implemented by writing corresponding program code to automatically match any actual access page sequence user_line with the target page sequence standard_line, and output the matching result described in step 702 or step 707; the specific implementation methods adopted by those skilled in the art based on the principles of the above embodiments are all within the protection scope of this application, and will not be described in detail in this specification.

[0124] In some embodiments, based on Figure 7After the process shown completes the matching between the actual access page sequence and the target page sequence, for the actual access page sequence with a matching result of is_completed=true, step 164 can be used to determine whether the corresponding actual access path contains the preset key events configured in the target access path. If the preset key events are not contained, it means that although all the target pages were accessed, the user did not perform the key operation, and the target task was not successfully executed. Therefore, the task execution status can be reset to the failure status, that is, is_completed=true can be changed to is_completed=false, and the corresponding S and N can be set to 0.

[0125] In other embodiments, step 164 may also be integrated into Figure 7 In the process shown, for example, if step 706 determines that there is no next target page to be matched, step 164 can be executed first. If step 164 determines that the corresponding actual access path contains a preset key event, step 707 can be executed, and the result indicating a successful match can be output. Otherwise, if step 164 determines that the corresponding actual access path does not contain a preset key event, step 702 can be executed, and the result indicating a failed match can be output.

[0126] In some embodiments, the page log of the target task may include multiple page operation events and the corresponding event occurrence times.

[0127] For example, based on technologies such as event tracking, during the interaction between the user and the application, the user's operation behavior on each page of the application and the corresponding timestamps can be monitored, and corresponding page operation events and event occurrence times can be generated and stored in the page log.

[0128] For example, the above page operation events can record multiple parameters related to the corresponding operation behavior, such as session ID, user ID, scene ID, page title, and page URL (uniform resource locator).

[0129] Based on this, in some embodiments, reference is made to Figure 8 Based on the page logs of the target task, determine at least one actual access path corresponding to the target task, i.e., step 140 above, which may include the following steps.

[0130] Step 142: Based on the preset inactivity interval, filter at least one session corresponding to the target task from the page logs.

[0131] Each session includes multiple page operation events sorted by event occurrence time, and the difference in occurrence time between two adjacent page operation events in the session is no greater than a preset inactivity interval.

[0132] During web page access, a session mechanism is typically used to manage user state and store temporary data to enable personalized interaction with users. The aforementioned preset inactivity interval is a timeout threshold preset by the server. If the client does not send any requests to the server within this preset inactivity interval, it means that the user has not performed any operation based on the services provided by the server during this period (i.e., inactive). The server can then close the current session to release resources and prevent system resources from being occupied by a large number of invalid accesses.

[0133] The aforementioned preset inactivity interval can be determined based on the configuration of the server corresponding to the target task; for example, it could be 30 minutes or 15 minutes, etc. This embodiment does not limit this.

[0134] In addition, each session's page operation events include at least a first entry event, which indicates entry into the starting target page, which is the first target page in the target page sequence.

[0135] Since each session corresponds to one access process, that is, one actual access path, step 142 above aims to filter out page operation events related to the target task from the large amount of data recorded in the page log, and group the large number of page operation events in the form of sessions to obtain multiple actual access paths related to the target task.

[0136] To improve filtering efficiency, step 142 above uses entering the initial target page as a marker event for starting access to the target task. Sessions containing this marker event are filtered out for subsequent analysis, while sessions that do not contain this marker event are not intended to access the target task and can be ignored and not included in subsequent analysis steps. For example, to distinguish different sessions, a corresponding session identifier, i.e., session_ID, can be configured for each session.

[0137] In practical applications, each page operation event may record the session identifier configured by the system during the corresponding session. Based on this, in addition to distinguishing different sessions based on a preset inactivity interval as shown in step 142, some embodiments can also filter and construct different sessions related to the target task based on the session identifier recorded in the page operation event, that is, aggregate based on the session identifier (grouping page operation events with the same session identifier into the same session); after aggregation, multiple page operation events in each session can also be sorted according to the event occurrence time.

[0138] Step 144: Starting from the first entry event, construct the sequence of actual accessed pages for each session.

[0139] For example, in step 144, for each session, the page operation events it contains can be traversed in chronological order. If it is a page entry event, the page_ID or scene_ID recorded in the page entry event is recorded in a preset sequence as an identifier to distinguish different pages, and finally the actual access page sequence user_line corresponding to the session is obtained.

[0140] Furthermore, in step 144, the first entry event and the corresponding page_ID or scene_ID of each subsequent page entry event can be recorded in the preset sequence only when the first entry event is obtained. This ensures that the first page in each actual access page sequence user_line is the first target page in the target page sequence, i.e. the starting target page. This aligns the starting point of each actual access page sequence user_line with the starting target page, filtering out other irrelevant pages located before the starting target page.

[0141] In the above embodiments, not only is page logs based on the target task obtained to acquire the actual page sequence corresponding to each historical access process of the user to the target task, but also each actual page sequence is aligned with the starting target page, reducing subsequent sequence matching steps (such as step 1612 or...). Figure 7 The workload of the process shown is reduced to ensure the accuracy of the total number of pages S and the number of unique pages N obtained from the statistics, as well as the accuracy of the user disorientation degree L obtained from further calculation.

[0142] In some embodiments, the above-mentioned step 140, which determines at least one actual access path corresponding to the target task based on the page log, may further include: cleaning the page operation events in each session before constructing the actual access page sequence.

[0143] In real-world applications, page logs record various types of page operation events, each event may contain multiple parameters, and the formats may differ. Therefore, data cleaning can be performed to remove events and parameters irrelevant to the analysis of the actual access path, retaining only those related to the analysis, such as the corresponding page identifier (e.g., page_ID or scene_ID), the time of entering the page, the time of leaving the page, the page URL, and page click behavior. The page click behavior can be used for matching based on preset key events as described in step 1614, improving the accuracy of judging the execution status of the target task.

[0144] For example, the above-mentioned cleaning of page operation events includes, but is not limited to, normalizing the various parameters in the page operation events, and merging the same or similar applications based on the application identifier (app_ID) recorded in the page operation events.

[0145] In the above embodiments, noise reduction through data cleaning can improve the processing efficiency and accuracy of subsequent steps.

[0146] In some embodiments, after obtaining the preset evaluation index through step 160, the cross-page task processing method described above may also perform the following steps: generating an optimization strategy for the target task based on the preset evaluation index.

[0147] For example, based on the task execution status and user disorientation L corresponding to multiple actual access routes determined in some embodiments, the degree to which the target task causes user disorientation can be comprehensively evaluated. For example, the success rate of the new product release task and the detour degree of the actual access route under successful execution can be evaluated, thereby determining whether it needs to be optimized, or determining the optimization priority of different target tasks (optimizing the target tasks that are more likely to cause user disorientation first).

[0148] For example, based on the visit list (visit_nodes), the unique visit list (unique_visited_nodes), the total number of pages (S), and the number of unique pages (N) generated during sequence matching in some embodiments, it is possible to determine which target pages are returned more frequently, which target pages redirect to non-target pages more often, and so on. These target pages are then designated as pages to be optimized, which allows for more targeted guidance to relevant personnel to optimize these pages, such as modifying page content and navigation methods. This avoids aimless modifications to the target task, improves optimization effectiveness and efficiency, increases the conversion rate of the corresponding target task, and enhances the user experience.

[0149] In some embodiments, the actual access routes, corresponding task execution status, user disorientation, etc. can also be stored to form an evaluation database of the target task, which is convenient for subsequent backtracking or cross-product comparison.

[0150] The cross-page task processing method provided in one or more of the above embodiments constrains the starting point to the starting target page when constructing the actual access page sequence, thereby achieving starting point alignment and capturing subsequent page operation events. This ensures that the constructed actual access page sequence is the real access process for the target task, reduces noise data, and ensures the accuracy of the final assessment of the user's disorientation level for the target task.

[0151] Secondly, the cross-page task processing method provided in one or more of the above embodiments adopts sequential matching based on page sequence when determining whether the actual access path matches the target access path. This method is tolerant of detours and repeated accesses, allowing non-target pages and duplicate pages to appear and retaining path deviation information (used to count S and N), while also restricting the appearance of each target page in sequence to ensure the accuracy of the matching results. At the same time, by matching based on preset key events, it avoids situations such as "reaching the final target page but not submitting" that lead to the false completion of the target task, ensuring that the matching results can reflect the true completion status of the target task and improving the accuracy of the evaluation.

[0152] Secondly, when determining the actual access path, data cleaning ensures data consistency, thereby guaranteeing the consistency and stability of subsequent statistical calculations for the total number of pages S and the number of unique pages N. By configuring the target access path corresponding to the target task (including determining R, configuring the target page sequence, and preset key events), cross-product alignment comparisons can be achieved, providing a reference for optimization directions.

[0153] Furthermore, based on the above embodiments, the entire process from data collection, cleaning, calculation and evaluation to the storage of evaluation results can be automated without much human intervention. It can be widely applied to various forms of applications (including PC applications, mobile applications, mini-programs, etc.) to improve the evaluation efficiency of each cross-page task and the entire application.

[0154] It is understood that the above embodiments are merely examples, and modifications can be made to the above embodiments in actual implementation. Those skilled in the art will understand that any modifications to the above embodiments that do not require creative effort fall within the protection scope of one or more embodiments of this specification, and will not be described again in the embodiments.

[0155] Based on the same inventive concept, one or more embodiments of this specification also provide a cross-page task processing device. Figure 9 This is a structural block diagram of the cross-page task processing device.

[0156] like Figure 9 As shown, the cross-page task processing device 300 may include: The target movement path determination module 301 is used to obtain the target access movement path of the target task, wherein the target access movement path includes a target page sequence, and the target page sequence includes multiple target pages that need to be accessed to complete the target task; The actual access path determination module 302 is used to obtain the page log of the target task and determine at least one actual access path corresponding to the target task based on the page log. The actual access path includes an actual access page sequence, and the actual access page sequence includes at least one target page. The path matching module 303 is used to match each actual access path with the target access path, and determine the preset evaluation index corresponding to the actual access path based on the matching result. The preset evaluation index is used to evaluate the degree to which the actual access path deviates from the target access path.

[0157] In some embodiments, the target access path further includes: a preset key event, wherein the preset key event is an event indicating that the target task has been successfully executed.

[0158] In some embodiments, the aforementioned preset evaluation indicators include task execution status, which indicates whether the actual access path successfully executes the target task.

[0159] In some embodiments, the above-mentioned path matching module 303 can be specifically used to perform the following operations: determine whether the actual access page sequence matches the target page sequence; determine whether there is a preset key event in the actual access path; if the actual access page sequence matches the target page sequence and there is a preset key event in the actual access path, determine that the task execution status corresponding to the actual access path is a successful state; otherwise, determine that the task execution status corresponding to the actual access path is a failed state.

[0160] In some embodiments, the above-mentioned path matching module 303 is used to perform the following operations: count the total number of pages S and the number of unique pages N contained in each actual access page sequence; evaluate the user disorientation degree corresponding to each actual access path based on the total number of pages S, the number of unique pages N and the number of target pages R, wherein the number of target pages R is the number of target pages contained in the target page sequence.

[0161] In some embodiments, the page logs described above include multiple page operation events and their corresponding occurrence times.

[0162] Based on this, the aforementioned actual movement path determination module 302 can be used to perform the following operations: based on a preset inactivity interval, filter at least one session corresponding to the target task from the page log; starting from the first entry event, construct the actual access page sequence corresponding to each session. Each session may include multiple page operation events sorted by event occurrence time, and each session's page operation events include at least a first entry event indicating entry into the starting target page, which is the first target page in the target page sequence.

[0163] Since the principle by which the cross-page task processing device 300 solves the problem is similar to that of the aforementioned cross-page task processing method, the implementation and principle of each module in the cross-page task processing device 300 can be found in the relevant embodiments of the aforementioned cross-page task processing method, and repeated details will not be repeated.

[0164] See Figure 10 , Figure 10 This is a structural block diagram of an electronic device provided for one or more embodiments of this specification. Figure 10 As shown, the electronic device 500 may include a processor 501 and a memory 502; the memory 502 may be coupled to the processor 501. It is worth noting that... Figure 10 This is an example; other types of structures can also be used to supplement or replace this structure to achieve telecommunications functions or other functions. The electronic device 500 can be a server, client, or other intermediate device; for example, the electronic device 500 can be... Figure 2 The processing device 13 shown.

[0165] In one possible implementation, the functionality of the cross-page task processing device 300 can be integrated into the processor 501. The processor 501 can be configured to perform the following operations: Obtain the target access path of the target task, wherein the target access path includes a target page sequence, and the target page sequence includes multiple target pages that need to be accessed sequentially to complete the target task; Obtain the page logs of the target task, and determine at least one actual access path corresponding to the target task based on the page logs, wherein the actual access path includes an actual access page sequence, and the actual access page sequence includes at least one target page; Each of the actual access routes is matched with the target access route to determine a preset evaluation index corresponding to the actual access route. The preset evaluation index is used to evaluate the degree to which the actual access route deviates from the target access route.

[0166] In another possible implementation, the cross-page task processing device 300 can be configured separately from the processor 501. For example, the cross-page task processing device 300 can be configured as a chip connected to the processor 501, and the degree of user disorientation in cross-page tasks can be automatically and visually assessed through the control of the processor 501.

[0167] Furthermore, in some alternative implementations, the electronic device 500 may also include: a communication module, an input unit, an audio processor, a display, a power supply, etc. It is worth noting that the electronic device 500 is not necessarily required to include these components. Figure 10 All components shown; in addition, the electronic device 500 may also include Figure 10 For components not shown, please refer to existing technologies.

[0168] This specification also provides, in one or more embodiments, a computer-readable storage medium capable of implementing all steps of the cross-page task processing method in the above embodiments. The computer-readable storage medium stores a computer program that, when executed by a processor, implements all steps of the cross-page task processing method in the above embodiments. Specific steps are described in the preceding embodiments and will not be repeated here.

[0169] In addition, one or more embodiments of this specification also provide a computer program product capable of implementing all the steps in the above-described cross-page task processing method embodiments; the computer program product includes: a computer program or instructions, which, when executed on a computer, cause the computer to implement all the steps of the cross-page task processing method in the above-described embodiments. Specific steps can be found in the foregoing embodiments and will not be repeated here.

[0170] The foregoing has described specific embodiments of this specification. In other possible implementations, some or all of the actions or steps described in the above embodiments may be performed in a different order than that shown in the above embodiments, and the desired result may still be achieved. Furthermore, the processes depicted in the accompanying drawings do not necessarily require a specific or sequential order to achieve the desired result. In some implementations, multitasking and parallel processing are possible or may be advantageous.

[0171] The various embodiments in this specification are described in a progressive manner. Similar or identical parts between embodiments can be referred to mutually. Each embodiment focuses on describing the differences from other embodiments. In particular, the device and system embodiments are basically similar to the method embodiments, so the descriptions are relatively simple; relevant parts can be referred to the descriptions of the method embodiments.

[0172] It should be noted that, unless otherwise specified, one or more embodiments of this specification and the features thereof can be combined with each other. This specification is not limited to any single aspect, nor to any single embodiment, nor to any combination and / or substitution of such aspects and / or embodiments. Furthermore, each aspect and / or embodiment of one or more embodiments of this specification can be used alone, or in combination with one or more other aspects and / or embodiments thereof.

[0173] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of one or more embodiments of this specification, and are not intended to limit them. Although one or more embodiments of this specification have been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some or all of the technical features therein. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of one or more embodiments of this specification, and they should all be covered within the scope of the claims and the specification of one or more embodiments of this specification.

[0174] The foregoing description of one or more embodiments of this specification has been provided in conjunction with optional implementation methods. However, these embodiments are merely exemplary and serve only an illustrative purpose. Based on this, various substitutions and modifications can be made to one or more embodiments of this specification, all of which fall within the protection scope of one or more embodiments of this specification.

Claims

1. A method for cross-page task processing, characterized in that, include: Obtain the target access path of the target task, wherein the target access path includes a target page sequence, and the target page sequence includes multiple target pages that need to be accessed sequentially to complete the target task; Obtain the page logs of the target task, and determine at least one actual access path corresponding to the target task based on the page logs, wherein the actual access path includes an actual access page sequence, and the actual access page sequence includes at least one target page; Each of the actual access routes is matched with the target access route to determine a preset evaluation index corresponding to the actual access route. The preset evaluation index is used to evaluate the degree to which the actual access route deviates from the target access route.

2. The method according to claim 1, characterized in that, The target access path also includes: preset key events, which are events indicating that the target task has been successfully executed; The preset evaluation indicators include task execution status, which indicates whether the actual access path successfully executes the target task. Each actual access path is matched with the target access path to determine a preset evaluation index corresponding to the actual access path, including: Determine whether the actual accessed page sequence matches the target page sequence; Determine whether the preset key event exists in the actual access route; If the actual access page sequence matches the target page sequence and the preset key event exists in the actual access path, the task execution state corresponding to the actual access path is determined to be a successful state; otherwise, the task execution state corresponding to the actual access path is determined to be a failed state.

3. The method according to claim 2, characterized in that, Determining whether the actual accessed page sequence matches the target page sequence includes: Determine whether the actual accessed page sequence contains all of the target pages; Determine whether the order of the target pages contained in the actual accessed page sequence is consistent with the target page sequence.

4. The method according to any one of claims 1 to 3, characterized in that, Each actual access path is matched with the target access path to determine a preset evaluation index corresponding to the actual access path, including: Based on the actual page access sequence, the total number of pages S and the number of unique pages N corresponding to each actual access path are counted. Based on the total number of pages S, the number of unique pages N, and the number of target pages R, the user disorientation degree corresponding to each of the actual access paths is evaluated, wherein the number of target pages R is the number of target pages contained in the target page sequence.

5. The method according to any one of claims 1 to 3, characterized in that, The page log includes multiple page operation events and their corresponding occurrence times; Based on the page logs, at least one actual access path corresponding to the target task is determined, including: Based on a preset inactivity interval, at least one session corresponding to the target task is filtered from the page log. The session includes multiple page operation events sorted according to the event occurrence time. The page operation events in the session include a first entry event indicating entry into the starting target page. The starting target page is the first target page in the target page sequence. Starting from the first entry event, construct the sequence of actual accessed pages corresponding to the session.

6. The method according to claim 5, characterized in that, Determining at least one actual access path corresponding to the target task based on the page logs also includes: Before constructing the actual page access sequence, the page operation events in the session are cleaned.

7. The method according to any one of claims 1 to 3, characterized in that, Also includes: The target task is optimized based on the preset evaluation indicators.

8. A cross-page task processing device, characterized in that, include: The target movement path determination module is used to obtain the target access movement path of the target task, wherein the target access movement path includes a target page sequence, and the target page sequence includes multiple target pages that need to be accessed to complete the target task; The actual access path determination module is used to obtain the page log of the target task and determine at least one actual access path corresponding to the target task based on the page log, wherein the actual access path includes an actual access page sequence, and the actual access page sequence includes at least one target page. The path matching module is used to match each of the actual access paths with the target access path, and determine the preset evaluation index corresponding to the actual access path based on the matching result. The preset evaluation index is used to evaluate the degree to which the actual access path deviates from the target access path.

9. The apparatus according to claim 8, characterized in that, The target access path also includes: preset key events, which are events indicating that the target task has been successfully executed; The preset evaluation indicators include task execution status, which indicates whether the actual access path successfully executes the target task. The movement path matching module is used to perform the following operations: Determine whether the actual accessed page sequence matches the target page sequence; Determine whether the preset key event exists in the actual access route; If the actual access page sequence matches the target page sequence and the preset key event exists in the actual access path, the task execution state corresponding to the actual access path is determined to be a successful state; otherwise, the task execution state corresponding to the actual access path is determined to be a failed state.

10. The apparatus according to claim 8 or 9, characterized in that, The movement path matching module is used to perform the following operations: Based on the actual page access sequence, the total number of pages S and the number of unique pages N corresponding to each actual access path are counted. Based on the total number of pages S, the number of unique pages N, and the number of target pages R, the user disorientation degree corresponding to each of the actual access paths is evaluated, wherein the number of target pages R is the number of target pages contained in the target page sequence.

11. The apparatus according to claim 8 or 9, characterized in that, The page log includes multiple page operation events and their corresponding occurrence times; The actual movement path determination module is used to perform the following operations: Based on a preset inactivity interval, at least one session corresponding to the target task is filtered from the page log. The session includes multiple page operation events sorted according to the event occurrence time. The page operation events in the session include at least a first entry event indicating entry into the starting target page. The starting target page is the first target page in the target page sequence. Starting from the first entry event, construct the sequence of actual accessed pages corresponding to the session.

12. An electronic device, characterized in that, The electronic device includes: Memory, used to store computer programs; A processor is configured to execute a computer program stored in the memory, wherein when the computer program is executed, it implements the method described in any one of claims 1-7.

13. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer program instructions, which, when executed, implement the method described in any one of claims 1-7.

Images