Survey on Hypergraph Learning: Algorithm Classification and Application Analysis

被引：0
|
作者：
Hu B.-D. [1 ]
Wang X.-G. [1 ]
Wang X.-Y. [1 ]
Song M.-L. [1 ]
Chen C. [1 ]
机构：
[1] College of Computer Science and Technology, Zhejiang University, Hangzhou
来源：
Ruan Jian Xue Bao/Journal of Software | 2022年 / 33卷 / 02期
关键词：
Expansion; Hypergraph learning; Neural network; Non-expansion; Spectral analysis;
D O I：
10.13328/j.cnki.jos.006353
中图分类号：
学科分类号：
摘要：
With the rise of graph structured data mining, hypergraph, as a special type of graph structured data, is widely concerned in social network analysis, image processing, biological response analysis, and other fields. By analyzing the topological structure and node attributes of hypergraph, many problemscan be effectively solved such as recommendation, community detection, and so on. According to the characteristics of hypergraph learning algorithm, it can be divided into spectral analysis method, neural network method, and other method. According to the methods used to process hypergraphs, it can be further divided into expansion method and non-expansion method. If the expansion method is applied to the indecomposable hypergraph, it is likely to cause information loss. However, the existing hypergraph reviews do not discuss that hypergraph learning methods are applicable to which type of hypergraphs. So, this article discusses the expansion method and non-expansion method respectively from the aspects of spectral analysis method and neural network method, and further subdivides them according to their algorithm characteristics and application scenarios. Then, the ideas of different algorithms are analyzed and comparedin experiments. The advantages and disadvantages of different algorithms are concluded. Finally, some promising research directionsare proposed. © Copyright 2022, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：498 / 523
页数：25
相关论文
共 86 条
  • [1] Karypis G, Aggarwal R, Kumar V, Et al., Multilevel hypergraph partitioning: Applications in VLSI domain, IEEE Trans. on Very Large Scale Integration (VLSI) Systems, 7, 1, pp. 69-79, (1999)
  • [2] Karypis G, Kumar V., Multilevel k-way hypergraph partitioning, VLSI Design, 11, 3, pp. 285-300, (2000)
  • [3] Eiter T, Gottlob G., Identifying the minimal transversals of a hypergraph and related problems, SIAM Journal on Computing, 24, 6, pp. 1278-1304, (1995)
  • [4] Sun L, Ji S, Ye J., Hypergraph spectral learning for multi-label classification, Proc. of the 14th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pp. 668-676, (2008)
  • [5] Carletti T, Battiston F, Cencetti G, Et al., Random walks on hypergraphs, Physical Review E, 101, 2-1, (2020)
  • [6] Huang Y, Liu Q, Metaxas D., Video object segmentation by hypergraph cut, Proc. of the 2009 IEEE Conf. on Computer Vision and Pattern Recognition, pp. 1738-1745, (2009)
  • [7] Gao Y, Wang M, Tao D, Et al., 3-D object retrieval and recognition with hypergraph analysis, IEEE Trans. on Image Processing, 21, 9, pp. 4290-4303, (2012)
  • [8] Agarwal S, Branson K, Belongie S., Higher order learning with graphs, Proc. of the 23rd Int'l Conf. on Machine Learning, pp. 17-24, (2006)
  • [9] Jiang J, Wei Y, Feng Y, Et al., Dynamic hypergraph neural networks, Proc. of the IJCAI, pp. 2635-2641, (2019)
  • [10] Tu K, Cui P, Wang X, Et al., Structural deep embedding for hyper-networks, Proc. of the AAAI Conf. on Artificial Intelligence, (2018)
123456789