Target path determination method, electronic device, storage medium, and program product

Abstract

The present disclosure provides a target path determination method, an electronic device, a readable storage medium and a program product. The target path determination method comprises: determining a current node in a target behavior link; judging whether the current node in the target behavior link is a fallback node; and if not, performing a target operation according to one or more of the current node, a preset split node and a cache area state, the target operation comprising one or more of determining a target path, updating the cache area and redetermining the current node, the cache area being used for storing nodes in the target behavior link.

Description

Technical Field

[0001] This disclosure relates to the field of computer technology, and more particularly to a method for determining a target path, an electronic device, a storage medium, and a program product. Background Technology

[0002] With the continuous development of computer technology and the internet, various applications and websites are emerging to meet the needs of all walks of life. By analyzing the usage of applications or websites, relevant personnel can better optimize them.

[0003] In related technologies, trigger events on various pages within an application or website are collected. These trigger events are then manually analyzed to determine the target behavior chain, and further analysis of this chain leads to the determination of the target path. However, because applications or websites typically have a large number of users and complex page trigger events, the target path determination methods in these technologies rely heavily on manual operation, resulting in low efficiency in target path determination. Summary of the Invention

[0004] This disclosure provides a method for determining a target path, an electronic device, a storage medium, and a program product.

[0005] The first aspect of this disclosure provides a target path determination method, comprising: determining a current node in a target behavior chain; determining whether the current node in the target behavior chain is a backtracking node; and if not, performing a target operation based on one or more of the current node, a preset splitting node, and a cache state, wherein the target operation includes one or more of determining a target path, updating a cache, and re-determining the current node, wherein the cache is used to store nodes in the target behavior chain.

[0006] In some implementations, determining whether the current node in the target behavior chain is a fallback node includes: determining that the current node in the target behavior chain is the fallback node in response to the existence of a node identical to the current node in the buffer; and determining that the current node in the target behavior chain is not the fallback node in response to the absence of a node identical to the current node in the buffer.

[0007] In some implementations, the preset split node includes a split head node, and the step of performing a target operation based on one or more of the current node, the preset split node, and the cache state includes: in response to the current node being the split head node and the cache state not being empty, using the cache path in the cache as the target path and clearing the cache, storing the current node in the cache, and re-determining the current node, wherein the cache path is generated based on the nodes stored in the cache; and in response to the current node being the split head node and the cache state being empty, or the current node not being the split head node, storing the current node in the cache and re-determining the current node.

[0008] In some implementations, before storing the current node in the cache, the method further includes: resetting the fallback flag; after determining whether the current node in the target behavior chain is a fallback node, the method further includes: if so, detecting whether a fallback flag exists; and performing the target operation based on the detection result of the fallback flag.

[0009] In some implementations, performing the target operation based on the detection result of the rollback identifier includes: when the rollback identifier is detected, directly deleting nodes in the cache that are stored later than the target node, and re-determining the current node, wherein the target node is a node in the cache that is the same as the current node; and when the rollback identifier is detected not to exist, using the cache path in the cache as the target path, deleting nodes in the cache that are stored later than the target node, adding the rollback identifier, and re-determining the current node.

[0010] In some implementations, the preset split node includes a split tail node, and the step of performing a target operation based on one or more of the current node, the preset split node, and the cache state includes: in response to the current node being the split tail node and the cache state not being empty, storing the current node in the cache and using the cache path in the stored cache as the target path, and re-determining the current node, wherein the cache path is generated based on the node stored in the cache; in response to the current node being the split tail node and the cache state being empty, directly re-determining the current node; and in response to the current node not being the split tail node, storing the current node in the cache and re-determining the current node.

[0011] In some implementations, the preset split node includes a split start node and a split tail node. The step of performing a target operation based on one or more of the current node, the preset split node, and the cache state includes: in response to the current node not being the split start node, the cache state not being empty, and the current node being the split tail node, storing the current node in the cache, using the cache path in the stored cache as the target path, and re-determining the current node, the cache path being generated based on the nodes stored in the cache; in response to the current node not being the split start node, the cache state not being empty, and the current node not being the split tail node, storing the current node in the cache, and re-determining the current node; in response to the current node not being the split start node and the cache state being empty, directly re-determining the current node; and in response to the current node being the split start node, clearing the cache, storing the current node in the cleared cache, and re-determining the current node.

[0012] In some implementations, after determining whether the current node in the target behavior chain is a fallback node, the method further includes: if so, directly deleting the node stored in the cache that is later than the target node, and re-determining the current node, wherein the target node is the same node in the cache as the current node.

[0013] In some implementations, before determining whether the current node in the target behavior chain is a fallback node, the method further includes: determining that the cache endpoint is different from the current node, wherein the cache endpoint is the most recently stored node in the cache.

[0014] In some implementations, after determining the current node in the target behavior chain, the method further includes: re-determining the current node in response to the buffer endpoint being the same as the current node.

[0015] In some implementations, before determining the current node in the target behavior chain, the method further includes: determining target behavior data, the target behavior data including multiple trigger nodes and their corresponding trigger times; and connecting the multiple trigger nodes together in sequence according to the order of the trigger times to generate the target behavior chain.

[0016] In some implementations, the method further includes: calculating a multi-dimensional score for each of the target paths, the multi-dimensional score including one or more of opportunity volume score, opportunity conversion rate score, churn rate score, and dwell time score; determining an optimal path from the plurality of target paths based on the multi-dimensional score; and outputting the optimal path.

[0017] A second aspect of this disclosure provides an electronic device, comprising: a memory storing execution instructions; and a processor executing the execution instructions stored in the memory, causing the processor to perform a target path determination method according to any embodiment of this disclosure.

[0018] A third aspect of this disclosure provides a readable storage medium storing executable instructions, which, when executed by a processor, are used to implement the target path determination method according to any embodiment of this disclosure.

[0019] A fourth aspect of this disclosure provides a computer program product, including a computer program / instructions that, when executed by a processor, implement the target path determination method described in any embodiment of this disclosure. Attached Figure Description

[0020] The accompanying drawings illustrate exemplary embodiments of the present disclosure and, together with the description thereof, serve to explain the principles of the present disclosure. These drawings are included to provide a further understanding of the present disclosure and are incorporated in and constitute a part of this specification.

