Access path analysis method, apparatus, device, and storage medium

Abstract

The application relates to the technical field of data processing, and particularly provides an access path analysis method and device, equipment and a storage medium. The method comprises the following steps: acquiring a first access path, the first access path comprising at least two access nodes; clustering the first access path to obtain at least one access path set, wherein the access path set comprises a plurality of access paths with a similarity greater than a similarity threshold; counting the number of access nodes included in the first access path in the access path set as a first node number; taking the first access path with the first node number satisfying a first preset condition as a second access path; counting the number of the second access paths as a first path number; and taking the second access path with the first path number satisfying a second preset condition as an access path to be optimized. In the embodiment, the access path to be optimized is found in an automatic manner, so that the workload of the staff is reduced, and resource waste is reduced.

Description

Technical Field

[0001] This application relates to the field of Internet technology, and in particular to an access path analysis method, apparatus, device, and storage medium. Background Technology

[0002] With the rapid development of computer and internet technology, more and more websites and applications are being used in people's lives and work.

[0003] To provide users with more convenient services and a better experience, developers need to update and optimize the business logic of websites or applications. In related technologies, this typically requires staff to find a certain number of sample users and conduct surveys, interviews, or other methods to determine the access paths that need optimization.

[0004] The entire process described above requires manual labor, which involves a huge workload and consumes a lot of resources. Summary of the Invention

[0005] To address the aforementioned technical problems, this application provides an access path analysis method, apparatus, device, and storage medium that enables automated identification of access paths requiring optimization, reducing workload for staff and minimizing resource waste.

[0006] Firstly, this application provides an access path analysis method, which includes: obtaining a first access path, the first access path including at least two access nodes, the access nodes being pages experienced during the execution of access services; clustering the access paths to obtain at least one access path set, wherein the access path set includes multiple first access paths with a similarity greater than a similarity threshold; counting the number of access nodes included in the first access paths in the access path set as the first node count; selecting the first access paths whose first node count meets a first preset condition as second access paths; counting the number of second access paths as the first path count; and selecting the second access paths whose first path count meets a second preset condition as access paths to be optimized.

[0007] Secondly, this application provides an access path analysis device, comprising: an access path acquisition module for acquiring a first access path, the first access path including at least two access nodes, the access nodes being pages experienced during the execution of access services; a path clustering module for clustering the access paths to obtain multiple access path sets, wherein the access path sets include multiple first access paths with a similarity greater than a similarity threshold; a node count module for counting the number of access nodes included in the first access paths in the access path sets, as the first node count; a node count judgment module for determining the first access path whose first node count meets a first preset condition as a second access path; a path count module for counting the number of second access paths, as the first path count; and an optimized path determination module for determining the second access path whose first path count meets a second preset condition as the access path to be optimized.

[0008] Thirdly, this application provides an access path analysis device, the device comprising: one or more processors; a storage device for storing one or more programs; and when the one or more programs are executed by the one or more processors, causing the one or more processors to implement the access path analysis method as described in the first aspect above.

[0009] Fourthly, this application provides a storage medium, which may be a computer-readable storage medium storing a computer program thereon, which, when executed by a processor, implements the access path analysis method as described in the first aspect above.

[0010] Fifthly, embodiments of this application provide a computer program product, which includes a computer program or instructions that, when executed by a processor, implement the access path analysis method as described in the first aspect above.

[0011] The technical solution provided in this application has the following advantages compared with the prior art:

[0012] This application provides an access path analysis method, apparatus, device, and storage medium. The method includes: obtaining a first access path, the first access path including at least two access nodes, where each access node is a page experienced during the execution of an access service; clustering the first access path to obtain at least one access path set, wherein the access path set includes multiple first access paths with a similarity greater than a similarity threshold; counting the number of access nodes included in the access paths in the access path set as the first node count; selecting the first access paths whose first node count meets a first preset condition as second access paths; counting the number of second access paths as the first path count; and selecting the second access paths whose first path count meets a second preset condition as access paths to be optimized. Because the access paths are clustered based on their similarity, and the number of nodes and paths in the clustered access path set is analyzed to determine the access paths that need optimization, the entire process automates the search for access paths that need optimization, reducing the workload of staff and minimizing resource waste. Attached Figure Description

[0013] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0014] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, for those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0015] Figure 1 A flowchart illustrating an access path analysis method provided in an embodiment of this application;

[0016] Figure 2 A flowchart illustrating another access path analysis method provided in an embodiment of this application;

[0017] Figure 3 A flowchart illustrating another access path analysis method provided in this application embodiment;

[0018] Figure 4 This is a schematic diagram of the access path analysis device provided in an embodiment of this application;

[0019] Figure 5 This is a schematic diagram of the access path analysis device provided in an embodiment of this application. Detailed Implementation

[0020] To better understand the above-mentioned objectives, features, and advantages of this application, the solution of this application will be further described below. It should be noted that, unless otherwise specified, the embodiments and features described in these embodiments can be combined with each other.

[0021] Many specific details are set forth in the following description in order to provide a full understanding of this application, but this application may also be implemented in other ways different from those described herein; obviously, the embodiments in the specification are only some embodiments of this application, and not all embodiments.

