Heterogeneous Hypergraph Embedding for Graph Classification
- Publisher:
- ACM
- Publication Type:
- Conference Proceeding
- Citation:
- WSDM '21: Proceedings of the 14th ACM International Conference on Web Search and Data Mining, 2021, pp. 725-733
- Issue Date:
- 2021-03-08
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 3437963.3441835.pdf | Published version | 2.64 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Recently, graph neural networks have been widely used for network embedding because of their prominent performance in pairwise relationship learning. In the real world, a more natural and common situation is the coexistence of pairwise relationships and complex non-pairwise relationships, which is, however, rarely studied. In light of this, we propose a graph neural network-based representation learning framework for heterogeneous hypergraphs, an extension of conventional graphs, which can well characterize multiple non-pairwise relations. Our framework first projects the heterogeneous hypergraph into a series of snapshots and then we take the Wavelet basis to perform localized hypergraph convolution. Since the Wavelet basis is usually much sparser than the Fourier basis, we develop an efficient polynomial approximation to the basis to replace the time-consuming Laplacian decomposition. Extensive evaluations have been conducted and the experimental results show the superiority of our method. In addition to the standard tasks of network embedding evaluation such as node classification, we also apply our method to the task of spammers detection and the superior performance of our framework shows that relationships beyond pairwise are also advantageous in the spammer detection. To make our experiment repeatable, source codes and related datasets are available at https://xiangguosun.mystrikingly.com
Please use this identifier to cite or link to this item: