首页 | 官方网站   微博 | 高级检索  
     

超图学习综述:算法分类与应用分析
引用本文:胡秉德,王新根,王新宇,宋明黎,陈纯. 超图学习综述:算法分类与应用分析[J]. 软件学报, 2022, 33(2): 498-523. DOI: 10.13328/j.cnki.jos.006353
作者姓名:胡秉德  王新根  王新宇  宋明黎  陈纯
作者单位:浙江大学 计算机科学与技术学院, 浙江 杭州 310007
基金项目:广东省重点领域研发计划(2020B0101100005); 浙江省重点研发计划(2021C01014)
摘    要:随着图结构化数据挖掘的兴起,超图作为一种特殊的图结构化数据,在社交网络分析、图像处理、生物反应解析等领域受到广泛关注.研究者通过解析超图中的拓扑结构与节点属性等信息,能够有效解决实际应用场景中所遇到的如兴趣推荐、社群划分等问题.根据超图学习算法的设计特点,将其划分为谱分析方法和神经网络方法,根据方法对超图处理的不同手段...

关 键 词:超图学习  谱分析  神经网络  展开  非展开
收稿时间:2020-08-07
修稿时间:2020-09-30

Survey on Hypergraph Learning: Algorithm Classification and Application Analysis
HU Bing-De,WANG Xin-Gen,WANG Xin-Yu,SONG Ming-Li,CHEN Chun. Survey on Hypergraph Learning: Algorithm Classification and Application Analysis[J]. Journal of Software, 2022, 33(2): 498-523. DOI: 10.13328/j.cnki.jos.006353
Authors:HU Bing-De  WANG Xin-Gen  WANG Xin-Yu  SONG Ming-Li  CHEN Chun
Affiliation:College of Computer Science and Technology, Zhejiang University, Hangzhou 310007, China
Abstract: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.
Keywords:hypergraph learning  spectral analysis  neural network  expansion  non-expansion
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号