Access path analysis method and device, equipment and storage medium

By obtaining and clustering access paths, automatically counting the number of nodes and paths, and determining the paths to be optimized, the problems of large workload and waste of resources in the manual optimization process in the existing technology are solved, and automated optimization is achieved and efficiency is improved.

CN119025757AActive Publication Date: 2024-11-26BEIJING QIYI CENTURY SCI & TECH CO LTD
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202411137761.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-19
Publication Date
2024-11-26
Estimated Expiration
2044-08-19

AI Technical Summary

Technical Problem

In the prior art, the optimization of access paths of websites or applications requires manual sample user questionnaire and interviews, resulting in huge workload and waste of resources.

Method used

By obtaining the access path, clustering paths with similarity greater than the threshold, counting the number of access nodes and paths, automatically determining the access path to be optimized, and using automated methods to reduce the workload of workers.

Benefits of technology

It realizes automated search for access paths that need to be optimized, reduces the workload and resource waste of staff, and improves optimization efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119025757A_ABST
    Figure CN119025757A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of data processing, and particularly provides an access path analysis method and device, equipment and a storage medium, and the method comprises the steps: obtaining a first access path which comprises at least two access nodes; the first access paths are clustered, at least one access path set is obtained, and the access path set comprises a plurality of access paths with the similarity larger than a similarity threshold value; counting the number of access nodes included in a first access path in the access path set as the number of first nodes; taking the first access path of which the first node number meets a first preset condition as a second access path; counting the number of second access paths as the number of first paths; and taking the second access path of which the first path number meets a second preset condition as the access path to be optimized. According to the embodiment of the invention, the access path needing to be optimized is searched in an automatic mode, the workload of workers is reduced, and resource waste is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

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

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

[0003] In order to provide people with more convenient services and better experience, developers need to update and optimize the services in websites or applications. In related technologies, staff are usually required to find a certain number of sample users and conduct questionnaire surveys and interviews on the sample users to determine the access paths that need to be optimized.

[0004] The entire process above needs to be completed manually, which is a huge workload and consumes a lot of resources. Summary of the invention

[0005] In order to solve the above technical problems, the present application provides an access path analysis method, device, equipment and storage medium to realize automatic search for access paths that need to be optimized, reduce the workload of staff and reduce resource waste.

[0006] In a first aspect, the present application provides an access path analysis method, the method comprising: obtaining a first access path, the first access path comprising at least two access nodes, the access nodes being pages experienced in the process of executing an access service; clustering the access paths to obtain at least one access path set, wherein the access path set comprises multiple first access paths whose similarities are 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 number; taking the first access path whose first node number meets a first preset condition as the second access path; counting the number of second access paths as the first path number; taking the second access path whose first path number meets a second preset condition as the access path to be optimized.

[0007] In a second aspect, the present application provides an access path analysis device, which includes: an access path acquisition module, used to acquire a first access path, the first access path includes at least two access nodes, and the access nodes are pages experienced in the process of executing an access business; a path clustering module, used to cluster the access paths to obtain multiple access path sets, wherein the access path set includes multiple first access paths with similarities greater than a similarity threshold; a node quantity counting module, used to count the number of access nodes included in the first access path in the access path set as the first node quantity; a node quantity judgment module, used to take the first access path whose first node quantity meets the first preset condition as the second access path; a path quantity counting module, used to count the number of second access paths as the first path quantity; an optimized path determination module, used to take the second access path whose first path quantity meets the second preset condition as the access path to be optimized.

[0008] In a third aspect, the present application provides an access path analysis device, which includes: one or more processors; a storage device for storing one or more programs; when the one or more programs are executed by one or more processors, the one or more processors implement the access path analysis method as described in the first aspect above.

[0009] In a fourth aspect, the present 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 in the first aspect described above.

[0010] In a fifth aspect, an embodiment of the present application provides a computer program product, which includes a computer program or instructions, and when the computer program or instructions are executed by a processor, the access path analysis method in the first aspect described above is implemented.

[0011] Compared with the prior art, the technical solution provided by the embodiments of the present application has the following advantages:

[0012] The embodiment of the present application provides an access path analysis method, device, equipment and storage medium, the method comprising: obtaining a first access path, the first access path comprising at least two access nodes, the access nodes being pages experienced in the process of executing an access service; clustering the first access path to obtain at least one access path set, wherein the access path set comprises a plurality of first access paths whose similarity is greater than a similarity threshold; counting the number of access nodes included in the access paths in the access path set as the number of first nodes; taking the first access path whose number of first nodes meets the first preset condition as the second access path; counting the number of second access paths as the number of first paths; taking the second access path whose number of first paths meets the second preset condition as the access path to be optimized. Since the access paths are clustered according to the similarity between the access paths, the number of nodes and the number of paths in the access paths of the clustered access path set are analyzed, and then the access paths that need to be optimized are determined, the entire process uses an automated method to find the access paths that need to be optimized, thereby reducing the workload of the staff and reducing the waste of resources. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0014] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

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

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

