Method for constructing matter association graph, matter query method, device and equipment
By constructing an event association graph using the Locality Sensitive Hash (LSH) algorithm and the Floyd algorithm, the inefficiency and poor adaptability caused by relying on human experience in existing technologies are solved, and efficient and accurate event association mining and logical pattern mining are achieved.
CN114510562BActive Publication Date: 2026-06-09CHINA CONSTRUCTION BANK +1
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- CHINA CONSTRUCTION BANK
- Filing Date
- 2022-02-17
- Publication Date
- 2026-06-09
AI Technical Summary
Technical Problem
Existing technologies for identifying correlations rely on human experience, which is inefficient, subjective, and poorly adaptable.
Method used
Locality Sensitive Hash (LSH) algorithm is used to determine the similarity between item names, and an item association graph is constructed based on the similarity. Directed edges are used to represent the association relationship, and the path density is determined by the Floyd algorithm. The data is then processed in conjunction with a word vector model.
Benefits of technology
It improves the efficiency and accuracy of constructing the item association graph, reduces the influence of subjective factors, and can quickly and accurately discover item associations, providing an intuitive logical association pattern and item center.
✦ Generated by Eureka AI based on patent content.
Smart Images
Figure CN114510562B_ABST
Abstract
The present disclosure provides a method for constructing a matter association graph, which can be applied to the technical field of government affairs. The method for constructing the matter association graph comprises: taking a matter name as a node of the matter association graph to obtain a plurality of nodes; determining the similarity between two nodes in the plurality of nodes according to the matter name by using a local sensitive hashing algorithm; connecting the two nodes to obtain an edge between the two nodes in the case that the similarity between the two nodes is greater than or equal to a first predetermined threshold; and constructing the matter association graph based on the nodes and the edge. The present disclosure also provides a matter query method, device, equipment, storage medium and program product.
Need to check novelty before this filing date? Find Prior Art