[0021] Figure 1 This is a flowchart illustrating a target path determination method according to some embodiments of this disclosure.

[0022] Figure 2 This is another flowchart illustrating the target path determination method of some embodiments of this disclosure.

[0023] Figure 3 This is yet another flowchart illustrating the target path determination method of some embodiments of this disclosure.

[0024] Figure 4 This is a schematic diagram illustrating the process of determining whether a node is a rollback node in some embodiments of this disclosure.

[0025] Figure 5 This is a schematic diagram illustrating the process of performing the target operation in some embodiments of this disclosure.

[0026] Figure 6 This is a flowchart illustrating some embodiments of the target path determination method based on splitting the first node.

[0027] Figure 7 This is another schematic diagram illustrating the execution of the target operation in some embodiments of this disclosure.

[0028] Figure 8 This is a flowchart illustrating some implementations of the present disclosure of path splitting based on splitting the first node.

[0029] Figure 9This is a visualization example of the path splitting results based on splitting the first node in some implementations of this disclosure.

[0030] Figure 10 This is another schematic diagram illustrating the execution of the target operation in some embodiments of this disclosure.

[0031] Figure 11 This is a flowchart illustrating some embodiments of the target path determination method based on split tail nodes disclosed herein.

[0032] Figure 12 This is a flowchart illustrating some implementations of path splitting based on split tail nodes in this disclosure.

[0033] Figure 13 This is a visualization example of the path splitting results based on splitting the tail node in some implementations of this disclosure.

[0034] Figure 14 This is another schematic diagram illustrating the execution of the target operation in some embodiments of this disclosure.

[0035] Figure 15 This is a flowchart illustrating a target path determination method based on splitting the first node and splitting the tail node, according to some embodiments of this disclosure.

[0036] Figure 16 This is a schematic diagram of a path splitting process based on splitting the first node and splitting the last node in some implementations of this disclosure.

[0037] Figure 17 This is another flowchart illustrating the target path determination method of some embodiments of this disclosure.

[0038] Figure 18 This is a visualization example of user path analysis results from some implementations of this disclosure.

[0039] Figure 19 This is a visualization example of the funnel analysis results of some embodiments of this disclosure.

[0040] Figure 20 This is a visual example of a funnel analysis configuration page for some embodiments of this disclosure.

[0041] Figure 21 This is a visualization example of the distribution analysis results of some embodiments of this disclosure.

[0042] Figure 22 This is a visualization example of the interval analysis results of some embodiments of this disclosure.

[0043] Figure 23This is a visualization example of the thermal analysis results of some embodiments of this disclosure.

[0044] Figure 24 This is a visualization example of the attribute analysis results of some embodiments of this disclosure.

[0045] Figure 25 This is a schematic diagram of the architecture of a target path determination system according to some embodiments of this disclosure.

[0046] Figure 26 This is a schematic block diagram of a target path determination device using a processor-based hardware implementation according to one embodiment of the present disclosure. Detailed Implementation

[0047] The present disclosure will now be described in further detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are for illustrative purposes only and are not intended to limit the scope of the disclosure. Furthermore, it should be noted that, for ease of description, only the parts relevant to the present disclosure are shown in the accompanying drawings.

[0048] It should be noted that, where there is no conflict, the embodiments and features described in this disclosure can be combined with each other. The technical solutions of this disclosure will now be described in detail with reference to the accompanying drawings and embodiments.

[0049] Unless otherwise stated, the exemplary implementations / embodiments shown are to be understood as providing exemplary features of various details that provide ways in which the technical concepts of this disclosure can be implemented in practice. Therefore, unless otherwise stated, the features of various implementations / embodiments may be additionally combined, separated, interchanged and / or rearranged without departing from the technical concepts of this disclosure.

[0050] The use of crosshairs and / or shading in the accompanying drawings is generally used to clarify the boundaries between adjacent components. Thus, unless otherwise stated, the presence or absence of crosshairs or shading does not convey or indicate any preference or requirement for the specific material, material properties, dimensions, proportions, commonalities between the illustrated components, or any other characteristics, properties, etc., of the components. Furthermore, in the accompanying drawings, the dimensions and relative dimensions of components may be exaggerated for clarity and / or descriptive purposes. When exemplary embodiments can be implemented differently, a specific process sequence may be performed in a different order than that described. For example, two consecutively described processes may be performed substantially simultaneously or in the reverse order of their description. Furthermore, the same reference numerals denote the same components.

[0051] When a component is referred to as being "on" or "above" another component, "connected to," or "joined to" another component, the component may be directly on, directly connected to, or directly joined to the other component, or there may be intermediate components. However, when a component is referred to as being "directly on" another component, "directly connected to," or "directly joined to" another component, there are no intermediate components. Therefore, the term "connection" can refer to a physical connection, an electrical connection, etc., and may or may not have intermediate components.

[0052] The terminology used herein is for the purpose of describing particular embodiments and is not intended to be limiting. As used herein, unless the context clearly indicates otherwise, the singular forms “a” and “the” are intended to include the plural forms as well. Furthermore, when the terms “comprising” and / or “including” and variations thereof are used in this specification, it indicates the presence of the stated features, integrals, steps, operations, parts, components, and / or groups thereof, but does not exclude the presence or addition of one or more other features, integrals, steps, operations, parts, components, and / or groups thereof. It should also be noted that, as used herein, the terms “substantially,” “about,” and other similar terms are used as approximate terms rather than as terms of degree, thus explaining the inherent biases in measurements, calculated values, and / or provided values ​​that would be recognized by one of ordinary skill in the art.

[0053] The target path determination method disclosed herein can be applied to the target path determination apparatus disclosed herein, which can be configured on an electronic device. The electronic device can be a server or a terminal device, and the terminal device can be a mobile terminal, such as a mobile phone, tablet computer, personal digital assistant, or other hardware device with various operating systems.

[0054] The following text combines Figures 1 to 26 The target path determination method and target path determination device disclosed herein are described in detail.