[0017] Figure 3 A flowchart of another access path analysis method provided in an embodiment of the present application;

[0018] Figure 4 A schematic diagram of the structure of an access path analysis device provided in an embodiment of the present application;

[0019] Figure 5 A schematic diagram of the structure of an access path analysis device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0020] In order to more clearly understand the above-mentioned purposes, features and advantages of the present application, the scheme of the present application will be further described below. It should be noted that the embodiments of the present application and the features in the embodiments can be combined with each other without conflict.

[0021] In the following description, many specific details are set forth to facilitate a full understanding of the present application, but the present application may also be implemented in other ways different from those described herein; obviously, the embodiments in the specification are only part of the embodiments of the present application, rather than all of the embodiments.

[0022] The term "including" and its variations used herein are open inclusions, i.e., "including but not limited to". The term "based on" means "based at least in part 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". The relevant definitions of other terms will be given in the following description.

[0023] It should be noted that the concepts such as "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 or interdependence of the functions performed by these devices, modules or units.

[0024] It should be noted that the modifications of "one" and "plurality" mentioned in the present application are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0025] The access path analysis method provided by the present application is described in detail below in conjunction with the accompanying drawings and specific implementation methods.

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

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

[0028] S101. Obtain a first access path, where the first access path includes at least two access nodes, and the access nodes are pages experienced in the process of executing an access service.

[0029] The access path is also called the user path or user journey, which refers to the sequence of a user jumping from one page to another on the user interface, including the complete process of all triggering and browsing behaviors performed by the user on the user interface. The above user interface may include any interface that interacts with the user, such as the website user interface, application program interface, and mini-program interface.

[0030] The access node in the access path usually refers to a series of steps or touchpoints that users go through on the user interface. Each access node represents a specific stage or interface in the access path. For example, common access node types include homepage, navigation menu page, search results page, login page, content page, etc.

[0031] When a user performs an access service, the various pages experienced in executing the access service constitute an access path and are recorded. In a specific implementation, the pages experienced when executing the access service are page A, page B, page C, and page D in sequence, then the access path corresponding to this execution of the access service is: page A-page B-page C-page D. Page A, page B, page C, and page D are all access nodes included in the access path. The above-mentioned access service can be any access service provided by the client, such as: payment service, movie viewing service, member rights page, network connection service, personalized setting service, shopping cart management service, etc.

[0032] In a possible implementation, obtaining the first access path includes: periodically reading the access paths of all users within a set time length from a database as the first access path. For example, obtaining the access paths within the past week every week. The specific values ​​of the above-mentioned set time length and reading cycle can be set according to the actual application scenario, and the embodiments of the present application are not limited to this.

[0033] In one possible implementation, the user's access path is recorded by pingback. Specifically, when a user jumps from one page A to another page B, the jump behavior can be recorded, and page B can use certain network technologies to capture the user's access from page A and send a signal or request to the server. After receiving this signal, the server can record the information of this visit, including the source access node (page A), the target access node (page B), the access time, the user ID, and the access node feature value. By continuously recording the user's page jumps, the user's access path can be gradually constructed. The collected access paths are stored in the server's database or log file for subsequent use.

[0034] S102: Cluster the first access paths to obtain at least one access path set, wherein the access path set includes a plurality of first access paths whose similarities are greater than a similarity threshold.

[0035] The above-mentioned similarity threshold is used to characterize the 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 services or access requirements are the same. Therefore, the first access paths with similarities greater than the similarity threshold are combined into an access path set.

[0036] If the similarity between the two first access paths is less than or equal to the similarity threshold, it indicates that the two first access paths are not similar, there is no correlation between the two first access paths, and subsequent analysis cannot be performed, therefore, the first access paths with similarity less than or equal to the similarity threshold are divided into different access path sets. The similarity threshold can be set according to actual conditions.

[0037] Specifically, the first access paths are aggregated according to the similarity between them, and the first access paths with similarity greater than a similarity threshold are classified into the same access path set.

