Transaction Graph Node Embedding via Directed Acyclic Subgraphs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for analyzing transaction composition graphs are time-consuming and labor-intensive, requiring manual analysis or AI assistance to perform numeric or predictive analysis, and struggle to efficiently convert complex transaction data into feature vectors for risk assessment and artifact classification.
Innovation Solution
A computer-implemented process that trains an embedding model using machine learning to convert transaction composition graphs into multiple directed acyclic subgraphs or spanning trees, generating one-hot vectors and embedding nodes into latent feature vectors based on data flow and neural network computations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If manual analysis or AI assistance is used for transaction composition graphs, then analysis accuracy is improved, but time consumption and labor intensity increase
Solution Approach 1:
The patent replaces manual mechanical analysis with automated machine learning models. The system uses trained embedding models to automatically convert transaction composition graphs into feature vectors and perform risk assessment, eliminating the need for manual analysis while maintaining high accuracy through sophisticated neural network architectures.
Solution Approach 2:
The system enables self-service automated analysis where the machine learning models independently process transaction composition graphs without human intervention. The models automatically learn from training data, generate feature vectors, and produce risk assessments, allowing the system to serve itself and eliminate dependency on manual AI assistance.
2Reliability
If complex transaction data is converted into feature vectors using traditional methods, then risk assessment capability is improved, but computational complexity increases
Solution Approach 1:
The patent segments the complex transaction composition graph into individual nodes and edges, processing them separately through the embedding model. Each node is converted into a feature vector independently, and relationships are captured through edge features. This segmentation reduces computational complexity by breaking down the overall complex transformation into manageable smaller operations.
Solution Approach 2:
The system transforms complex transaction data from graph structure into vector space representations, adding a mathematical dimension for computation. By mapping nodes and edges to feature vectors in multidimensional space, the system enables efficient similarity calculations and risk assessments using standard vector operations, simplifying the overall computational process.
3Productivity
If automated embedding models are trained on transaction data, then analysis efficiency is improved, but training data requirements increase
Solution Approach 1:
The patent designs embedding models with universal applicability across different transaction types and domains. The models learn general patterns from training data that can be applied to various transaction composition graphs, reducing the need for domain-specific training data. The same model architecture and training approach can be reused across different applications, minimizing overall training data requirements.
Solution Approach 2:
The system performs preliminary training of embedding models on representative transaction data before deployment. By pre-training the models with sufficient data upfront, the system achieves high analysis efficiency during operation without requiring continuous large-scale training. The preliminary action of model training consolidates the data requirement into an initial phase, allowing efficient automated analysis thereafter.
Data Source
AI summary
A computer-implemented process for transaction composition graph node embedding comprising traversing a data flow of transactions to convert a full graph to multiple directed acyclic subgraphs/paths in spanning trees, taking one-by-one nodes as input to a predetermined neural network, generating a set of one-hot vectors for all nodes, computing an embedding vector from a corresponding one-hot vector, computing a probability that an output node is nearby, and embedding the node to a latent feature vector.