[0055] Figure 1 This is a flowchart illustrating some embodiments of the target path determination method of this disclosure. Please refer to... Figure 1 The target path determination method S100 provided in this disclosure may include steps S110, S120 and S130.

[0056] S110: Determine the current node in the target behavior chain.

[0057] S120: Determine whether the current node in the target behavior chain is a fallback node.

[0058] S130: If not, then perform the target operation based on one or more of the current node, the preset split node, and the cache state. The target operation includes one or more of the following: determining the target path, updating the cache, and re-determining the current node. The cache is used to store nodes in the target behavior chain.

[0059] The target path determination method of this disclosure automatically determines whether the current node in the target behavior chain is a fallback node. If the current node is not a fallback node, it automatically executes a target operation based on one or more of the current node, a preset split node, and the cache state, thereby determining the target path. This avoids complex manual operations and improves the efficiency of target path determination. Furthermore, since target behavior chains are typically long, meaning they contain a large number of nodes, and a single page of an application or website may be triggered multiple times (meaning there may be multiple identical nodes in the target behavior chain), determining fallback nodes in the target behavior chain and executing target operations based on preset split nodes further improves the accuracy of the determined target path.

[0060] Optionally, the target behavior chain may include multiple nodes, which can be chained together in a certain order. Each node's identifier corresponds one-to-one with a page in the application / website; that is, one node identifier can uniquely represent a page in the application / website. In this disclosure, the same node as another node can be understood as two nodes having the same identifier, meaning both nodes correspond to the same page in the application / website.

[0061] Furthermore, in step S110, each node can be selected as the current node sequentially according to the cascading order of the multiple nodes in the target behavior link. For example, if the target behavior link is: node A → node B → node C → node B → node D → node B → node C, then node A, which is in the first position, is selected as the current node and the subsequent steps are executed. When the current node is re-determined, node B, which is in the second position, is selected as the current node and the subsequent steps are executed. When the current node is re-determined, node C, which is in the third position, is selected as the current node and the subsequent steps are executed. This process continues until node C, which is in the seventh position (i.e., the last position), is selected as the current node and the subsequent steps are executed.

[0062] Optionally, a back node can be understood as the node corresponding to the application / website page after the back operation is performed. A page of an application / website may include multiple elements. After receiving a page switching instruction, it can switch from the current page to another page. The page switching instruction can be generated through voice detection, image detection, touch detection (such as detecting whether an element on the current page has been clicked, double-clicked, long-pressed, etc.).

[0063] Optionally, preset split nodes can be used to split the target behavior link to obtain the target path from the target behavior link. Preset split nodes may include one or more of a split start node and a split tail node. The split start node is used to determine the starting point of the target path. The split tail node is used to determine the ending point of the target path.

[0064] For example, preset split nodes can be pre-set based on the behavior to be observed (e.g., a function to guide the user to complete or an application / website page to visit). Pre-setting the first split node based on the behavior corresponding to the starting event facilitates obtaining the subsequent path after the behavior occurs, thus facilitating analysis of where the user went. Pre-setting the last split node based on the behavior corresponding to the ending event facilitates obtaining the preceding path before the behavior occurs, thus facilitating analysis of where the user originated.

[0065] Optionally, the nodes stored in the cache may include the preceding nodes of the current node in the target behavior chain, or may include both the preceding nodes and the current node in the target behavior chain; this is not limited here. A preceding node can be understood as a node in the target behavior chain that precedes the current node. The preceding nodes stored in the cache may be all the preceding nodes of the current node in the target behavior chain, or may be some of the preceding nodes of the current node in the target behavior chain; this is not limited here.

[0066] The cache state can be empty or not empty. For example, if the number of nodes stored in the cache is greater than a preset value (e.g., 0) or the occupied capacity of the cache is greater than a preset capacity (e.g., 0), then the cache state is determined to be not empty; if the number of nodes stored in the cache is less than or equal to a preset value (e.g., 0) or the occupied capacity of the cache is less than or equal to a preset capacity (e.g., 0), then the cache state is determined to be empty.

[0067] Updating the cache includes, but is not limited to, deleting nodes stored in the cache and storing the current node in the cache.

[0068] Furthermore, in some embodiments, the target path is determined based on the current node, the preset split node, and the cache state, and the cache is updated, and the current node is re-determined; in some embodiments, the target path is determined based on the current node, the preset split node, and the cache state, and the current node is re-determined; in some embodiments, the cache is updated based on the current node, the preset split node, and the cache state, and the current node is re-determined; in some embodiments, the current node is re-determined based on the current node, the preset split node, and the cache state; in some embodiments, the cache is updated based on the current node and the preset split node, and the current node is re-determined.

[0069] It should be noted that in related technologies, user paths are tracked by pre-setting a funnel or defining the page events or click events to be analyzed. However, in this disclosure, it is not necessary to pre-set a funnel or define the page events or click events to be analyzed. Instead, the user path is automatically generated by splitting the target behavior link, making the solution more flexible.

[0070] Please see Figure 2 In some embodiments, steps S140 and S150 are included before step S110.

[0071] S140: Determine the target behavior data, which includes multiple trigger nodes and their corresponding trigger times.

[0072] S150: Connect multiple trigger nodes in sequence according to the order of their triggering times to generate the target behavior chain.

[0073] The target path determination method described above can automatically generate target behavior links based on target behavior data, thereby reducing manual operations and improving the overall efficiency in determining target paths.

[0074] For example, user behavior data can be collected in advance and stored uniformly in a preset path table. The table structure of the preset path table may include one or more of the following: user device identifier (Duid), session identifier (Ssid), page identifier (Uicode), event identifier (evt_id), trigger time (client_time), and trigger order (session_rank). Ssid, or SessionID, is used to uniquely identify a user's login session. Uicode is used to uniquely identify the currently triggered application / website page. evt_id is used to uniquely identify the event / action that triggered the current page.

[0075] Furthermore, based on session identifiers, data with the same session identifiers in the preset path table can be filtered out, and the page identifiers in the filtered data can be used as the identifiers of trigger nodes. Then, a set of target behavior data can be generated based on the identifiers of the trigger nodes and their corresponding trigger times. A set of target behavior data can generate a target behavior chain.

[0076] Please see Figure 3 In some implementations, step S160 is included before step S120.

