CoANE: Modeling Context Co-occurrence for Attributed Network Embedding
- URL: http://arxiv.org/abs/2106.09241v1
- Date: Thu, 17 Jun 2021 04:31:02 GMT
- Title: CoANE: Modeling Context Co-occurrence for Attributed Network Embedding
- Authors: I-Chung Hsieh, Cheng-Te Li
- Abstract summary: Attributed network embedding (ANE) is to learn low-dimensional vectors so that not only the network structure but also node attributes can be preserved.
We propose a novel ANE model, Context Co-occurrence-aware Attributed Network Embedding (CoANE)
The learning of context co-occurrence can capture the latent social circles of each node.
- Score: 10.609715843964263
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Attributed network embedding (ANE) is to learn low-dimensional vectors so
that not only the network structure but also node attributes can be preserved
in the embedding space. Existing ANE models do not consider the specific
combination between graph structure and attributes. While each node has its
structural characteristics, such as highly-interconnected neighbors along with
their certain patterns of attribute distribution, each node's neighborhood
should be not only depicted by multi-hop nodes, but consider certain clusters
or social circles. To model such information, in this paper, we propose a novel
ANE model, Context Co-occurrence-aware Attributed Network Embedding (CoANE).
The basic idea of CoANE is to model the context attributes that each node's
involved diverse patterns, and apply the convolutional mechanism to encode
positional information by treating each attribute as a channel. The learning of
context co-occurrence can capture the latent social circles of each node. To
better encode structural and semantic knowledge of nodes, we devise a three-way
objective function, consisting of positive graph likelihood, contextual
negative sampling, and attribute reconstruction. We conduct experiments on five
real datasets in the tasks of link prediction, node label classification, and
node clustering. The results exhibit that CoANE can significantly outperform
state-of-the-art ANE models.
Related papers
- Exact Recovery and Bregman Hard Clustering of Node-Attributed Stochastic
Block Model [0.16385815610837165]
This paper presents an information-theoretic criterion for the exact recovery of community labels.
It shows how network and attribute information can be exchanged in order to have exact recovery.
It also presents an iterative clustering algorithm that maximizes the joint likelihood.
arXiv Detail & Related papers (2023-10-30T16:46:05Z) - Collaborative Graph Neural Networks for Attributed Network Embedding [63.39495932900291]
Graph neural networks (GNNs) have shown prominent performance on attributed network embedding.
We propose COllaborative graph Neural Networks--CONN, a tailored GNN architecture for network embedding.
arXiv Detail & Related papers (2023-07-22T04:52:27Z) - SHGNN: Structure-Aware Heterogeneous Graph Neural Network [77.78459918119536]
This paper proposes a novel Structure-Aware Heterogeneous Graph Neural Network (SHGNN) to address the above limitations.
We first utilize a feature propagation module to capture the local structure information of intermediate nodes in the meta-path.
Next, we use a tree-attention aggregator to incorporate the graph structure information into the aggregation module on the meta-path.
Finally, we leverage a meta-path aggregator to fuse the information aggregated from different meta-paths.
arXiv Detail & Related papers (2021-12-12T14:18:18Z) - Explicit Pairwise Factorized Graph Neural Network for Semi-Supervised
Node Classification [59.06717774425588]
We propose the Explicit Pairwise Factorized Graph Neural Network (EPFGNN), which models the whole graph as a partially observed Markov Random Field.
It contains explicit pairwise factors to model output-output relations and uses a GNN backbone to model input-output relations.
We conduct experiments on various datasets, which shows that our model can effectively improve the performance for semi-supervised node classification on graphs.
arXiv Detail & Related papers (2021-07-27T19:47:53Z) - A Generative Node-attribute Network Model for Detecting Generalized
Structure [6.151348127802708]
We propose a principle model (named GNAN) which can generate both topology information and attribute information.
The new model can detect not only community structure, but also a range of other types of structure in networks.
Experiments on both synthetic and real-world networks show that the new model is competitive with other state-of-the-art models.
arXiv Detail & Related papers (2021-06-05T12:07:04Z) - Node Similarity Preserving Graph Convolutional Networks [51.520749924844054]
Graph Neural Networks (GNNs) explore the graph structure and node features by aggregating and transforming information within node neighborhoods.
We propose SimP-GCN that can effectively and efficiently preserve node similarity while exploiting graph structure.
We validate the effectiveness of SimP-GCN on seven benchmark datasets including three assortative and four disassorative graphs.
arXiv Detail & Related papers (2020-11-19T04:18:01Z) - Tree Structure-Aware Graph Representation Learning via Integrated
Hierarchical Aggregation and Relational Metric Learning [26.8738194817491]
We propose T-GNN, a tree structure-aware graph neural network model for graph representation learning.
The proposed T-GNN consists of two modules: (1) the integrated hierarchical aggregation module and (2) the relational metric learning module.
arXiv Detail & Related papers (2020-08-23T09:41:19Z) - Graph Prototypical Networks for Few-shot Learning on Attributed Networks [72.31180045017835]
We propose a graph meta-learning framework -- Graph Prototypical Networks (GPN)
GPN is able to perform textitmeta-learning on an attributed network and derive a highly generalizable model for handling the target classification task.
arXiv Detail & Related papers (2020-06-23T04:13:23Z) - Graph Neural Networks with Composite Kernels [60.81504431653264]
We re-interpret node aggregation from the perspective of kernel weighting.
We present a framework to consider feature similarity in an aggregation scheme.
We propose feature aggregation as the composition of the original neighbor-based kernel and a learnable kernel to encode feature similarities in a feature space.
arXiv Detail & Related papers (2020-05-16T04:44:29Z) - A Block-based Generative Model for Attributed Networks Embedding [42.00826538556588]
We propose a block-based generative model for attributed network embedding from a probability perspective.
We use a neural network to characterize the nonlinearity between node embeddings and node attributes.
The results show that our proposed method consistently outperforms state-of-the-art embedding methods for both clustering and classification tasks.
arXiv Detail & Related papers (2020-01-06T03:44:15Z)
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.