Xi Zeng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xi Zeng has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Fangyuan Lei
Guangdong Provincial Key Laboratory of Intellectual Property Big Data, Guangdong Polytechnic Normal University, Guangzhou, China
2 shared publications - Da Huang
Faculty of Applied Sciences, Macao Polytechnic University, Macao, China
1 shared publication - Jiahao Huang
Guangdong Provincial Key Laboratory of Intellectual Property and Big Data, Guangdong Polytechnic Normal University, Guangzhou, China
1 shared publication - Jianjian Jiang
Guangdong Provincial Key Laboratory of Intellectual Property and Big Data, Guangdong Polytechnic Normal University, Guangzhou, China
1 shared publication - Qingyun Dai
Guangdong Provincial Key Laboratory of Intellectual Property and Big Data, Guangdong Polytechnic Normal University, Guangzhou, China
1 shared publication - Ruijun Ma
College of Engineering, South China Agricultural University, Guangzhou, China
1 shared publication
Latest Publications
- Open Access
- 27 February 2023
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 9 (5) , 5049-5062
SimGRL: a simple self-supervised graph representation learning framework via triplets
Recently, graph contrastive learning (GCL) has achieved remarkable performance in graph representation learning. However, existing GCL methods usually follow a dual-channel encoder network (i.e., Siamese networks), which adds to the complexity of the network architecture. Additionally, these methods overly depend on varied data augmentation techniques, corrupting graph information. Furthermore, they are heavily reliant on large quantities of negative nodes for each object node, which requires tremendous memory costs. To address these issues, we propose a novel and simple graph representation learning framework, named SimGRL. Firstly, our proposed network architecture only contains one encoder based on a graph neural network instead of a dual-channel encoder, which simplifies the network architecture. Then we introduce a distributor to generate triplets to obtain the contrastive views between nodes and their neighbors, avoiding the need for data augmentations. Finally, we design a triplet loss based on adjacency information in graphs that utilizes only one negative node for each object node, reducing memory overhead significantly. Extensive experiments demonstrate that SimGRL achieves competitive performance on node classification and graph classification tasks, especially in terms of running time and memory overhead.
- 27 February 2023
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 9 (5) , 5049-5062
Open AccessSimGRL: a simple self-supervised graph representation learning framework via triplets
Recently, graph contrastive learning (GCL) has achieved remarkable performance in graph representation learning. However, existing GCL methods usually follow a dual-channel encoder network (i.e., Siamese networks), which adds to the complexity of the network architecture. Additionally, these methods overly depend on varied data augmentation techniques, corrupting graph information. Furthermore, they are heavily reliant on large quantities of negative nodes for each object node, which requires tremendous memory costs. To address these issues, we propose a novel and simple graph representation learning framework, named SimGRL. Firstly, our proposed network architecture only contains one encoder based on a graph neural network instead of a dual-channel encoder, which simplifies the network architecture. Then we introduce a distributor to generate triplets to obtain the contrastive views between nodes and their neighbors, avoiding the need for data augmentations. Finally, we design a triplet loss based on adjacency information in graphs that utilizes only one negative node for each object node, reducing memory overhead significantly. Extensive experiments demonstrate that SimGRL achieves competitive performance on node classification and graph classification tasks, especially in terms of running time and memory overhead.
- Open Access
- 9 January 2023
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 9 (4) , 4389-4401
Multi-order hypergraph convolutional networks integrated with self-supervised learning
Hypergraphs, as a powerful representation of information, effectively and naturally depict complex and non-pair-wise relationships in the real world. Hypergraph representation learning is useful for exploring complex relationships implicit in hypergraphs. However, most methods focus on the 1-order neighborhoods and ignore the higher order neighborhood relationships among data on the hypergraph structure. These often result in underutilization of hypergraph structure. In this paper, we exploit the potential of higher order neighborhoods in hypergraphs for representation and propose a Multi-Order Hypergraph Convolutional Network Integrated with Self-supervised Learning. We first encode the multi-channel network of the hypergraph by a high-order spectral convolution operator that captures the multi-order representation of nodes. Then, we introduce an inter-order attention mechanism to preserve the low-order neighborhood information. Finally, to extract valid embedding in the higher order neighborhoods, we incorporate a self-supervised learning strategy based on maximizing mutual information in the multi-order hypergraph convolutional network. Experiments on several hypergraph datasets show that the proposed model is competitive with state-of-the-art baselines, and ablation studies show the effectiveness of higher order neighborhood development, the inter-order attention mechanism, and the self-supervised learning strategy.
- 9 January 2023
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 9 (4) , 4389-4401
Open AccessMulti-order hypergraph convolutional networks integrated with self-supervised learning
Hypergraphs, as a powerful representation of information, effectively and naturally depict complex and non-pair-wise relationships in the real world. Hypergraph representation learning is useful for exploring complex relationships implicit in hypergraphs. However, most methods focus on the 1-order neighborhoods and ignore the higher order neighborhood relationships among data on the hypergraph structure. These often result in underutilization of hypergraph structure. In this paper, we exploit the potential of higher order neighborhoods in hypergraphs for representation and propose a Multi-Order Hypergraph Convolutional Network Integrated with Self-supervised Learning. We first encode the multi-channel network of the hypergraph by a high-order spectral convolution operator that captures the multi-order representation of nodes. Then, we introduce an inter-order attention mechanism to preserve the low-order neighborhood information. Finally, to extract valid embedding in the higher order neighborhoods, we incorporate a self-supervised learning strategy based on maximizing mutual information in the multi-order hypergraph convolutional network. Experiments on several hypergraph datasets show that the proposed model is competitive with state-of-the-art baselines, and ablation studies show the effectiveness of higher order neighborhood development, the inter-order attention mechanism, and the self-supervised learning strategy.