CensNet: Convolution with Edge-Node Switching in Graph Neural Networks
In this paper, we present CensNet, Convolution with Edge-Node Switching graph neural network, for semi-supervised classification and regression in graph-structured data with both node and edge features. CensNet is a general graph embedding framework, which embeds both nodes and edges to a latent feature space. By using line graph of the original undirected graph, the role of nodes and edges are switched, and two novel graph convolution operations are proposed for feature propagation. Experimental results on real-world academic citation networks and quantum chemistry graphs show that our approach has achieved or matched the state-of-the-art performance.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph ClassificationGraph EmbeddingGraph Neural NetworkGraph RegressionNode ClassificationregressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Co-embedding of Nodes and Edges with Graph Neural Networks
Graph, as an important data representation, is ubiquitous in many real world applications ranging from social network analysis to biology. How to correctly and effectively learn and extract information from graph is esse…
BIG-bench Machine LearningGraph ClassificationGraph EmbeddingGraph Learning+5Het-node2vec: second order random walk sampling for heterogeneous multigraphs embedding
Many real-world problems are naturally modeled as heterogeneous graphs, where nodes and edges represent multiple types of entities and relations. Existing learning models for heterogeneous graph representation usually de…
Graph Representation LearningRepresentation LearningFAROS: Fair Graph Generation via Attribute Switching Mechanisms
Recent advancements in graph diffusion models (GDMs) have enabled the synthesis of realistic network structures, yet ensuring fairness in the generated data remains a critical challenge. Existing solutions attempt to mit…
Graph GenerationLink PredictionGraph Edge Representation via Tensor Product Graph Convolutional Representation
Graph Convolutional Networks (GCNs) have been widely studied. The core of GCNs is the definition of convolution operators on graphs. However, existing Graph Convolution (GC) operators are mainly defined on adjacency matr…
Graph LearningSelective Harvesting over Networks
Active search (AS) on graphs focuses on collecting certain labeled nodes (targets) given global knowledge of the network topology and its edge weights under a query budget. However, in most networks, nodes, topology and …
Multi-Armed Bandits