MGrin / transactions-graph-generatorLinks
Generator for graph of transactions. Is kind of optimized for large graph generations. Contains graph structure generation, nodes information generation (client names, phone numbers, etc...), patterns generation
☆30Updated 2 years ago
Alternatives and similar repositories for transactions-graph-generator
Users that are interested in transactions-graph-generator are comparing it to the libraries listed below
Sorting:
- This repository builds an anti-money laundering scheme employing graph theory and social network analysis to detect the sophisticated lay…☆20Updated 6 years ago
- Node Embeddings in Dynamic Graphs☆57Updated 3 years ago
- This repository contains the code used in the experimental setup of the paper 'Inductive Graph Representation Learning for Fraud Detectio…☆34Updated 2 years ago
- Companion repository for the KDD'18 hands-on tutorial on Higher-Order Data Analytics for Temporal Network Data☆46Updated 6 years ago
- Detection of Accounting Anomalies in the Latent Space using Adversarial Autoencoder Neural Networks - A lab we prepared for the KDD'19 Wo…☆89Updated 6 years ago
- Jupyter notebooks showing how to use Neo4j Graph Algorithms☆52Updated 5 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆88Updated last year
- Fraud detection with the Paysim financial dataset, Neo4j Graph Data Science, and Neo4j Bloom☆46Updated 11 months ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆125Updated 2 years ago
- The data represents financial transactions -- bank transfers, purchases, credit card transactions, checks, etc. Most of the transactions…☆59Updated last week
- Learning from graph data using Keras☆64Updated 6 years ago
- DYnamic MOtif-NoDes (DYMOND) is a dynamic network generative model based on temporal motifs and node behavior.☆15Updated 2 years ago
- Benchmark for Graph Embedding Methods☆47Updated 4 years ago
- This project is to implement the algorithm discussed in Efficient Identification of Overlapping Communities.☆15Updated 3 years ago
- GraphOfDocs: Representing multiple documents as a single graph☆19Updated 3 years ago
- ☆21Updated 2 years ago
- Tutorial for Multi-Stakeholder Recommender Systems☆22Updated 4 years ago
- Code for the CIKM 2019 Paper "Fast and Accurate Network Embeddings via Very Sparse Random Projection"☆58Updated 5 years ago
- Temporal Walk Based Centrality Metric for Graph Streams☆15Updated 2 years ago
- Exploring News Recommendation With Neo4j GDS☆30Updated 2 years ago
- A scalable Gensim implementation of "Learning Role-based Graph Embeddings" (IJCAI 2018).☆167Updated 2 years ago
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆133Updated 2 years ago
- NetworkX API for Neo4j Graph Algorithms.☆132Updated 5 years ago
- Python Implementation of 'Spectral Clustering in Heterogeneous Information Networks'.☆20Updated 5 years ago
- Hands-on tutorial about link analysis techniques☆37Updated 4 years ago
- Worked with a number of real-world datasets available at http://snap.stanford.edu/ to identify the importance of certain nodes in terms o…☆11Updated 8 years ago
- RDyn: graph benchmark handling community dynamics☆23Updated last year
- Personalized Purchase Prediction of Market Baskets with Wasserstein-Based Sequence Matching☆19Updated 6 years ago
- Anomaly detection algorithm for social networks using Graph Neural Networks by leveraging graph parameteres, between centrality, degree, …☆12Updated 5 years ago
- ☆10Updated 3 years ago