{"payload":{"pageCount":2,"repositories":[{"type":"Public","name":"NLB","owner":"Graph-COM","isFork":false,"description":"\"No Need to Look Back: An Efficient and Scalable Approach for Temporal Network Representation Learning\" by Yuhong Luo and Pan Li","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-21T15:12:55.552Z"}},{"type":"Public","name":"HEPT","owner":"Graph-COM","isFork":false,"description":"[ICML 2024] LSH-Based Efficient Point Transformer (HEPT)","topicNames":["point-cloud","pytorch","transformer","hep-ex","geometric-deep-learning","ai4science"],"topicsNotShown":0,"allTopics":["point-cloud","pytorch","transformer","hep-ex","geometric-deep-learning","ai4science"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":10,"forksCount":4,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-02T01:53:09.284Z"}},{"type":"Public","name":"SPE","owner":"Graph-COM","isFork":false,"description":"Official code for SPE ","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":9,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-26T17:50:49.376Z"}},{"type":"Public","name":"GDL_DS","owner":"Graph-COM","isFork":false,"description":"Code for GDL-DS: A Benchmark for Geometric Deep Learning under Distribution Shifts","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-23T14:27:08.393Z"}},{"type":"Public","name":"Pair-Align","owner":"Graph-COM","isFork":false,"description":"Code for Pairwise Alignment Improves Graph Domain Adaptation (Pair-Align)","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-05T20:26:09.740Z"}},{"type":"Public","name":"GAD-NR","owner":"Graph-COM","isFork":false,"description":"[WSDM 2024] GAD-NR : Graph Anomaly Detection via Neighborhood Reconstruction ","topicNames":["auto-encoder","graph-neural-networks","graph-anomaly-detection","deep-learning","pytorch","unsupervised-learning","anomaly-detection"],"topicsNotShown":0,"allTopics":["auto-encoder","graph-neural-networks","graph-anomaly-detection","deep-learning","pytorch","unsupervised-learning","anomaly-detection"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":28,"forksCount":2,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-21T05:25:12.310Z"}},{"type":"Public","name":"GSAT","owner":"Graph-COM","isFork":false,"description":"[ICML 2022] Graph Stochastic Attention (GSAT) for interpretable and generalizable graph learning.","topicNames":["interpretability","xai","interpretable-machine-learning","deep-learning","pytorch","graph-neural-networks"],"topicsNotShown":0,"allTopics":["interpretability","xai","interpretable-machine-learning","deep-learning","pytorch","graph-neural-networks"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":142,"forksCount":17,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-19T17:31:48.564Z"}},{"type":"Public","name":"GraphMaker","owner":"Graph-COM","isFork":false,"description":"code for the paper \"GraphMaker: Can Diffusion Models Generate Large Attributed Graphs?\"","topicNames":["social-network","network-science","pytorch","generative-model","graph-generation","node-classification","graph-neural-networks","synthetic-data-generation","ddpm"],"topicsNotShown":0,"allTopics":["social-network","network-science","pytorch","generative-model","graph-generation","node-classification","graph-neural-networks","synthetic-data-generation","ddpm"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":39,"forksCount":4,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-25T21:06:54.805Z"}},{"type":"Public","name":"ED-HNN","owner":"Graph-COM","isFork":false,"description":"[ICLR 2023] \"Equivariant Hypergraph Diffusion Neural Operators\" by Peihao Wang, Shenghao Yang, Yunyu Liu, Zhangyang Wang, Pan Li","topicNames":["hypergraph-learning","graph-diffusion","equivariant-network","graph-neural-networks"],"topicsNotShown":0,"allTopics":["hypergraph-learning","graph-diffusion","equivariant-network","graph-neural-networks"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":32,"forksCount":4,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-06T01:14:00.217Z"}},{"type":"Public","name":"GAD-EBM","owner":"Graph-COM","isFork":false,"description":"[NeurIPS 2023 : GLFRONTIERS Workshop] GAD-EBM : Graph Anomaly Detection using Energy-Based Models","topicNames":["energy-based-model","graph-anomaly-detection","neurips-2023","glfrontiers"],"topicsNotShown":0,"allTopics":["energy-based-model","graph-anomaly-detection","neurips-2023","glfrontiers"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-11-17T17:13:34.635Z"}},{"type":"Public","name":"DIG_MILP","owner":"Graph-COM","isFork":false,"description":"The official implementation of DIG-MILP","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":10,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-27T01:58:24.473Z"}},{"type":"Public","name":"SUREL_Plus","owner":"Graph-COM","isFork":false,"description":"[VLDB'23] SUREL+ is a novel set-based computation framework for scalable subgraph-based graph representation learning. ","topicNames":["graph-representation-learning","open-graph-benchmark","scalable-graph-learning"],"topicsNotShown":0,"allTopics":["graph-representation-learning","open-graph-benchmark","scalable-graph-learning"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":0,"starsCount":15,"forksCount":1,"license":"BSD 2-Clause \"Simplified\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-09-06T23:33:15.266Z"}},{"type":"Public","name":"LRI","owner":"Graph-COM","isFork":false,"description":"[ICLR 2023] Learnable Randomness Injection (LRI) for interpretable Geometric Deep Learning.","topicNames":["interpretability","geometric-deep-learning","xai","graph-neural-networks","interpretable-machine-learning","deep-learning","pytorch"],"topicsNotShown":0,"allTopics":["interpretability","geometric-deep-learning","xai","graph-neural-networks","interpretable-machine-learning","deep-learning","pytorch"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":20,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-07-18T13:38:54.065Z"}},{"type":"Public","name":"StruRW","owner":"Graph-COM","isFork":false,"description":"[ICML 2023] Structural Re-weighting Improves Graph Domain Adaptation (StruRW)","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":21,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-06-20T16:58:49.983Z"}},{"type":"Public","name":"PEG","owner":"Graph-COM","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":34,"forksCount":8,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-06-04T01:23:03.466Z"}},{"type":"Public","name":"Neighborhood-Aware-Temporal-Network","owner":"Graph-COM","isFork":false,"description":"Yuhong Luo and Pan Li. Neighborhood-aware scalable temporal network representation learning. In Learning on Graphs, 2022.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":26,"forksCount":4,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-05-06T03:50:30.129Z"}},{"type":"Public","name":"Meta_CO","owner":"Graph-COM","isFork":false,"description":"the official repository of the paper unsupervised learning for combinatorial optimization needs meta learning","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":0,"license":"GNU Lesser General Public License v2.1","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-02-23T15:38:14.082Z"}},{"type":"Public","name":"SUREL","owner":"Graph-COM","isFork":false,"description":"[VLDB'22] SUREL is a novel walk-based computation framework for efficient subgraph-based graph representation learning.","topicNames":["graph-representation-learning","open-graph-benchmark"],"topicsNotShown":0,"allTopics":["graph-representation-learning","open-graph-benchmark"],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":0,"issueCount":2,"starsCount":18,"forksCount":4,"license":"BSD 2-Clause \"Simplified\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-01-28T04:26:54.340Z"}},{"type":"Public","name":"Labs-for-Machine-Learning-on-Graphs","owner":"Graph-COM","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-10-17T01:09:29.152Z"}},{"type":"Public","name":"Bayesian_inference_based_GNN","owner":"Graph-COM","isFork":false,"description":"[Neurips2022] Understanding Non-linearity in Graph Neural Networks from the Perspective of Bayesian Inference","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":7,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-10-12T04:10:03.366Z"}},{"type":"Public","name":"CO_ProxyDesign","owner":"Graph-COM","isFork":false,"description":"The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":15,"forksCount":0,"license":"GNU Lesser General Public License v2.1","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-10-09T18:45:29.338Z"}},{"type":"Public","name":"Neural_Higher-order_Pattern_Prediction","owner":"Graph-COM","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":11,"forksCount":4,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-03-04T18:42:28.145Z"}},{"type":"Public","name":"a3d3-institute.github.io","owner":"Graph-COM","isFork":true,"description":"draft website using html5up template","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":53,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-01-29T00:16:03.136Z"}},{"type":"Public","name":"GPRGNN","owner":"Graph-COM","isFork":true,"description":"","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":29,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-05-28T19:52:24.907Z"}},{"type":"Public","name":"distance-encoding","owner":"Graph-COM","isFork":true,"description":"Distance Encoding for GNN Design","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":26,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-03-20T22:00:33.234Z"}},{"type":"Public","name":"CAW","owner":"Graph-COM","isFork":true,"description":"","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":16,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-01-17T22:02:31.972Z"}},{"type":"Public","name":"GIB","owner":"Graph-COM","isFork":true,"description":"Graph Information Bottleneck (GIB) for learning minimal sufficient structural and feature information using GNNs","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":24,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-10-27T01:19:23.631Z"}},{"type":"Public","name":"DSFM-with-incidence-relations","owner":"Graph-COM","isFork":true,"description":"Decomposable Submodular Function Minimization with Incidence Relations","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-09-25T16:29:42.322Z"}},{"type":"Public","name":"QDSDM","owner":"Graph-COM","isFork":true,"description":"Quadratic Decomposable Submodular Function Minimization","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-09-25T06:35:05.074Z"}},{"type":"Public","name":"IPM-for-submodular-hypergraphs","owner":"Graph-COM","isFork":true,"description":"Inverse power method for submodular hypergraphs","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-09-25T04:46:52.171Z"}}],"repositoryCount":31,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}