[0022] The term "comprising" and its variations as used herein are open-ended inclusions, meaning "including but not limited to". The term "based on" means "at least partially based on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". Definitions of other terms will be given in the description below.

[0023] It should be noted that the concepts of "first" and "second" mentioned in this application are only used to distinguish different devices, modules or units, and are not used to limit the order of functions performed by these devices, modules or units or their interdependencies.

[0024] It should be noted that the terms "a" and "a plurality of" used in this application are illustrative rather than restrictive, and those skilled in the art should understand that, unless otherwise expressly indicated in the context, they should be understood as "one or more".

[0025] The access path analysis method provided in this application will be described in detail below with reference to the accompanying drawings and specific embodiments.

[0026] Figure 1 This is a flowchart of an access path analysis method according to an embodiment of this application. This embodiment can be applied to the situation of analyzing whether the access path needs to be optimized. The method can be executed by an access path analysis device, which can be implemented in software and / or hardware and can be configured in an electronic device.

[0027] like Figure 1 As shown, the access path analysis method provided in this application embodiment mainly includes steps S101-S106.

[0028] S101. Obtain the first access path, which includes at least two access nodes, which are the pages experienced during the execution of the access business.

[0029] The access path, also known as the user path or user journey, refers to the sequence of a user's movements from one page to another on the user interface, encompassing the complete process of all triggers and browsing behaviors performed by the user on the user interface. The aforementioned user interface can include any interface that interacts with the user, such as a website user interface, application interface, or mini-program interface.

[0030] Access nodes in an access path typically refer to a series of steps or touchpoints a user experiences on the user interface. Each access node represents a specific stage or interface in the access path. For example, common access node types include the homepage, navigation menu page, search results page, login page, content page, and so on.

[0031] During a user's access to a service, the access path is recorded, consisting of the pages accessed during the process. In one specific implementation, if the pages accessed during the service execution are, in sequence, page A, page B, page C, and page D, then the access path for this service execution is: page A - page B - page C - page D. Pages A, B, C, and D are all access nodes included in this access path. The aforementioned service can be any service provided by the client, such as: payment service, movie viewing service, membership benefits page, network connection service, personalization settings service, shopping cart management service, etc.

[0032] In one possible implementation, obtaining the first access path includes: periodically reading the access paths of all users within a set time period from the database as the first access path. For example, obtaining the access paths from the past week every week. The specific values ​​of the set time period and reading period can be set according to the actual application scenario, and this application embodiment does not limit them.

[0033] In one possible implementation, the user's access path is recorded via pingback. Specifically, when a user navigates from page A to page B, this navigation is recorded. Page B can then use network technology to detect the user's access from page A and send a signal or request to the server. Upon receiving this signal, the server records information about the access, including the source node (page A), the destination node (page B), the access time, the user's identifier, and the node's characteristic values. By continuously recording the user's page navigation, the user's access path can be gradually constructed. The collected access paths are stored in the server's database or log file for later use.

[0034] S102. Cluster the first access paths to obtain at least one set of access paths, wherein the set of access paths includes multiple first access paths with a similarity greater than a similarity threshold.

[0035] The aforementioned similarity threshold is used to characterize the degree of similarity between each first access path. If the similarity between any two first access paths is greater than the similarity threshold, it indicates that the two first access paths are very similar and the user's access business or access needs are the same. Therefore, the first access paths with a similarity greater than the similarity threshold are grouped into an access path set.

[0036] If the similarity between two first access paths is less than or equal to a similarity threshold, it indicates that the two first access paths are dissimilar, have no correlation, and cannot be further analyzed. Therefore, first access paths with similarity less than or equal to the similarity threshold are classified into different access path sets. The aforementioned similarity threshold can be set according to the actual situation.

[0037] Specifically, the access paths are aggregated based on their similarity, and those with a similarity greater than a similarity threshold are grouped into the same access path set.

[0038] In one possible implementation, the access path includes at least two access nodes, each with its corresponding feature value. Access nodes with the same attributes have the same feature value. For example, the playback page for TV series A and the playback page for TV series B have the same attribute—both are TV series playback pages—so the feature value corresponding to the playback page for TV series A is the same as the feature value corresponding to the playback page for TV series B. Similarly, the playback pages for movies C and D have the same attribute—both are movie playback pages—so the feature value corresponding to the playback page for movie C is the same as the feature value corresponding to the playback page for movie D. However, the playback pages for TV series A and movie C have different attributes; therefore, one is a TV series playback page, and the other is a movie playback page.

[0039] The feature values ​​corresponding to each access node can be set according to the actual situation. It is only necessary to record the feature values ​​corresponding to each access node in the access path while recording the access path. The specific setting method of each feature value is not limited in this embodiment.

[0040] In one possible implementation, the feature values ​​corresponding to each access node included in the first access path are obtained, the sequential relationship between each feature value is determined according to the access order of each access node, and an access sequence is constructed based on the sequential relationship between each feature value and each feature value.

