BiTe-GCN: A New GCN Architecture via BidirectionalConvolution of
Topology and Features on Text-Rich Networks
- URL: http://arxiv.org/abs/2010.12157v2
- Date: Thu, 4 Mar 2021 23:06:38 GMT
- Title: BiTe-GCN: A New GCN Architecture via BidirectionalConvolution of
Topology and Features on Text-Rich Networks
- Authors: Di Jin, Xiangchen Song, Zhizhi Yu, Ziyang Liu, Heling Zhang, Zhaomeng
Cheng, Jiawei Han
- Abstract summary: BiTe-GCN is a novel GCN architecture with bidirectional convolution of both topology and features on text-rich networks.
Our new architecture outperforms state-of-the-art by a breakout improvement.
This architecture can also be applied to several e-commerce searching scenes such as JD searching.
- Score: 44.74164340799386
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Graph convolutional networks (GCNs), aiming to integrate high-order
neighborhood information through stacked graph convolution layers, have
demonstrated remarkable power in many network analysis tasks. However,
topological limitations, including over-smoothing and local topology homophily,
limit its capability to represent networks. Existing studies only perform
feature convolution on network topology, which inevitably introduces unbalance
between topology and features. Considering that in real world, the information
network consists of not only the node-level citation information but also the
local text-sequence information. We propose BiTe-GCN, a novel GCN architecture
with bidirectional convolution of both topology and features on text-rich
networks to solve these limitations. We first transform the original text-rich
network into an augmented bi-typed heterogeneous network, capturing both the
global node-level information and the local text-sequence information from
texts. We then introduce discriminative convolution mechanisms to performs
convolutions of both topology and features simultaneously. Extensive
experiments on text-rich networks demonstrate that our new architecture
outperforms state-of-the-art by a breakout improvement. Moreover, this
architecture can also be applied to several e-commerce searching scenes such as
JD searching. The experiments on the JD dataset validate the superiority of the
proposed architecture over the related methods.
Related papers
- Topological Graph Signal Compression [7.836468889756101]
We propose a novel TDL-based method for compressing signals over graphs.
Our results show that our framework improves both standard GNN and feed-forward architectures.
arXiv Detail & Related papers (2023-08-21T22:26:21Z) - TeKo: Text-Rich Graph Neural Networks with External Knowledge [75.91477450060808]
We propose a novel text-rich graph neural network with external knowledge (TeKo)
We first present a flexible heterogeneous semantic network that incorporates high-quality entities.
We then introduce two types of external knowledge, that is, structured triplets and unstructured entity description.
arXiv Detail & Related papers (2022-06-15T02:33:10Z) - BSAL: A Framework of Bi-component Structure and Attribute Learning for
Link Prediction [33.488229191263564]
We propose a bicomponent structural and attribute learning framework (BSAL) that is designed to adaptively leverage information from topology and feature spaces.
BSAL constructs a semantic topology via the node attributes and then gets the embeddings regarding the semantic view.
It provides a flexible and easy-to-implement solution to adaptively incorporate the information carried by the node attributes.
arXiv Detail & Related papers (2022-04-18T03:12:13Z) - DPGNN: Dual-Perception Graph Neural Network for Representation Learning [21.432960458513826]
Graph neural networks (GNNs) have drawn increasing attention in recent years and achieved remarkable performance in many graph-based tasks.
Most existing GNNs are based on the message-passing paradigm to iteratively aggregate neighborhood information in a single topology space.
We present a novel message-passing paradigm, based on the properties of multi-step message source, node-specific message output, and multi-space message interaction.
arXiv Detail & Related papers (2021-10-15T05:47:26Z) - Neural Network Layer Algebra: A Framework to Measure Capacity and
Compression in Deep Learning [0.0]
We present a new framework to measure the intrinsic properties of (deep) neural networks.
While we focus on convolutional networks, our framework can be extrapolated to any network architecture.
arXiv Detail & Related papers (2021-07-02T13:43:53Z) - Spatio-Temporal Inception Graph Convolutional Networks for
Skeleton-Based Action Recognition [126.51241919472356]
We design a simple and highly modularized graph convolutional network architecture for skeleton-based action recognition.
Our network is constructed by repeating a building block that aggregates multi-granularity information from both the spatial and temporal paths.
arXiv Detail & Related papers (2020-11-26T14:43:04Z) - Multi-Level Graph Convolutional Network with Automatic Graph Learning
for Hyperspectral Image Classification [63.56018768401328]
We propose a Multi-level Graph Convolutional Network (GCN) with Automatic Graph Learning method (MGCN-AGL) for HSI classification.
By employing attention mechanism to characterize the importance among spatially neighboring regions, the most relevant information can be adaptively incorporated to make decisions.
Our MGCN-AGL encodes the long range dependencies among image regions based on the expressive representations that have been produced at local level.
arXiv Detail & Related papers (2020-09-19T09:26:20Z) - Dual-constrained Deep Semi-Supervised Coupled Factorization Network with
Enriched Prior [80.5637175255349]
We propose a new enriched prior based Dual-constrained Deep Semi-Supervised Coupled Factorization Network, called DS2CF-Net.
To ex-tract hidden deep features, DS2CF-Net is modeled as a deep-structure and geometrical structure-constrained neural network.
Our network can obtain state-of-the-art performance for representation learning and clustering.
arXiv Detail & Related papers (2020-09-08T13:10:21Z) - AM-GCN: Adaptive Multi-channel Graph Convolutional Networks [85.0332394224503]
We study whether Graph Convolutional Networks (GCNs) can optimally integrate node features and topological structures in a complex graph with rich information.
We propose an adaptive multi-channel graph convolutional networks for semi-supervised classification (AM-GCN)
Our experiments show that AM-GCN extracts the most correlated information from both node features and topological structures substantially.
arXiv Detail & Related papers (2020-07-05T08:16:03Z)
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.