Allocation identification detection method and system based on topology analysis of atlas

By abstracting the distribution transactions and fund directions into transaction chain maps and analyzing the ring structure using the depth-first search algorithm, it solves the shortcomings of the distribution channel compliance detection in the existing technology and improves the traceability of transactions and transparency, optimize risk management and transaction processing efficiency.

CN119006156APending Publication Date: 2024-11-22CHINA CITIC BANK CO LTD
View PDF 0 Cites 2 Cited by

Patent Information

Application Number
CN202411026757.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-30
Publication Date
2024-11-22

AI Technical Summary

Technical Problem

The existing technology cannot avoid fraudulent behavior of forging compliance channels when detecting compliance with distribution channels. The funds are poorly traceable, the degree of automation is low, and a large amount of manual intervention is required, resulting in a reduction in transaction processing efficiency and accuracy.

Method used

The topological analysis method based on graphs is used to abstract the transaction and funding trends into a transaction chain graph, and the ring structure is analyzed through the depth-first search algorithm, and an analysis report is generated to identify false generations, improving the traceability and transparency of transactions.

Benefits of technology

It enhances the traceability of transactions issued by the agency, detects potential risks in real time, optimizes risk management, improves transaction processing efficiency, reduces financial fraud, and ensures the authenticity and compliance of business activities.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119006156A_ABST
    Figure CN119006156A_ABST
Patent Text Reader

Abstract

The invention relates to a method and a system for identifying and detecting issuing on the basis of topology analysis of a graph, and the method comprises the steps: obtaining standardized issuing data which comprises transaction entities and a transaction relation between the transaction entities; constructing a transaction chain atlas according to the issuing data, wherein the transaction chain atlas comprises nodes and edges; performing topology analysis on the transaction chain atlas by using a depth-first search algorithm to obtain a ring structure in the transaction chain atlas; and detecting and analyzing the ring structure to generate an analysis report. According to the method, the agency transaction data and the subsequent transaction fund destination information are abstracted into the transaction chain atlas, and the ring structure in the transaction chain atlas is obtained, so that possible false agency is determined, the traceability of agency transactions is enhanced, the transparency of agency is increased, potential risks are detected in real time, risk management is optimized, and the risk management efficiency is improved. And the transaction processing efficiency is improved in a digital and automatic mode.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of graph analysis technology, and in particular to a method and system for detecting proxy posting based on graph topological analysis. Background Art

[0002] There is a related patent "Method and Equipment for Verification of Fund Payment", and its publication number is CN110009351A. This patent verifies whether the payee is registered based on the foreign exchange settlement transaction data when the preset conditions are met, and when the payee is not registered, generates the corresponding registration information of the payee based on the foreign exchange settlement transaction data, so as to realize fund payment to the corresponding payee based on the registration information. In this way, it can ensure that the reporting entity of the foreign exchange settlement business matches the actual payee of the domestic agency payment, thereby avoiding the situation where funds cannot be traced and false transactions.

[0003] The existing technology mainly relies on equipment to detect whether the payment channels are compliant, which cannot avoid fraudulent behavior of forging compliant channels, and does not take into account the macro perspective of the collected data; there is insufficient verification of the payee, and the subsequent destination of the payee's funds is not considered, which may contain unclear fund flows; there are problems with fund tracing, and there is a lack of effective mechanisms to ensure the consistency between the initial reporting entity and the actual receipt of funds. If false payment occurs, the source of funds cannot be traced back in time; the degree of automation is insufficient, and more business manual intervention and investigation are required to deal with false payment behavior, which reduces the efficiency and accuracy of transaction processing. Summary of the invention

[0004] In order to address the deficiencies of the prior art, the present invention provides a method and system for identifying and detecting proxy payments based on topological analysis of a graph, which abstracts the proxy payments transactions and subsequent fund flows for corporate and private customers into a transaction chain graph, performs topological analysis on the graph, and determines possible false proxy payments.

[0005] To achieve the above objectives, the technical solutions adopted by the present invention include:

