超图
成对比较
计算机科学
图形
理论计算机科学
人工智能
数学
离散数学
作者
Naganand Yadati,Madhav Nimishakavi,Prateek Yadav,Vikram Nitin,Anand Louis,Partha Talukdar
出处
期刊:Ludwig Maximilian University of Munich - Munich Personal RePEc Archive
日期:2019-01-01
卷期号:32: 1509-1520
被引量:62
摘要
In many real-world networks such as co-authorship, co-citation, etc., relationships are complex and go beyond pairwise associations. Hypergraphs provide a flexible and natural modeling tool to model such complex relationships. The obvious existence of such complex relationships in many real-world networks naturally motivates the problem of learning with hypergraphs. A popular learning paradigm is hypergraph-based semi-supervised learning (SSL) where the goal is to assign labels to initially unlabelled vertices in a hypergraph. Motivated by the fact that a graph convolutional network (GCN) has been effective for graph-based SSL, we propose HyperGCN, a novel way of training a GCN for SSL on hypergraphs based on tools from sepctral theory of hypergraphs. We demonstrate HyperGCN's effectiveness through detailed experimentation on real-world hypergraphs for SSL and combinatorial optimisation and analyse when it is going to be more effective than state-of-the art baselines. We have made the source code available.
科研通智能强力驱动
Strongly Powered by AbleSci AI