Graph convolutional networks (GCNs) have achieved great success in many applications and have caught significant attention in both academic and industrial domains. However, repeatedly employing graph convolutional layers would render the node embeddings indistinguishable. For the sake of avoiding oversmoothing, most GCN-based models are restricted in a shallow architecture. Therefore, the expressive power of these models is insufficient since they ignore information beyond local neighborhoods. Furthermore, existing methods either do not consider the semantics from high-order local structures or neglect the node homophily (i.e., node similarity), which severely limits the performance of the model. In this article, we take above problems into consideration and propose a novel Semantics and Homophily preserving Network Embedding (SHNE) model. In particular, SHNE leverages higher order connectivity patterns to capture structural semantics. To exploit node homophily, SHNE utilizes both structural and feature similarity to discover potential correlated neighbors for each node from the whole graph; thus, distant but informative nodes can also contribute to the model. Moreover, with the proposed dual-attention mechanisms, SHNE learns comprehensive embeddings with additional information from various semantic spaces. Furthermore, we also design a semantic regularizer to improve the quality of the combined representation. Extensive experiments demonstrate that SHNE outperforms state-of-the-art methods on benchmark datasets.

Download full-text PDF

Source
http://dx.doi.org/10.1109/TNNLS.2021.3116936DOI Listing

Publication Analysis

Top Keywords

semantics homophily
8
homophily preserving
8
preserving network
8
network embedding
8
graph convolutional
8
node homophily
8
shne
6
node
5
shne semantics
4
homophily
4

Similar Publications

Probability graph complementation contrastive learning.

Neural Netw

November 2024

School of Computer Science and Engineering, Beihang University, Beijing, 100191, PR China. Electronic address:

Graph Neural Network (GNN) has achieved remarkable progress in the field of graph representation learning. The most prominent characteristic, propagating features along the edges, degrades its performance in most heterophilic graphs. Certain researches make attempts to construct KNN graph to improve the graph homophily.

View Article and Find Full Text PDF
Article Synopsis
  • - The study explores how using non-biomedical synonyms can enhance the quality of concept embeddings for biomedical terms, like Myocardial Infarction.
  • - By replacing synonyms with their most common representatives via WordNet, researchers found an average 8% reduction in intra-cluster distance among 1055 concept sets, indicating improved embedding similarity.
  • - The findings suggest that this method is effective in refining biomedical concept embeddings using the Word2Vec algorithm and the approach is accessible through a Python package online.
View Article and Find Full Text PDF

In point cloud, some regions typically exist nodes from multiple categories, i.e., these regions have both homophilic and heterophilic nodes.

View Article and Find Full Text PDF

Attributed Multi-Order Graph Convolutional Network for Heterogeneous Graphs.

Neural Netw

June 2024

College of Computer and Data Science, Fuzhou University, Fuzhou 350116, China; Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou 350116, China. Electronic address:

Heterogeneous graph neural networks play a crucial role in discovering discriminative node embeddings and relations from multi-relational networks. One of the key challenges in heterogeneous graph learning lies in designing learnable meta-paths, which significantly impact the quality of learned embeddings. In this paper, we propose an Attributed Multi-Order Graph Convolutional Network (AMOGCN), which automatically explores meta-paths that involve multi-hop neighbors by aggregating multi-order adjacency matrices.

View Article and Find Full Text PDF

Homophily modulates double descent generalization in graph convolution networks.

Proc Natl Acad Sci U S A

February 2024

Departement Mathematik und Informatik, Universität Basel, Basel 4051, Switzerland.

Graph neural networks (GNNs) excel in modeling relational data such as biological, social, and transportation networks, but the underpinnings of their success are not well understood. Traditional complexity measures from statistical learning theory fail to account for observed phenomena like the double descent or the impact of relational semantics on generalization error. Motivated by experimental observations of "transductive" double descent in key networks and datasets, we use analytical tools from statistical physics and random matrix theory to precisely characterize generalization in simple graph convolution networks on the contextual stochastic block model.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!