[0006] A method for identifying and detecting proxy delivery based on topological analysis of a graph, characterized by comprising:

[0007] S1. Obtain standardized agency data, wherein the agency data includes transaction entities and transaction relationships between transaction entities;

[0008] S2. Construct a transaction chain graph based on the proxy data, wherein the transaction chain graph includes nodes and edges;

[0009] S3. Performing topological analysis on the transaction chain graph using a depth-first search algorithm to obtain a ring structure in the transaction chain graph;

[0010] S4. Detect and analyze the ring structure and generate an analysis report.

[0011] Furthermore, the obtaining of standardized proxy data includes:

[0012] Collect transaction data related to agency payment and information on the destination of transaction funds;

[0013] The transaction data and the transaction funds destination information are cleaned to obtain standardized agency payment data.

[0014] Furthermore, the transaction entity includes a first transaction entity and a second transaction entity, and the transaction relationship includes a first transaction relationship and a second transaction relationship.

[0015] Furthermore, constructing a transaction chain graph based on the proxy data includes:

[0016] Import the payment data into the Neo4j database to build a transaction chain graph;

[0017] Save the transaction chain graph in the form of an adjacency matrix.

[0018] Furthermore, the topological analysis of the transaction chain graph using a depth-first search algorithm to obtain a ring structure in the transaction chain graph includes:

[0019] Perform a depth-first search on the starting node of the transaction chain graph;

[0020] Set the threshold for the amount and number of payments;

[0021] Query the transaction entities whose agency payment amount and number of transactions exceed the agency payment amount and number threshold, and obtain the transaction entities with larger agency payment amount and number of transactions;

[0022] The ring structure formed by the strongly connected subgraphs of the transaction entities with the larger agency payment amount and number of transactions is obtained by querying the strongly connected components.

[0023] Furthermore, the method further comprises:

[0024] Update the proxy data, build a new transaction chain map based on the updated proxy data, perform topological analysis on the new transaction chain map, and update the analysis report.

[0025] The present invention also relates to a proxy identification and detection system based on topological analysis of graphs, which is characterized by comprising:

[0026] A data acquisition module, used to acquire standardized proxy data, wherein the proxy data includes transaction entities and transaction relationships between transaction entities;

[0027] A graph construction module, used to construct a transaction chain graph according to the proxy data, wherein the transaction chain graph includes nodes and edges;

[0028] A topology analysis module, used to perform topology analysis on the transaction chain graph using a depth-first search algorithm to obtain a ring structure in the transaction chain graph;

[0029] The detection and analysis module is used to detect and analyze the ring structure and generate an analysis report.

[0030] The present invention also relates to a computer-readable storage medium, characterized in that a computer program is stored on the storage medium, and the computer program implements the above method when executed by a processor.

[0031] The present invention also relates to an electronic device, characterized in that it comprises a processor and a memory;

[0032] The memory is used to store program instructions;

[0033] The processor is used to execute the above method by calling program instructions.

[0034] The present invention also relates to a computer program product, comprising a computer program and / or instructions, characterized in that the computer program and / or instructions implement the steps of the above method when executed by a processor.

[0035] The beneficial effects of the present invention are:

[0036] The present invention adopts a method and system for identifying and detecting payment on behalf of others based on topological analysis of graphs, abstracts payment on behalf of others transaction data and subsequent transaction funds destination information into a transaction chain graph, obtains the ring structure in the transaction chain graph, thereby determining possible false payment on behalf of others, enhancing the traceability of payment on behalf of others transactions, detecting potential risks in real time, optimizing risk management, and improving transaction processing efficiency through digital and automated methods. The present invention can identify the problem of enterprises that may have falsely increased payment amounts in daily business transactions through payment on behalf of others channels, as well as the behavior of subordinate branches assisting in counterfeiting payment on behalf of others for performance pressure. By effectively identifying and analyzing the closed loop existing in the transaction chain of payment on behalf of others channels, the present invention aims to assist banks in autonomously identifying and handling illegal or irregular financial activities, which can reduce possible financial fraud, increase transaction transparency, and ensure the authenticity and compliance of business activities. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in describing the embodiments of the present application are briefly introduced below.