[0077] S160: Determine that the cache endpoint is different from the current node. The cache endpoint is the most recently stored node in the cache.

[0078] Specifically, in this embodiment, it is only when the endpoint of the buffer is different from the current node that it is determined whether the current node in the target behavior chain is a fallback node.

[0079] Furthermore, in some embodiments, after step S110, the method further includes: re-determining the current node in response to the buffer endpoint being the same as the current node.

[0080] Specifically, in this embodiment, if the cache endpoint is the same as the current node, the current node is directly redefined, that is, the next node in the target behavior chain is taken as the current node, and then the cache endpoint is re-evaluated to see if it is the same as the current node. This avoids nodes corresponding to multiple subpages of the same page entering subsequent judgments, reduces the judgment process, and improves the efficiency of determining the target path.

[0081] Please see Figure 4 In some implementations, step S120 may include steps S121 and S122.

[0082] S121: In response to the existence of a node identical to the current node in the buffer, determine the current node in the target behavior chain as the fallback node.

[0083] S122: In response to the absence of a node identical to the current node in the buffer, determine that the current node in the target behavior chain is not a fallback node.

[0084] The target path determination method described above can accurately determine whether the current node is a fallback node based on the nodes stored in the cache.

[0085] For example, it can be determined whether there is a node in the cache that is the same as the current node by matching the current node with each node stored in the cache. If there is a node in the cache that is the same as the current node, the current node can be considered to be in the cache, and the current node in the target behavior chain can be determined to be a backtrack node. If there is no node in the cache that is the same as the current node, the current node can be considered to be not in the cache, and the current node in the target behavior chain can be determined to be a backtrack node.

[0086] In some implementations, the preset split node includes the split head node. See also... Figure 5 Accordingly, step S130 may include steps S131 and S132.

[0087] S131: In response to the current node being the first node of the split and the cache state not being empty, the cache path in the cache is used as the target path, the cache is cleared, the current node is stored in the cache, and the current node is redefined. The cache path is generated based on the node stored in the cache.

[0088] For example, when the current node in the target behavior chain is not a backtracking node, the current node is the first split node, and the cache area is not empty, the cached path in the cache area is first stored as the target path in the preset database, then the cache area is cleared, and then the current node is stored in the cleared cache area. Next, the current node is re-determined. In this way, when traversing to the first split node, the cached path is regenerated from the first split node, thus facilitating the splitting of multiple target paths originating from the first split node from a single target behavior chain.

[0089] For example, in this disclosure, nodes stored in the cache can be chained together in chronological order of storage time to form a cache path. The cache path includes all nodes stored in the cache. The number of cache paths is zero or one. The cache path is updated in real time. New nodes stored in the cache are added to the end of existing cache paths to form new cache paths. When a node in the cache is deleted, that node is also deleted from the cache path, thus forming a new cache path.

[0090] S132: In response to the current node being the first node of the split and the cache state being empty, or the current node not being the first node of the split, store the current node in the cache and redetermine the current node.

[0091] For example, if the current node in the target behavior chain is not a backtracking node, and the current node is the first node of the split, and the cache is empty, then the current node is first stored directly in the cache, and then the current node is re-determined; if the current node is not the first node of the split, then similarly, the current node is first stored directly in the cache, and then the current node is re-determined.

[0092] The target path determination method described above, when the current node in the target behavior chain is not a fallback node, employs a first node splitting approach. It splits the target behavior chain based on the current node, the split first node, and the cache state, thereby automatically obtaining the target path and improving the efficiency and accuracy of target path determination. Furthermore, since the target path is determined based on the split first node, it can be used for subsequent research into where the user is going.

[0093] In some implementations, before storing the current node in the cache, the method further includes: resetting the fallback flag (setting it to have no fallback flag). See also [link to relevant documentation]. Figure 6 After step S120, steps S170 and S180 are also included.

[0094] S170: If so, check if a rollback flag exists.

[0095] Specifically, if the current node in the target behavior chain is a fallback node, then check whether there is a fallback flag.

[0096] For example, the rollback flag is peripheral statistics. When a rollback flag is detected, it can be assumed that a rollback operation has occurred.

[0097] S180: Execute the target operation based on the detection result of the rollback flag.

[0098] Please see Figure 7 In some implementations, step S180 may include steps S181 and S182.

[0099] S181: When a rollback flag is detected, directly delete the node in the cache that is stored later than the target node, and redetermine the current node. The target node is the same node in the cache as the current node.

[0100] For example, when a rollback flag is detected, nodes stored later than the target node in the cache are first deleted, and then the current node is re-determined. In this way, paths following nodes that are identical to the current node in the cache path are deleted in a timely manner, that is, paths corresponding to rollback operations are deleted, thereby avoiding interference from rollback operations on the target path generated subsequently based on the cache path, and improving the accuracy of the target path.

[0101] S182: When a fallback flag is detected as not existing, the cache path in the cache area is used as the target path, and nodes in the cache that are stored later than the target node are deleted, a fallback flag is added, and the current node is redefined.

[0102] For example, when a rollback flag is detected as missing, the cached path in the cache is first stored as the target path in a preset database. Then, nodes in the cache that are stored later than the target node are deleted. Next, a rollback flag is added, and then the current node is redefined. In this way, the target path before the rollback operation can be accurately and timely stored, ensuring the integrity of the total number of target paths.

[0103] The target path determination method described above resets the fallback flag before storing the current node in the cache, and checks whether a fallback flag exists for the current node in the target behavior chain, and performs the target operation based on the detection result of the fallback flag. In this way, the user's fallback operation can be identified more accurately based on the fallback flag, thereby determining the target path more accurately.

[0104] In one example, a diagram illustrating the path splitting process based on splitting the first node is shown below. Figure 8As shown. Further, if the target behavior chain is: homepage1→homepage / ershou_home→homepage1→homepage / ershou_home→ershoul istsearch→ershou / l ist→plat / li st→ershou / list→ershou / detail→ershou / detail / imagedetail→ershou / detail→house / t imel ine→ershou / detail→ershou / list→plat / l ist→ershou / list→ershou / detail→ershou / li st, and the first node of the split is homepage1, then according to... Figure 8 The process shown decomposes the target behavior chain into paths, yielding the following target path:

[0105] (1) homepage1→homepage / ershou_home;

[0106] (2) homepage1→homepage / ershou_home→ershoul istsearch→ershou / list→plat / list;

[0107] (3) homepage1→homepage / ershou_home→ershoul istsearch→ershou / list→ershou / detail→ershou / detail / imagedetail;

[0108] (4) homepage1→homepage / ershou_home→ershoul istsearch→ershou / list→ershou / detail→house / timeline;

[0109] (5) homepage1→homepage / ershou_home→ershoul istsearch→ershou / list→plat / list;

[0110] (6)homepage1→homepage / ershou_home→ershoul istsearch→ershou / list→ershou / detai.

[0111] In one example, a visualization of the path splitting result based on splitting the first node is shown below. Figure 9 As shown.

[0112] In some implementations, the preset split node includes a split tail node. See also... Figure 10 Accordingly, step S130 may include steps S133, S134 and S135.

[0113] S133: In response to the current node being the split tail node and the cache state not being empty, store the current node in the cache, use the cache path in the stored cache as the target path, and redetermine the current node. The cache path is generated based on the node stored in the cache.

[0114] For example, when the current node in the target behavior chain is not a backtracking node, and the current node is a split tail node, and the cache state is not empty, the current node is first stored in the cache, and then the cache path in the cache that stores the current node is used as the target path, and then the current node is re-determined.

[0115] S134: In response to the current node being the split tail node and the cache state being empty, directly redetermine the current node.

[0116] For example, if the current node in the target behavior chain is not a backtracking node, and the current node is a split tail node, and the cache state is empty, the current node is directly re-determined.

[0117] S135: In response to the current node not being the split tail node, store the current node in the cache and redetermine the current node.

[0118] For example, when the current node in the target behavior chain is not a backtracking node and is not a split tail node, the current node is first stored in the cache area, and then the current node is re-determined.

[0119] The target path determination method described above employs a tail node splitting approach. It splits the target behavior link based on the current node, the split tail node, and the cache state, thereby automatically obtaining the target path and improving the efficiency and accuracy of target path determination. Furthermore, since the target path is determined based on the split tail node, it can be used for subsequent research into the user's origin.

[0120] Please see Figure 11 In some implementations, step S120 is followed by step S190.

[0121] S190: If so, directly delete the node in the cache that is stored later than the target node, and redetermine the current node. The target node is the same node in the cache as the current node.

[0122] For example, in step S190, if the current node in the target behavior chain is a rollback node, the nodes stored in the cache later than the target node are first directly deleted, and then the current node is re-determined. In this way, the paths after the nodes in the cache path that are the same as the current node are deleted in a timely manner, that is, the paths corresponding to the rollback operation are deleted, thereby avoiding interference from the rollback operation on the target path generated subsequently based on the cache path, and improving the accuracy of the target path.

[0123] In one example, a flowchart illustrating path splitting based on splitting the tail node is shown below. Figure 12 As shown. Further, if the target behavior chain is: homepage1→homepage / ershou_home→homepage1→homepage / ershou_home→ershoulistsearch→ershou / li st→plat / li st→ershou / list→ershou / detail→ershou / detail / imagedetail→ershou / detail→house / timeline→ershou / detail→ershou / list→plat / li st→ershou / list→ershou / detail→ershou / li st, and the tail node is ershou / detail, then according to... Figure 12 The process shown decomposes the target behavior chain into paths, yielding the following target path:

[0124] (1) homepage1→homepage / ershou_home→ershoul istsearch→ershou / list→ershou / detail;

[0125] (2)homepage1→homepage / ershou_home→ershoul istsearch→ershou / list→ershou / detail.

[0126] In one example, a visualization of the path splitting result based on splitting the tail node is shown below. Figure 13 As shown.

[0127] In some implementations, the preset split node includes a split start node and a split tail node. See also... Figure 14 Accordingly, step S130 may include steps S136, S137, S138 and S139.

[0128] S136: In response to the current node not being the first node of the split, the cache state not being empty, and the current node being the last node of the split, store the current node in the cache, use the cache path in the stored cache as the target path, and redetermine the current node. The cache path is generated based on the node stored in the cache.

[0129] For example, when the current node in the target behavior chain is not a backtracking node, and the current node is not the first node of the split, and the cache state is not empty, and the current node is the last node of the split, the current node is first stored in the cache, and then the cache path in the stored cache is used as the target path, and then the current node is re-determined.

[0130] S137: In response to the current node not being the first node of the split, the cache state not being empty, and the current node not being the last node of the split, store the current node in the cache and redetermine the current node.

[0131] For example, if the current node in the target behavior chain is not a backtracking node, and the current node is not the first node of the split, and the cache state is not empty, and the current node is not the last node of the split, the current node is first stored in the cache, and then the current node is re-determined.

[0132] S138: In response to the current node not being the first node of the split and the cache state being empty, directly redetermine the current node.

[0133] For example, if the current node in the target behavior chain is not a backtracking node, and the current node is not the first node of the split, and the cache state is empty, the current node is directly re-determined.

[0134] S139: In response to the current node being the first node of the split, clear the cache, store the current node in the cleared cache, and redetermine the current node.

[0135] For example, when the current node in the target behavior chain is not a backtracking node and the current node is the first node of the split, the cache is cleared first, then the current node is stored in the cleared cache, and then the current node is re-determined.

[0136] The target path determination method described above employs a first-and-last node splitting approach. It splits the target behavior link based on the current node, the first split node, the last split node, and the cache state, thereby automatically obtaining the target path and improving the efficiency and accuracy of target path determination. Furthermore, since the target path is determined based on the first and last split nodes, it can be used for subsequent research on the main path problem.

[0137] Further, please refer to Figure 15 In some implementations, step S120 is followed by step S190.

[0138] S190: If so, directly delete the node in the cache that is stored later than the target node, and redetermine the current node. The target node is the same node in the cache as the current node.