[0038] In one possible implementation, the access path includes at least two access nodes, each access node has its corresponding characteristic value, and access nodes with the same attributes have the same characteristic value. For example: the play page of TV series A and the play page of TV series B have the same attributes, that is, both are TV series play pages, then the characteristic value corresponding to the play page of TV series A is the same as the characteristic value corresponding to the play page of TV series B. For another example: the play page of movie C and the play page of movie D have the same attributes, that is, both are movie play pages, then the characteristic value corresponding to the play page of movie C is the same as the characteristic value corresponding to the play page of movie D. However, the play page of TV series A and the play page of movie C have different attributes, therefore, one is the play page of the TV series and the other is the play page of the movie.

[0039] The characteristic value corresponding to each access node can be set according to the actual situation. It is only necessary to record the characteristic value corresponding to each access node in the access path while recording the access path. The setting method of each characteristic value is not specifically limited in the embodiment of the present application.

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

[0041] As can be seen from the above, a feature value corresponding to each access node is pre-set for each access node, so the feature value corresponding to the access node can be recorded in the process of recording the access path. Therefore, when the first access path is obtained from the database, the feature value corresponding to the access node can be obtained.

[0042] The access order can be understood as the order of each node in an access path. For example, in the access path: page A-page B-page C-page D, the order of each node 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 access order between access nodes is taken as the order relationship between the eigenvalues ​​corresponding to each access node. For example, the order of each access node is: page A-page B-page C-page D. Page A corresponds to eigenvalue a, page B corresponds to eigenvalue b, page C corresponds to eigenvalue c, and page D corresponds to eigenvalue d. At this time, the order relationship between each eigenvalue is: eigenvalue a-eigenvalue b-eigenvalue c-eigenvalue d.

[0044] Each eigenvalue is constructed into an access sequence according to its corresponding order. For example, if the order of each eigenvalue is: eigenvalue a-eigenvalue b-eigenvalue c-eigenvalue d, then the constructed access sequence is [a, b, c, d].

[0045] According to the access sequence construction process, the access sequence of each first access path is determined, and the similarity between each access sequence is calculated by a similarity algorithm as the similarity of each first access path. Then, 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 similarity threshold, the multiple first access paths are divided into the same access path set.

[0046] The similarity algorithm may include an edit distance algorithm, a term frequency-inverse document frequency (TF-IDF) algorithm, a longest common subsequence (LCS) algorithm, etc. The similarity algorithm is not limited in the embodiments of the present application.

[0047] In a possible implementation, the access path set includes a plurality of first access paths having a similarity greater than a set threshold and having the same terminating access node.

[0048] The same terminating access nodes can be understood as the services that the user ultimately wants to access are the same. For example, the same terminating access nodes can include that all terminating access nodes are access nodes corresponding to the TV series playing page.

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

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

[0051] In a possible implementation, the access path set includes multiple access paths with the same access sequence. In other words, the same first access paths are divided 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 as the first node number.

[0053] The number of access nodes is mainly used to indicate the number of pages jumped by the user in the process of executing the access service. The number of access nodes included in the first access path is the same as the number of pages jumped by the user in the access process.

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

[0055] Exemplarily, the first access path is: page A-page B-page C-page D, and the number of access nodes included in the first access path is 4. The first access path is: page A-page B-page C-page D-page E, and the number of access nodes included in the first access path is 5.

[0056] S104: Use a first access path whose number of first nodes meets a first preset condition as a second access path.

[0057] The first preset condition is used to measure whether the first access path needs to be optimized based on the number of access nodes in the first access path. Further, the first preset condition is a condition for measuring the number of access nodes in the access path.

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

[0059] The first node number satisfies the first preset condition, including: the first node number is greater than the first set number, indicating that the number of access nodes included in the first access path is greater than the first set number, indicating that the user needs to jump to more pages in the process of executing the access service, and the user needs to perform more trigger operations, and it is necessary to further determine whether the access path needs to be optimized.

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

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

[0062] S105: Count the number of second access paths 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, in the access path set, if the number of access paths in which the number of access nodes meets the first preset condition is 1000, then the number of second access paths is 1000, that is, the number of first paths is 1000.

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

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

[0066] Among them, the access path to be optimized can be understood as an access path that may have certain defects and needs to be optimized, which is found through analysis of the access path. Among them, the access path to be optimized may include that the access service settings corresponding to the access path are unreasonable and need to be optimized. For example: the access path to be optimized may be the access path corresponding to the "movie recommendation" access service, and another example: the access path to be optimized may be the access path corresponding to the "membership rights" access service. In other words, each access path to be optimized can essentially be understood as the access service settings corresponding to the access path to be optimized are unreasonable or defective, and the access service corresponding to the access path needs to be optimized, thereby achieving the optimization of the access path.