[0041] As mentioned above, each access node has a pre-defined characteristic value. Therefore, during the process of recording the access path, the characteristic value of the access node can also be recorded. Thus, while retrieving the first access path from the database, the characteristic value of the access node can also be obtained.

[0042] The access order described above can be understood as the sequential relationship between various nodes in an access path. For example, in the access path: page A - page B - page C - page D, the sequential order between the nodes is: access node A before access node B, access node B before access node C, and access node C before access node D.

[0043] The order in which nodes are accessed is used as the order of their corresponding feature values. For example, if the order of accessed nodes is: Page A - Page B - Page C - Page D, then the feature value for page A is 'a', for page B it is 'b', for page C it is 'c', and for page D it is 'd'. In this case, the order of these feature values ​​is: Feature value a - Feature value b - Feature value c - Feature value d.

[0044] The access sequence is formed by arranging the feature values ​​according to their corresponding order. For example, if the order of the feature values ​​is: feature value a - feature value b - feature value c - feature value d, then the access sequence is [a, b, c, d].

[0045] Following the aforementioned access sequence construction process, the access sequences for each first access path are determined. A similarity algorithm is used to calculate the similarity between each access sequence, which is then used as the similarity of each first access path. Next, it is determined whether the similarity of each first access path is greater than a similarity threshold. If the similarity of multiple first access paths is greater than the threshold, then these multiple first access paths are grouped into the same access path set.

[0046] The aforementioned similarity algorithms may include edit distance algorithms, term frequency-inverse document frequency (TF-IDF) algorithms, and longest common subsequence (LCS) algorithms. This application does not limit the similarity algorithm used in its embodiments.

[0047] In one possible implementation, the access path set includes multiple first access paths with a similarity greater than a set threshold and the same termination node.

[0048] Having the same termination node can be understood as meaning that the service the user ultimately wants to access is the same. For example, having the same termination node could mean that all termination nodes are the access nodes corresponding to the TV series playback page.

[0049] As can be seen from the above, each access node in the first access path has its corresponding feature value. The feature value corresponding to the termination access node is obtained. When the feature values ​​corresponding to the termination access nodes are the same, it is determined that the termination access nodes of the two first access paths are the same.

[0050] In this embodiment, the first access path that the termination node accesses is usually the access path of the same access service. By analyzing the access path of the same access service, it can be determined whether the access service needs to be optimized.

[0051] In one possible implementation, the access path set includes multiple access paths with the same access sequence. In other words, identical first access paths are grouped into the same access path set, and then each access path set is analyzed separately.

[0052] S103. Count the number of access nodes included in the first access path in the access path set, and use it as the number of first nodes.

[0053] The number of access nodes primarily indicates the number of pages a user navigates to during the access process. The number of access nodes within the first access path is the same as the number of pages the user navigates to during the access process.

[0054] For each first access path in the access path set, the number of access nodes included in each first access path is counted, and this number of access nodes in each first access path is taken as the number of first nodes. In other words, each first access path in the access path set has its corresponding number of first nodes, which is the number of access nodes included in that first access path.

[0055] For example, the first access path is: page A - page B - page C - page D, which includes 4 access nodes. The second access path is: page A - page B - page C - page D - page E, which includes 5 access nodes.

[0056] S104. The first access path whose number of first nodes meets the first preset condition is used as the second access path.

[0057] The first preset condition is used to measure whether the first access path needs optimization based on the number of access nodes in the first access path. Furthermore, the first preset condition is a condition that measures the number of access nodes in the access path.

[0058] Specifically, the first preset condition includes either the number of first nodes being greater than a first set number, or the number of first nodes being less than a third set number. The third set number is less than the first set number.

[0059] The first node count meets the first preset condition, including: the first node count is greater than the first set count, which means that the number of access nodes included in the first access path is greater than the first set count. This indicates that the more pages the user needs to jump to during the execution of the access business, the more trigger operations the user needs to perform, and it is necessary to further determine whether the access path needs to be optimized.

[0060] The first node count meets the first preset condition, including: the first node count is less than the third preset count, which means that the number of access nodes included in the access path is less than the third preset count, indicating that the user needs to jump to very few pages during the access process, and it is necessary to further determine whether the access path needs to be optimized.

[0061] The second access path can be understood as the access path whose number of access nodes meets the first preset condition. The second access path is the access path that needs further evaluation to determine whether it needs to be optimized.

[0062] S105. Count the number of second access paths and use it as the number of first paths.

[0063] The number of second access paths refers to the number of access paths in the access path set whose number of access nodes meets the first preset condition. For example, if the number of access paths in the access path set whose number of access nodes meets the first preset condition is 1000, then the number of second access paths is 1000, which means the number of first paths is 1000.

[0064] S106. The second access path whose number of first paths meets the second preset condition is taken as the access path to be optimized.

[0065] The second preset condition is used to measure whether a second access path needs optimization based on the number of access paths in the access path set that satisfy the first preset condition. Furthermore, the second preset condition is a condition that measures the number of access paths in the access path set that satisfy the first preset condition.