[0139] For example, if the current node in the target behavior chain is a fallback node, first delete the nodes stored in the cache that are later than the target node, and then re-determine the current node. In this way, the paths after the nodes that are the same as the current node in the cache path are deleted in a timely manner, that is, the paths corresponding to the fallback operation are deleted, thereby avoiding interference from the fallback operation on the target path generated subsequently based on the cache path, and improving the accuracy of the target path.

[0140] In one example, the process of splitting the first and last nodes is as follows: Figure 16 As shown. Further, if the target behavior chain is: homepage1→homepage / ershou_home→homepage1→homepage / ershou_home→ershoulistsearch→ershou / list→plat / list→ershou / list→ershou / detail→ershou / detail→ershou / detail / imagedetail→ershou / detail→house / timeline→ershou / detail→ershou / list→plat / list→ershou / list→ershou / list, and the first node of the split is homepage1 and the last node of the split is ershou / detail, then according to... Figure 16 The process shown decomposes the target behavior chain into paths, yielding the following target path:

[0141] (1) homepage / ershou_home→ershoul istsearch→ershou / list→ershou / detail;

[0142] (2) homepage / ershou_home→ershoul istsearch→ershou / list→ershou / detail.

[0143] Please see Figure 17 In some embodiments, steps S210, S220 and S230 may also be included.

[0144] S210: Calculate the multi-dimensional scores for each target path. The multi-dimensional scores include one or more of the following: opportunity volume score, opportunity conversion rate score, churn rate score, and dwell time score.

[0145] S220: Determine the optimal path from multiple target paths based on multi-dimensional scores.

[0146] S230: Output the optimal path.

[0147] The target path determination method described above can automatically determine the optimal path from multiple target paths based on multi-dimensional scores and output the optimal path, thereby facilitating relevant personnel to optimize applications or websites based on the optimal path.

[0148] For example, the opportunity score for a target path can be determined based on a preset opportunity table. For instance, the preset opportunity table may include all user behaviors on an application / website that could potentially generate opportunities. The target path is then matched against behaviors in the preset opportunity table, and the number of matched behaviors is used as the opportunity score for the corresponding target path.

[0149] For example, the conversion rate score of a target path can include the conversion rate of nodes within the path and the conversion rate of the path itself. Specifically, the conversion rate of a node within the path = the number of opportunities generated by that node / the number of visits to that node; and the conversion rate of a path = the number of opportunities generated by that path / the number of visits to that path. It is understood that paths with the same number of nodes can have their conversion rate scores compared. For two target paths with different numbers of nodes, a predetermined number of reverse paths can be extracted from the target path using a tail-node reverse-engineering approach, and then the conversion rate scores can be compared based on these reverse paths.

[0150] For example, the churn rate score of a target path may include the churn rate of nodes within the path and the churn rate of the path itself. The churn rate of a node within the path is 1 - the conversion rate of that node. The conversion rate of that node is the number of times that node is triggered / the number of times the node before that node is triggered. The number of times that node is triggered is the total number of target paths matching the first node to that node, and the number of times the node before that node is triggered is the total number of target paths matching the first node to the node before that node. The churn rate of a path is 1 - the conversion rate of that path. The conversion rate of that path is the number of times the end node of the path is triggered / the number of times the first node of the path is triggered.

[0151] For example, the dwell time score of the target path may include page dwell time, action dwell time, and action pre-action time, wherein page dwell time is the time interval between the current page trigger time and the next page trigger time, action dwell time is the time interval between the next action occurrence time and the current action occurrence time in the same session, and action pre-action time is the time interval between the previous action occurrence time and the current action occurrence time.

[0152] For example, after calculating the multi-dimensional scores for each target path, the scores for each dimension are sorted, and the target paths ranking in the preset order for each dimension are taken as the optimal paths for the corresponding dimension. For instance, the multi-dimensional scores include opportunity volume score, opportunity conversion rate score, churn rate score, and dwell time score. The opportunity volume score, opportunity conversion rate score, and dwell time score are sorted in descending order, and the churn rate score is sorted in ascending order. The target paths ranking in the top 10 for opportunity volume score are taken as the optimal paths for opportunity volume, the top 10 for opportunity conversion rate score are taken as the optimal paths for conversion, the top 10 for churn rate score are taken as the optimal paths for churn, and the top 10 for dwell time score are taken as the optimal paths for dwell time.

[0153] For example, after calculating the multi-dimensional score of a target path, the scores of each dimension in the multi-dimensional score of a target path are weighted and summed to obtain the comprehensive score of the target path. The comprehensive scores of each target path are determined and sorted. Then, the target path with the comprehensive score ranked in a preset position is taken as the optimal path.

[0154] For example, the target path determined according to this disclosure can also be used for user path analysis. In one example, a visualization of the user path analysis results is shown below. Figure 18 As shown.

[0155] For example, the target path determined according to this disclosure can also be used for funnel analysis. In one example, a visualization of the funnel analysis results is shown in the figure below. Figure 19 As shown. In another example, a visual example of the funnel analysis configuration page is shown below. Figure 20 As shown.

[0156] For example, the target path determined according to this disclosure can also be used for distribution analysis. In one example, a visualization of the distribution analysis results is shown in the figure below. Figure 21 As shown.

[0157] For example, the target path determined according to this disclosure can also be used for interval analysis. In one example, a visualization of the interval analysis results is shown in the figure below. Figure 22 As shown.

[0158] For example, the target path determined according to this disclosure can also be used for thermal analysis. In one example, a visualization of the thermal analysis results is shown in the figure below. Figure 23 As shown.

[0159] For example, the target path determined according to this disclosure can also be used for attribute analysis. In one example, a visualization of the attribute analysis results is shown in the figure below. Figure 24 As shown.

[0160] For example, the target path determined according to this disclosure can also be used for path monitoring, personal preference path analysis, etc.

[0161] In one example, the target path determination method of this disclosure can be implemented based on a target path determination system, the architecture of which is shown in the diagram below. Figure 25 As shown. In the access layer, profile tags can include a preset business opportunity table and a preset path table. The compass is used to record the data reported by the embedded points in the application / website into the relevant data table. Attribution is data statistics. Business opportunities can be understood as the middle platform determining which behaviors are business opportunities and recording the behaviors that are business opportunities into the preset business opportunity table.