[0038] Figure 1It is a schematic diagram of the flow of the proxy identification and detection method based on the topological analysis of the graph of the present invention;

[0039] Figure 2 It is a schematic diagram of the structure of the proxy identification and detection system based on the topological analysis of the graph of the present invention;

[0040] Figure 3 The figure is a schematic structural diagram of an electronic device of the present invention. DETAILED DESCRIPTION

[0041] In order to make the purpose, technical solutions and advantages of the present application clearer, the technical solutions of the present application will be clearly and completely described below in conjunction with the specific embodiments of the present application and the corresponding drawings. It should be understood that the described embodiments are only part of the embodiments of the present application, rather than all of the embodiments, and these embodiments are only used to illustrate the present application and are not used to limit the scope of the present application. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of this application.

[0042] like Figure 1 As shown, the embodiment of the present invention discloses a method for detecting proxy distribution based on topological analysis of a graph, and the steps of the method include:

[0043] Step S1. Obtain standardized proxy data, wherein the proxy data includes transaction entities and transaction relationships between transaction entities.

[0044] Specifically, the obtaining of standardized proxy data includes:

[0045] Collect transaction data related to agency payment and information on the destination of transaction funds;

[0046] The transaction data and the transaction funds destination information are cleaned to obtain standardized agency payment data.

[0047] The transaction entities include a first transaction entity and a second transaction entity, and the transaction relationship includes a first transaction relationship and a second transaction relationship.

[0048] In an embodiment of the present invention, data can be introduced from the bank data lake to collect transaction data related to remittance, and further collect information on the whereabouts of transaction funds flowing to customers to ensure the authenticity and reliability of the collected data.

[0049] In an embodiment of the present invention, the first transaction entity may be a customer of the bank, the second transaction entity may be a customer of a non-bank, the first transaction relationship may be an "income relationship", which is input from a non-bank to the bank, and the second transaction relationship may be a "payment relationship", which is a relationship output by the bank.

[0050] Step S2: construct a transaction chain graph based on the proxy data, wherein the transaction chain graph includes nodes and edges.

[0051] Specifically, the step of constructing a transaction chain graph based on the proxy data includes:

[0052] Import the payment data into the Neo4j database to build a transaction chain graph;

[0053] Save the transaction chain graph in the form of an adjacency matrix.

[0054] In the embodiment of the present invention, the nodes in the transaction chain graph represent transaction entities, and the edges in the transaction chain graph represent transaction relationships. Therefore, the nodes can be divided into first nodes and second nodes. The first node represents the bank's customers, and the second node represents non-bank customers. The edges can be divided into first relationship edges and second relationship edges. The first relationship edge can represent "income relationship" and the second relationship edge can represent "payment relationship". The above operations can distinguish between corporate customers and personal customers.

[0055] In an embodiment of the present invention, the transaction chain graph is saved in the form of an adjacency matrix to facilitate subsequent depth-first traversal.

[0056] Step S3: Use a depth-first search algorithm to perform topological analysis on the transaction chain graph to obtain a ring structure in the transaction chain graph.

[0057] Specifically, the topological analysis of the transaction chain graph using a depth-first search algorithm to obtain a ring structure in the transaction chain graph includes:

[0058] Perform a depth-first search on the starting node of the transaction chain graph;

[0059] Set the threshold for the amount and number of payments;

[0060] Query the transaction entities whose agency payment amount and number of transactions exceed the agency payment amount and number threshold, and obtain the transaction entities with larger agency payment amount and number of transactions;

[0061] The ring structure formed by the strongly connected subgraphs of the transaction entities with the larger agency payment amount and number of transactions is obtained by querying the strongly connected components.

