CA3144126A1 - Method of and system for constructing page access path - Google Patents
Method of and system for constructing page access path Download PDFInfo
- Publication number
- CA3144126A1 CA3144126A1 CA3144126A CA3144126A CA3144126A1 CA 3144126 A1 CA3144126 A1 CA 3144126A1 CA 3144126 A CA3144126 A CA 3144126A CA 3144126 A CA3144126 A CA 3144126A CA 3144126 A1 CA3144126 A1 CA 3144126A1
- Authority
- CA
- Canada
- Prior art keywords
- access
- path
- page
- pages
- ingress
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 40
- 238000005192 partition Methods 0.000 claims abstract description 39
- 238000004140 cleaning Methods 0.000 claims abstract description 28
- 238000000638 solvent extraction Methods 0.000 claims abstract description 13
- 239000011800 void material Substances 0.000 claims description 9
- 241000209202 Bromus secalinus Species 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 4
- 238000010276 construction Methods 0.000 abstract description 4
- 230000000694 effects Effects 0.000 description 12
- 230000003252 repetitive effect Effects 0.000 description 10
- 238000004458 analytical method Methods 0.000 description 9
- 230000006399 behavior Effects 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 6
- 230000002708 enhancing effect Effects 0.000 description 3
- 230000009466 transformation Effects 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000002452 interceptive effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/21—Design, administration or maintenance of databases
- G06F16/215—Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The present invention makes public a method of and a system for constructing a page access path, whereby consumption of computational resources is reduced at the same time construction efficiency is enhanced by optimizing a page access path tree. The method comprises: obtaining an access session of a user, the access session including a plurality of different access pages;
page-cleaning and serially numbering according to collection time the access pages in the access session; sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path; partitioning, based on a numbering interval of adjacent ingress access pages, the access pages within the interval into a corresponding path partition; matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order.
page-cleaning and serially numbering according to collection time the access pages in the access session; sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path; partitioning, based on a numbering interval of adjacent ingress access pages, the access pages within the interval into a corresponding path partition; matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order.
Description
METHOD OF AND SYSTEM FOR CONSTRUCTING PAGE ACCESS PATH
BACKGROUND OF THE INVENTION
Technical Field [0001] The present invention relates to the field of internet technology, and more particularly to a method of and a system for constructing a page access page.
Description of Related Art
BACKGROUND OF THE INVENTION
Technical Field [0001] The present invention relates to the field of internet technology, and more particularly to a method of and a system for constructing a page access page.
Description of Related Art
[0002] It is required in the businesses of website operations and website analyses to learn what the user behavior is from the time the user enters a website to the time of departure, for instance, to learn whether the user browses and accesses according to paths of navigations designed by the website, how the circumstance of users loss is on each browsing step, what the actual access is after the user has departed from the corresponding page, and so on, as it is required to summarize link analyses of key paths of a website with respect to the user access, to count the origin/skip and exiting indices of each page, to recognize and optimize the structure of the website, to enhance website accesses and order conversion rate, and to enhance user experience.
[0003] While analyzing the path behavior track of a user in the state of the art, it is required to traverse all behavior track data of the user, and to perform many rounds of associated traversing operations on all behaviors before path information of the user could be obtained. When the access volume of the website is huge, such traversing will be extremely time-consuming and consume great quantities of computational resources.
SUMMARY OF THE INVENTION
Date Recue/Date Received 2021-12-29
SUMMARY OF THE INVENTION
Date Recue/Date Received 2021-12-29
[0004] An objective of the present invention is to provide a method of and a system for constructing a page access path, whereby consumption of computational resources is reduced at the same time of enhancing construction efficiency by optimizing a page access path tree.
[0005] In order to achieve the above objective, according to the first aspect, the present invention provides a method of constructing a page access path, which method comprises:
[0006] obtaining an access session of a user, the access session including a plurality of different access pages;
[0007] page-cleaning and serially numbering according to collection time the access pages in the access session;
[0008] sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and recording path information of each head node;
[0009] partitioning, based on a numbering interval of adjacent ingress access pages, the access pages within the interval into a corresponding path partition if there are plural paths;
alternatively partitioning the entire access pages as one path partition if there is one path;
alternatively partitioning the entire access pages as one path partition if there is one path;
[0010] matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order, obtaining a matching relation of each access page and constructing path nodes, and simultaneously recording path information of the path nodes; and
[0011] constructing a page access path tree based on the head node and the path information of the path nodes.
[0012] Preferably, the step of obtaining an access session of a user, the access session including a plurality of different access pages includes:
[0013] obtaining a plurality of access pages browsed by the user through a terminal within a preset time period when accessing a website, and summarizing the plurality of access pages chronologically to constitute the access session.
Date Recue/Date Received 2021-12-29
Date Recue/Date Received 2021-12-29
[0014] Preferably, the step of page-cleaning and serially numbering according to collection time the access pages in the access session includes:
[0015] recognizing any noise access page engendered by crawlers and/or cheats from the access pages, and preliminarily cleaning and eliminating the noise access page; and
[0016] serially numbering according to collection time the remaining access pages in the same access session.
[0017] Further, the method further comprises, after the step of preliminarily cleaning and eliminating the noise access page:
[0018] if it is compared in the same access session that two consecutive access pages are identical access pages, then secondarily cleaning and eliminating the later access page.
[0019] Preferably, the method further comprises, prior to the step of sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and recording path information of each head node:
[0020] constructing a page breakpoint dimension table, the page breakpoint dimension table including at least one access page breakpoint page.
[0021] Preferably, the step of sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and recording path information of each head node includes:
[0022] comparing the access pages in the access session sequentially with the page breakpoint dimension table on a one-by-one basis, and defining any matched access page as the ingress access page of a new path; and
[0023] taking each ingress access page as a head node of the corresponding path, and recording path information of each head node as void; wherein
[0024] the number of paths is the number of the ingress access pages.
Date Recue/Date Received 2021-12-29
Date Recue/Date Received 2021-12-29
[0025] Further, the step of matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order, obtaining a matching relation of each access page and constructing path nodes, and simultaneously recording path information of the path nodes includes:
[0026] sequentially searching for redirected pages of each access page in the path partition in an increasing order;
[0027] drawing a path matching relation between the various access pages in the path partition based on a matching relation between each access page and the corresponding redirected page, expressing the access pages in the form of path nodes in a path relation, and recording a path matching relation of each path node through the path information, the path information further including pit click information of the redirected page; and
[0028] serially connecting the head nodes and the path nodes to form a path according to the path matching relation.
[0029] Further, the step of constructing a page access path tree includes:
[0030] summarizing each path in the access session, and constructing the page access path tree.
[0031] In comparison with prior-art technology, the method of constructing a page access path provided by the present invention achieves the following advantageous effects.
[0032] In the method of constructing a page access path provided by the present invention, a plurality of access pages browsed by the user through a terminal within a preset time period when accessing a website are obtained, the plurality of access pages are summarized chronologically to constitute the access session, thereafter the access pages in the access session are page-cleaned and serially numbered according to collection time, subsequently ingress access pages of each path are sequentially recognized from the plurality of access pages, each ingress access page is taken as a head node of the corresponding path, and path information of each head node is simultaneously recorded;
Date Recue/Date Received 2021-12-29 if there are plural recognized paths, a numbering interval of adjacent ingress access pages can be based on to partition the access pages within the interval into a corresponding path partition; alternatively, if there is one path, the entire access pages are partitioned as one path partition, thereafter the access pages pertaining to each path partition are matched, for redirecting pages, one by one sequentially in an increasing order, a matching relation of each access page is obtained and path nodes are constructed, path information of the path nodes is simultaneously recorded, and a page access path tree is finally constructed based on the head node and the path information of the path nodes.
Date Recue/Date Received 2021-12-29 if there are plural recognized paths, a numbering interval of adjacent ingress access pages can be based on to partition the access pages within the interval into a corresponding path partition; alternatively, if there is one path, the entire access pages are partitioned as one path partition, thereafter the access pages pertaining to each path partition are matched, for redirecting pages, one by one sequentially in an increasing order, a matching relation of each access page is obtained and path nodes are constructed, path information of the path nodes is simultaneously recorded, and a page access path tree is finally constructed based on the head node and the path information of the path nodes.
[0033] Seen as such, by page-cleaning the access session, the present invention makes it possible to perform noise reduction treatment on consecutively repetitive access pages, and thus prevent the repetitive access pages from interfering with path analysis.
Moreover, in comparison with the prior-art solution in which the mode of access page details is used to associate the table itself for many times to take the information of the next access page, and the next following the next access page to construct the path, the present invention reduces the consumption of system computational resources at the same time of enhancing the path tree construction efficiency by optimizing the path of the access pages.
Moreover, in comparison with the prior-art solution in which the mode of access page details is used to associate the table itself for many times to take the information of the next access page, and the next following the next access page to construct the path, the present invention reduces the consumption of system computational resources at the same time of enhancing the path tree construction efficiency by optimizing the path of the access pages.
[0034] According to the second aspect, the present invention provides a system for constructing a page access path, the system is applied to the method of constructing a page access path as recited in the aforementioned technical solution, and the system comprises:
[0035] an obtaining unit, for obtaining an access session of a user, the access session including a plurality of different access pages;
[0036] a cleaning unit, for page-cleaning and serially numbering according to collection time the access pages in the access session;
[0037] a recognizing unit, for sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and recording path information of each head node;
[0038] a judging unit, for partitioning, based on a numbering interval of adjacent ingress access Date Recue/Date Received 2021-12-29 pages, the access pages within the interval into a corresponding path partition if there are plural paths; alternatively partitioning the entire access pages as one path partition if there is one path;
[0039] a path matching unit, for matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order, obtaining a matching relation of each access page and constructing path nodes, and simultaneously recording path information of the path nodes; and
[0040] a path tree constructing unit, for constructing a page access path tree based on the head node and the path information of the path nodes.
[0041] In comparison with prior-art technology, the advantageous effects achieved by the system for constructing a page access path provided by the present invention are identical with the advantageous effects achieved by the method of constructing a page access path provided by the aforementioned technical solution, while no repetition is made in this context.
[0042] According to the third aspect, the present invention provides a computer-readable storage medium storing thereon a computer program that executes the steps of the aforementioned method of constructing a page access path when it is run by a processor.
[0043] In comparison with prior-art technology, the advantageous effects achieved by the computer-readable storage medium provided by the present invention are identical with the advantageous effects achieved by the method of constructing a page access path provided by the aforementioned technical solution, while no repetition is made in this context.
BRIEF DESCRIPTION OF THE DRAWINGS
BRIEF DESCRIPTION OF THE DRAWINGS
[0044] The accompanying drawings herein described are employed to provide further Date Recue/Date Received 2021-12-29 comprehension to the present invention, and constitute a part of the present invention, and exemplary embodiments of the present invention and their descriptions are meant to explain the present invention, rather than to restrict the present invention.
In the drawings:
In the drawings:
[0045] Fig. 1 is a flowchart schematically illustrating the method of constructing a page access path in an embodiment of the present invention; and
[0046] Fig. 2 is a view schematically illustrating an example of a page access path tree in an embodiment of the present invention.
DETAILED DESCRIPTION OF THE INVENTION
DETAILED DESCRIPTION OF THE INVENTION
[0047] To make more lucid and clear the aforementioned objectives, characteristics and advantages of the present invention, the technical solutions in the embodiments of the present invention will be clearly and comprehensively described below with reference to the accompanying drawings in the embodiments of the present invention.
Apparently, the embodiments as described are merely partial, rather than the entire, embodiments of the present invention. Any other embodiments makeable by persons ordinarily skilled in the art on the basis of the embodiments in the present invention without creative effort shall all fall within the protection scope of the present invention.
Apparently, the embodiments as described are merely partial, rather than the entire, embodiments of the present invention. Any other embodiments makeable by persons ordinarily skilled in the art on the basis of the embodiments in the present invention without creative effort shall all fall within the protection scope of the present invention.
[0048] Embodiment 1
[0049] Referring to Fig. 1, this embodiment provides a method of constructing a page access path, and the method comprises:
[0050] obtaining an access session of a user, the access session including a plurality of different access pages; page-cleaning and serially numbering according to collection time the access pages in the access session; sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of Date Recue/Date Received 2021-12-29 the corresponding path, and recording path information of each head node;
partitioning, based on a numbering interval of adjacent ingress access pages, the access pages within the interval into a corresponding path partition if there are plural paths;
alternatively partitioning the entire access pages as one path partition if there is one path; matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order, obtaining a matching relation of each access page and constructing path nodes, and simultaneously recording path information of the path nodes;
and constructing a page access path tree based on the head node and the path information of the path nodes.
partitioning, based on a numbering interval of adjacent ingress access pages, the access pages within the interval into a corresponding path partition if there are plural paths;
alternatively partitioning the entire access pages as one path partition if there is one path; matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order, obtaining a matching relation of each access page and constructing path nodes, and simultaneously recording path information of the path nodes;
and constructing a page access path tree based on the head node and the path information of the path nodes.
[0051] In the method of constructing a page access path provided by this embodiment, a plurality of access pages browsed by the user through a terminal within a preset time period when accessing a website are obtained, the plurality of access pages are summarized chronologically to constitute the access session, thereafter the access pages in the access session are page-cleaned and serially numbered according to collection time, subsequently ingress access pages of each path are sequentially recognized from the plurality of access pages, each ingress access page is taken as a head node of the corresponding path, and path information of each head node is simultaneously recorded;
if there are plural recognized paths, a numbering interval of adjacent ingress access pages can be based on to partition the access pages within the interval into a corresponding path partition; alternatively, if there is one path, the entire access pages are partitioned as one path partition, thereafter the access pages pertaining to each path partition are matched, for redirecting pages, one by one sequentially in an increasing order, a matching relation of each access page is obtained and path nodes are constructed, path information of the path nodes is simultaneously recorded, and a page access path tree is finally constructed based on the head node and the path information of the path nodes.
if there are plural recognized paths, a numbering interval of adjacent ingress access pages can be based on to partition the access pages within the interval into a corresponding path partition; alternatively, if there is one path, the entire access pages are partitioned as one path partition, thereafter the access pages pertaining to each path partition are matched, for redirecting pages, one by one sequentially in an increasing order, a matching relation of each access page is obtained and path nodes are constructed, path information of the path nodes is simultaneously recorded, and a page access path tree is finally constructed based on the head node and the path information of the path nodes.
[0052] Seen as such, by page-cleaning the access session, this embodiment makes it possible to perform noise reduction treatment on consecutively repetitive access pages, and thus Date Recue/Date Received 2021-12-29 prevent the repetitive access pages from interfering with path analysis.
Moreover, in comparison with the prior-art solution in which the mode of access page details is used to associate the table itself for many times to take the information of the next access page, and the next following the next access page to construct the path, this embodiment reduces the consumption of system computational resources at the same time of enhancing the path tree construction efficiency by optimizing the path of the access pages.
Moreover, in comparison with the prior-art solution in which the mode of access page details is used to associate the table itself for many times to take the information of the next access page, and the next following the next access page to construct the path, this embodiment reduces the consumption of system computational resources at the same time of enhancing the path tree construction efficiency by optimizing the path of the access pages.
[0053] In the aforementioned embodiment, the step of obtaining an access session of a user, the access session including a plurality of different access pages includes:
[0054] obtaining a plurality of access pages browsed by the user through a terminal within a preset time period when accessing a website, and summarizing the plurality of access pages chronologically to constitute the access session.
[0055] During specific implementation, the solution of this embodiment is applicable to multiple ends, such as the APP end, the PC end, a small program end, etc., an access session is generated by a user browsing a plurality of access pages through any end within a preset time period when accessing a website, and during summarization it is required to sort the pages chronologically according to the access times of the user to form the access session.
[0056] In the aforementioned embodiment, the step of page-cleaning and serially numbering according to collection time the access pages in the access session includes:
[0057] recognizing any noise access page engendered by crawlers and/or cheats from the access pages, and preliminarily cleaning and eliminating the noise access page; and serially numbering according to collection time the remaining access pages in the same access session.
[0058] During specific implementation, a currently available algorithm program is employed to recognize the visitor list of crawlers and/or cheats to recognize any noise access page in the access pages, these noise access pages are cleaned and eliminated, and only the access Date Recue/Date Received 2021-12-29 pages remaining in the access session are serially numbered according to collection time.
[0059] In the aforementioned embodiment, the method further comprises, after the step of preliminarily cleaning and eliminating the noise access page:
[0060] if it is compared in the same access session that two consecutive access pages are identical access pages, then secondarily cleaning and eliminating the later access page.
[0061] During specific implementation, if it is determined that two consecutive access pages in the same access session are identical access pages, this indicates that the user might have continuously refreshed the access page or that the later access page might have been generated in a certain page turning scenario; since this type of repetitive access pages is meaningless to path analysis, there is a need to remove the duplicate, namely to filter out and eliminate the later repetitive access page. Understandably, it is also possible in the actual operational process to firstly serially number the access pages in the access session, then to perform preliminary cleaning and secondary cleaning on the access pages, and finally to update the numberings again. None of the two numbering schemes affects the specific implementation of the solution, so no restriction is made thereto.
[0062] In addition, the method of judging whether two consecutive access pages are repetitive is to judge through one or more of page information comparison, url information comparison, and page name information comparison; if the comparison results of any information in the page information comparison, url information comparison, and page name information comparison of two consecutive access pages are identical, this indicates that the two consecutive access pages are repetitive of each other, and it is required in this case to eliminate the later repetitive access page.
[0063] In the aforementioned embodiment, the method further comprises, prior to the step of sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and Date Recue/Date Received 2021-12-29 recording path information of each head node:
[0064] constructing a page breakpoint dimension table, the page breakpoint dimension table including at least one access page breakpoint page.
[0065] In the aforementioned embodiment, the step of sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and recording path information of each head node includes:
[0066] comparing the access pages in the access session sequentially with the page breakpoint dimension table on a one-by-one basis, and defining any matched access page as the ingress access page of a new path; and taking each ingress access page as a head node of the corresponding path, and recording path information of each head node as void;
wherein the number of paths is the number of the ingress access pages.
wherein the number of paths is the number of the ingress access pages.
[0067] During specific implementation, the page breakpoint dimension table records therein breakpoint pages, such as a homepage of website pages, a tab page, etc.;
usually speaking, a breakpoint page is precisely an ingress access page (the first access page) of a new path, and it is also taken as the head node of the new path; the access pages remaining in the access session are compared one by one with breakpoint pages in the breakpoint dimension table, when comparison is successful, this indicates that the corresponding access page is an ingress access page, it is now taken as the head node of the new path, and the number of corresponding paths can be finally known by counting the number of the ingress access pages. Understandably, since there is no path node occurring before the head node, the path relation recorded of the path information of the head node is void.
usually speaking, a breakpoint page is precisely an ingress access page (the first access page) of a new path, and it is also taken as the head node of the new path; the access pages remaining in the access session are compared one by one with breakpoint pages in the breakpoint dimension table, when comparison is successful, this indicates that the corresponding access page is an ingress access page, it is now taken as the head node of the new path, and the number of corresponding paths can be finally known by counting the number of the ingress access pages. Understandably, since there is no path node occurring before the head node, the path relation recorded of the path information of the head node is void.
[0068] In the aforementioned embodiment, the step of matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order, obtaining a matching relation of each access page and constructing path nodes, and simultaneously recording path information of the path nodes includes:
Date Recue/Date Received 2021-12-29
Date Recue/Date Received 2021-12-29
[0069] sequentially searching for redirected pages of each access page in the path partition in an increasing order; drawing a path matching relation between the various access pages in the path partition based on a matching relation between each access page and the corresponding redirected page, expressing the access pages in the form of path nodes in a path relation, and recording a path matching relation of each path node through the path information, the path information further including pit click information of the redirected page; and serially connecting the head nodes and the path nodes to form a path according to the path matching relation.
[0070] During specific implementation, the access pages in the path partition are sequentially relationally matched with their redirected pages, a path matching relation between head nodes and path nodes in the path partition is obtained, and path information of each path node is recorded, which path information includes not only the relational matching between access page path nodes and redirected page path nodes, but also records pit click information when the access page is entered through the redirected page.
Access path fields of the user are designed using a dynamic array, starting with the first access page as the path, the user path is labeled with pit information of corresponding clicks on the redirected page for value transformation analysis of pits, so as to analyze website browsing habits of users more precisely and more thoroughly, and to enhance value analysis effect. As should be emphasized, path information of later path nodes subsumes path information of path nodes matched and associated with the former, in other words, from the path information of later path nodes can be restored the path of path nodes directly or indirectly related thereto.
Access path fields of the user are designed using a dynamic array, starting with the first access page as the path, the user path is labeled with pit information of corresponding clicks on the redirected page for value transformation analysis of pits, so as to analyze website browsing habits of users more precisely and more thoroughly, and to enhance value analysis effect. As should be emphasized, path information of later path nodes subsumes path information of path nodes matched and associated with the former, in other words, from the path information of later path nodes can be restored the path of path nodes directly or indirectly related thereto.
[0071] To facilitate comprehension, the aforementioned embodiment is exemplarily explained below.
[0072] Step 1 ¨ obtaining an access session, associating a cheating algorithm with a crawler algorithm to recognize noise access pages, performing preliminary cleaning and Date Recue/Date Received 2021-12-29 eliminating, and simultaneously performing secondary cleaning and eliminating on repetitive access pages;
[0073] Step 2 ¨ recognizing all paths in the access session ¨ explanation is made with one path for example, a homepage access page A numbering 1 is taken as the head node, path information of the head node is marked as void, and other access pages serve as path nodes.
[0074] A search access page B numbering 2 is compared with the page breakpoint dimension table, when comparison succeeds, this indicates that the search access page B
is a breakpoint page, and now its path information is recorded as void; when comparison fails, this indicates that the search access page B is a path node, it is required now to match as to whether its redirected page is the homepage access page A, if not, a path relation between the search access page B and the homepage access page A is recorded in the path information of the search access page B, and the pit click information of the homepage access page A is simultaneously recorded, namely to record as to which pit of the homepage access page A should be clicked in order to skip to the search access page B.
is a breakpoint page, and now its path information is recorded as void; when comparison fails, this indicates that the search access page B is a path node, it is required now to match as to whether its redirected page is the homepage access page A, if not, a path relation between the search access page B and the homepage access page A is recorded in the path information of the search access page B, and the pit click information of the homepage access page A is simultaneously recorded, namely to record as to which pit of the homepage access page A should be clicked in order to skip to the search access page B.
[0075] An Apple 5S quaternary access page C numbering 3 is compared with the page breakpoint dimension table, when comparison succeeds, this indicates that the search access page C
is a breakpoint page, and now its path information is recorded as void; when comparison fails, this indicates that the search access page C is a path node, it is required now to match as to whether its redirected page is the search access page B, if yes, the path information of the search access page C will be: path information of the search access page B + name and pit click information of the search access page B; if not, it is continued to judge whether the redirected page of the search access page C is the homepage access page A, if yes, the path information of the search access page C will be: path information of the homepage access page A + name and pit click information of the homepage access page A; if not, the path information of the search access page C will be void.
Date Recue/Date Received 2021-12-29
is a breakpoint page, and now its path information is recorded as void; when comparison fails, this indicates that the search access page C is a path node, it is required now to match as to whether its redirected page is the search access page B, if yes, the path information of the search access page C will be: path information of the search access page B + name and pit click information of the search access page B; if not, it is continued to judge whether the redirected page of the search access page C is the homepage access page A, if yes, the path information of the search access page C will be: path information of the homepage access page A + name and pit click information of the homepage access page A; if not, the path information of the search access page C will be void.
Date Recue/Date Received 2021-12-29
[0076] An Apple 11 quaternary access page D numbering 4 is compared with the page breakpoint dimension table, when comparison succeeds, this indicates that the quaternary access page D is a breakpoint page, and now its path information is recorded as void;
when comparison fails, this indicates that the quaternary access page D is a path node, it is required now to sequentially match its path matching relations with the search access page C, the search access page B, and the homepage access page A, whose specific matching process can be inferred from the aforementioned logic, and the path information of the quaternary access page D is finally obtained.
when comparison fails, this indicates that the quaternary access page D is a path node, it is required now to sequentially match its path matching relations with the search access page C, the search access page B, and the homepage access page A, whose specific matching process can be inferred from the aforementioned logic, and the path information of the quaternary access page D is finally obtained.
[0077] Taking for example, the following operations are included as seen from an access behavior record of a user: the user opening the homepage of the website ¨
searching for page (mobile phones) ¨Apple 5S quaternary page ¨Apple 11 quaternary page ¨
searching for page (mobile phones) ¨Huawei mate30 quaternary page ¨ submitting order ¨
payment page. Access session data collected is as follows:
Date Recue/Date Received 2021-12-29
searching for page (mobile phones) ¨Apple 5S quaternary page ¨Apple 11 quaternary page ¨
searching for page (mobile phones) ¨Huawei mate30 quaternary page ¨ submitting order ¨
payment page. Access session data collected is as follows:
Date Recue/Date Received 2021-12-29
[0078]
Collection pv_id Access Application Access Page Redirected Click Pit No.
Time Session Name Page Name 2020-09-27 cal va App. T homepage 1 16:22:20 2020-09-27 ca2 va App. T search page homepage dl 2 16:22:21 (mobile phones) 2020-09-27 ca3 va App. T Apple 5S search page c12 16:22:22 quaternary page (mobile phones) 2020-09-27 ca4 va App. T Apple 11 Apple 5S c13 4 16:22:23 quaternary page quaternary page 2020-09-27 ca6 va App. T Huawei p20 search page c15 16:22:25 quaternary page (mobile phones) 2020-09-27 ca7 va App. T homepage Huawei p20 c16 6 16:22:26 quaternary page 2020-09-27 ca8 va App. T shopping cart homepage c17 7 16:22:27 page 2020-09-27 ca9 va App. T order Shopping cart c18 8 16:22:28 submission page page 2020-09-27 call) va App. T payment page order c19 16:22:29 submission page
Collection pv_id Access Application Access Page Redirected Click Pit No.
Time Session Name Page Name 2020-09-27 cal va App. T homepage 1 16:22:20 2020-09-27 ca2 va App. T search page homepage dl 2 16:22:21 (mobile phones) 2020-09-27 ca3 va App. T Apple 5S search page c12 16:22:22 quaternary page (mobile phones) 2020-09-27 ca4 va App. T Apple 11 Apple 5S c13 4 16:22:23 quaternary page quaternary page 2020-09-27 ca6 va App. T Huawei p20 search page c15 16:22:25 quaternary page (mobile phones) 2020-09-27 ca7 va App. T homepage Huawei p20 c16 6 16:22:26 quaternary page 2020-09-27 ca8 va App. T shopping cart homepage c17 7 16:22:27 page 2020-09-27 ca9 va App. T order Shopping cart c18 8 16:22:28 submission page page 2020-09-27 call) va App. T payment page order c19 16:22:29 submission page
[0079] As shown in Fig. 2, website browsing behaviors of the user are sequentially: opening the homepage of the website, searching for page (mobile phones), Apple 5S
quaternary page, Apple 11 quaternary page, searching for page (mobile phones), Huawei P20 quaternary page, website homepage, shopping cart page, order submission page, and payment succeeded page.
quaternary page, Apple 11 quaternary page, searching for page (mobile phones), Huawei P20 quaternary page, website homepage, shopping cart page, order submission page, and payment succeeded page.
[0080] The following path information data can be obtained by processing the above access session with the method according to the present embodiment, and a page access path tree of access session va can be drawn through the path information data.
Date Recue/Date Received 2021-12-29
Date Recue/Date Received 2021-12-29
[0081]
Collection pv_id Access Application Page Redirected Click No. Path Time Session Name Page Name Pit 2020-09-27 cal va App. T homepage 1 16:22:20 2020-09-27 ca2 va App. T search homepage ell 2 homepage, ell 16:22:21 page (mobile phones) 2020-09-27 ca3 va App. T Apple 5S search page e12 3 homepage, -- ell;
16:22:22 quaternary (mobile search page page phones) (mobile phones), el2 2020-09-27 ca4 va App. T Apple 11 Apple 5S e13 4 homepage, ell;
16:22:23 quaternary quaternary search page page page (mobile phones), e12; Apple 5S
quaternary page 2020-09-27 ca6 va App. T Huawei search page e15 5 homepage, c11;
16:22:25 p20 (mobile search page quaternary phones) (mobile phones), page el5 2020-09-27 ca7 va App. T homepage Huawei p20 e16 6 16:22:26 quaternary page 2020-09-27 ca8 va App. T shopping homepage e17 7 homepage, e17 16:22:27 cart page 2020-09-27 ca9 va App. T order shopping cart e18 8 .. homepage, e17;
16:22:28 submission page shopping cart page page, e18 2020-09-27 ca 1 0 va App. T payment order e 1 9 9 homepage, c17;
16:22:29 page submission shopping cart page page, e18; order submission page, el9
Collection pv_id Access Application Page Redirected Click No. Path Time Session Name Page Name Pit 2020-09-27 cal va App. T homepage 1 16:22:20 2020-09-27 ca2 va App. T search homepage ell 2 homepage, ell 16:22:21 page (mobile phones) 2020-09-27 ca3 va App. T Apple 5S search page e12 3 homepage, -- ell;
16:22:22 quaternary (mobile search page page phones) (mobile phones), el2 2020-09-27 ca4 va App. T Apple 11 Apple 5S e13 4 homepage, ell;
16:22:23 quaternary quaternary search page page page (mobile phones), e12; Apple 5S
quaternary page 2020-09-27 ca6 va App. T Huawei search page e15 5 homepage, c11;
16:22:25 p20 (mobile search page quaternary phones) (mobile phones), page el5 2020-09-27 ca7 va App. T homepage Huawei p20 e16 6 16:22:26 quaternary page 2020-09-27 ca8 va App. T shopping homepage e17 7 homepage, e17 16:22:27 cart page 2020-09-27 ca9 va App. T order shopping cart e18 8 .. homepage, e17;
16:22:28 submission page shopping cart page page, e18 2020-09-27 ca 1 0 va App. T payment order e 1 9 9 homepage, c17;
16:22:29 page submission shopping cart page page, e18; order submission page, el9
[0082] To sum it up, the present embodiment achieves the following advantageous effects.
[0083] The solution according to this embodiment is advantageous in quick computation, in Date Recue/Date Received 2021-12-29 economical computing capabilities, and in its applicability to multiple ends.
[0084] The solution according to this embodiment makes it possible to realize transformation analysis of paths self-defined by the user and to monitor flow loss and transformation of key nodes as long as the page types required by the user to analyze are well configured.
[0085] The solution according to this embodiment makes it possible to analyze website page access paths and such paths as fishbone diagrams and flow funnel diagrams of page pits, and to find through path analysis whether the user browses the website according to navigation paths designed for products, whereby there will be direction and improvement for readjustment of the products.
[0086] The solution according to this embodiment makes it possible to more precisely realize value calculation of commodities or activities of pits on website pages, whereby in-site advertisements and sales by operations can be guided.
[0087] Embodiment 2
[0088] This embodiment provides a system for constructing a page access path, and the system comprises:
[0089] an obtaining unit, for obtaining an access session of a user, the access session including a plurality of different access pages;
[0090] a cleaning unit, for page-cleaning and serially numbering according to collection time the access pages in the access session;
[0091] a recognizing unit, for sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and recording path information of each head node;
[0092] a judging unit, for partitioning, based on a numbering interval of adjacent ingress access pages, the access pages within the interval into a corresponding path partition if there are Date Recue/Date Received 2021-12-29 plural paths; alternatively partitioning the entire access pages as one path partition if there is one path;
[0093] a path matching unit, for matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order, obtaining a matching relation of each access page and constructing path nodes, and simultaneously recording path information of the path nodes; and
[0094] a path tree constructing unit, for constructing a page access path tree based on the head node and the path information of the path nodes.
[0095] In comparison with prior-art technology, the advantageous effects achieved by the system for constructing a page access path provided by this embodiment of the present invention are identical with the advantageous effects achieved by the method of constructing a page access path provided by the aforementioned Embodiment 1, while no repetition is made in this context.
[0096] Embodiment 3
[0097] This embodiment provides a computer-readable storage medium storing thereon a computer program that executes the steps of the aforementioned method of constructing a page access path when it is run by a processor.
[0098] In comparison with prior-art technology, the advantageous effects achieved by the computer-readable storage medium provided by this embodiment are identical with the advantageous effects achieved by the method of constructing a page access path provided by the aforementioned technical solution, while no repetition is made in this context.
[0099] As comprehensible to persons ordinarily skilled in the art, the entire or partial steps in the method realizing the present invention can be completed via a program that instructs relevant hardware, the program can be stored in a computer-readable storage medium and Date Recue/Date Received 2021-12-29 subsume the various steps in the aforementioned method embodiment when executed, and the storage medium can be an ROM/RAM, a magnetic disk, an optical disk, a memory card, etc.
[0100] What is described above is merely directed to specific modes of execution of the present invention, but the protection scope of the present invention is not restricted thereby, as any modification and replacement easily conceivable to persons skilled in the art within the technical range disclosed by the present invention should be covered by the protection scope of the present invention. Accordingly, the protection scope of the present invention shall be based on the protection scope claimed in the Claims.
Date Recue/Date Received 2021-12-29
Date Recue/Date Received 2021-12-29
Claims (10)
1. A method of constructing a page access path, characterized in comprising:
obtaining an access session of a user, the access session including a plurality of different access pages;
page-cleaning and serially numbering according to collection time the access pages in the access session;
sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and recording path information of each head node;
partitioning, based on a numbering interval of adjacent ingress access pages, the access pages within the interval into a corresponding path partition if there are plural paths; alternatively partitioning the entire access pages as one path partition if there is one path;
matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order, obtaining a matching relation of each access page and constructing path nodes, and simultaneously recording path information of the path nodes;
and constructing a page access path tree based on the head node and the path information of the path nodes.
obtaining an access session of a user, the access session including a plurality of different access pages;
page-cleaning and serially numbering according to collection time the access pages in the access session;
sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and recording path information of each head node;
partitioning, based on a numbering interval of adjacent ingress access pages, the access pages within the interval into a corresponding path partition if there are plural paths; alternatively partitioning the entire access pages as one path partition if there is one path;
matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order, obtaining a matching relation of each access page and constructing path nodes, and simultaneously recording path information of the path nodes;
and constructing a page access path tree based on the head node and the path information of the path nodes.
2. The method according to Claim 1, characterized in that the step of obtaining an access session of a user, the access session including a plurality of different access pages includes:
obtaining a plurality of access pages browsed by the user through a terminal within a preset time period when accessing a website, and summarizing the plurality of access pages chronologically to constitute the access session.
obtaining a plurality of access pages browsed by the user through a terminal within a preset time period when accessing a website, and summarizing the plurality of access pages chronologically to constitute the access session.
3. The method according to Claim 2, characterized in that the step of page-cleaning and Date Recue/Date Received 2021-12-29 serially numbering according to collection time the access pages in the access session includes:
recognizing any noise access page engendered by crawlers and/or cheats from the access pages, and preliminarily cleaning and eliminating the noise access page; and serially numbering according to collection time the remaining access pages in the same access session.
recognizing any noise access page engendered by crawlers and/or cheats from the access pages, and preliminarily cleaning and eliminating the noise access page; and serially numbering according to collection time the remaining access pages in the same access session.
4. The method according to Claim 3, characterized in further comprising, after the step of preliminarily cleaning and eliminating the noise access page:
if it is compared in the same access session that two consecutive access pages are identical access pages, then secondarily cleaning and eliminating the later access page.
if it is compared in the same access session that two consecutive access pages are identical access pages, then secondarily cleaning and eliminating the later access page.
5. The method according to anyone of Claims 1 to 4, characterized in further comprising, prior to the step of sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and recording path information of each head node:
constructing a page breakpoint dimension table, the page breakpoint dimension table including at least one access page breakpoint page.
constructing a page breakpoint dimension table, the page breakpoint dimension table including at least one access page breakpoint page.
6. The method according to Claim 5, characterized in that the step of sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and recording path information of each head node includes:
comparing the access pages in the access session sequentially with the page breakpoint dimension table on a one-by-one basis, and defining any matched access page as the ingress access page of a new path; and taking each ingress access page as a head node of the corresponding path, and recording path information of each head node as void; wherein the number of paths is the number of the ingress access pages.
Date Recue/Date Received 2021-12-29
comparing the access pages in the access session sequentially with the page breakpoint dimension table on a one-by-one basis, and defining any matched access page as the ingress access page of a new path; and taking each ingress access page as a head node of the corresponding path, and recording path information of each head node as void; wherein the number of paths is the number of the ingress access pages.
Date Recue/Date Received 2021-12-29
7. The method according to Claim 6, characterized in that the step of matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order, obtaining a matching relation of each access page and constructing path nodes, and simultaneously recording path information of the path nodes includes:
sequentially searching for redirected pages of each access page in the path partition in an increasing order;
drawing a path matching relation between the various access pages in the path partition based on a matching relation between each access page and the corresponding redirected page, expressing the access pages in the form of path nodes in a path relation, and recording a path matching relation of each path node through the path information, the path information further including pit click information of the redirected page; and serially connecting the head nodes and the path nodes to form a path according to the path matching relation.
sequentially searching for redirected pages of each access page in the path partition in an increasing order;
drawing a path matching relation between the various access pages in the path partition based on a matching relation between each access page and the corresponding redirected page, expressing the access pages in the form of path nodes in a path relation, and recording a path matching relation of each path node through the path information, the path information further including pit click information of the redirected page; and serially connecting the head nodes and the path nodes to form a path according to the path matching relation.
8. The method according to Claim 7, characterized in that the step of constructing a page access path tree includes:
summarizing each path in the access session, and constructing the page access path tree.
summarizing each path in the access session, and constructing the page access path tree.
9. A system for constructing a page access path, characterized in comprising:
an obtaining unit, for obtaining an access session of a user, the access session including a plurality of different access pages;
a cleaning unit, for page-cleaning and serially numbering according to collection time the access pages in the access session;
a recognizing unit, for sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and recording path information of each head node;
a judging unit, for partitioning, based on a numbering interval of adjacent ingress access pages, the access pages within the interval into a corresponding path partition if there are plural paths; alternatively partitioning the entire access pages as one path partition if there is Date Recue/Date Received 2021-12-29 one path;
a path matching unit, for matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order, obtaining a matching relation of each access page and constructing path nodes, and simultaneously recording path information of the path nodes; and a path tree constructing unit, for constructing a page access path tree based on the head node and the path information of the path nodes.
an obtaining unit, for obtaining an access session of a user, the access session including a plurality of different access pages;
a cleaning unit, for page-cleaning and serially numbering according to collection time the access pages in the access session;
a recognizing unit, for sequentially recognizing ingress access pages of each path from the plurality of access pages, taking each ingress access page as a head node of the corresponding path, and recording path information of each head node;
a judging unit, for partitioning, based on a numbering interval of adjacent ingress access pages, the access pages within the interval into a corresponding path partition if there are plural paths; alternatively partitioning the entire access pages as one path partition if there is Date Recue/Date Received 2021-12-29 one path;
a path matching unit, for matching, for redirecting pages, one by one the access pages pertaining to each path partition sequentially in an increasing order, obtaining a matching relation of each access page and constructing path nodes, and simultaneously recording path information of the path nodes; and a path tree constructing unit, for constructing a page access path tree based on the head node and the path information of the path nodes.
10. A computer-readable storage medium, storing thereon a computer program, characterized in that the computer program executes the steps of the method according to anyone of Claims 1 to 8 when it is run by a processor.
Date Recue/Date Received 2021-12-29
Date Recue/Date Received 2021-12-29
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011610978.1A CN112632446A (en) | 2020-12-30 | 2020-12-30 | Page access path construction method and system |
| CN202011610978.1 | 2020-12-30 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA3144126A1 true CA3144126A1 (en) | 2022-06-30 |
Family
ID=75286696
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA3144126A Pending CA3144126A1 (en) | 2020-12-30 | 2021-12-29 | Method of and system for constructing page access path |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112632446A (en) |
| CA (1) | CA3144126A1 (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113127742B (en) * | 2021-04-30 | 2023-10-20 | 康键信息技术（深圳）有限公司 | User behavior path extraction method, device, equipment and storage medium |
| CN113242159B (en) * | 2021-05-24 | 2022-12-09 | 中国工商银行股份有限公司 | Application access relation determining method and device |
| CN113791837B (en) * | 2021-08-12 | 2023-08-11 | 百度在线网络技术（北京）有限公司 | Page processing method, device, equipment and storage medium |
| CN113934616B (en) * | 2021-12-16 | 2022-03-18 | 深圳市活力天汇科技股份有限公司 | Method for judging abnormal user based on user operation time sequence |
| CN114374595B (en) * | 2022-01-13 | 2024-03-15 | 平安普惠企业管理有限公司 | Event node attribution analysis method, device, electronic equipment and storage medium |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106897196B (en) * | 2015-12-17 | 2019-10-25 | 北京国双科技有限公司 | The determination method and device of access path between Website page |
| CN107644100B (en) * | 2017-10-09 | 2021-02-26 | 北京京东尚科信息技术有限公司 | Information processing method, device and system and computer readable storage medium |
| CN107943679B (en) * | 2017-11-24 | 2021-02-26 | 阿里巴巴（中国）有限公司 | Path funnel generation method and device and server |
| CN108874909A (en) * | 2018-05-28 | 2018-11-23 | 深圳壹账通智能科技有限公司 | User access path acquisition methods, server and computer storage medium |
| CN109284450B (en) * | 2018-08-22 | 2023-06-20 | 中国平安人寿保险股份有限公司 | Method and device for determining order forming paths, storage medium and electronic equipment |
| CN111552905A (en) * | 2020-04-22 | 2020-08-18 | 苏宁云计算有限公司 | Method and system for acquiring user access critical path |
| CN111737630B (en) * | 2020-08-25 | 2021-06-25 | 智者四海（北京）技术有限公司 | Method for recording user access path |
-
2020
- 2020-12-30 CN CN202011610978.1A patent/CN112632446A/en active Pending
-
2021
- 2021-12-29 CA CA3144126A patent/CA3144126A1/en active Pending
Also Published As
| Publication number | Publication date |
|---|---|
| CN112632446A (en) | 2021-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA3144126A1 (en) | Method of and system for constructing page access path | |
| Alspaugh et al. | Analyzing log analysis: An empirical study of user log mining | |
| Johnson et al. | Time between vulnerability disclosures: A measure of software product vulnerability | |
| US20080148242A1 (en) | Optimizing an interaction model for an application | |
| US20170308917A1 (en) | Process and system to categorize, evaluate and optimize a customer experience | |
| US20130086038A1 (en) | Provision of index recommendations for database access | |
| US20160162599A1 (en) | Query optimization with zone map selectivity modeling | |
| US11514498B2 (en) | System and method for intelligent guided shopping | |
| Meschenmoser et al. | Scraping scientific web repositories: challenges and solutions for automated content extraction | |
| US12019739B2 (en) | User behavior risk analytic system with multiple time intervals and shared data extraction | |
| CN103631828A (en) | Method and device for determining access path and method and system for determining page churn rate | |
| US20200320153A1 (en) | Method for accessing data records of a master data management system | |
| CN110675194A (en) | Funnel analysis method, device, equipment and readable medium | |
| US20160034505A1 (en) | Systems and methods for large-scale link analysis | |
| CN112231598B (en) | Webpage path navigation method and device, electronic equipment and storage medium | |
| US11836331B2 (en) | Mathematical models of graphical user interfaces | |
| US10540360B2 (en) | Identifying relationship instances between entities | |
| WO2023165271A1 (en) | Knowledge graph construction and graph calculation | |
| Wang et al. | Root cause analysis for microservice systems via hierarchical reinforcement learning from human feedback | |
| CN112287339A (en) | APT intrusion detection method and device and computer equipment | |
| Jan et al. | A statistical machine learning approach for ticket mining in IT service delivery | |
| CN110959153A (en) | Application analysis using flexible post-processing | |
| CN117118857A (en) | Knowledge graph-based network security threat management system and method | |
| Tendick et al. | Statistical methods for complex event processing and real time decision making | |
| Samiullah et al. | Mining frequent correlated graphs with a new measure |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request |
Effective date: 20220916 |
|
| EEER | Examination request |
Effective date: 20220916 |
|
| EEER | Examination request |
Effective date: 20220916 |
|
| EEER | Examination request |
Effective date: 20220916 |
|
| EEER | Examination request |
Effective date: 20220916 |
|
| EEER | Examination request |
Effective date: 20220916 |