[0067] Specifically, the second preset condition includes that the number of the first paths is greater than the second set number, or the number of the first paths is less than the fourth set number, wherein the fourth set number is less than the second set number.

[0068] The number of first paths satisfies the second preset condition, including: the number of first paths is greater than the second set number, indicating that the number of access paths in the access path set whose number of nodes is greater than the first set number is relatively large, that is, a large number of users need to perform multiple trigger operations to find the services they want to access. Therefore, such access paths are selected as access paths to be optimized.

[0069] The number of first paths satisfies the second preset condition, including: the number of first paths is less than the fourth set number, indicating that when the number of access nodes is small and users can access the access by performing few trigger operations, an access service is still accessed by only a few users, indicating that the access path or the access service corresponding to the access path needs to be optimized. Therefore, this type of access path is used as the access path to be optimized.

[0070] The embodiment of the present application provides an access path analysis method, which includes: obtaining an access path, the access path includes at least two access nodes, and the access node is a page experienced in the process of executing an access service; clustering the access paths to obtain at least one access path set, wherein the access path set includes multiple access paths whose similarity is 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 number; taking the first access path whose first node number meets the first preset condition as the second access path; counting the number of second access paths as the first path number; taking the second access path whose first path number meets the second preset condition as the access path to be optimized. Since the access paths are clustered according to the similarity between the access paths, the number of nodes and the number of paths in the access paths of the clustered access path set are analyzed, and then the access paths that need to be optimized are determined, the entire process uses an automated method to find the access paths that need to be optimized, reducing the workload of the staff and reducing resource waste.

[0071] Based on the above embodiments, the present application further optimizes the access path analysis method. Figure 2 As shown, the optimized access path analysis method mainly includes steps S201-S206.

[0072] S201. Obtain a first access path, where the first access path includes at least two access nodes, where the access nodes are pages experienced during the execution of an access service.

[0073] S202: Cluster the access paths to obtain at least one access path set, wherein the access path set includes a plurality of first access paths whose similarities are greater than a set threshold.

[0074] S203: Count the number of access nodes included in the first access path in the access path set as the first node number.

[0075] S201-S203 in the embodiment of the present application has the same execution process as S101-S103 in the above embodiment. For details, please refer to the description in the above embodiment, which will not be repeated in the embodiment of the present application.

[0076] S204: Use the first access path in which the number of first nodes is greater than the first set number 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 first node number is greater than the first set number, it indicates that the number of access nodes included in the access path is large and further optimization may be required. Therefore, the access path is used as the second access path. The first set number can be set according to actual conditions and is not specifically limited in the embodiments of the present application.

[0078] S205: Count the number of second access paths 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, in the access path set, if the number of access paths whose number of nodes is greater than the first set number is less than 1000, then the number of second access paths is 1000. Then, the number of first paths is 1000.

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

[0081] The second set number is a value used to measure the number of access paths in which the number of nodes in the access path set is greater than the first set number.

[0082] If the number of the first paths is greater than the second set number, it indicates that there are many access paths in the access path set whose number of nodes is greater than the first set number, that is, a large number of users need to perform multiple trigger operations to find the services they want to access. Therefore, such access paths are used as access paths to be optimized.

[0083] If the number of the first paths is less than the second set number, it indicates that the number of access paths in the access path set whose number of nodes is greater than the first set number is relatively small, that is, only a small number of users can find the services they want to access by performing multiple trigger operations. Such access paths may only result in excessive number of access nodes due to certain errors in user operations. For such access paths, access path optimization is not performed for the time being.

[0084] If the number of first nodes included in an access path is greater than the first set number, it means that the user needs to perform multiple trigger operations to reach the service they want to access during the process of accessing the service, and the number of such access paths is greater than the second set number, it means that a large number of users need to perform multiple trigger operations to reach the service they want to access. For example: if the number of access nodes included in the access path is 7, 7 pages need to be jumped in the process of accessing the service, and the user needs to perform 7 trigger operations. In other words, from opening the initial page corresponding to the initial access node to finding the termination page corresponding to the desired termination access node, the user may have to perform at least 7 trigger operations, and the user interface needs to perform 7 jumps or switches to display the termination page. The entire process is redundant and complex, which is not conducive to users quickly finding the content they want. And there are 10,000 access paths with 7 access nodes, which means that a large number of users need to perform multiple trigger operations to reach the service they want to access. Therefore, this type of access path is used as an access path to be optimized.