[0066] In this context, "access paths to be optimized" can be understood as those access paths identified through analysis that may have certain flaws and require optimization. These paths may include those with unreasonable access service settings that need improvement. For example, an access path to be optimized might be the one corresponding to the "movie recommendation" service, or the one corresponding to the "membership benefits" service. In other words, each access path to be optimized essentially represents an access service setting that is unreasonable or flawed, requiring optimization of the corresponding access service to achieve overall access path optimization.

[0067] Specifically, the second preset condition includes either the number of first paths being greater than the second preset number, or the number of first paths being less than the fourth preset number. The fourth preset number is less than the second preset number.

[0068] The first path quantity satisfies the second preset condition, which includes: the first path quantity is greater than the second preset quantity. This indicates that there are a large number of access paths in the access path set with more nodes than the first preset quantity, meaning that a large number of users need to perform multiple trigger operations to find the service they want to access. Therefore, these types of access paths are considered access paths to be optimized.

[0069] The first path quantity meets the second preset condition, including: the first path quantity is less than the fourth preset quantity, indicating that when the number of access nodes is very small and users can access the service with very few triggering operations, a service is still accessed by only a few users. This indicates that the access path or the access service corresponding to the access path needs to be optimized. Therefore, this type of access path is regarded as an access path to be optimized.

[0070] This application provides an access path analysis method, which includes: obtaining access paths, each access path including at least two access nodes, where each access node is a page experienced during the execution of an access service; clustering the access paths to obtain at least one access path set, wherein the access path set includes multiple access paths with a similarity greater than a similarity threshold; counting the number of access nodes included in the access paths in the access path set as a first node count; selecting the first access path whose first node count meets a first preset condition as a second access path; counting the number of the second access paths as a first path count; and selecting the second access path whose first path count meets a second preset condition as the access path to be optimized. By clustering access paths based on their similarity, analyzing the number of nodes and paths in the clustered access path set, and thus determining the access paths that need optimization, the entire process automates the search for access paths that require optimization, reducing the workload of staff and minimizing resource waste.

[0071] Based on the above embodiments, the embodiments of this application further optimize the access path analysis method, such as... Figure 2 As shown, the optimized access path analysis method mainly includes steps S201-S206.

[0072] S201. Obtain the first access path, which includes at least two access nodes. The access nodes are the pages experienced during the execution of the access business.

[0073] S202. Cluster the access paths to obtain at least one set of access paths, wherein the set of access paths includes multiple first access paths with a similarity greater than a set threshold.

[0074] S203. Count the number of access nodes included in the first access path in the access path set, and use it as the number of first nodes.

[0075] The execution flow of S201-S203 in this embodiment is the same as that of S101-S103 in the above embodiment. For details, please refer to the description in the above embodiment. It will not be repeated in this embodiment.

[0076] S204. The first access path with a number of first nodes greater than the first set number is used as the second access path.

[0077] The first set number is a value used to measure the number of access nodes in the access path. If the number of first nodes is greater than the first set number, it indicates that the access path includes a large number of access nodes, which may require further optimization. Therefore, this access path is designated as the second access path. The first set number can be set according to actual conditions and is not specifically limited in this embodiment.

[0078] S205. Count the number of second access paths and use it as the number of first paths.

[0079] The number of second access paths refers to the number of access paths in the access path set whose number of access nodes is greater than the first set number. For example, if the number of access paths in the access path set whose number of nodes is greater than the first set number is 1000, then the number of second access paths is 1000. Therefore, the number of first paths is 1000.

[0080] S206. The second access path whose number of first paths is greater than the second set number is selected as the access path to be optimized.

[0081] The second set number is a value used to measure how many access paths in the access path set have more nodes than the first set number.

[0082] If the number of the first path is greater than the second set number, it indicates that there are many access paths in the access path set with more nodes than the first set number. This means that a large number of users need to perform multiple trigger operations to find the service they want to access. Therefore, these types of access paths are considered access paths to be optimized.

[0083] If the number of the first path is less than the second set number, it indicates that there are relatively few access paths in the access path set with more nodes than the first set number. This means that only a small number of users need to perform multiple triggering operations to find the service they want to access. These access paths may simply be due to user errors leading to an excessive number of access nodes. For these types of access paths, no optimization will be performed at this time.

[0084] If an access path includes more than a first set number of nodes, it indicates that users need to perform multiple triggering operations to access the desired service. Furthermore, if the number of such access paths exceeds a second set number, it means a large number of users require multiple triggering operations to reach their desired service. For example, if an access path includes 7 access nodes, it requires navigating through 7 pages and performing 7 triggering operations. In other words, from opening the initial page corresponding to the initial access node to finding the desired termination page, the user may need to perform at least 7 triggering operations, and the user interface may need to navigate or switch 7 times to display the termination page. The entire process is redundant and complex, hindering users from quickly finding the content they want. If there are 10,000 access paths with 7 access nodes, it indicates that a large number of users need to perform multiple triggering operations to reach their desired service. Therefore, this type of access path is considered an access path to be optimized.