[0162] Figure 26 This is a schematic block diagram of a target path determination device using a processor-based hardware implementation according to one embodiment of the present disclosure.

[0163] The target path determination apparatus may include corresponding modules that perform one or more steps in the flowchart described above. Therefore, each or more steps in the flowchart may be performed by a corresponding module, and the apparatus may include one or more of these modules. A module may be one or more hardware modules specifically configured to perform a corresponding step, or implemented by a processor configured to perform a corresponding step, or stored in a computer-readable medium for implementation by a processor, or implemented through some combination thereof.

[0164] The hardware architecture of the target path determination device disclosed herein can be implemented using a bus architecture. The bus architecture can include any number of interconnect buses and bridges, depending on the specific application of the hardware and overall design constraints. Bus 1100 connects various circuits including one or more processors 1200, memory 1300, and / or hardware modules. Bus 1100 can also connect various other circuits 1400 such as peripherals, voltage regulators, power management circuits, external antennas, etc.

[0165] Bus 1100 can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Component (EISA) bus, etc. Buses can be categorized as address buses, data buses, control buses, etc. For ease of representation, only one connection line is used in this diagram, but this does not imply that there is only one bus or only one type of bus.

[0166] Any process or method description in the flowcharts or otherwise herein can be understood as representing a module, segment, or portion of code comprising one or more executable instructions for implementing a particular logical function or process, and the scope of the preferred embodiments of this disclosure includes additional implementations in which functions may be performed not in the order shown or discussed, including substantially simultaneously or in reverse order depending on the functions involved, as will be understood by those skilled in the art to which embodiments of this disclosure pertain. The processor performs the various methods and processes described above. For example, the method embodiments of this disclosure may be implemented as software programs tangibly contained in a machine-readable medium, such as memory. In some embodiments, part or all of the software program may be loaded and / or installed via memory and / or a communication interface. When the software program is loaded into memory and executed by the processor, one or more steps of the methods described above may be performed. Alternatively, in other embodiments, the processor may be configured to perform one of the methods described above by any other suitable means (e.g., by means of firmware).

[0167] The logic and / or steps represented in the flowchart or otherwise described herein may be specifically implemented in any readable storage medium for use by, or in conjunction with, an instruction execution system, apparatus or device (such as a computer-based system, a processor-included system or other system that can fetch and execute instructions from, an instruction execution system, apparatus or device).

[0168] For the purposes of this specification, a "readable storage medium" can be any means capable of containing, storing, communicating, propagating, or transmitting a program for use by or in conjunction with an instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of readable storage media include: an electrical connection having one or more wires (electronic device), a portable computer disk drive (magnetic device), random access memory (RAM), read-only memory (ROM), erasable and programmable read-only memory (EPROM or flash memory), fiber optic devices, and portable read-only memory (CDROM). Furthermore, a readable storage medium can even be paper or other suitable media on which a program can be printed, since a program can be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, interpreting, or otherwise processing as necessary, and then stored in memory.

[0169] It should be understood that various parts of this disclosure can be implemented in hardware, software, or a combination thereof. In the above embodiments, multiple steps or methods can be implemented in software stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, it can be implemented using any one or a combination of the following techniques known in the art: discrete logic circuits having logic gates for implementing logical functions on data signals, application-specific integrated circuits (ASICs) having suitable combinational logic gates, programmable gate arrays (PGAs), field-programmable gate arrays (FPGAs), etc.

[0170] Those skilled in the art will understand that all or part of the steps of the methods described above can be implemented by a program instructing related hardware. The program can be stored in a readable storage medium, and when executed, the program includes one or a combination of the steps of the method implementation.

[0171] Furthermore, the functional units in the various embodiments of this disclosure can be integrated into a single processing module, or each unit can exist physically separately, or two or more units can be integrated into a single module. The integrated module can be implemented in hardware or as a software functional module. If the integrated module is implemented as a software functional module and sold or used as an independent product, it can also be stored in a readable storage medium. The storage medium can be a read-only memory, a disk, or an optical disk, etc.

[0172] refer to Figure 26 According to one embodiment of the present disclosure, the target path determination device 1000 of the present disclosure includes a determination module 1002, a judgment module 1004 and an execution module 1006.

[0173] The determination module 1002 is used to determine the current node in the target behavior chain. The judgment module 1004 is used to determine whether the current node in the target behavior chain is a fallback node. The execution module 1006 is used to execute a target operation based on one or more of the current node, a preset split node, and the cache state if the current node is not the target node. The target operation includes one or more of the following: determining the target path, updating the cache, and re-determining the current node. The cache is used to store nodes in the target behavior chain.

[0174] This disclosure also provides an electronic device, including: a memory storing execution instructions; and a processor or other hardware module executing the execution instructions stored in the memory, causing the processor or other hardware module to perform the above-described method.

[0175] This disclosure also provides a readable storage medium storing executable instructions, which, when executed by a processor, are used to implement the methods described above.

[0176] This disclosure also provides a computer program product, including a computer program / instructions that, when executed by a processor, implement the methods described above.

[0177] It is understood that before using the technical solutions disclosed in the various embodiments of this disclosure, users should be informed of the types, scope of use, and usage scenarios of the personal information involved in this disclosure in an appropriate manner in accordance with relevant laws and regulations, and user authorization should be obtained.

[0178] For example, upon receiving a user's active request, a prompt message is sent to the user to explicitly inform them that the requested operation will require the acquisition and use of the user's personal information. This allows the user to independently choose whether to provide personal information to the software or hardware, such as electronic devices, applications, websites, servers, or storage media, that are performing the operations of this disclosed technical solution, based on the prompt message.

[0179] As an optional but non-limiting implementation, in response to a user's active request, sending a prompt message to the user can be done via a pop-up window, where the prompt message can be presented in text format. Furthermore, the pop-up window can also include a selection control allowing the user to choose "agree" or "disagree" to provide personal information to the electronic device.

[0180] It is understood that the above notification and user authorization process are merely illustrative and do not constitute a limitation on the implementation of this disclosure. Other methods that comply with relevant laws and regulations may also be applied to the implementation of this disclosure.

[0181] At the same time, it is understood that the data involved in this disclosed technical solution (including but not limited to the data itself, the acquisition or use of the data) shall comply with the requirements of relevant laws, regulations and related provisions.

