giannisnik / k-clique-graphs-dense-subgraphsLinks
☆15Updated 8 years ago
Alternatives and similar repositories for k-clique-graphs-dense-subgraphs
Users that are interested in k-clique-graphs-dense-subgraphs are comparing it to the libraries listed below
Sorting:
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆17Updated 6 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- An implementation of "Fusing Structure and Content via Non-negative Matrix Factorization for Embedding Information Networks".☆20Updated 2 years ago
- SSumM: Sparse Summarization of Massive Graphs☆19Updated 5 years ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 7 years ago
- ☆16Updated 5 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 4 years ago
- Code for the paper "Unsupervised Community Detection with Modularity-based Attention Model"☆36Updated 5 years ago
- Code for "M. Zhang, Y. Chen, Weisfeiler-Lehman Neural Machine for Link Prediction, KDD 2017 oral"☆56Updated 6 years ago
- ☆12Updated 7 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆131Updated 4 years ago
- Node Embeddings in Dynamic Graphs☆56Updated 3 years ago
- Local Community Detection in Multiple Netwrks☆14Updated 4 months ago
- ☆33Updated 5 years ago
- Graph Neural Networks for Community Detection☆63Updated 5 years ago
- GloDyNE: Global Topology Preserving Dynamic Network Embedding (accepted by IEEE TKDE in 2020) https://ieeexplore.ieee.org/document/930271…