[0062] In the embodiment of the present invention, a graph theory algorithm is used to analyze the transaction chain graph, establish and identify the transaction pattern that constitutes a closed loop, and obtain a ring structure.

[0063] In the embodiment of the present invention, the presence of a ring structure indicates the possible existence of false agency transactions, and the ring structure is paid special attention to. By querying the strongly connected components, the rings composed of strongly connected subgraphs with a large proportion of amount or number of transactions are found, the properties of the ring structure are analyzed, and the potential risk level is confirmed based on the inflow and outflow of funds. It is checked whether each node in the ring path is registered and whether it is compliant.

[0064] Step S4: Detect and analyze the ring structure and generate an analysis report.

[0065] In the embodiment of the present invention, a specific analysis is conducted on enterprises whose capital flow within the loop accounts for a large proportion of the total capital flow. The higher the proportion, the higher the risk. An analysis report is generated for abnormal loops to confirm whether there is potential false issuance behavior, and an alarm is issued to relevant persons in charge to ensure that there is no financial fraud.

[0066] For the closed loop generated by the agency funds, obtain the specific proportion of funds inflow and outflow, analyze the rationality of each large transaction in the closed loop, and update the specific customer information status. Calculate the capital inflow reuse rate in the closed loop to determine whether there is possible false agency behavior.

[0067] In the present invention, the existing closed loop (ring structure) is found out according to the depth-first traversal algorithm, and the path through which the ring structure passes through fewer nodes is detected. When the minimum flow and maximum flow ratios in the path are too close (including the judgment of data such as date and amount), it can be determined that the enterprise has issued the agency payment amount through the agency payment channel and the amount is quickly recovered to the enterprise, and it is determined to be a false agency payment.

[0068] The present invention also provides a method for periodically maintaining and dynamically analyzing atlas data, the method comprising:

[0069] Update the proxy data, build a new transaction chain map based on the updated proxy data, perform topological analysis on the new transaction chain map, and update the analysis report.

[0070] In an embodiment of the present invention, actual transaction data is updated regularly, so that the graph network is dynamically changing over time, detection of new transactions is increased, analysis results are updated regularly, network structures that change over time are tracked and analyzed, and improvement directions based on effect evaluation are determined to adapt to changing market and technical environments.

[0071] like Figure 2 As shown, the embodiment of the present invention discloses a proxy identification and detection system based on topological analysis of a graph, and its structure includes:

[0072] A data acquisition module, used to acquire standardized proxy data, wherein the proxy data includes transaction entities and transaction relationships between transaction entities;

[0073] A graph construction module, used to construct a transaction chain graph according to the proxy data, wherein the transaction chain graph includes nodes and edges;

[0074] A topology analysis module, used to perform topology analysis on the transaction chain graph using a depth-first search algorithm to obtain a ring structure in the transaction chain graph;

[0075] The detection and analysis module is used to detect and analyze the ring structure and generate an analysis report.

[0076] By using this system, the above-mentioned operation processing method can be executed and the corresponding technical effects can be achieved.

[0077] An embodiment of the present invention also provides a computer-readable storage medium capable of implementing all the steps in the method in the above embodiment, wherein a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, all the steps in the method in the above embodiment are implemented.

[0078] The embodiment of the present invention further provides an electronic device for executing the above method, as a device for implementing the method, and its structure is as follows: Figure 3 As shown, the electronic device 300 includes: a processor 301 and a memory 303. The processor 301 and the memory 303 are connected, such as through a bus 302. Optionally, the electronic device 300 may also include a transceiver 304. It should be noted that in actual applications, the transceiver 304 is not limited to one. It is understandable that the structure illustrated in the embodiment of the present invention does not constitute a specific limitation on the specific structure of the electronic device 300. In other embodiments of the present application, the electronic device 300 may include more or fewer components than shown in the figure, or combine certain components, or split certain components, or arrange the components differently. The illustrated components may be implemented in hardware, software, or a combination of software and hardware. Optionally, the electronic device may also include a display screen 305 for displaying images, or receiving user operation instructions when necessary.

