{"list":"other","total":110,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"2002.05709","title":"A Simple Framework for Contrastive Learning of Visual Representations","created":"2020-02-13","cited_by_count":12049},{"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":"1911.05722","title":"Momentum Contrast for Unsupervised Visual Representation Learning","created":"2019-11-13","cited_by_count":7513},{"id":"2111.06377","title":"Masked Autoencoders Are Scalable Vision Learners","created":"2021-11-11","cited_by_count":7403},{"id":"1706.02216","title":"Inductive Representation Learning on Large Graphs","created":"2017-06-07","cited_by_count":6320},{"id":"1901.00596","title":"A Comprehensive Survey on Graph Neural Networks","created":"2019-01-03","cited_by_count":2919},{"id":"2005.00687","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","created":"2020-05-02","cited_by_count":2163},{"id":"1607.00653","title":"node2vec: Scalable Feature Learning for Networks","created":"2016-07-03","cited_by_count":1918},{"id":"2103.03230","title":"Barlow Twins: Self-Supervised Learning via Redundancy Reduction","created":"2021-03-04","cited_by_count":1838},{"id":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"1611.07308","title":"Variational Graph Auto-Encoders","created":"2016-11-21","cited_by_count":1382},{"id":"1809.10341","title":"Deep Graph Infomax","created":"2018-09-27","cited_by_count":1106},{"id":"1511.06335","title":"Unsupervised Deep Embedding for Clustering Analysis","created":"2015-11-19","cited_by_count":767},{"id":"2106.11959","title":"Revisiting Deep Learning Models for Tabular Data","created":"2021-06-22","cited_by_count":740},{"id":"2006.05582","title":"Contrastive Multi-View Representation Learning on Graphs","created":"2020-06-10","cited_by_count":652},{"id":"1905.07953","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","created":"2019-05-20","cited_by_count":541},{"id":"2205.10803","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","created":"2022-05-22","cited_by_count":448},{"id":"1703.10146","title":"Community Detection and Stochastic Block Models","created":"2017-03-29","cited_by_count":319},{"id":"2103.00111","title":"Graph Self-Supervised Learning: A Survey","created":"2021-02-27","cited_by_count":289},{"id":"2102.06514","title":"Large-Scale Representation Learning on Graphs via Bootstrapping","created":"2021-02-12","cited_by_count":186},{"id":"2102.10757","title":"Self-Supervised Learning of Graph Neural Networks: A Unified Review","created":"2021-02-22","cited_by_count":184},{"id":"2210.07606","title":"Revisiting Heterophily For Graph Neural Networks","created":"2022-10-14","cited_by_count":169},{"id":"2006.16904","title":"Graph Clustering with Graph Neural Networks","created":"2020-06-30","cited_by_count":163},{"id":"1906.06532","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","created":"2019-06-15","cited_by_count":149},{"id":"2002.01633","title":"Structural Deep Clustering Network","created":"2020-02-05","cited_by_count":145},{"id":"2106.12484","title":"From Canonical Correlation Analysis to Self-supervised Graph Neural Networks","created":"2021-06-23","cited_by_count":141},{"id":"2105.07342","title":"Self-supervised Learning on Graphs: Contrastive, Generative,or Predictive","created":"2021-05-16","cited_by_count":136},{"id":"2306.10759","title":"SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations","created":"2023-06-19","cited_by_count":133},{"id":"2105.09111","title":"Self-supervised Heterogeneous Graph Neural Network with Co-contrastive Learning","created":"2021-05-19","cited_by_count":130},{"id":"2205.12156","title":"Not too little, not too much: a theoretical analysis of graph (over)smoothing","created":"2022-05-24","cited_by_count":106},{"id":"2310.11829","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","created":"2023-10-18","cited_by_count":103},{"id":"2112.14772","title":"Deep Graph Clustering via Dual Correlation Reduction","created":"2021-12-29","cited_by_count":97},{"id":"1906.01210","title":"Attributed Graph Clustering via Adaptive Graph Convolution","created":"2019-06-04","cited_by_count":96},{"id":"1911.06750","title":"Unsupervised Attributed Multiplex Network Embedding","created":"2019-11-15","cited_by_count":95},{"id":"1908.02441","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","created":"2019-08-07","cited_by_count":94},{"id":"2112.02472","title":"Augmentation-Free Self-Supervised Learning on Graphs","created":"2021-12-05","cited_by_count":94},{"id":"2106.02466","title":"Graph Barlow Twins: A self-supervised representation learning framework for graphs","created":"2021-06-04","cited_by_count":85},{"id":"2110.11842","title":"Multi-view Contrastive Graph Clustering","created":"2021-10-22","cited_by_count":76},{"id":"2012.09600","title":"Deep Fusion Clustering Network","created":"2020-12-15","cited_by_count":71},{"id":"2206.01535","title":"Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination","created":"2022-06-03","cited_by_count":69},{"id":"2403.01232","title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","created":"2024-03-02","cited_by_count":65},{"id":"2212.08665","title":"Hard Sample Aware Network for Contrastive Deep Graph Clustering","created":"2022-12-16","cited_by_count":61},{"id":"2301.01098","title":"Cluster-guided Contrastive Graph Clustering Network","created":"2023-01-03","cited_by_count":60},{"id":"2205.07865","title":"Simple Contrastive Graph Clustering","created":"2022-05-11","cited_by_count":56},{"id":"2502.14546","title":"Position: Graph Learning Will Lose Relevance Due To Poor Benchmarks","created":"2025-02-20","cited_by_count":53},{"id":"2010.04408","title":"Dirichlet Graph Variational Autoencoder","created":"2020-10-09","cited_by_count":40},{"id":"2108.05499","title":"Attention-driven Graph Clustering Network","created":"2021-08-12","cited_by_count":40},{"id":"2305.18405","title":"Dink-Net: Neural Clustering on Large Graphs","created":"2023-05-28","cited_by_count":38},{"id":"2107.08562","title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","created":"2021-07-19","cited_by_count":37},{"id":"2302.07920","title":"InfoNCE Loss Provably Learns Cluster-Preserving Representations","created":"2023-02-15","cited_by_count":37},{"id":"2110.14863","title":"Graph Communal Contrastive Learning","created":"2021-10-28","cited_by_count":34},{"id":"2407.09777","title":"Graph Transformers: A Survey","created":"2024-07-13","cited_by_count":32},{"id":"2305.02931","title":"Beyond Homophily: Reconstructing Structure for Graph-agnostic Clustering","created":"2023-05-03","cited_by_count":29},{"id":"2305.10738","title":"Deep Temporal Graph Clustering","created":"2023-05-18","cited_by_count":28},{"id":"2209.03473","title":"Higher-order Clustering and Pooling for Graph Neural Networks","created":"2022-09-02","cited_by_count":26},{"id":"2211.12875","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","created":"2022-11-23","cited_by_count":26},{"id":"2308.08963","title":"CONVERT:Contrastive Graph Clustering with Reliable Augmentation","created":"2023-08-17","cited_by_count":23},{"id":"2002.08648","title":"Adaptive Graph Auto-Encoder for General Data Clustering","created":"2020-02-20","cited_by_count":22},{"id":"2204.08504","title":"CGC: Contrastive Graph Clustering for Community Detection and Tracking","created":"2022-04-05","cited_by_count":21},{"id":"2312.12697","title":"DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization","created":"2023-12-20","cited_by_count":21},{"id":"2405.11801","title":"LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering","created":"2024-05-20","cited_by_count":21},{"id":"2409.14500","title":"GraphLand: Evaluating Graph Machine Learning Models on Diverse Industrial Data","created":"2024-09-22","cited_by_count":20},{"id":"2406.14288","title":"Revisiting Modularity Maximization for Graph Clustering: A Contrastive Learning Perspective","created":"2024-06-20","cited_by_count":18},{"id":"2308.06827","title":"Reinforcement Graph Clustering with Unknown Cluster Number","created":"2023-08-13","cited_by_count":16},{"id":"2305.03555","title":"Contrastive Graph Clustering in Curvature Spaces","created":"2023-05-05","cited_by_count":15},{"id":"2511.20030","title":"Cross-Contrastive Clustering for Multimodal Attributed Graphs with Dual Graph Filtering","created":"2025-11-25","cited_by_count":14},{"id":"2101.06883","title":"CaEGCN: Cross-Attention Fusion based Enhanced Graph Convolutional Network for Clustering","created":"2021-01-18","cited_by_count":12},{"id":"2312.14066","title":"Upper Bounding Barlow Twins: A Novel Filter for Multi-Relational Clustering","created":"2023-12-21","cited_by_count":12},{"id":"2408.03765","title":"Reliable Node Similarity Matrix Guided Contrastive Graph Clustering","created":"2024-08-07","cited_by_count":12},{"id":"2206.08583","title":"NAFS: A Simple yet Tough-to-beat Baseline for Graph Representation Learning","created":"2022-06-17","cited_by_count":11},{"id":"2102.03826","title":"Effective and Scalable Clustering on Massive Attributed Graphs","created":"2021-02-07","cited_by_count":10},{"id":"2401.05975","title":"End-to-end Learnable Clustering for Intent Learning in Recommendation","created":"2024-01-11","cited_by_count":10},{"id":"2407.16863","title":"Balanced Multi-Relational Graph Clustering","created":"2024-07-23","cited_by_count":10},{"id":"2308.05309","title":"Homophily-enhanced Structure Learning for Graph Clustering","created":"2023-08-10","cited_by_count":9},{"id":"2411.13147","title":"GraphCL: Graph-based Clustering for Semi-Supervised Medical Image Segmentation","created":"2024-11-20","cited_by_count":9},{"id":"2601.17301","title":"Tabular Foundation Models are Strong Graph Anomaly Detectors","created":"2026-01-24","cited_by_count":9},{"id":"2409.09770","title":"Cluster Aware Graph Anomaly Detection","created":"2024-09-15","cited_by_count":8},{"id":"2304.12228","title":"Hierarchical Contrastive Learning Enhanced Heterogeneous Graph Neural Network","created":"2023-04-24","cited_by_count":6},{"id":"2306.06936","title":"CARL-G: Clustering-Accelerated Representation Learning on Graphs","created":"2023-06-12","cited_by_count":6},{"id":"2401.06595","title":"Every Node is Different: Dynamically Fusing Self-Supervised Tasks for Attributed Graph Clustering","created":"2024-01-12","cited_by_count":6},{"id":"2408.05087","title":"Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning","created":"2024-08-09","cited_by_count":6},{"id":"2408.05459","title":"A Versatile Framework for Attributed Network Clustering via K-Nearest Neighbor Augmentation","created":"2024-08-10","cited_by_count":6},{"id":"2411.11074","title":"Spectral Subspace Clustering for Attributed Graphs","created":"2024-11-17","cited_by_count":6},{"id":"2505.10704","title":"ZEUS: Zero-shot Embeddings for Unsupervised Separation of Tabular Data","created":"2025-05-15","cited_by_count":6},{"id":"2311.00322","title":"Robust Graph Clustering via Meta Weighting for Noisy Graphs","created":"2023-11-01","cited_by_count":5},{"id":"2411.01157","title":"Negative-Free Self-Supervised Gaussian Embedding of Graphs","created":"2024-11-02","cited_by_count":5},{"id":"2310.11787","title":"NeuroCUT: A Neural Approach for Robust Graph Partitioning","created":"2023-10-18","cited_by_count":4},{"id":"2312.16830","title":"A Contrastive Variational Graph Auto-Encoder for Node Clustering","created":"2023-12-28","cited_by_count":4},{"id":"2412.17245","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","created":"2024-12-23","cited_by_count":4},{"id":"2504.09970","title":"ASIL: Augmented Structural Information Learning for Deep Graph Clustering in Hyperbolic Space","created":"2025-04-14","cited_by_count":4},{"id":"2505.14040","title":"Unsupervised Graph Clustering with Deep Structural Entropy","created":"2025-05-20","cited_by_count":4},{"id":"2505.20807","title":"Simple yet Effective Graph Distillation via Clustering","created":"2025-05-27","cited_by_count":4},{"id":"2506.00989","title":"Boosting Bot Detection via Heterophily-Aware Representation Learning and Prototype-Guided Cluster Discovery","created":"2025-06-01","cited_by_count":4},{"id":"2509.01426","title":"DCA: Graph-Guided Deep Embedding Clustering for Brain Atlases","created":"2025-09-01","cited_by_count":4},{"id":"2602.08519","title":"Bridging Academia and Industry: A Comprehensive Benchmark for Attributed Graph Clustering","created":"2026-02-09","cited_by_count":4},{"id":"2504.15640","title":"Cequel: Cost-Effective Querying of Large Language Models for Text Clustering","created":"2025-04-22","cited_by_count":3},{"id":"1806.11494","title":"Comparing Graph Clusterings: Set partition measures vs. Graph-aware measures","created":"2018-06-29","cited_by_count":2},{"id":"2111.04981","title":"Wasserstein Adversarially Regularized Graph Autoencoder","created":"2021-11-09","cited_by_count":2}],"next_cursor":"100"}