[0085] For example, if the access service corresponding to the access path to be optimized is the drama playback page, it means that the user needs to trigger multiple times to find the drama playback page. 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 drama playback page.

[0086] The embodiment of the present application provides an access path analysis method, which includes: obtaining an access path, the access path includes at least two access nodes, and the access node is a page experienced in the process of executing an access service; clustering the access paths to obtain at least one access path set, wherein the access path set includes multiple access paths whose similarity is 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 number; taking the first access path whose first node number is greater than the first set number as the second access path; counting the number of second access paths as the first path number; taking the second access path whose first path number is greater than the second set number as the access path to be optimized. Since the access paths are clustered according to the similarity between the access paths, the number of nodes and the number of paths in the access paths of the clustered access path set are analyzed, and the access paths with a relatively large number of nodes and a relatively large number of access paths are taken as the access paths to be optimized, the entire process uses an automated method to find the access paths that need to be optimized, thereby reducing the workload of the staff and reducing the waste of resources.

[0087] In one possible implementation, a second access path whose number of first paths is greater than a second set number is used as an access path to be optimized, including: using a second access path whose number of first paths is greater than a second set number as a third access path; for at least one third access path, counting the number of repetitions of a subpath in the third access path; the subpath includes at least two adjacent access nodes, and the number of repetitions includes the number of times the same subpath appears in the second access path; and using a subpath whose number of repetitions is greater than a fifth set number as an access path to be optimized.

[0088] A subpath in an access path can be understood as a path formed by any two or more consecutive access nodes in the access path, and the number of subpath repetitions can be understood as the number of times the access path subpath appears repeatedly. The existence of subpath repetitions in an access path indicates that the user has repeatedly opened one or several access pages. For example: 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. Then Page D-Page E can be used as a subpath in the above access path, and the subpath "Page D-Page E" is repeated 4 times, that is, the number of repetitions of the subpath is 4.

[0089] The number of repetitions of the sub-path included in the access path in a certain access path set is greater than the fifth set number, for example: 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-page D-page E. Then page D-page E can be used as a sub-path in the above path, and the sub-path "page D-page E" is repeated 6 times, that is, the user continues to open "page D-page E" 6 times before finding the content he wants. Take page D as the "movie recommendation page" and page E as the "movie preview page" as an example. The user selects a movie he likes on the "movie recommendation page", jumps to the "movie preview page" for preview, and repeats it 4 times before finding the movie he really wants to watch.

[0090] In other words, the user repeatedly opens one or several access pages. This indicates that the movies recommended in the "movie recommendation page" are not of interest to the user, and the user cannot find the movie he wants to watch, which further indicates that the movie recommendation mechanism needs to be optimized to recommend suitable movies to the user based on the user's attributes. Therefore, the subpath is used as the access path to be optimized. In other words, the access business corresponding to the subpath is the access business that needs to be further optimized.

[0091] In one possible implementation, a sub-path whose number of repetitions is greater than a fifth set number is used as an access path to be optimized, including: using a third access path that satisfies a third set condition as a fourth access path; wherein satisfying 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 a fifth set number; counting the number of second paths of the fourth access path; and when the number of second paths is greater than a sixth set number, using the sub-path as the access path to be optimized.

[0092] In the embodiment of the present application, the fourth access path includes a sub-path, and the number of repetitions of the sub-path is greater than the fifth set number, which indicates that the user needs to repeat the selection multiple times before finding the movie he wants to watch. Then, in this case, the third access path that meets the third set condition is used as the fourth access path, and the number of the fourth access paths is counted as the number of the second paths. If the number of the second paths is greater than the sixth set number, it indicates that a large number of users need to repeat multiple times before finding the movie they want to watch, and the sub-path is used as the access path to be optimized.

[0093] In an embodiment of the present application, when the number of second paths is greater than the sixth set number, the sub-path is used as the access path to be optimized, thereby avoiding using an access path that is repeated too many times due to operational errors 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 present application further optimizes the access path analysis method. Figure 3 As shown, the optimized access path analysis method mainly includes steps S301-306.

[0095] S301. Obtain a first access path, where the first access path includes at least two access nodes, where the access nodes are pages experienced during the execution of an access service.

[0096] S302: Cluster the access paths to obtain at least one access path set, wherein the access path set includes a plurality of first access paths whose similarities are greater than a set threshold.

[0097] S303: Count the number of access nodes included in the first access path in the access path set as the first node number.

[0098] S301-S303 in the embodiment of the present application has the same execution process as S101-S103 in the above embodiment. For details, please refer to the description in the above embodiment, which will not be repeated in the embodiment of the present application.

