TY - JOUR
T1 - Hypergraph Collaborative Network on Vertices and Hyperedges
AU - Wu, Hanrui
AU - Yan, Yuguang
AU - Ng, Michael Kwok Po
N1 - The work of Hanrui Wu's was supported in part by the Fundamental Research Funds for the Central Universities under Grant 21622326. The work of Michael Kwok-Po Ng's was supported in part by the HKRGC GRF under Grants 12300218, 12300519, 17201020 and 17300021, in part by the HKRGC CRF under Grants C1013-21GF and C7004-21GF, in part by the Joint NSFCRGC N-HKU769/21 and in part by the HKU-TCL Joint Research Centre for Artificial Intelligence, Hong Kong.
Publisher Copyright:
© 2022 IEEE
PY - 2023/3/1
Y1 - 2023/3/1
N2 - In many practical datasets, such as co-citation and co-authorship, relationships across the samples are more complex than pair-wise. Hypergraphs provide a flexible and natural representation for such complex correlations and thus obtain increasing attention in the machine learning and data mining communities. Existing deep learning-based hypergraph approaches seek to learn the latent vertex representations based on either vertices or hyperedges from previous layers and focus on reducing the cross-entropy error over labeled vertices to obtain a classifier. In this paper, we propose a novel model called Hypergraph Collaborative Network (HCoN), which takes the information from both previous vertices and hyperedges into consideration to achieve informative latent representations and further introduces the hypergraph reconstruction error as a regularizer to learn an effective classifier. We evaluate the proposed method on two cases, i.e., semi-supervised vertex and hyperedge classifications. We carry out the experiments on several benchmark datasets and compare our method with several state-of-the-art approaches. Experimental results demonstrate that the performance of the proposed method is better than that of the baseline methods.
AB - In many practical datasets, such as co-citation and co-authorship, relationships across the samples are more complex than pair-wise. Hypergraphs provide a flexible and natural representation for such complex correlations and thus obtain increasing attention in the machine learning and data mining communities. Existing deep learning-based hypergraph approaches seek to learn the latent vertex representations based on either vertices or hyperedges from previous layers and focus on reducing the cross-entropy error over labeled vertices to obtain a classifier. In this paper, we propose a novel model called Hypergraph Collaborative Network (HCoN), which takes the information from both previous vertices and hyperedges into consideration to achieve informative latent representations and further introduces the hypergraph reconstruction error as a regularizer to learn an effective classifier. We evaluate the proposed method on two cases, i.e., semi-supervised vertex and hyperedge classifications. We carry out the experiments on several benchmark datasets and compare our method with several state-of-the-art approaches. Experimental results demonstrate that the performance of the proposed method is better than that of the baseline methods.
KW - Edge classification
KW - hypergraph
KW - hypergraph convolution
KW - vertex classification
UR - http://www.scopus.com/inward/record.url?scp=85141337477&partnerID=8YFLogxK
U2 - 10.1109/TPAMI.2022.3178156
DO - 10.1109/TPAMI.2022.3178156
M3 - Journal article
C2 - 35617188
AN - SCOPUS:85141337477
SN - 0162-8828
VL - 45
SP - 3245
EP - 3258
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
JF - IEEE Transactions on Pattern Analysis and Machine Intelligence
IS - 3
ER -