Method, device and storage medium for mining relations between objects
By generating perspective flowcharts and directed acyclic diagrams, and using genealogical search strategies for searching and reconstruction, the problem of inability to accurately explore relationships between objects in traditional technology is solved, and the accurate analysis and display of relationships between objects is achieved.
Patent Information
- Application Number
- CN202311447740.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-11-01
- Publication Date
- 2024-11-19
- Estimated Expiration
- 2043-11-01
AI Technical Summary
Traditional object-oriented process mining technology cannot conduct targeted analysis of businesses in different fields, and cannot accurately mine the relationship between objects of a given node.
By detecting the data to be mined in OCEL format, a perspective flow chart and directed acyclic graph are generated, and directed acyclic graph is searched using the pedigree search strategy, the target directed acyclic graph is reconstructed, and the data flow graph is generated to display the objects. relation.
Accurate mining of relationships between objects is realized, and a visual data representation method is provided, allowing users to analyze the relationships of given nodes in a targeted manner according to their needs, improving the accuracy and flexibility of mining results.
Smart Images

Figure CN117390088B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of data processing, and in particular to a method, device and storage medium for mining relations between objects. Background Art
[0002] Compared with traditional process mining, OCPM (Object-Centric Process Mining) as a new process mining technology has demonstrated its unique advantages in many fields.
[0003] Traditional process mining algorithms are relatively mature. Heuristic Miner is a classic algorithm in process mining, which is used to extract process models from event logs. It uses heuristic rules to discover the structure and behavior in the process model and has the advantages of flexibility and scalability. However, OCPM targets businesses in different fields and cannot analyze the mining results required by users in a targeted manner. For example, it cannot mine the relationship between objects in a given node in a targeted manner. Summary of the invention
[0004] The main purpose of the present invention is to solve the technical problem that it is impossible to analyze more accurate mining results in a targeted manner for businesses in different fields.
[0005] A first aspect of the present invention provides a method for mining relationships between objects, the method comprising:
[0006] When the data to be mined in the OCEL format is detected, the node and edge generation operation is performed according to the data dependency relationship of each preset column in the data to be mined to obtain a perspective flow chart;
[0007] In the perspective flow chart, performing node and edge conversion operations to obtain a directed acyclic graph;
[0008] When it is detected that a given node in the directed acyclic graph is designated, taking the given node as a starting point, performing a search operation on the directed acyclic graph according to a pedigree search strategy to obtain a search result;
[0009] A reconstruction operation is performed according to the search results to obtain a target directed acyclic graph.
[0010] Optionally, in a first implementation of the first aspect of the present invention, when the data to be mined in OCEL format is detected, the step of performing node and edge generation operations according to the data dependency relationship of each preset column in the data to be mined to obtain the perspective flowchart includes:
[0011] When a data example graph in OCEL format is detected, a node and edge generation operation is performed according to the data dependency relationship of each preset column in the data example graph to obtain a perspective flow chart.
[0012] Optionally, in a second implementation of the first aspect of the present invention, when the data to be mined in OCEL format is detected, the step of performing node and edge generation operations according to the data dependency relationship of each preset column in the data to be mined to obtain the perspective flowchart includes:
[0013] When the log data in the OCEL format is detected, the node and edge generation operation is performed according to the data dependency relationship of each preset column in the log data to obtain a perspective flow chart.
[0014] Optionally, in a third implementation of the first aspect of the present invention, when it is detected that a given node in the directed acyclic graph is specified, taking the given node as a starting point, performing a search operation on the directed acyclic graph according to a pedigree search strategy, and obtaining the search result step includes:
[0015] When it is detected that a given node in the directed acyclic graph is designated, taking the given node as a starting point, performing an upward search according to a pedigree search strategy to obtain a root node;
[0016] A downward search is performed from the root node to obtain the search result.
[0017] Optionally, in a fourth implementation of the first aspect of the present invention, when detecting that a given node in the directed acyclic graph is specified, searching upward from the given node as a starting point to obtain all root nodes comprises:
[0018] When it is detected that a given node in the directed acyclic graph is designated, the given node is taken as a starting point, a pedigree search strategy is combined with a breadth-first search strategy, and an upward search is performed to obtain the root node.
[0019] Optionally, in a fifth implementation of the first aspect of the present invention, when it is detected that a given node in the directed acyclic graph is specified, taking the given node as a starting point, performing an upward search according to a pedigree search strategy to obtain a root node comprises:
[0020] When it is detected that a given node in the directed acyclic graph is designated, the given node is taken as a starting point, a lineage search strategy is combined with a depth-first search strategy, and an upward search is performed to obtain the root node.
[0021] Optionally, in a sixth implementation of the first aspect of the present invention, after the step of performing a reconstruction operation according to the search results to obtain a target directed acyclic graph, the method further includes:
[0022] A data flow graph is generated according to the data dependency relationship of the target directed acyclic graph and the data path of the directed acyclic graph.
[0023] Optionally, in a seventh implementation of the first aspect of the present invention, when it is detected that a given node in the directed acyclic graph is specified, taking the given node as a starting point, performing a search operation on the directed acyclic graph according to a pedigree search strategy, and obtaining the search result step includes:
[0024] When it is detected that a given node in the directed acyclic graph is designated, taking the given node as a starting point, performing a search operation on the directed acyclic graph according to a pedigree search strategy, obtaining search results and recording the overall time complexity;
[0025] According to the comparison result of the overall time complexity and the preset time complexity standard, a prompt message is output.
[0026] The second aspect of the present invention provides a device for mining inter-object relationships, comprising: a memory and at least one processor, wherein instructions are stored in the memory, and the memory and the at least one processor are interconnected via lines; the at least one processor calls the instructions in the memory so that the device for mining inter-object relationships executes the above-mentioned method for mining inter-object relationships.
[0027] A third aspect of the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores instructions, which, when executed on a computer, enable the computer to execute the above-mentioned method for mining relations between objects.
[0028] In an embodiment of the present invention, when the data to be mined in OCEL format is detected, the node and edge generation operation is performed according to the data dependency relationship of each preset column in the data to be mined to obtain a perspective flowchart; in the perspective flowchart, the node and edge conversion operation is performed to obtain a directed acyclic graph; when it is detected that a given node in the directed acyclic graph is specified, the given node is used as the starting point, and the directed acyclic graph is searched according to the pedigree search strategy to obtain the search result; the reconstruction operation is performed according to the search result to obtain the target directed acyclic graph. The object relationship mining device converts the data to be mined into a perspective flowchart and a directed acyclic graph, and can represent complex data dependencies in a graphical manner. The perspective flowchart and the directed acyclic graph are both visual data representation methods, which can intuitively display the dependencies and processes in the data to be mined. The user can perform a pedigree search in the directed acyclic graph with the specified given node as the starting point to accurately find the search results related to the given node. The target directed acyclic graph can be obtained by performing a reconstruction operation based on the search results. It allows users to mine the object relationships of given nodes in a targeted manner according to their own needs. BRIEF DESCRIPTION OF THE DRAWINGS
[0029] Figure 1 It is a schematic diagram of a first embodiment of a method for mining relations between objects in an embodiment of the present invention;
[0030] Figure 2 It is a first reference diagram of a first embodiment of a method for mining relations between objects in an embodiment of the present invention;
[0031] Figure 3 It is a second reference diagram of the first embodiment of the method for mining relations between objects in an embodiment of the present invention;
[0032] Figure 4 It is the third reference diagram of the first embodiment of the method for mining the relationship between objects in the embodiment of the present invention;
[0033] Figure 5 Schematic diagram of a second embodiment of the method for mining relations between objects in an embodiment of the present invention;
[0034] Figure 6 The figure is a schematic diagram of an embodiment of a device for mining relations between objects in an embodiment of the present invention. DETAILED DESCRIPTION
[0035] The embodiments of the present invention provide a method, a device and a storage medium for mining relations between objects.
[0036] The embodiments disclosed in the present invention will be described in more detail below with reference to the accompanying drawings. Although certain embodiments disclosed in the present invention are shown in the accompanying drawings, it should be understood that the present invention can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present invention. It should be understood that the drawings and embodiments disclosed in the present invention are only for exemplary purposes and are not intended to limit the scope of protection disclosed in the present invention.
[0037] In the description of the embodiments disclosed in the present invention, the term "including" and similar terms should be understood as open inclusion, that is, "including but not limited to". The term "based on" should be understood as "based at least in part on". The term "one embodiment" or "the embodiment" should be understood as "at least one embodiment". The terms "first", "second", etc. may refer to different or the same objects. Other explicit and implicit definitions may also be included below.
[0038] For ease of understanding, the specific process of the embodiment of the present invention is described below. Figure 1 , an embodiment of the method for mining the relationship between objects in the embodiment of the present invention includes:
[0039] 101. When the data to be mined in the OCEL format is detected, a node and edge generation operation is performed according to the data dependency relationship of each preset column in the data to be mined to obtain a perspective flow chart;
[0040] The OCEL format is based on the CSV file format and contains three types of columns:
[0041] 1. Event attributes: Event Id (event unique identifier), Activity Name (activity name), Event Time (event time), the corresponding table headers are "ocel:event_id", "ocel:activity_name", "ocel:event_time" three columns;
[0042] 2. Associated object properties: Each column represents an object type (OT, Object Type), and the corresponding table header is "ocel:object:" concatenated with the object type name;
[0043] 3. Other attributes: Each column represents an other attribute type (Attribute Type), and its header is the attribute name.
[0044] This embodiment clearly proposes a method for using OCEL format data to find the relationship between objects, thereby restoring the process business required by the user. Through this method, the user can mine different processes by selecting different variants to meet the different needs of the process business concerned by different users.
[0045] Users can input the data to be mined in OCEL format, such as data input. For examples, refer to Figure 2 Specifically, for constructing a perspective flowchart, events are grouped left and right according to the object type. Events of different object types are connected left and right without direction. Events of the same instance of the same object type are sorted from top to bottom and from early to late according to event_time. Events in the same case are connected from top to bottom. A perspective flowchart is obtained.
[0046] Optionally, when a data example graph in OCEL format is detected, a node and edge generation operation is performed according to data dependencies of various preset columns in the data example graph to obtain a perspective flowchart.
[0047] Optionally, when log data in OCEL format is detected, node and edge generation operations are performed according to data dependencies of various preset columns in the log data to obtain a perspective flowchart.
[0048] Based on the data to be mined, the associated object attributes can be obtained from the preset columns in the data to be mined. Then, the event unique identification column, activity name column, event column, associated core object column, associated object column, and other attribute columns (which can be ignored) are defined from the object attributes to determine the core object type in the data to be mined, as well as the data dependency relationship of each object type.
[0049] Specifically, for constructing a perspective flowchart, events are grouped left and right according to object types. Events of different object types are connected left and right without direction. Events of the same instance of the same object type are sorted from top to bottom and from early to late according to event_time. Events in the same case are connected from top to bottom. A perspective flowchart is obtained.
[0050] 102. In the perspective flow chart, perform a conversion operation of nodes and edges to obtain a directed acyclic graph;
[0051] Specifically, initialize an empty directed acyclic graph. Traverse all execution nodes in the perspective flowchart, where, for each execution node, create a corresponding directed acyclic graph node and add it to the directed acyclic graph. Traverse all edges in the perspective flowchart, where, for each edge, obtain the identifiers of the start node and the end node. Find the corresponding start node and end node in the directed acyclic graph, and create a directed edge from the start node to the end node. Return the generated directed acyclic graph as the final result. Use an adjacency list to store the entire graph with a space complexity of O(n+e), where n represents the number of points and e represents the number of edges.
[0052] 103. When it is detected that a given node in the directed acyclic graph is designated, a search operation is performed on the directed acyclic graph according to a pedigree search strategy with the given node as a starting point to obtain a search result;
[0053] Specifically, build all case sets and variant sets.
[0054] Case: A sequence of events connected from the beginning to the end in an object type corresponds to a case, which is equivalent to an object instance representing a case.
[0055] Variant: For each object type, cases (objects) with the same activity sequence together constitute a variant. In other words, a variant is a collection of cases. At the same time, users can also obtain different flowcharts through this method by selecting different variants.
[0056] The user can select the relevant variant to determine the given node. Starting from the given node, the directed acyclic graph is searched through the pedigree search strategy to obtain the search result, i.e., the search result.
[0057] Optionally, when it is detected that a given node in the directed acyclic graph is specified, a search operation is performed on the directed acyclic graph based on a lineage search strategy with the given node as the starting point to obtain search results. Among them, the lineage search strategy is a method for searching and tracking data lineage relationships. In data management and data governance, lineage relationship refers to the relationship between data elements, including the source of the data, the conversion process, and the way it is used. The goal of the lineage search strategy is to help users understand the source, flow, and usage of the data by analyzing the lineage relationship of the data, so as to support data quality management, compliance, and risk assessment.
[0058] Optionally, when it is detected that a given node in the directed acyclic graph is designated, the given node is used as a starting point, and the pedigree search strategy is combined with the breadth-first search strategy to perform an upward search to obtain the root node. Among them, the breadth-first search strategy (BFS) is a graph search algorithm used to traverse nodes layer by layer in a graph or tree data structure in a breadth direction. It starts from the starting node, first visits all its directly adjacent nodes, and then visits the adjacent nodes of these adjacent nodes in turn, and so on, until all reachable nodes are traversed.
[0059] Optionally, when it is detected that a given node in the directed acyclic graph is designated, the given node is used as a starting point, and the pedigree search strategy is combined with the depth-first search strategy to perform an upward search to obtain the root node. The depth-first search strategy (DFS) is a graph search algorithm used to traverse nodes step by step in the depth direction in a graph or tree data structure. It starts from the starting node, first visits an adjacent node, and then recursively visits the adjacent nodes of the node until it reaches the deepest point, then traces back to the previous layer of nodes and continues to visit other unvisited adjacent nodes.
[0060] Specifically, based on the object type, remove the unselected nodes and the edges connected to them in the directed acyclic graph; construct a bilateral tree to facilitate the search and traversal from top to bottom and from bottom to top. Starting from a given node, use BFS or DFS to find all root nodes (direct ancestor nodes); start from the root node and search downward (all descendant objects of the ancestor object), and only keep the branches containing the core object node and the given node to obtain the search results.
[0061] 104. Perform a reconstruction operation according to the search results to obtain a target directed acyclic graph.
[0062] Specifically, the DAG, i.e., the target directed acyclic graph, is reconstructed through the search results. The corresponding DFG (data flow graph) can be obtained based on the target directed acyclic graph.
[0063] Example: Reference Figure 3 , select s2 as the given node to search, with Payment as the core object type (p1 is the core object).
[0064] 1. Remove s1, s3 and the edges connecting these two nodes.
[0065] 2. Search upward to find the root nodes o1 and o2.
[0066] 3. Search downward from o1 and o2, retain p1 (core node branch) and s2 (given node branch), and get the search results.
[0067] Based on p1 and s2, we can get a DAG (target directed acyclic graph) with s2 as a given node and Payment as the core object type (p1 as the core object) for lineage search and reconstruction. Figure 4 .
[0068] Optionally, a data flow graph is generated according to the data dependency of the target directed acyclic graph and the data path of the directed acyclic graph. Specifically, an empty data flow graph is initialized. All nodes in the target directed acyclic graph are traversed, wherein for each node, a corresponding data flow graph node is created and added to the data flow graph. All edges in the target directed acyclic graph are traversed, wherein for each edge, the identifiers of the start node and the end node are obtained. The corresponding start node and the end node are found in the data flow graph, and a data flow edge pointing from the start node to the end node is created. The data dependency is analyzed, wherein for each data flow graph node, the data transfer relationship between its input edge and output edge is checked. According to the data transfer relationship, the data dependency relationship between the nodes is determined. Data flow analysis techniques such as active variable analysis, data flow equations, etc. can be used. For each data flow graph node, the data transfer path of its input edge and output edge is considered. According to the data transfer path, the data path relationship between the nodes is determined. Data flow analysis techniques such as data flow graph analysis, path analysis, etc. can be used. Finally, the generated data flow graph is returned as the final result.
[0069] In an embodiment of the present invention, when the data to be mined in OCEL format is detected, the node and edge generation operation is performed according to the data dependency relationship of each preset column in the data to be mined to obtain a perspective flowchart; in the perspective flowchart, the node and edge conversion operation is performed to obtain a directed acyclic graph; when it is detected that a given node in the directed acyclic graph is specified, the given node is used as the starting point, and the directed acyclic graph is searched according to the pedigree search strategy to obtain the search result; the reconstruction operation is performed according to the search result to obtain the target directed acyclic graph. The object relationship mining device converts the data to be mined into a perspective flowchart and a directed acyclic graph, and can represent complex data dependencies in a graphical manner. The perspective flowchart and the directed acyclic graph are both visual data representation methods, which can intuitively display the dependencies and processes in the data to be mined. The user can perform a pedigree search in the directed acyclic graph with the specified given node as the starting point to accurately find the search results related to the given node. The target directed acyclic graph can be obtained by performing a reconstruction operation based on the search results. It allows users to mine the object relationships of given nodes in a targeted manner according to their own needs.
[0070] See also Figure 5 , Figure 5 This is a second embodiment of the method for mining the relationship between objects in the embodiment of the present invention. In step 103, the following steps may be performed:
[0071] 1031. When it is detected that a given node in the directed acyclic graph is designated, a search operation is performed on the directed acyclic graph based on the given node as a starting point according to a pedigree search strategy, a search result is obtained, and the overall time complexity is recorded;
[0072] 1032. Output prompt information according to the comparison result between the overall time complexity and the preset time complexity standard.
[0073] Specifically, when searching for a result, the Hash table is used to record the data and filter the nodes that have been passed. The overall time complexity is O(n), where n represents the number of points. Based on the overall time complexity, the warning operation is performed by outputting prompt information.
[0074] In this embodiment, the hash table is used to record the visited nodes, so that the same node can be avoided from being visited repeatedly during the search process, thereby improving the search efficiency. At the same time, the warning operation is performed by outputting prompt information, so that the user can take corresponding measures in time.
[0075] Figure 61 is a schematic diagram of the structure of an inter-object relationship mining device provided by an embodiment of the present invention. The inter-object relationship mining device 500 may have relatively large differences due to different configurations or performances, and may include one or more processors (central processing units, CPU) 510 (for example, one or more processors) and a memory 520, and one or more storage media 530 (for example, one or more mass storage devices) storing application programs 533 or data 532. Among them, the memory 520 and the storage medium 530 can be short-term storage or permanent storage. The program stored in the storage medium 530 may include one or more modules (not shown in the figure), and each module may include a series of instruction operations in the inter-object relationship mining device 500. Furthermore, the processor 510 may be configured to communicate with the storage medium 530 to execute a series of instruction operations in the storage medium 530 on the inter-object relationship mining device 500.
[0076] The object-relationship-based mining device 500 may also include one or more power supplies 540, one or more wired or wireless network interfaces 550, one or more input and output interfaces 560, and / or one or more operating systems 531, such as Windows Serve, Mac OS X, Unix, Linux, Free BSD, etc. Those skilled in the art will appreciate that Figure 6 The illustrated structure of the mining equipment based on the relationship between objects does not constitute a limitation on the mining equipment based on the relationship between objects, and may include more or less components than those illustrated, or may combine certain components, or may have different arrangements of components.
[0077] The present invention also provides a computer-readable storage medium, which may be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium. Instructions are stored in the computer-readable storage medium. When the instructions are executed on a computer, the computer executes the steps of the method for mining the relationship between objects.
[0078] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0079] In addition, although each operation is described in a specific order, this should be understood as requiring such operation to be performed in the specific order shown or in a sequential order, or requiring that all illustrated operations should be performed to obtain desired results. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details are included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single implementation in combination. On the contrary, the various features described in the context of a single implementation can also be implemented in multiple implementations individually or in any suitable sub-combination mode.
[0080] Although the subject matter has been described in language specific to structural features and / or methodological logical actions, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. On the contrary, the specific features and actions described above are merely example forms of implementing the claims.
Claims
1. A method for mining relations between objects, characterized in that: The method for mining the relationship between objects includes: When the data to be mined in the OCEL format is detected, the node and edge generation operation is performed according to the data dependency relationship of each preset column in the data to be mined to obtain a perspective flow chart; In the perspective flow chart, performing node and edge conversion operations to obtain a directed acyclic graph; When it is detected that a given node in the directed acyclic graph is designated, taking the given node as a starting point, performing a search operation on the directed acyclic graph according to a pedigree search strategy to obtain a search result; Performing a reconstruction operation according to the search results to obtain a target directed acyclic graph; When the data to be mined in OCEL format is detected, the step of performing node and edge generation operations according to the data dependency relationship of each preset column in the data to be mined to obtain the perspective flowchart includes: When a data example graph in OCEL format is detected, a node and edge generation operation is performed according to the data dependency relationship of each preset column in the data example graph to obtain a perspective flow chart; When the data to be mined in OCEL format is detected, the step of performing node and edge generation operations according to the data dependency relationship of each preset column in the data to be mined to obtain the perspective flowchart includes: When the log data in the OCEL format is detected, the node and edge generation operation is performed according to the data dependency relationship of each preset column in the log data to obtain a perspective flow chart; Wherein, when it is detected that a given node in the directed acyclic graph is designated, taking the given node as a starting point, performing a search operation on the directed acyclic graph according to a pedigree search strategy, and obtaining the search result comprises: When it is detected that a given node in the directed acyclic graph is designated, taking the given node as a starting point, performing an upward search according to a pedigree search strategy to obtain a root node; Perform downward search from the root node to obtain the search result; Wherein, when it is detected that a given node in the directed acyclic graph is designated, taking the given node as a starting point, performing a search operation on the directed acyclic graph according to a pedigree search strategy, and obtaining the search result comprises: When it is detected that a given node in the directed acyclic graph is designated, taking the given node as a starting point, performing a search operation on the directed acyclic graph according to a pedigree search strategy, obtaining search results and recording the overall time complexity; Outputting prompt information according to the comparison result of the overall time complexity and the preset time complexity standard; Wherein, after the step of performing a reconstruction operation according to the search results to obtain a target directed acyclic graph, the method further includes: A data flow graph node is generated according to the data dependency relationship of the target directed acyclic graph and the data path of the directed acyclic graph, and a data flow graph is generated according to the data flow graph node and a preset empty data flow graph.
2. The method for mining inter-object relationships according to claim 1, characterized in that: When it is detected that a given node in the directed acyclic graph is designated, the step of searching upward from the given node as a starting point to obtain all root nodes comprises: When it is detected that a given node in the directed acyclic graph is designated, the given node is taken as a starting point, a pedigree search strategy is combined with a breadth-first search strategy, and an upward search is performed to obtain the root node.
3. The method for mining inter-object relationships according to claim 1, characterized in that: When it is detected that a given node in the directed acyclic graph is designated, taking the given node as a starting point, performing an upward search according to a pedigree search strategy to obtain a root node comprises: When it is detected that a given node in the directed acyclic graph is designated, the given node is taken as a starting point, a lineage search strategy is combined with a depth-first search strategy, and an upward search is performed to obtain the root node.
4. A device for mining relations between objects, characterized in that: The object-to-object relationship mining device comprises: a memory and at least one processor, the memory stores instructions, and the memory and the at least one processor are interconnected via a line; The at least one processor calls the instructions in the memory to enable the device for mining inter-object relations to perform the method for mining inter-object relations according to any one of claims 1 to 3.
5. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method for mining inter-object relationships according to any one of claims 1 to 3 is implemented.