[0085] For example, if the access path to be optimized corresponds to the TV series playback page, it means that the user needs to trigger the page multiple times to find it. The whole process is redundant, and the access path needs to be optimized to reduce the number of access nodes so that the user can quickly find the TV series playback page.

[0086] This application provides an access path analysis method, which includes: obtaining access paths, each access path including at least two access nodes, where each access node is a page experienced during the execution of an access service; clustering the access paths to obtain at least one access path set, wherein the access path set includes multiple access paths with a similarity greater than a similarity threshold; counting the number of access nodes included in the access paths in the access path set, as the first number of nodes; selecting first access paths with a first number of nodes greater than a first predetermined number as second access paths; counting the number of second access paths, as the first number of paths; and selecting second access paths with a first number of paths greater than a second predetermined number as access paths to be optimized. By clustering access paths based on their similarity, analyzing the number of nodes and paths in the clustered access path set, and selecting access paths with a large number of nodes and paths as access paths to be optimized, the entire process automates the search for access paths requiring optimization, reducing the workload of staff and minimizing resource waste.

[0087] In one possible implementation, a second access path with a first path number greater than a second predetermined number is selected as an access path to be optimized, including: selecting a second access path with a first path number greater than a second predetermined number as a third access path; for at least one third access path, counting the number of repetitions of sub-paths in the third access path; a sub-path includes at least two adjacent access nodes, and the number of repetitions includes the number of times the same sub-path appears in the second access path; and selecting a sub-path with a repetition count greater than a fifth predetermined number as an access path to be optimized.

[0088] A subpath in an access path can be understood as a path consisting of any two or more consecutive access nodes. The subpath repetition count can be understood as the number of times a subpath appears repeatedly in the access path. The presence of repetitive subpaths in an access path indicates that the user is repeatedly opening one or more access pages. For example, in the access path: Page A - Page B - Page C - Page D - Page E - Page D - Page E - Page D - Page E - Page D - Page E, then Page D - Page E can be considered a subpath in the above access path. This subpath "Page D - Page E" is executed 4 times, meaning the subpath repetition count is 4.

[0089] If the number of repetitions of a sub-path within a set of access paths exceeds a predetermined limit (e.g., the access path is: Page A - Page B - Page C - Page D - Page E - Page D - Page E - Page D - Page E - Page D - Page E - Page D - Page E), then Page D - Page E can be considered a sub-path within the above path. This sub-path "Page D - Page E" is repeated 6 times, meaning the user must open "Page D - Page E" 6 times to find the desired content. For example, if Page D is a "movie recommendation page" and Page E is a "movie preview page," the user selects a movie they like on the "movie recommendation page," is redirected to the "movie preview page" to preview it, and this process is repeated 4 times before finding the movie they actually want to watch.

[0090] In other words, the user is repeatedly opening one or more access pages. This indicates that the movies recommended on the "movie recommendation page" are not of interest to the user, and the user cannot find movies they want to watch. This further suggests that the movie recommendation mechanism needs optimization to recommend suitable movies based on user attributes. Therefore, sub-paths are considered access paths to be optimized; in other words, the access services corresponding to the sub-paths require further optimization.

[0091] In one possible implementation, a sub-path with a repetition count greater than a fifth preset number is selected as an access path to be optimized. This includes: selecting a third access path that meets a third preset condition as a fourth access path; wherein meeting the third preset condition includes: the third access path includes a sub-path, and the repetition count of the sub-path is greater than a fifth preset number; counting the number of second paths in the fourth access path; and if the number of second paths is greater than a sixth preset number, selecting the sub-path as an access path to be optimized.

[0092] In this embodiment, if the fourth access path includes sub-paths and the number of repetitions of the sub-paths is greater than the fifth preset number, it indicates that users need to repeatedly select the desired video before they can find it. In this case, the third access path that meets the third preset condition is designated as the fourth access path, and the number of fourth access paths is counted as the number of second paths. If the number of second paths is greater than the sixth preset number, it indicates that a large number of users need to repeat the selection multiple times to find the desired video, and this sub-path is designated as the access path to be optimized.

[0093] In this embodiment of the application, when the number of second paths is greater than the sixth set number, the sub-path is taken as the access path to be optimized, so as to avoid taking the access path with too many repetitions due to the operation error of individual users as the access path to be optimized, thereby improving the accuracy of access path analysis.

[0094] Based on the above embodiments, the embodiments of this application further optimize the access path analysis method, such as... Figure 3 As shown, the optimized access path analysis method mainly includes steps S301-306.

[0095] S301. Obtain the first access path, which includes at least two access nodes. The access nodes are the pages experienced during the execution of the access business.

[0096] S302. Cluster the access paths to obtain at least one set of access paths, wherein the set of access paths includes multiple first access paths with a similarity greater than a set threshold.

[0097] S303. Count the number of access nodes included in the first access path in the access path set, and use it as the number of first nodes.

[0098] The execution flow of S301-S303 in this embodiment is the same as that of S101-S103 in the above embodiment. For details, please refer to the description in the above embodiment. It will not be repeated in this embodiment.

[0099] S304. The first access path with a number of first nodes less than the third set number is used as the second access path.

[0100] The third preset number is a value used to measure the number of access nodes in the access path. If the number of first nodes is less than the third preset number, it indicates that the number of access nodes included in the first access path is small, and further optimization may be needed. Therefore, the first access path is used as the second access path. The first preset number can be set according to the actual situation, and is not specifically limited in this embodiment.

[0101] S305. Count the number of second access paths and use it as the number of first paths.

[0102] The number of second access paths refers to the number of access paths in the access path set whose number of nodes is less than the third set number. For example, if there are 10 access paths in the access path set whose number of nodes is less than the third set number, then the number of second access paths is 10. Therefore, the number of first paths is 10.

[0103] S306. The second access path whose number of first paths is less than the fourth set number is taken as the access path to be optimized.

[0104] If the number of target access paths is less than the second set number, then any access path included in the access path set will be used as the access path to be optimized.

[0105] The first path quantity can be understood as the number of access paths in a set of access paths whose first node count is less than the third preset quantity. The fourth preset quantity can be understood as a value that measures the number of access paths in a set of access paths whose first node count is less than the third preset quantity. The fourth preset quantity can be set based on actual experience, and is not specifically limited in this embodiment.

[0106] If the number of access paths in a set of access paths with the first node count less than the third set count is less than the fourth set count, it indicates that within that sampling period, with a small number of access nodes, the number of people executing the access path is small. In other words, the number of users accessing the service is low, suggesting that the service is not attractive to users and needs optimization. For example, if the access service is "Member Benefits," and there are few access paths to "Member Benefits" within a period, it indicates that "Member Benefits" is not attractive to users and further optimization is needed to improve its appeal.

[0107] This application provides an access path analysis method, which includes: obtaining access paths, each access path including at least two access nodes, where each access node is a page experienced during the execution of an access service; clustering the access paths to obtain at least one access path set, wherein the access path set includes multiple access paths with a similarity greater than a similarity threshold; counting the number of access nodes included in the access paths in the access path set, as the first number of nodes; selecting first access paths with a first number of nodes less than a third predetermined number as second access paths; counting the number of second access paths, as the first number of paths; and selecting second access paths with a first number of paths less than a fourth predetermined number as access paths to be optimized. By clustering access paths based on their similarity, analyzing the number of nodes and paths in the clustered access path set, and selecting access paths with fewer nodes and fewer access paths as access paths to be optimized, the entire process automates the search for access paths requiring optimization, reducing the workload of staff and minimizing resource waste.

[0108] In one possible implementation, the dwell time of each access node included in each access path is counted; access nodes whose dwell time exceeds a set time are identified as access nodes to be optimized.

[0109] The dwell time at an access node is used to characterize the length of time a user stays on a page during a service access process. The preset duration is an indicator used to measure the dwell time of a user during a service access process. The preset duration can be set based on actual experience values, and is not specifically limited in this embodiment.

[0110] Specifically, the dwell time of each access node in the access path is counted, and the dwell time of each access node is compared with the set time to identify the access nodes whose dwell time exceeds the set time.

[0111] In another possible implementation, the dwell time of each access node in the access path is counted, the dwell time of each access node is sorted in descending order, and the dwell time is compared with a set time in descending order. The comparison is stopped after a dwell time is less than or equal to the set time, and all access nodes with a dwell time exceeding the set time are obtained.

[0112] If the dwell time at any access node in the access path exceeds the preset time, it indicates that the page content corresponding to that access node is too complex or has too much information, and users may need more time to digest and understand it. Alternatively, the website's navigation design may be unintuitive or difficult to understand, causing users to spend more time searching for the information or functions they need. Or, the page loading time may be too long, causing users to lose patience while waiting, leading to an increased dwell time. Therefore, access services corresponding to access nodes with dwell times exceeding the set time require further optimization.

[0113] In one possible implementation, if only one access node in an access path has a dwell time exceeding a preset duration, it indicates that only the page content settings of that access node are unreasonable. Therefore, only that access node should be treated as an access path requiring optimization. For example, if the dwell time on the "Movie Recommendations" page is too long, it means that the movies recommended on the "Movie Recommendations" page do not contain movies that the user wants to watch. The user may spend more time searching for the movies they want to watch, and the movie recommendation service needs to be optimized to recommend more suitable movies to the user.

[0114] In another possible implementation, if the dwell time of multiple consecutive access nodes in an access path exceeds a preset duration, it indicates that the access path consisting of multiple consecutive access nodes needs optimization. For example, if there is too much text content on multiple consecutive pages, users need more time to digest and understand the text content on each page. Therefore, the page content needs to be optimized by adding text and images, or by adjusting the page layout to reduce the time required for user digestion and understanding.

[0115] In another possible implementation, if multiple discontinuous access nodes within an access path all exceed a preset dwell time, it indicates that each access node may have different underlying causes. In this case, each access node can be treated as an access path to be optimized. For example, if one access node corresponds to a "Movie Recommendation" page and another to a "Playback History" page, then a longer dwell time on the "Movie Recommendation" page suggests that the recommended movies are not what the user wants to watch, and the user may spend more time searching for the movies they want to watch. The movie recommendation service needs to be optimized to recommend more suitable movies to the user. Conversely, a longer dwell time on the "Playback History" page may be due to excessive redundant content on the page, resulting in long page loading times. Users may lose patience while waiting, leading to increased dwell time. In such cases, the access nodes corresponding to the "Movie Recommendation" page and the "Playback History" page need to be optimized separately.

