{"list":"other","total":67,"rows":[{"id":"1609.02907","title":"Semi-Supervised Classification with Graph Convolutional Networks","created":"2016-09-09","cited_by_count":11361},{"id":"1710.10903","title":"Graph Attention Networks","created":"2017-10-30","cited_by_count":8923},{"id":"1706.02216","title":"Inductive Representation Learning on Large Graphs","created":"2017-06-07","cited_by_count":6320},{"id":"1810.00826","title":"How Powerful are Graph Neural Networks?","created":"2018-10-01","cited_by_count":4393},{"id":"1704.01212","title":"Neural Message Passing for Quantum Chemistry","created":"2017-04-04","cited_by_count":3487},{"id":"1505.07818","title":"Domain-Adversarial Training of Neural Networks","created":"2015-05-28","cited_by_count":3044},{"id":"1610.02136","title":"A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networks","created":"2016-10-07","cited_by_count":2385},{"id":"2005.00687","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","created":"2020-05-02","cited_by_count":2163},{"id":"1606.09375","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","created":"2016-06-30","cited_by_count":2089},{"id":"1702.05464","title":"Adversarial Discriminative Domain Adaptation","created":"2017-02-17","cited_by_count":1311},{"id":"1611.04076","title":"Least Squares Generative Adversarial Networks","created":"2016-11-13","cited_by_count":1001},{"id":"1907.04931","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","created":"2019-07-10","cited_by_count":618},{"id":"1605.06636","title":"Deep Transfer Learning with Joint Adaptation Networks","created":"2016-05-21","cited_by_count":612},{"id":"1909.13021","title":"Multi-scale Attributed Node Embedding","created":"2019-09-28","cited_by_count":548},{"id":"1507.00504","title":"Optimal Transport for Domain Adaptation","created":"2015-07-02","cited_by_count":463},{"id":"1904.05801","title":"Bridging Theory and Algorithm for Domain Adaptation","created":"2019-04-11","cited_by_count":332},{"id":"1608.06019","title":"Domain Separation Networks","created":"2016-08-22","cited_by_count":320},{"id":"2010.03978","title":"A Brief Review of Domain Adaptation","created":"2020-10-07","cited_by_count":288},{"id":"2004.11198","title":"SIGN: Scalable Inception Graph Neural Networks","created":"2020-04-23","cited_by_count":284},{"id":"1912.01805","title":"Adversarial Domain Adaptation with Domain Mixup","created":"2019-12-04","cited_by_count":250},{"id":"2002.06157","title":"Generalization and Representational Limits of Graph Neural Networks","created":"2020-02-14","cited_by_count":218},{"id":"1310.4375","title":"Fast Computation of Wasserstein Barycenters","created":"2013-10-16","cited_by_count":216},{"id":"1606.07536","title":"Coupled Generative Adversarial Networks","created":"2016-06-24","cited_by_count":216},{"id":"1812.05418","title":"DLOW: Domain Flow for Adaptation and Generalization","created":"2018-12-13","cited_by_count":177},{"id":"1805.09114","title":"Optimal Transport for structured data with application on graphs","created":"2018-05-23","cited_by_count":172},{"id":"2002.11361","title":"Understanding Self-Training for Gradual Domain Adaptation","created":"2020-02-26","cited_by_count":149},{"id":"1807.09596","title":"Contextual Stochastic Block Models","created":"2018-07-23","cited_by_count":134},{"id":"1910.11319","title":"Progressive Domain Adaptation for Object Detection","created":"2019-10-24","cited_by_count":134},{"id":"2101.11859","title":"Interpreting and Unifying Graph Neural Networks with An Optimization Framework","created":"2021-01-28","cited_by_count":131},{"id":"1901.06003","title":"Gromov-Wasserstein Learning for Graph Matching and Node Embedding","created":"2019-01-17","cited_by_count":126},{"id":"2011.09230","title":"FixBi: Bridging Domain Spaces for Unsupervised Domain Adaptation","created":"2020-11-18","cited_by_count":124},{"id":"1905.07645","title":"Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching","created":"2019-05-18","cited_by_count":103},{"id":"2006.14744","title":"Graph Optimal Transport for Cross-Domain Alignment","created":"2020-06-26","cited_by_count":103},{"id":"1811.02834","title":"Fused Gromov-Wasserstein distance for structured objects: theoretical foundations and mathematical properties","created":"2018-11-07","cited_by_count":93},{"id":"2009.05204","title":"Transfer Learning of Graph Neural Networks with Ego-graph Information Maximization","created":"2020-09-11","cited_by_count":93},{"id":"1909.01541","title":"Graph Transfer Learning via Adversarial Domain Adaptation with Graph Convolution","created":"2019-09-04","cited_by_count":67},{"id":"2204.00570","title":"Connect, Not Collapse: Explaining Contrastive Learning for Unsupervised Domain Adaptation","created":"2022-04-01","cited_by_count":67},{"id":"1903.01689","title":"Domain Adaptation with Asymmetrically-Relaxed Distribution Alignment","created":"2019-03-05","cited_by_count":61},{"id":"2106.01128","title":"Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs","created":"2021-06-02","cited_by_count":61},{"id":"1307.5551","title":"Regularized Discrete Optimal Transport","created":"2013-07-21","cited_by_count":54},{"id":"2107.00085","title":"CLDA: Contrastive Learning for Semi-Supervised Domain Adaptation","created":"2021-06-30","cited_by_count":52},{"id":"2306.04979","title":"CoCo: A Coupled Contrastive Framework for Unsupervised Domain Adaptive Graph Classification","created":"2023-06-08","cited_by_count":46},{"id":"2306.03221","title":"Structural Re-weighting Improves Graph Domain Adaptation","created":"2023-06-05","cited_by_count":45},{"id":"2002.07366","title":"Adversarial Deep Network Embedding for Cross-network Node Classification","created":"2020-02-18","cited_by_count":44},{"id":"1906.00684","title":"DANE: Domain Adaptive Network Embedding","created":"2019-06-03","cited_by_count":43},{"id":"2212.08174","title":"Non-IID Transfer Learning on Graphs","created":"2022-12-15","cited_by_count":43},{"id":"2006.04163","title":"Generalized Spectral Clustering via Gromov-Wasserstein Learning","created":"2020-06-07","cited_by_count":38},{"id":"2102.06555","title":"Online Graph Dictionary Learning","created":"2021-02-12","cited_by_count":37},{"id":"2106.07482","title":"Graph Domain Adaptation: A Generative View","created":"2021-06-14","cited_by_count":35},{"id":"2204.08200","title":"Understanding Gradual Domain Adaptation: Improved Analysis, Optimal Path and Beyond","created":"2022-04-18","cited_by_count":32},{"id":"2402.05660","title":"Rethinking Propagation for Unsupervised Graph Domain Adaptation","created":"2024-02-08","cited_by_count":31},{"id":"2309.10773","title":"Semi-supervised Domain Adaptation in Graph Transfer Learning","created":"2023-09-19","cited_by_count":27},{"id":"2207.04587","title":"Gradual Domain Adaptation without Indexed Intermediate Domains","created":"2022-07-11","cited_by_count":26},{"id":"2403.01092","title":"Pairwise Alignment Improves Graph Domain Adaptation","created":"2024-03-02","cited_by_count":25},{"id":"2006.04804","title":"Optimal Transport Graph Neural Networks","created":"2020-06-08","cited_by_count":24},{"id":"2106.06080","title":"Gradual Domain Adaptation in the Wild:When Intermediate Distributions are Absent","created":"2021-06-10","cited_by_count":21},{"id":"2110.02753","title":"Semi-relaxed Gromov-Wasserstein divergence with applications on graphs","created":"2021-10-06","cited_by_count":21},{"id":"2205.15733","title":"Template based Graph Neural Network with Optimal Transport Distances","created":"2022-05-31","cited_by_count":20},{"id":"2310.13852","title":"Gradual Domain Adaptation: Theory and Algorithms","created":"2023-10-20","cited_by_count":18},{"id":"2306.15963","title":"Fused Gromov-Wasserstein Graph Mixup for Graph-level Classifications","created":"2023-06-28","cited_by_count":15},{"id":"2403.01467","title":"Collaborate to Adapt: Source-Free Graph Domain Adaptation via Bi-directional Adaptation","created":"2024-03-03","cited_by_count":15},{"id":"2412.11654","title":"Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain Adaptation","created":"2024-12-16","cited_by_count":14},{"id":"2206.11492","title":"Gradual Domain Adaptation via Normalizing Flows","created":"2022-06-23","cited_by_count":11},{"id":"2303.06595","title":"A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data","created":"2023-03-12","cited_by_count":11},{"id":"2407.11052","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","created":"2024-07-09","cited_by_count":10},{"id":"2407.19311","title":"Can Modifying Data Address Graph Domain Adaptation?","created":"2024-07-27","cited_by_count":9},{"id":"2212.04725","title":"Augmenting Knowledge Transfer across Graphs","created":"2022-12-09","cited_by_count":1}],"next_cursor":null}