Discovering B-coupling relationships in the bipartite hypergraph through link prediction in the unimodal graph

There are great demands in various applications on discovering unknown relationships in graphs that have not been found yet or will appear in the near future. The B-coupling relationship is one of predictable relationships in bipartite graphs. Some previous works predict B-coupling relationships by using a unimodal graph. The unimodal graph includes only one node type where links denote B-coupling relationships in the original bipartite graph. In some previous works, there are some restrictions because they consider bipartite graphs including only simple edges. However, in the real world, there are many applications to be modeled by hyperedges. In this paper, we propose a method that predicts B-coupling relationships in a bipartite graph including hyperedges. Moreover, we also recommend coupling nodes by using predicted links in the unimodal graph. We show through various experiments that our B-coupling prediction outperforms other method proposed earlier.