timtadh / parsemis
The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. https://www2.cs.fau.de/EN/research/zold/ParSeMiS/index.html
☆44Updated 5 years ago
Alternatives and similar repositories for parsemis:
Users that are interested in parsemis are comparing it to the libraries listed below
- GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…☆112Updated last year
- WebGraph framework with extensions☆23Updated 10 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 12 years ago
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago
- Network storage and analytics library☆27Updated 7 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Personalized PageRank Algorithm described in the paper "FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs"☆35Updated 10 years ago
- Contains the code (and working vm setup) for our KDD MLG 2016 paper titled: "subgraph2vec: Learning Distributed Representations of Rooted…☆42Updated 7 years ago
- Semantic Preserving Embeddings for Generalized Graphs☆31Updated 6 years ago
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆20Updated 5 years ago
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago
- NOUS: Construction, Querying and Reasoning with Knowledge Graphs☆71Updated 2 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆201Updated 4 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Updated 10 years ago
- A graph application benchmark suite☆21Updated 9 years ago
- Code for paper "Lancer: Your Code Tell Me What You Need"☆11Updated 2 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- Community Detection and Compression Analytic for Big Graph Data☆37Updated 10 years ago
- We design a Monte Carlo based method, UniWalk, to enable the fast top-k SimRank computation over large undirected graphs. UniWalk directl…☆12Updated 7 years ago
- node2vec implemented with Java☆12Updated 6 years ago
- C# Data Extraction for "Learning to Represent Edits"☆26Updated 6 years ago
- Graph Embedding via Frequent Subgraphs☆45Updated 4 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆57Updated 3 years ago
- GossipMap: distributed parallel community detection algorithm☆22Updated 9 years ago
- Source Code of GraRep☆52Updated 7 years ago
- DeepWalk implementation in C++☆99Updated 10 months ago
- ☆24Updated 2 years ago
- Code for "CoaCor: Code Annotation for Code Retrieval with Reinforcement Learning" (WWW 2019)☆36Updated 5 years ago
- ☆43Updated 2 years ago
- Chaos: Scale-out Graph Processing from Secondary Storage☆50Updated 9 years ago