Alternatives and similar repositories for kdd20-mosso

Users that are interested in kdd20-mosso are comparing it to the libraries listed below

• geon0325 / MoCHy
  Source code for VLDB 2020 paper "Hypergraph Motifs: Concepts, Algorithms, and Discoveries."
  ☆16Updated last year
• young917 / www21-hyperlap
  WWW21 - How Do Hyperedges Overlap
  ☆16Updated last year
• yunbum-kook / icdm20-hyperff
  ☆13Updated 4 years ago
• wuhao-wu-jiang / Personalized-PageRank
  ☆14Updated 3 years ago
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 3 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• AnryYang / PANE
  Official Implementation for "Scaling Attributed Network Embedding to Massive Graphs"
  ☆17Updated last year
• zexihuang / random-walk-embedding
  A Broader Picture of Random-walk Based Graph Embedding
  ☆30Updated 4 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆54Updated last year
• flyingdoog / RWM
  Local Community Detection in Multiple Netwrks
  ☆15Updated 6 months ago
• gdmnl / SCARA-PPR
  The original code for SCARA: Scalable Graph Neural Networks with Feature-Oriented Optimization (VLDB 2022) and Scalable Decoupling Graph …
  ☆13Updated last year
• chlehdwon / RDB2G-Bench
  Source code for the paper RDB2G-Bench: A Comprehensive Benchmark for Automatic Graph Modeling of Relational Databases
  ☆17Updated last month
• manhtuando97 / KDD-20-Hypergraph
  Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"
  ☆31Updated 10 months ago
• GemsLab / StrucEmbedding-GraphLibrary
  The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.
  ☆18Updated 2 years ago
• Kangfei / LSS
  Released code for [sigmod'21] A learned Sketch for Subgraph Counting
  ☆19Updated 3 years ago
• KyuhanLee / SSumM
  SSumM: Sparse Summarization of Massive Graphs
  ☆19Updated 5 years ago
• Cecca / ugraph
  Code and data for the Clustering Uncertain Graphs paper
  ☆10Updated 2 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆159Updated last year
• asajadi / fast-pagerank
  Fast (Personalized) PageRank Implementation
  ☆68Updated 2 years ago
• yqc01 / BESIDE
  (BESIDE) ``Bridge” Enhanced Signed Directed Network Embedding
  ☆11Updated 6 years ago
• arbenson / ScHoLP-Data
  Data for the paper "Simplicial closure and higher-order link prediction"
  ☆21Updated 6 years ago
• twistedcubic / HNHN
  Hypergraph representation learning: Hypergraph Networks with Hyperedge Neurons.
  ☆41Updated 4 years ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• loukasa / graph-coarsening
  Multilevel graph coarsening algorithm with spectral and cut guarantees
  ☆91Updated 5 years ago
• RapidsAtHKUST / ContinuousSubgraphMatching
  Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…
  ☆50Updated 2 years ago
• kswoo97 / pcl
  Published as a journal paper at DAMI 2023
  ☆16Updated 6 months ago
• K-Kyungho / PET
  Official code for "Towards Better Utilzation of Multiple Views for Bundle Recommendation" (CIKM 24 Short)
  ☆20Updated 8 months ago
• NAVER-INTEL-Co-Lab / gaudi-geometric-learning
  Handbook for Geometric Deep Learning with Intel Gaudi-v2 Devices
  ☆20Updated 5 months ago
• ShinhwanKang / BeGin
  Easy-to-use framework for graph continual learning with Python
  ☆37Updated 10 months ago
• Harryi0 / dyrep_torch
  ☆39Updated 4 years ago