[0079] The processor 301 is applied in the embodiment of the present application to implement the method shown in the above method embodiment. The transceiver 304 may include a receiver and a transmitter. The transceiver 304 is applied in the embodiment of the present application to implement the function of the electronic device of the embodiment of the present application communicating with other devices when executed.

[0080] Processor 301 may be a CPU (Central Processing Unit), a general purpose processor, a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. It may implement or execute various exemplary logic blocks, modules and circuits described in conjunction with the disclosure of this application. Processor 301 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, etc.

[0081] The processor 301 may also include one or more processing units, for example, the processor 301 may include an application processor (AP), a modem processor, a graphics processor (GPU), an image signal processor (ISP), a controller, a memory, a video codec, a digital signal processor (DSP), a baseband processor, and / or a neural network processor (NPU). Among them, different processing units may be independent devices or integrated into one or more processors. Among them, the controller may be the nerve center and command center of the electronic device 300. The controller may generate an operation control signal according to the instruction opcode and the timing signal to complete the control of fetching and executing instructions. A memory may also be set in the processor 301 for storing instructions and data. In some embodiments, the memory in the processor 301 is a high-speed cache memory. The memory may store instructions or data that the processor 301 has just used or circulated. If the processor 301 needs to use the instruction or data again, it may be directly called from the memory. Repeated access is avoided, the waiting time of the processor 301 is reduced, and the efficiency of the system is improved.

[0082] The processor 301 can run the method provided in the embodiment of the present application. The processor 301 can include different devices. For example, when a CPU and a GPU are integrated, the CPU and the GPU can cooperate to execute the method provided in the embodiment of the present application, for example, part of the algorithm in the method is executed by the CPU, and another part of the algorithm is executed by the GPU to obtain faster processing efficiency.

[0083] The bus 302 may include a path to transmit information between the above components. The bus 302 may be a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus. The bus 302 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 3 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0084] The memory 303 may be a ROM (Read Only Memory) or other types of static storage devices that can store static information and instructions, a RAM (Random Access Memory) or other types of dynamic storage devices that can store information and instructions, or an EEPROM (Electrically Erasable Programmable Read Only Memory), a CD-ROM (Compact Disc Read Only Memory), or may include a high-speed random access memory, or may include a non-volatile memory, such as at least one disk storage device, a flash memory device, a universal flash storage (UFS), or other optical disk storage, optical disk storage (including compressed optical disk, laser disk, optical disk, digital versatile disk, Blu-ray disk, etc.), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited to this.

[0085] Optionally, the memory 303 is used to store application code for executing the solution of the present application, and the execution is controlled by the processor 301. The processor 301 is used to execute the application code stored in the memory 303 to implement the method provided in any embodiment of the present application.

[0086] The memory 303 can be used to store computer executable program codes, which include instructions. The processor 301 executes various functional applications and data processing of the electronic device 300 by running the instructions stored in the memory 303. The memory 303 may include a program storage area and a data storage area. Among them, the program storage area may store the code of the operating system, application program, etc. The data storage area may store data created during the use of the electronic device 300 (such as images, videos, etc. collected by the camera application), etc.

[0087] The memory 303 may also store one or more computer programs corresponding to the method provided in the embodiment of the present application. The one or more computer programs are stored in the above-mentioned memory 303 and are configured to be executed by the one or more processors 301. The one or more computer programs include instructions, and the above-mentioned instructions can be used to execute each step in the above-mentioned corresponding embodiment.

[0088] Of course, the code of the method provided in the embodiment of the present application can also be stored in an external memory. In this case, the processor 301 can run the code of the method stored in the external memory through the external memory interface, and the processor 301 can control the running process.

