Fig. 1
From: Support vector machine with hypergraph-based pairwise constraints
Simple graph versus hypergraph. Left: an article set \(V = \{ v_{1} ,v_{2} ,v_{3} ,v_{4} ,v_{5} ,v_{6} ,v_{7} \}\) and an author set \(E = \{ e_{1} ,e_{2} ,e_{3} \}\). The element \((v_{i} ,e_{j} )\) is set to 1 if \(e_{j}\) is an author of article \(v_{i}\), and 0 otherwise. Middle: an undirected simple graph in which two articles are joined together by an edge if there is at least one author in common. While, this graph cannot tell us whether the same person is the author of three or more articles or not. Right: a hypergraph which could completely illustrate the high-order relationships among authors and articles