Nohup sh run_gae.sh pubmed > log_run_gae_pubmed.txt 2>&1 & Nohup sh run_gae.sh citeseer > log_run_gae_citeseer.txt 2>&1 & Nohup sh run_gae.sh cora > log_run_gae_cora.txt 2>&1 & Nohup sh run_gae.sh tencent > log_run_gae_tencent.txt 2>&1 & Nohup sh run_graphsage.sh pubmed > log_run_graphsage_pubmed.txt 2>&1 & Nohup sh run_graphsage.sh citeseer > log_run_graphsage_citeseer.txt 2>&1 & Nohup sh run_graphsage.sh cora > log_run_graphsage_cora.txt 2>&1 & Nohup sh run_graphsage.sh tencent > log_run_graphsage_tencent.txt 2>&1 & Nohup sh run_gcn.sh pubmed > log_run_gcn_pubmed.txt 2>&1 & Nohup sh run_gcn.sh citeseer > log_run_gcn_citeseer.txt 2>&1 & Nohup sh run_gcn.sh cora > log_run_gcn_cora.txt 2>&1 & Nohup sh run_gcn.sh tencent > log_run_gcn_tencent.txt 2>&1 & Nohup sh run_node2vec.sh pubmed > log_run_node2vec_pubmed.txt 2>&1 & Nohup sh run_node2vec.sh citeseer > log_run_node2vec_citeseer.txt 2>&1 & A bipartite graph is a graph in which the vertices can be put into two separate groups so that the only edges are between those two groups, and there are no edges between vertices within the same. Nohup sh run_node2vec.sh cora > log_run_node2vec_cora.txt 2>&1 & Nohup sh run_node2vec.sh tencent > log_run_node2vec_tencent.txt 2>&1 & Nohup sh run_abcgraph_mlp.sh pubmed > log_run_abcgraph_mlp_pubmed.txt 2>&1 & Nohup sh run_abcgraph_mlp.sh citeseer > log_run_abcgraph_mlp_citeseer.txt 2>&1 & Equivalently, a bipartite graph is a graph that. Vertex sets U and V are usually called the parts of the graph. Nohup sh run_abcgraph_mlp.sh cora > log_run_abcgraph_mlp_cora.txt 2>&1 & In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V, that is every edge connects a vertex in U to one in V. Nohup sh run_abcgraph_mlp.sh tencent > log_run_abcgraph_mlp_tencent.txt 2>&1 & A bipartite graph is a graph in which the vertex set, V, can be partitioned into two subsets, X and Y, such that each edge of the graph has one vertex in X and one vertex in Y. Nohup sh run_abcgraph_adv.sh pubmed > log_run_abcgraph_adv_pubmed.txt 2>&1 &
Nohup sh run_abcgraph_adv.sh citeseer > log_run_abcgraph_adv_citeseer.txt 2>&1 & Nohup sh run_abcgraph_adv.sh cora > log_run_abcgraph_adv_cora.txt 2>&1 & Nohup sh run_abcgraph_adv.sh tencent > log_run_abcgraph_adv_tencent.txt 2>&1 & From the other datasets, we can see that our model's performance is better than the GAE model. To apply GAE to the large-scale graph data is another research topic, so we don't report the result in the "Tencent" dataset.
#Bipartite graph code#
N/A (*): For the GAE model, the code of the original GAE paper can not simply applied to the large-scale bipartite graph due to the memory constrain. In this construction, the bipartite graph is the bipartite double cover of the directed graph.Only Linux (*): For the Node2Vec model, its binary file is only ELF 64-bit LSB executable, x86-64, for GNU/Linux. In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets \displaystyle, which can then be reinterpreted as the adjacency matrix of a bipartite graph with n vertices on each side of its bipartition. A complete bipartite graph with m = 5 and n = 3
0 kommentar(er)
