Hypergraph Collaborative Network on Vertices and Hyperedges

被引:27
|
作者
Wu, Hanrui [1 ]
Yan, Yuguang [2 ]
Ng, Michael Kwok-Po [3 ]
机构
[1] Jinan Univ, Coll Informat Sci & Technol, Guangzhou 510006, Peoples R China
[2] Guangdong Univ Technol, Sch Comp, Guangzhou 510006, Peoples R China
[3] Univ Hong Kong, Dept Math, Hong Kong, Peoples R China
关键词
Standards; Correlation; Convolution; Collaborative work; Task analysis; Data models; Training; Edge classification; hypergraph; hypergraph convolution; vertex classification;
D O I
10.1109/TPAMI.2022.3178156
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:3245 / 3258
页数:14
相关论文
共 50 条
  • [1] Co-clustering Vertices and Hyperedges via Spectral Hypergraph Partitioning
    Zhu, Yu
    Li, Boning
    Segarra, Santiago
    29TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO 2021), 2021, : 1416 - 1420
  • [2] The partition of a uniform hypergraph into pairs of dependent hyperedges
    Lehel, J
    DISCRETE MATHEMATICS, 1997, 163 (1-3) : 313 - 318
  • [4] Dynamic hypergraph neural networks based on key hyperedges
    Kang, Xiaojun
    Li, Xinchuan
    Yao, Hong
    Li, Dan
    Jiang, Bo
    Peng, Xiaoyue
    Wu, Tiejun
    Qi, Shihua
    Dong, Lijun
    INFORMATION SCIENCES, 2022, 616 : 37 - 51
  • [5] Hypergraph Convolution on Nodes-Hyperedges Network for Semi-Supervised Node Classification
    Wu, Hanrui
    Ng, Michael K.
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2022, 16 (04)
  • [6] Hypergraph Convolutional Network With Multiple Hyperedges Fusion for Hyperspectral Image Classification Under Limited Samples
    Wang, Yuxiang
    Xue, Zhaohui
    Jia, Mingming
    Liu, Zhiwei
    Su, Hongjun
    IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2024, 62
  • [7] On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs
    Keller, Chaya
    Keszegh, Balazs
    PalvolgyiI, Domotor
    ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (03):
  • [8] Hypergraph partitioning with fixed vertices
    Alpert, CJ
    Caldwell, AE
    Kahng, AB
    Markov, IL
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2000, 19 (02) : 267 - 272
  • [9] ON A CERTAIN NUMBERING OF THE VERTICES OF A HYPERGRAPH
    NEBESKY, L
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1983, 33 (01) : 1 - 6
  • [10] Hypergraph Joint Representation Learning for Hypervertices and Hyperedges via Cross Expansion
    Yan, Yuguang
    Chen, Yuanlin
    Wang, Shibo
    Wu, Hanrui
    Cai, Ruichu
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 8, 2024, : 9232 - 9240