MUSE: Multi-faceted Attention for Signed Network Embedding
- URL: http://arxiv.org/abs/2104.14449v1
- Date: Thu, 29 Apr 2021 16:09:35 GMT
- Title: MUSE: Multi-faceted Attention for Signed Network Embedding
- Authors: Dengcheng Yan, Youwen Zhang, Wei Li, Yiwen Zhang
- Abstract summary: Signed network embedding is an approach to learn low-dimensional representations of nodes in signed networks with both positive and negative links.
We propose MUSE, a MUlti-faceted attention-based Signed network Embedding framework to tackle this problem.
- Score: 4.442695760653947
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Signed network embedding is an approach to learn low-dimensional
representations of nodes in signed networks with both positive and negative
links, which facilitates downstream tasks such as link prediction with general
data mining frameworks. Due to the distinct properties and significant added
value of negative links, existing signed network embedding methods usually
design dedicated methods based on social theories such as balance theory and
status theory. However, existing signed network embedding methods ignore the
characteristics of multiple facets of each node and mix them up in one single
representation, which limits the ability to capture the fine-grained attentions
between node pairs. In this paper, we propose MUSE, a MUlti-faceted
attention-based Signed network Embedding framework to tackle this problem.
Specifically, a joint intra- and inter-facet attention mechanism is introduced
to aggregate fine-grained information from neighbor nodes. Moreover, balance
theory is also utilized to guide information aggregation from multi-order
balanced and unbalanced neighbors. Experimental results on four real-world
signed network datasets demonstrate the effectiveness of our proposed
framework.
Related papers
- Link Polarity Prediction from Sparse and Noisy Labels via Multiscale Social Balance [8.635930195821263]
Signed Graph Neural Networks (SGNNs) have recently gained attention as an effective tool for several learning tasks on signed networks.
One of these tasks is to predict the polarity of the links for which this information is missing, starting from the network structure and the other available polarities.
In this work, we devise a semi-supervised learning framework that builds around the novel concept of emphmultiscale social balance to improve the prediction of link polarities.
arXiv Detail & Related papers (2024-07-22T14:02:28Z) - Multi-perspective Memory Enhanced Network for Identifying Key Nodes in Social Networks [51.54002032659713]
We propose a novel Multi-perspective Memory Enhanced Network (MMEN) for identifying key nodes in social networks.
MMEN mines key nodes from multiple perspectives and utilizes memory networks to store historical information.
Our method significantly outperforms previous methods.
arXiv Detail & Related papers (2024-03-22T14:29:03Z) - 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) - SigGAN : Adversarial Model for Learning Signed Relationships in Networks [2.0277446818410994]
We propose a Generative Adversarial Network (GAN) based model for signed networks, SigGAN.
It considers the requirements of signed networks, such as, integration of information from negative edges, high imbalance in number of positive and negative edges and structural balance theory.
arXiv Detail & Related papers (2022-01-17T14:53:30Z) - SSSNET: Semi-Supervised Signed Network Clustering [4.895808607591299]
We introduce a novel probabilistic balanced normalized cut loss for training nodes in a GNN framework for semi-supervised signed network clustering, called SSSNET.
The main novelty approach is a new take on the role of social balance theory for signed network embeddings.
arXiv Detail & Related papers (2021-10-13T10:36:37Z) - Signed Bipartite Graph Neural Networks [42.32959912473691]
Signed bipartite networks are different from classical signed networks, which contain two different node sets and signed links between two node sets.
In this work, we firstly define the signed relationship of the same set of nodes and provide a new perspective for analyzing signed bipartite networks.
We then do some comprehensive analysis of balance theory from two perspectives on several real-world datasets.
arXiv Detail & Related papers (2021-08-22T05:15:45Z) - Interpretable Signed Link Prediction with Signed Infomax Hyperbolic
Graph [54.03786611989613]
signed link prediction in social networks aims to reveal the underlying relationships (i.e. links) among users (i.e. nodes)
We develop a unified framework, termed as Signed Infomax Hyperbolic Graph (textbfSIHG)
In order to model high-order user relations and complex hierarchies, the node embeddings are projected and measured in a hyperbolic space with a lower distortion.
arXiv Detail & Related papers (2020-11-25T05:09:03Z) - A Multi-Semantic Metapath Model for Large Scale Heterogeneous Network
Representation Learning [52.83948119677194]
We propose a multi-semantic metapath (MSM) model for large scale heterogeneous representation learning.
Specifically, we generate multi-semantic metapath-based random walks to construct the heterogeneous neighborhood to handle the unbalanced distributions.
We conduct systematical evaluations for the proposed framework on two challenging datasets: Amazon and Alibaba.
arXiv Detail & Related papers (2020-07-19T22:50:20Z) - Unsupervised Differentiable Multi-aspect Network Embedding [52.981277420394846]
We propose a novel end-to-end framework for multi-aspect network embedding, called asp2vec.
Our proposed framework can be readily extended to heterogeneous networks.
arXiv Detail & Related papers (2020-06-07T19:26:20Z) - CSNE: Conditional Signed Network Embedding [77.54225346953069]
Signed networks encode positive and negative relations between entities such as friend/foe or trust/distrust.
Existing embedding methods for sign prediction generally enforce different notions of status or balance theories in their optimization function.
We introduce conditional signed network embedding (CSNE)
Our probabilistic approach models structural information about the signs in the network separately from fine-grained detail.
arXiv Detail & Related papers (2020-05-19T19:14:52Z)
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.