Topic-aware latent models for representation learning on networks
- URL: http://arxiv.org/abs/2111.05576v1
- Date: Wed, 10 Nov 2021 08:52:52 GMT
- Title: Topic-aware latent models for representation learning on networks
- Authors: Abdulkadir \c{C}elikkanat and Fragkiskos D. Malliaros
- Abstract summary: We introduce TNE, a generic framework to enhance the embeddings of nodes acquired by means of random walk-based approaches with topic-based information.
We evaluate our methodology in two downstream tasks: node classification and link prediction.
- Score: 5.304857921982132
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Network representation learning (NRL) methods have received significant
attention over the last years thanks to their success in several graph analysis
problems, including node classification, link prediction, and clustering. Such
methods aim to map each vertex of the network into a low-dimensional space in a
way that the structural information of the network is preserved. Of particular
interest are methods based on random walks; such methods transform the network
into a collection of node sequences, aiming to learn node representations by
predicting the context of each node within the sequence. In this paper, we
introduce TNE, a generic framework to enhance the embeddings of nodes acquired
by means of random walk-based approaches with topic-based information. Similar
to the concept of topical word embeddings in Natural Language Processing, the
proposed model first assigns each node to a latent community with the favor of
various statistical graph models and community detection methods and then
learns the enhanced topic-aware representations. We evaluate our methodology in
two downstream tasks: node classification and link prediction. The experimental
results demonstrate that by incorporating node and community embeddings, we are
able to outperform widely-known baseline NRL models.
Related papers
- Ensemble Quadratic Assignment Network for Graph Matching [52.20001802006391]
Graph matching is a commonly used technique in computer vision and pattern recognition.
Recent data-driven approaches have improved the graph matching accuracy remarkably.
We propose a graph neural network (GNN) based approach to combine the advantages of data-driven and traditional methods.
arXiv Detail & Related papers (2024-03-11T06:34:05Z) - GNN-LoFI: a Novel Graph Neural Network through Localized Feature-based
Histogram Intersection [51.608147732998994]
Graph neural networks are increasingly becoming the framework of choice for graph-based machine learning.
We propose a new graph neural network architecture that substitutes classical message passing with an analysis of the local distribution of node features.
arXiv Detail & Related papers (2024-01-17T13:04:23Z) - Hub-aware Random Walk Graph Embedding Methods for Classification [44.99833362998488]
We propose two novel graph embedding algorithms based on random walks that are specifically designed for the node classification problem.
The proposed methods are experimentally evaluated by analyzing the classification performance of three classification algorithms trained on embeddings of real-world networks.
arXiv Detail & Related papers (2022-09-15T20:41:18Z) - Associative Learning for Network Embedding [20.873120242498292]
We introduce a network embedding method from a new perspective.
Our network learns associations between the content of each node and that node's neighbors.
Our proposed method is evaluated on different downstream tasks such as node classification and linkage prediction.
arXiv Detail & Related papers (2022-08-30T16:35:45Z) - Interpolation-based Correlation Reduction Network for Semi-Supervised
Graph Learning [49.94816548023729]
We propose a novel graph contrastive learning method, termed Interpolation-based Correlation Reduction Network (ICRN)
In our method, we improve the discriminative capability of the latent feature by enlarging the margin of decision boundaries.
By combining the two settings, we extract rich supervision information from both the abundant unlabeled nodes and the rare yet valuable labeled nodes for discnative representation learning.
arXiv Detail & Related papers (2022-06-06T14:26:34Z) - A Variational Edge Partition Model for Supervised Graph Representation
Learning [51.30365677476971]
This paper introduces a graph generative process to model how the observed edges are generated by aggregating the node interactions over a set of overlapping node communities.
We partition each edge into the summation of multiple community-specific weighted edges and use them to define community-specific GNNs.
A variational inference framework is proposed to jointly learn a GNN based inference network that partitions the edges into different communities, these community-specific GNNs, and a GNN based predictor that combines community-specific GNNs for the end classification task.
arXiv Detail & Related papers (2022-02-07T14:37:50Z) - Network Representation Learning: From Preprocessing, Feature Extraction
to Node Embedding [9.844802841686105]
Network representation learning (NRL) advances the conventional graph mining of social networks, knowledge graphs, and complex biomedical and physics information networks.
This survey paper reviews the design principles and the different node embedding techniques for network representation learning over homogeneous networks.
arXiv Detail & Related papers (2021-10-14T17:46:37Z) - Node2Seq: Towards Trainable Convolutions in Graph Neural Networks [59.378148590027735]
We propose a graph network layer, known as Node2Seq, to learn node embeddings with explicitly trainable weights for different neighboring nodes.
For a target node, our method sorts its neighboring nodes via attention mechanism and then employs 1D convolutional neural networks (CNNs) to enable explicit weights for information aggregation.
In addition, we propose to incorporate non-local information for feature learning in an adaptive manner based on the attention scores.
arXiv Detail & Related papers (2021-01-06T03:05:37Z) - Self-Supervised Learning of Contextual Embeddings for Link Prediction in
Heterogeneous Networks [11.540329725077843]
We develop SLiCE, a framework bridging static representation learning methods using global information from the entire graph.
We first pre-train our model in a self-supervised manner by introducing higher-order semantic associations and masking nodes.
We also interpret the semantic association matrix and provide its utility and relevance in making successful link predictions between heterogeneous nodes in the network.
arXiv Detail & Related papers (2020-07-22T03:48:53Z) - Policy-GNN: Aggregation Optimization for Graph Neural Networks [60.50932472042379]
Graph neural networks (GNNs) aim to model the local graph structures and capture the hierarchical patterns by aggregating the information from neighbors.
It is a challenging task to develop an effective aggregation strategy for each node, given complex graphs and sparse features.
We propose Policy-GNN, a meta-policy framework that models the sampling procedure and message passing of GNNs into a combined learning process.
arXiv Detail & Related papers (2020-06-26T17:03:06Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.