[0182] In the description of this specification, the references to terms such as "one embodiment / mode," "some embodiments / modes," "example," "specific example," or "some examples," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment / mode or example is included in at least one embodiment / mode or example of this application. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment / mode or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments / modes or examples. Moreover, without contradiction, those skilled in the art can combine and integrate the different embodiments / modes or examples described in this specification, as well as the features of different embodiments / modes or examples.

[0183] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of that feature. In the description of this application, "multiple" means at least two, such as two, three, etc., unless otherwise explicitly specified.

[0184] Those skilled in the art should understand that the above embodiments are merely for illustrating the present disclosure and are not intended to limit the scope of the disclosure. Those skilled in the art can make other changes or modifications based on the above disclosure, and these changes or modifications still fall within the scope of the present disclosure.

Claims

1. A method for determining a target path, characterized in that, include: Determine the current node in the target behavior chain; Determine whether the current node in the target behavior chain is a fallback node; If not, then perform a target operation based on one or more of the current node, the preset split node, and the cache state. The target operation includes one or more of determining the target path, updating the cache, and re-determining the current node. The cache is used to store nodes in the target behavior link. The preset splitting node includes at least one splitting start node and a splitting end node; The step of performing one or more target operations based on the current node, the preset split node, and the cache state includes: In response to the current node being the first node of the split and the cache state not being empty, the cache path in the cache is used as the target path, the cache is cleared, the current node is stored in the cache, and the current node is re-determined, wherein the cache path is generated based on the nodes stored in the cache. Alternatively, the step of performing the target operation based on one or more of the current node, the preset split node, and the cache state includes: In response to the current node being the split tail node and the cache state not being empty, the current node is stored in the cache, and the cache path in the stored cache is used as the target path, and the current node is re-determined, the cache path being generated based on the node stored in the cache.

2. The target path determination method according to claim 1, characterized in that, The step of determining whether the current node in the target behavior chain is a fallback node includes: In response to the existence of a node identical to the current node in the cache, the current node in the target behavior chain is determined to be the fallback node; In response to the absence of a node identical to the current node in the cache, it is determined that the current node in the target behavior chain is not the fallback node.

3. The target path determination method according to claim 1, characterized in that, The preset splitting node includes a splitting head node, and the step of performing a target operation based on one or more of the current node, the preset splitting node, and the cache state includes: In response to the current node being the first node of the split and the cache state being empty, or the current node not being the first node of the split, the current node is stored in the cache and the current node is re-determined.

4. The target path determination method according to claim 3, characterized in that, Before storing the current node in the cache, the method further includes: Reset the rollback flag; After determining whether the current node in the target behavior chain is a fallback node, the method further includes: If so, check if a rollback flag exists; The target operation is performed based on the detection result of the rollback flag.

5. The target path determination method according to claim 4, characterized in that, The step of performing the target operation based on the detection result of the rollback identifier includes: When the fallback flag is detected, the node stored in the cache that is later than the target node is directly deleted, and the current node is re-determined. The target node is the same node in the cache that is the same as the current node. When the absence of the rollback identifier is detected, the cache path in the cache area is used as the target path, and nodes stored in the cache area that are later than the target node are deleted, the rollback identifier is added, and the current node is re-determined.

6. The target path determination method according to claim 1, characterized in that, The preset splitting node includes a splitting tail node, and the step of performing a target operation based on one or more of the current node, the preset splitting node, and the cache state includes: In response to the current node being the split tail node and the cache state being empty, the current node is directly redefined; In response to the current node not being the split tail node, the current node is stored in the cache area, and the current node is re-determined.

7. The target path determination method according to claim 1, characterized in that, The preset splitting node includes a splitting head node and a splitting tail node. The step of performing a target operation based on one or more of the current node, the preset splitting node, and the cache state includes: In response to the current node not being the first node of the split, the cache state not being empty, and the current node being the last node of the split, the current node is stored in the cache, and the cache path in the stored cache is used as the target path, and the current node is re-determined, the cache path being generated based on the nodes stored in the cache; In response to the current node not being the first node of the split, the cache state not being empty, and the current node not being the last node of the split, the current node is stored in the cache, and the current node is re-determined; In response to the current node not being the first node of the split and the cache state being empty, the current node is directly re-determined; In response to the current node being the first node of the split, the cache area is cleared, the current node is stored in the cleared cache area, and the current node is re-determined.

8. The target path determination method according to claim 6 or 7, characterized in that, After determining whether the current node in the target behavior chain is a fallback node, the method further includes: If so, then directly delete the node stored in the cache that is later than the target node, and redetermine the current node. The target node is the same node in the cache that is the same as the current node.

9. The target path determination method according to claim 1, characterized in that, Before determining whether the current node in the target behavior chain is a fallback node, the method further includes: The endpoint of the cache is determined to be different from the current node, where the endpoint of the cache is the most recently stored node in the cache.

10. The target path determination method according to claim 9, characterized in that, After determining the current node in the target behavior chain, the following is also included: In response to the fact that the endpoint of the buffer is the same as the current node, the current node is redefined.

11. The target path determination method according to claim 1, characterized in that, Before determining the current node in the target behavior chain, the following is also included: Determine the target behavior data, which includes multiple trigger nodes and their corresponding trigger times; According to the order of the triggering times, multiple triggering nodes are connected in series to generate the target behavior chain.

12. The target path determination method according to claim 1, characterized in that, Also includes: Calculate the multi-dimensional scores for each of the target paths, including one or more of the following: opportunity volume score, opportunity conversion rate score, churn rate score, and dwell time score. The optimal path is determined from among the multiple target paths based on the multi-dimensional scores; Output the optimal path.

13. An electronic device, characterized in that, include: The memory stores execution instructions; A processor that executes the execution instructions stored in the memory, causing the processor to perform the target path determination method according to any one of claims 1 to 12.

14. A readable storage medium, characterized in that, The readable storage medium stores execution instructions, which, when executed by a processor, are used to implement the target path determination method according to any one of claims 1 to 12.

15. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the target path determination method according to any one of claims 1 to 12.

Images