[0099] S304: Use the first access path in which the number of first nodes is less than the third set number as the second access path.

[0100] The third set 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 set number, it indicates that the number of access nodes included in the first access path is small and further optimization may be required. Therefore, the first access path is used as the second access path. The first set number can be set according to actual conditions and is not specifically limited in the embodiments of the present application.

[0101] S305: Count the number of second access paths 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, in the access path set, if the number of access paths whose number of nodes is less than the third set number is 10, then the number of second access paths is 10. Then, the number of first paths is 10.

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

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

[0105] The first path number can be understood as the number of access paths in an access path set whose first node number is less than the third set number. The fourth set number can be understood as a value measuring the number of access paths in an access path set whose first node number is less than the third set number. The fourth set number can be set according to actual experience and is not specifically limited in the embodiments of the present application.

[0106] If the number of first nodes in a certain access path set is less than the third set number and the number of access paths is less than the fourth set number, it means that in the sampling period, when the number of access nodes is small, the number of people executing the access path is small, that is, the number of people accessing the access service is small, indicating that the access service is not attractive to users and needs to be optimized. For example: when the access service is "membership rights", if there are few access paths to access "membership rights" in a period, it means that "membership rights" are not attractive to users and the access service of "membership rights" needs to be further optimized to improve the attractiveness of the "membership rights" access service.

[0107] The embodiment of the present application provides an access path analysis method, which includes: obtaining an access path, the access path includes at least two access nodes, and the access node is a page experienced in the process of executing an access service; clustering the access paths to obtain at least one access path set, wherein the access path set includes multiple access paths whose similarity is 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 number; taking the first access path whose first node number is less than the third set number as the second access path; counting the number of second access paths as the first path number; taking the second access path whose first path number is less than the fourth set number as the access path to be optimized. Since the access paths are clustered according to the similarity between the access paths, the number of nodes and the number of paths in the access paths of the clustered access path set are analyzed, and the access paths with relatively small number of nodes and relatively small number of access paths are taken as the access paths to be optimized, the whole process uses an automated method to find the access paths that need to be optimized, reducing the workload of the staff and reducing the waste of resources.

[0108] In a possible implementation, the length of stay of access nodes included in each of the access paths is counted; and access nodes whose length of stay exceeds a set length of time are taken as access nodes to be optimized.

[0109] The length of stay of the access node is used to characterize the length of time a user stays on a page during the process of accessing a service. The preset length of stay is an indicator used to measure the length of time a user stays during the process of accessing a service. The preset length of stay can be set according to actual experience and is not specifically limited in the embodiments of the present application.

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

[0111] In another possible implementation, the length of stay of each access node in the access path is counted, the length of stay of each access node is sorted in descending order, the length of stay is compared with the set length of stay in descending order, and when there is a length of stay that is less than or equal to the set length of stay, the comparison is stopped to obtain all access nodes whose length of stay exceeds the set length of stay.

[0112] If the dwell time of any access node in the access path exceeds the preset time, it indicates that the page content corresponding to the access node is too complex or the amount of information is too large, and users may need more time to digest and understand it. Alternatively, the navigation design of the website is not intuitive or difficult to understand, and users may spend more time looking for the information or functions they need. Alternatively, the page loading time is too long, and users may lose patience while waiting, resulting in an increase in dwell time. Therefore, the access services corresponding to the access nodes with a dwell time longer than the set time are access services that need to be further optimized.

[0113] In a possible implementation, if the dwell time of only one access node in an access path exceeds the preset time, it indicates that only the page content of the access node is not set reasonably, so only the access node is treated as an access path that needs to be optimized. For example, if the dwell time on the "Movie Recommendation" page is too long, it indicates that the movies recommended by the "Movie Recommendation" page do not have the movies that the user wants to watch, and the user may spend more time looking for the movies they want to watch. The movie recommendation service needs to be optimized to recommend more suitable movies to the user.

[0114] In another possible implementation, if the duration of stay at multiple consecutive access nodes in an access path exceeds a preset duration, it indicates that the access path formed by the multiple consecutive access nodes needs to be optimized. For example, if there is too much text content in multiple consecutive pages, users need more time to digest and understand the text content in each page. It is necessary to optimize the page content, add graphic explanations, or adjust the page layout to reduce the time for users to digest and understand.