[0089] The display screen 305 includes a display panel. The display panel can be a liquid crystal display (LCD), an organic light-emitting diode (OLED), an active-matrix organic light-emitting diode or an active-matrix organic light-emitting diode (AMOLED), a flexible light-emitting diode (FLED), Miniled, MicroLed, Micro-oLed, a quantum dot light-emitting diode (QLED), etc. In some embodiments, the electronic device 300 may include 1 or N display screens 305, where N is a positive integer greater than 1. The display screen 305 can be used to display information input by a user or information provided to a user and various graphical user interfaces (GUI). For example, the display screen 305 can display photos, videos, web pages, or files.

[0090] The electronic device provided in the embodiment of the present application is applicable to any embodiment of the above method. Therefore, the beneficial effects that can be achieved can refer to the beneficial effects in the corresponding method provided above, which will not be repeated here.

[0091] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0092] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A system that specifies the functions of a box or boxes.

[0093] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a product including an instruction system, which is implemented in the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0094] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps of the functions specified in a box or multiple boxes. Although the preferred embodiments of the present invention have been described, those skilled in the art may make additional changes and modifications to these embodiments once they know the basic creative concept. Therefore, the attached claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present invention.

[0095] The above is only a preferred specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed by the present invention should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

Claims

1. A method for identifying and detecting proxy messages based on topological analysis of graphs, characterized in that: include: S1. Obtain standardized agency data, wherein the agency data includes transaction entities and transaction relationships between transaction entities; S2. Construct a transaction chain graph based on the proxy data, wherein the transaction chain graph includes nodes and edges; S3. Performing topological analysis on the transaction chain graph using a depth-first search algorithm to obtain a ring structure in the transaction chain graph; S4. Detect and analyze the ring structure and generate an analysis report.

2. The method according to claim 1, characterized in that The obtaining of standardized proxy data includes: Collect transaction data related to agency payment and information on the destination of transaction funds; The transaction data and the transaction funds destination information are cleaned to obtain standardized agency payment data.

3. The method according to claim 1, characterized in that The transaction entities include a first transaction entity and a second transaction entity, and the transaction relationship includes a first transaction relationship and a second transaction relationship.

4. The method according to claim 1, characterized in that The step of constructing a transaction chain graph according to the proxy data includes: Import the payment data into the Neo4j database to build a transaction chain graph; Save the transaction chain graph in the form of an adjacency matrix.

5. The method according to claim 1, characterized in that The topological analysis of the transaction chain graph using a depth-first search algorithm to obtain a ring structure in the transaction chain graph includes: Perform a depth-first search on the starting node of the transaction chain graph; Set the threshold for the amount and number of payments; Query the transaction entities whose agency payment amount and number of transactions exceed the agency payment amount and number threshold, and obtain the transaction entities with larger agency payment amount and number of transactions; The ring structure formed by the strongly connected subgraphs of the transaction entities with the larger agency payment amount and number of transactions is obtained by querying the strongly connected components.

6. The method according to claim 1, characterized in that The method further comprises: Update the proxy data, build a new transaction chain map based on the updated proxy data, perform topological analysis on the new transaction chain map, and update the analysis report.

7. A proxy identification and detection system based on topological analysis of graphs, characterized in that: include: A data acquisition module, used to acquire standardized proxy data, wherein the proxy data includes transaction entities and transaction relationships between transaction entities; A graph construction module, used to construct a transaction chain graph according to the proxy data, wherein the transaction chain graph includes nodes and edges; A topology analysis module, used to perform topology analysis on the transaction chain graph using a depth-first search algorithm to obtain a ring structure in the transaction chain graph; The detection and analysis module is used to detect and analyze the ring structure and generate an analysis report.

8. A computer-readable storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

9. An electronic device, characterized in that: including a processor and a memory; The memory is used to store program instructions; The processor is configured to execute the method according to any one of claims 1 to 6 by calling program instructions.

10. A computer program product comprising a computer program and / or instructions, characterized in that: When the computer program and / or the instructions are executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Citation Information

Cited By

  • PID (Proportion Integration Differentiation) drawing element intelligent identification and topology reconstruction method based on visual inspection

    CN121281087A

  • Invisible risk assessment method and device based on multi-modal data, equipment and medium

    CN121441798A