[0116] Figure 4This is a schematic diagram of the structure of an access path analysis device according to an embodiment of this application, such as... Figure 4 As shown, the access path analysis device 40 provided in this application embodiment mainly includes: an access path acquisition module 41, a path clustering module 42, a node number statistics module 43, a node number judgment module 44, a path number statistics module 45, and an optimized path determination module 46.

[0117] The system includes the following modules: an access path acquisition module 41, which acquires a first access path, including at least two access nodes, where each access node is a page accessed during the execution of an access service; a path clustering module 42, which clusters the first access path to obtain multiple access path sets, wherein each access path set includes multiple first access paths with a similarity greater than a similarity threshold; a node count module 43, which counts the number of access nodes included in the first access paths in the access path sets, as the first node count; a node count judgment module 44, which identifies first access paths whose first node count meets a first preset condition as second access paths; a path count module 45, which counts the number of second access paths, as the first path count; and an optimized path determination module 46, which identifies second access paths whose first path count meets a second preset condition as access paths to be optimized.

[0118] This application provides an access path analysis device that performs the following process: obtaining a first access path, which includes at least two access nodes, where each access node is a page accessed during the execution of an access service; clustering the first access path to obtain at least one access path set, wherein the access path set includes multiple first access paths with a similarity greater than a similarity threshold; counting the number of access nodes included in the access paths in the access path set as the first node count; selecting the first access paths whose first node count meets a first preset condition as second access paths; counting the number of second access paths as the first path count; and selecting the second access paths whose first path count meets a second preset condition as access paths to be optimized. By clustering access paths based on their similarity and analyzing the number of nodes and paths in the clustered access path set to determine the access paths requiring optimization, the entire process automates the search for access paths to be optimized, reducing the workload of staff and minimizing resource waste.

[0119] In one possible implementation, the set of access paths includes multiple first access paths with a similarity greater than a set threshold and the same termination node.

[0120] In one possible implementation, the node number determination module 43 is specifically used to take the first access path with a first node number greater than a first set number as the second access path; the optimization path determination module 46 is specifically used to take the second access path with a first path number greater than a second set number as the access path to be optimized.

[0121] In one possible implementation, the node number determination module 43 specifically uses the first access path whose first node number is less than the third set number as the second access path; the optimization path determination module 46 is specifically used to use the second access path as the access path to be optimized if the first path number is less than the fourth set number.

[0122] In one possible implementation, the optimization path determination module 46 is specifically used to select the second access path whose number of first paths is greater than a second set number as the third access path; for at least one of the third access paths, count the number of repetitions of sub-paths in the third access path; the sub-path includes at least two adjacent access nodes, and the number of repetitions includes the number of times the same sub-path appears in the third access path; and select the sub-path whose number of repetitions is greater than a fifth set number as the access path to be optimized.

[0123] In one possible implementation, the optimization path determination module 46 is specifically used to select a third access path that meets a third set condition as a fourth access path; wherein meeting the third set condition includes: the third access path includes a sub-path, and the number of repetitions of the sub-path is greater than the fifth set number; count the number of the fourth access paths as the second path number; and if the second path number is greater than the sixth set number, select the sub-path as the access path to be optimized.

[0124] In one possible implementation, it further includes: an optimization node determination module, used to count the dwell time of each access node included in each access path; and to identify access nodes whose dwell time exceeds a set duration as access nodes to be optimized.

[0125] The access path analysis device provided in this application embodiment can execute the access path analysis method provided in any embodiment of this application, and has the corresponding functional modules and beneficial effects of the execution method.

[0126] Figure 5 This is a schematic diagram of the structure of an access path analysis device provided in this embodiment. For example... Figure 5 As shown, the access path analysis device 500 includes a processor 510, a memory 520, an input device 530, and an output device 540; the number of processors 510 in the electronic device can be one or more. Figure 5Taking a processor 510 as an example; the processor 510, memory 520, input device 530, and output device 540 in the electronic device can be connected via a bus or other means. Figure 5 Taking the example of a connection between China and Israel via a bus.

[0127] The memory 520, as a computer-readable storage medium, can be used to store software programs, computer-executable programs, and modules, such as the program instructions / modules corresponding to the access path analysis method in the embodiments of this application. The processor 510 executes various functional applications and data processing of the electronic device by running the software programs, instructions, and modules stored in the memory 520, thereby implementing the access path analysis method provided in the embodiments of this application.

[0128] The memory 520 may primarily include a program storage area and a data storage area. The program storage area may store the operating system and at least one application program required for a given function; the data storage area may store data created based on terminal usage. Furthermore, the memory 520 may include high-speed random access memory and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 520 may further include memory remotely located relative to the processor 510, which can be connected to the electronic device via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0129] Input device 530 can be used to receive input digital or character information, and to generate key signal inputs related to user settings and function control of the electronic device, and may include a keyboard, mouse, etc. Output device 540 may include a display device such as a screen.