[0115] In another possible implementation, if the dwell time of multiple discontinuous access nodes in an access path exceeds the preset time, it indicates that there may be different reasons for each access node. At this time, each access node can be used as an access path to be optimized. For example: if one access node corresponds to a "movie recommendation" page, and another access node corresponds to a "historical playback" page. Then, the dwell time on the "movie recommendation" page indicates that the movies recommended by the "movie recommendation" page do not have the movies the user wants to watch, and the user may spend more time looking for the movies they want to watch. The movie recommendation service needs to be optimized to recommend more suitable movies to the user. If the dwell time on the "historical playback" page is too long, it may be that the redundant content of the "historical playback" page is too large, and the page loading time is too long. The user may lose patience during the waiting process, resulting in an increase in the dwell time. In this case, it is necessary to optimize the access nodes corresponding to the "movie recommendation" page and the "historical playback" page respectively.

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

[0117] Among them, the access path acquisition module 41 is used to obtain a first access path, wherein the first access path includes at least two access nodes, and the access nodes are pages experienced in the process of executing the access business; the path clustering module 42 is used to cluster the first access path to obtain multiple access path sets, wherein the access path set includes multiple first access paths with similarities greater than a similarity threshold; the node quantity counting module 43 is used to count the number of access nodes included in the first access path in the access path set as the first node quantity; the node quantity judgment module 44 is used to take the first access path whose first node quantity meets the first preset condition as the second access path; the path quantity counting module 45 is used to count the number of the second access path as the first path quantity; the optimized path determination module 46 is used to take the second access path whose first path quantity meets the second preset condition as the access path to be optimized.

[0118] The embodiment of the present application provides an access path analysis device, which is used to execute the following process: obtain a first access path, the first access path includes at least two access nodes, and the access node is a page experienced in the process of executing an access service; cluster the first access path to obtain at least one access path set, wherein the access path set includes multiple first access paths with similarities greater than a similarity threshold; count the number of access nodes included in the access paths in the access path set as the first node number; take the first access path whose first node number meets the first preset condition as the second access path; count the number of second access paths as the first path number; take the second access path whose first path number meets the second preset condition as the access path to be optimized. Since the access paths are clustered according to the similarity between the access paths, the number of nodes and the number of paths in the access paths of the clustered access path set are analyzed, and then the access paths that need to be optimized are determined. The entire process uses an automated method to find the access paths that need to be optimized, reducing the workload of the staff and reducing resource waste.

[0119] In a possible implementation, the access path set includes a plurality of first access paths having a similarity greater than a set threshold and having the same terminating access node.

[0120] In a possible implementation, the node quantity determination module 43 is specifically used to use the first access path where the number of the first nodes is greater than the first set number as the second access path; the optimized path determination module 46 is specifically used to use the second access path where the number of the first path is greater than the second set number as the access path to be optimized.

[0121] In a possible implementation, the node quantity judgment module 43 specifically uses the first access path where the first node quantity is less than the third set quantity as the second access path; the optimized path determination module 46 is specifically used to use the second access path as the access path to be optimized when the first path quantity is less than the fourth set quantity.

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

[0123] In one possible implementation, the optimized path determination module 46 is specifically used to use the third access path that meets the third set condition 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; counting the number of the fourth access paths as the second path number; and when the second path number is greater than the sixth set number, using the sub-path as the access path to be optimized.

[0124] In a possible implementation, it also includes: an optimization node determination module, which is used to count the residence time of the access nodes included in each of the access paths; and to select the access nodes whose residence time exceeds the set time as the access nodes to be optimized.

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

[0126] Figure 5 Schematic diagram of the structure of an access path analysis device provided by this embodiment. 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 the processor 510 in the electronic device can be one or more. Figure 5A processor 510 is taken as an example; the processor 510, the memory 520, the input device 530 and the output device 540 in the electronic device can be connected via a bus or other means. Figure 5 The example of connecting through bus is taken in the following.

[0127] The memory 520, as a computer-readable storage medium, can be used to store software programs, computer executable programs and modules, such as program instructions / modules corresponding to the access path analysis method in the embodiment of the present 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, that is, implements the access path analysis method provided in the embodiment of the present application.

[0128] The memory 520 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system and at least one application required for a function; the data storage area may store data created according to the use of the terminal, etc. In addition, the memory 520 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 520 may further include a memory remotely arranged relative to the processor 510, and these remote memories may be connected to the electronic device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0129] The input device 530 may be used to receive input digital or character information and generate key signal input related to user settings and function control of the electronic device, and may include a keyboard, a mouse, etc. The output device 540 may include a display device such as a display 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 the embodiment of the present application.

[0131] Of course, the computer executable instructions of a storage medium including computer executable instructions provided in an embodiment of the present application are not limited to the operations of the method described above, but can also execute related operations in the access path analysis method provided in any embodiment of the present application.

