Alternatives and similar repositories for parsemis:

Users that are interested in parsemis are comparing it to the libraries listed below

• ehab-abdelhamid / GraMi
  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
• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆56Updated 3 years ago
• lhelwerd / WebGraph
  WebGraph framework with extensions
  ☆23Updated 10 years ago
• ehab-abdelhamid / ScaleMine
  Parallel Frequent Subgraph Mining
  ☆30Updated 7 years ago
• qcri / Arabesque
  Scalable Graph Mining
  ☆61Updated 2 years ago
• ssrangan / gm-sparql
  Graph Mining Using SPARQL
  ☆21Updated 9 years ago
• ColinConduff / FrequentSubgraphMining
  This is a python implementation of the Gaston frequent subgraph mining algorithm.
  ☆20Updated 5 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆202Updated 4 years ago
• Sotera / distributed-louvain-modularity
  Community Detection and Compression Analytic for Big Graph Data
  ☆37Updated 10 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• annamalai-nr / subgraph2vec_gensim
  Contains the code (and working vm setup) for our KDD MLG 2016 paper titled: "subgraph2vec: Learning Distributed Representations of Rooted…
  ☆42Updated 7 years ago
• ShelsonCao / GraRep
  Source Code of GraRep
  ☆52Updated 7 years ago
• nddsg / KGMiner
  Knowledge Graph Miner
  ☆42Updated 8 years ago
• gbagan / gmark
  ☆42Updated 2 years ago
• mwcvitkovic / Open-Vocabulary-Learning-on-Source-Code-with-a-Graph-Structured-Cache
  Code to reproduce the experiments in the paper Open Vocabulary Learning on Source Code with a Graph-Structured Cache
  ☆21Updated 5 years ago
• macks22 / dblp
  Parse the dblp data into a structured format for experimentation.
  ☆73Updated 7 years ago
• rkwitt / gboost
  A fork of Sebastian Nowozin's and Koji Tsuda's gboost code
  ☆17Updated 12 years ago
• uwescience / GossipMap
  GossipMap: distributed parallel community detection algorithm
  ☆22Updated 9 years ago
• microsoft / msrc-dpu-learning-to-represent-edits
  C# Data Extraction for "Learning to Represent Edits"
  ☆26Updated 6 years ago
• teapot-co / tempest
  Network storage and analytics library
  ☆27Updated 7 years ago
• LijunChang / Graph_Edit_Distance
  Exact graph edit distance (GED) computation and verification
  ☆56Updated 2 years ago
• AKSW / LSQ
  Linked SPARQL Queries (LSQ): Framework for RDFizing triple store (web) logs and performing SPARQL query extraction, analysis and benchmar…
  ☆25Updated 5 months ago
• graphchallenge / GraphChallenge
  Graph Challenge
  ☆31Updated 5 years ago
• nphdang / GE-FSG
  Graph Embedding via Frequent Subgraphs
  ☆44Updated 4 years ago
• plofgren / fast-ppr-scala
  Personalized PageRank Algorithm described in the paper "FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs"
  ☆35Updated 10 years ago
• uwsampa / graphbench
  A graph application benchmark suite
  ☆21Updated 9 years ago
• mponza / WikipediaRelatedness
  The Wikipedia Relatedness library
  ☆19Updated 6 years ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• ldbc / ldbc_graphalytics
  Generic driver for LDBC Graphalytics implementation
  ☆82Updated 3 months ago