[0130] This embodiment also provides a storage medium containing computer-executable instructions, which, when executed by a computer processor, are used to implement the access path analysis method provided in this application embodiment.

[0131] Of course, the computer-executable instructions provided in the embodiments of this application are not limited to the method operations described above, but can also perform related operations in the access path analysis method provided in any embodiment of this application.

[0132] Based on the above description of the implementation methods, those skilled in the art can clearly understand that this application can be implemented using software and necessary general-purpose hardware, and of course, it can also be implemented using hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as a computer floppy disk, read-only memory (ROM), random access memory (RAM), flash memory, hard disk, or optical disk, etc., including several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0133] It is worth noting that in the embodiments of the access path analysis device described above, the various units and modules included are only divided according to functional logic, but are not limited to the above division, as long as the corresponding functions can be achieved; in addition, the specific names of each functional unit are only for easy differentiation and are not used to limit the scope of protection of this application.

[0134] It should be noted that, in this document, relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0135] The above description is merely a specific embodiment of this application, enabling those skilled in the art to understand or implement this application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of this application. Therefore, this application is not to be limited to the embodiments described herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. An access path analysis method, characterized in that, The method includes: obtaining a first access path, the first access path including at least two access nodes, the access nodes being pages experienced during the execution of access services; The first access path is clustered to obtain at least one set of access paths, wherein the set of access paths includes multiple first access paths with a similarity greater than a set threshold. The number of access nodes included in the first access path in the access path set is counted and used as the number of first nodes; The first access path whose number of the first nodes meets the first preset condition is used as the second access path; The number of the second access paths is counted and used as the number of the first paths. The second access path whose number of the first path meets the second preset condition is taken as the access path to be optimized. The first access path whose number of the first nodes meets the first preset condition is used as the second access path, including: The first access path with a number of nodes greater than the first set number is used as the second access path; The second access paths whose number of the first paths meets the second preset condition are selected as access paths to be optimized, including: The second access paths whose number of first paths is greater than the second set number are selected as access paths to be optimized.

2. The method according to claim 1, characterized in that, The access path set includes multiple first access paths with a similarity greater than a set threshold and the same termination node.

3. The method according to claim 2, characterized in that, The access path whose number of the first nodes meets the first preset condition is used as the second access path, including: The first access path with a number of nodes less than the third set number is used as the second access path; The second access paths whose number of the first paths meets the second preset condition are selected as access paths to be optimized, including: If the number of the first path is less than the fourth set number, then the second access path is selected as the access path to be optimized.

4. The method according to claim 1, characterized in that, The second access paths, whose number of first paths is greater than the second predetermined number, are considered as access paths to be optimized, including: The second access path whose number of first paths is greater than the second set number is used as the third access path; For at least one of the third access paths, count the number of times the sub-paths in the third access path are repeated; the sub-path includes at least two adjacent access nodes, and the number of repetitions includes the number of times the same sub-path appears in the third access path; Sub-paths with a repetition count greater than the fifth set number are considered as access paths to be optimized.

5. The method according to claim 4, characterized in that, Subpaths with a repetition count greater than the fifth set number are considered as access paths to be optimized, including: The third access path that meets the third set condition is used as the fourth access path; wherein, meeting the third set condition includes: the third access path includes a sub-path, and the number of repetitions of the sub-path is greater than the fifth set number; The number of the fourth access path is counted and used as the number of the second path. If the number of the second path is greater than the sixth set number, the sub-path will be used as the access path to be optimized.

6. The method according to claim 1 or 3, characterized in that, Also includes: The dwell time of each access node included in each access path is calculated. Access nodes whose dwell time exceeds the set time limit are designated as access nodes to be optimized.

7. An access path analysis device, characterized in that, The device includes: The access path acquisition module is used to acquire a first access path, which includes at least two access nodes, and the access nodes are pages experienced during the execution of access services. The path clustering module is used to cluster the first access path to obtain multiple access path sets, wherein the access path sets include multiple first access paths with a similarity greater than a similarity threshold. The node count module is used to count the number of access nodes included in the first access path in the access path set, and use this count as the first node count. The node count determination module is used to take the first access path whose first node count meets the first preset condition as the second access path; The path count module is used to count the number of the second access paths, which is then used as the first path count. The optimized path determination module is used to select the second access path whose number of the first path meets the second preset condition as the access path to be optimized. The first access path whose number of the first nodes meets the first preset condition is used as the second access path, including: The first access path with a number of nodes greater than the first set number is used as the second access path; The second access paths whose number of the first paths meets the second preset condition are selected as access paths to be optimized, including: The second access paths whose number of first paths is greater than the second set number are selected as access paths to be optimized.

8. An access path analysis device, characterized in that, The device includes: One or more processors; Storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the access path analysis method as described in any one of claims 1-6.

9. A storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the access path analysis method as described in any one of claims 1-6.

Images