[0132] Through the above description of the implementation method, the technicians in the relevant field can clearly understand that the present application can be implemented with the help of software and necessary general hardware, and of course it can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present application can be essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the 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 (FLASH), hard disk or optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, server, or network device, etc.) to execute the methods described in each embodiment of the present application.

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

[0134] It should be noted that, in this article, relational terms such as "first" and "second" are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

[0135] The above description is only a specific implementation of the present application, so that those skilled in the art can understand or implement the present application. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein can be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present application will not be limited to the embodiments described herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. An access path analysis method, characterized in that: The method comprises: Acquire a first access path, where the first access path includes at least two access nodes, where the access nodes are pages experienced during the execution of an access service; Clustering the first access paths to obtain at least one access path set, wherein the access path set includes a plurality of first access paths whose similarity is greater than a set threshold; Counting the number of access nodes included in the first access path in the access path set as the first node number; Using a first access path whose number of the first nodes meets a first preset condition as a second access path; Counting the number of the second access paths as the number of the first paths; The second access paths whose number of the first paths meets a second preset condition are used as access paths to be optimized.

2. The method according to claim 1, characterized in that The access path set includes a plurality of first access paths whose similarity is greater than a set threshold and whose terminal access nodes are the same.

3. The method according to claim 1, characterized in that Using a first access path in which the number of the first nodes meets a first preset condition as a second access path includes: Using a first access path having a number of the first nodes greater than a first set number as a second access path; The step of selecting the second access paths whose number of the first paths meets a second preset condition as the access paths to be optimized includes: The second access paths whose number of the first paths is greater than the second set number are used as access paths to be optimized.

4. The method according to claim 2, characterized in that: The step of using an access path in which the number of the first nodes meets a first preset condition as a second access path includes: Using a first access path in which the number of the first nodes is less than a third set number as a second access path; The step of selecting the second access paths whose number of the first paths meets a second preset condition as the access paths to be optimized includes: If the number of the first paths is less than the fourth set number, the second access path is used as the access path to be optimized.

5. The method according to claim 3, characterized in that: The step of selecting the second access paths, whose number of the first paths is greater than the second set number, as access paths to be optimized includes: The second access path whose number of the 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, counting the number of repetitions of a subpath in the third access path; the subpath includes at least two adjacent access nodes, and the number of repetitions includes the number of times the same subpath appears in the third access path; The sub-path with the number of repetitions greater than the fifth set number is used as the access path to be optimized.

6. The method according to claim 5, characterized in that The sub-paths with a number of repetitions greater than a fifth set number are taken as access paths to be optimized, including: The third access path that satisfies the third setting condition is used as the fourth access path; wherein satisfying the third setting condition includes: the third access path includes a sub-path, and the number of repetitions of the sub-path is greater than the fifth setting number; Counting the number of the fourth access paths as the number of second paths; When the number of the second paths is greater than the sixth set number, the sub-path is used as the access path to be optimized.

7. The method according to claim 3 or 4, characterized in that: Also includes: Counting the length of stay of the access nodes included in each of the access paths; The access nodes whose stay time exceeds the set time are regarded as the access nodes to be optimized.

8. An access path analysis device, characterized in that: The device comprises: An access path acquisition module, used to acquire a first access path, wherein the first access path includes at least two access nodes, and the access nodes are pages experienced in the process of executing an access service; a path clustering module, configured to cluster the first access paths to obtain a plurality of access path sets, wherein the access path sets include a plurality of first access paths whose similarity is greater than a similarity threshold; A node quantity counting module, used for counting the number of access nodes included in the first access path in the access path set as the first node quantity; A node quantity determination module, configured to use a first access path whose first node quantity meets a first preset condition as a second access path; A path quantity counting module, used for counting the quantity of the second access paths as the first path quantity; The optimized path determining module is used to take the second access path whose number of the first paths meets a second preset condition as the access path to be optimized.

9. An access path analysis device, characterized in that: The device comprises: one or more processors; A 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 to 7.

10. A storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the access path analysis method as described in any one of claims 1 to 7 is implemented.

Citation Information

Patent Citations

  • Method for optimizing website structures on basis of frequent browse sequences

    CN108334646A

  • Network node anomaly identification method based on access request path analysis

    CN116055182A

  • User interaction path optimization method and device, equipment and medium

    CN116738100A

  • System for home network with efficient control

    KR102042194B1

  • Method and system for fast computation of routes under multiple network states with communication continuation

    US20020172157A1