{"list":"other","total":57,"rows":[{"id":"1609.02907","title":"Semi-Supervised Classification with Graph Convolutional Networks","created":"2016-09-09","cited_by_count":11361},{"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":"1606.09375","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","created":"2016-06-30","cited_by_count":2089},{"id":"1611.07308","title":"Variational Graph Auto-Encoders","created":"2016-11-21","cited_by_count":1382},{"id":"1611.08097","title":"Geometric deep learning: going beyond Euclidean data","created":"2016-11-24","cited_by_count":1048},{"id":"1809.09401","title":"Hypergraph Neural Networks","created":"2018-09-25","cited_by_count":488},{"id":"1709.05584","title":"Representation Learning on Graphs: Methods and Applications","created":"2017-09-17","cited_by_count":457},{"id":"1712.00468","title":"Graph Signal Processing: Overview, Challenges and Applications","created":"2017-12-01","cited_by_count":413},{"id":"1901.08150","title":"Hypergraph Convolution and Hypergraph Attention","created":"2019-01-23","cited_by_count":228},{"id":"1607.01668","title":"Tensor Decomposition for Signal Processing and Machine Learning","created":"2016-07-06","cited_by_count":224},{"id":"1905.04497","title":"Stability Properties of Graph Neural Networks","created":"2019-05-11","cited_by_count":127},{"id":"1810.13066","title":"Connecting the Dots: Identifying Network Structure via Graph Signal Processing","created":"2018-10-31","cited_by_count":111},{"id":"2010.03633","title":"Simplicial Neural Networks","created":"2020-10-07","cited_by_count":110},{"id":"1907.11577","title":"Topological Signal Processing over Simplicial Complexes","created":"2019-07-26","cited_by_count":96},{"id":"1805.00165","title":"Convolutional Neural Network Architectures for Signals Supported on Graphs","created":"2018-05-01","cited_by_count":95},{"id":"1802.06916","title":"Simplicial Closure and higher-order link prediction","created":"2018-02-20","cited_by_count":93},{"id":"1807.05044","title":"Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplacian","created":"2018-07-13","cited_by_count":86},{"id":"1911.02613","title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","created":"2019-11-06","cited_by_count":69},{"id":"1608.03008","title":"Network Topology Inference from Spectral Templates","created":"2016-08-10","cited_by_count":58},{"id":"2010.04558","title":"HyperSAGE: Generalizing Inductive Representation Learning on Hypergraphs","created":"2020-10-09","cited_by_count":54},{"id":"2010.10728","title":"Heterogeneous Hypergraph Embedding for Graph Classification","created":"2020-10-21","cited_by_count":52},{"id":"1905.08287","title":"Random Walks on Hypergraphs with Edge-Dependent Vertex Weights","created":"2019-05-20","cited_by_count":45},{"id":"1912.02354","title":"HodgeNet: Graph Neural Networks for Edge Data","created":"2019-12-05","cited_by_count":39},{"id":"1808.02111","title":"Flow Smoothing and Denoising: Graph Signal Processing in the Edge-Space","created":"2018-08-06","cited_by_count":37},{"id":"1312.5179","title":"The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited","created":"2013-12-18","cited_by_count":35},{"id":"1602.04436","title":"Autoregressive Moving Average Graph Filtering","created":"2016-02-14","cited_by_count":35},{"id":"1503.05432","title":"Discrete Signal Processing on Graphs: Sampling Theory","created":"2015-03-03","cited_by_count":34},{"id":"1711.10146","title":"Structural Deep Embedding for Hyper-Networks","created":"2017-11-28","cited_by_count":33},{"id":"1709.01249","title":"Inhomogeneous Hypergraph Clustering with Applications","created":"2017-09-05","cited_by_count":31},{"id":"2008.00586","title":"Signal Processing on Directed Graphs","created":"2020-08-02","cited_by_count":28},{"id":"1803.03833","title":"Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering","created":"2018-03-10","cited_by_count":25},{"id":"1905.07451","title":"Graph-based Semi-Supervised & Active Learning for Edge Flows","created":"2019-05-17","cited_by_count":25},{"id":"1906.11295","title":"Hypernetwork Science via High-Order Hypergraph Walks","created":"2019-06-26","cited_by_count":20},{"id":"1907.09203","title":"Introducing Hypergraph Signal Processing: Theoretical Foundation and Practical Applications","created":"2019-07-22","cited_by_count":20},{"id":"2006.16377","title":"Hypergraph Random Walks, Laplacians, and Clustering","created":"2020-06-29","cited_by_count":20},{"id":"1504.04687","title":"Sampling of graph signals with successive local aggregations","created":"2015-04-18","cited_by_count":19},{"id":"1502.05058","title":"Tensor Spectral Clustering for Partitioning Higher-order Network Structures","created":"2015-02-17","cited_by_count":15},{"id":"1602.06516","title":"Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques","created":"2016-02-21","cited_by_count":13},{"id":"1708.08781","title":"Cheeger Inequalities for Submodular Transformations","created":"2017-08-29","cited_by_count":13},{"id":"1311.4296","title":"Reflection methods for user-friendly submodular optimization","created":"2013-11-18","cited_by_count":11},{"id":"1711.08171","title":"Hypergraph $p$-Laplacian: A Differential Geometry View","created":"2017-11-22","cited_by_count":11},{"id":"1807.09644","title":"Three hypergraph eigenvector centralities","created":"2018-07-25","cited_by_count":11},{"id":"2002.03392","title":"Line Hypergraph Convolution Network: Applying Graph Convolution for Hypergraphs","created":"2020-02-09","cited_by_count":11},{"id":"1408.2425","title":"Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms","created":"2014-08-11","cited_by_count":9},{"id":"1605.03122","title":"Kernel-Based Structural Equation Models for Topology Identification of Directed Networks","created":"2016-05-10","cited_by_count":8},{"id":"1902.10132","title":"Quadratic Decomposable Submodular Function Minimization: Theory and Practice (Computation and Analysis of PageRank over Hypergraphs)","created":"2019-02-26","cited_by_count":7},{"id":"1910.07247","title":"A Notion of Harmonic Clustering in Simplicial Complexes","created":"2019-10-16","cited_by_count":7},{"id":"1909.02253","title":"Powerset Convolutional Neural Networks","created":"2019-09-05","cited_by_count":6},{"id":"1703.01830","title":"Decomposable Submodular Function Minimization: Discrete and Continuous","created":"2017-03-06","cited_by_count":5},{"id":"1806.08104","title":"Hypergraph p-Laplacian Regularization for Remote Sensing Image Recognition","created":"2018-06-21","cited_by_count":5},{"id":"1909.12980","title":"Estimating Network Processes via Blind Identification of Multiple Graph Filters","created":"2019-09-27","cited_by_count":5},{"id":"1502.02643","title":"Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions","created":"2015-02-09","cited_by_count":4},{"id":"1507.08364","title":"Reconstruction of Graph Signals through Percolation from Seeding Nodes","created":"2015-07-30","cited_by_count":4},{"id":"1803.03851","title":"Revisiting Decomposable Submodular Function Minimization with Incidence Relations","created":"2018-03-10","cited_by_count":4},{"id":"1406.6474","title":"On the Convergence Rate of Decomposable Submodular Function Minimization","created":"2014-06-25","cited_by_count":3},{"id":"1803.10923","title":"Polynomial-Time Algorithms for Submodular Laplacian Systems","created":"2018-03-29","cited_by_count":1}],"next_cursor":null}