Node2vec is a method for graph embedding that can be used for tasks such as node classification, community discovery, and connection prediction.
First, let us load the required Python library and execute the following code to load the Cora dataset:
import networkx as nx import numpy as np import pandas as pd import matplotlib.pyplot as plt %matplotlib inline from sklearn.manifold import TSNE from node2vec import Node2Vec # 加载Cora数据集 cora = pd.read_csv('cora/cora.content', sep='\t', header=None) cited_in = pd.read_csv('cora/cora.cites', sep='\t', header=None, names=['target', 'source']) nodes, features = cora.iloc[:, :-1], cora.iloc[:, -1]
Among them, cora.content
contains all node feature information, with a total of 2708 nodes and 1433 features; and cora.cites
creates a node for each node through citation mapping. There are 5429 directed edge relationships between them. Next, we need to merge node features and reference information to build the graph structure.
# 定义函数:构造基于Cora数据集的图结构 def create_graph(nodes, features, cited_in): nodes.index = nodes.index.map(str) graph = nx.from_pandas_edgelist(cited_in, source='source', target='target') for index, row in nodes.iterrows(): node_id = str(row[0]) features = row.drop(labels=[0]) node_attrs = {f'attr_{i}': float(x) for i, x in enumerate(features)} if graph.has_node(node_id) == True: temp = graph.nodes[node_id] temp.update(node_attrs) graph.add_nodes_from([(node_id, temp)]) else: graph.add_nodes_from([(node_id, node_attrs)]) return graph # 构建图 graph = create_graph(nodes, features, cited_in)
This function integrates the node features in cora.content
with the directed edges of cora.cites
and labels them on the graph. Now we have built a graphical view that allows us to visualize our ideas.
In order to perform node feature classification, we need to extract some information from the network and pass it as input to the classifier. One example is to use the node 2 vector method to convert the extracted information into a vector expression so that each node has at least one dimension.
By randomly walking samples from the starting node to the target node, the Node2Vec model learns the vector representing each node. The node 2Vec model defines the transition probabilities between nodes during the random walk.
We will use the node2vec library to generate an embedding representation of the graph and employ a neural network for node classification.
# 定义函数:创建基于Cora数据集的嵌入 def create_embeddings(graph): # 初始化node2vec实例,指定相关超参数 n2v = Node2Vec(graph, dimensions=64, walk_length=30, num_walks=200, p=1, q=1, weight_key='attr_weight') # 基于指定参数训练得到嵌入向量表达式 model = n2v.fit(window=10, min_count=1, batch_words=4) # 获得所有图中节点的嵌入向量 embeddings = pd.DataFrame(model.wv.vectors) ids = list(map(str, model.wv.index2word)) # 将原有的特征和id与新获取到的嵌入向量按行合并 lookup_table = nodes.set_index(0).join(embeddings.set_index(embeddings.index)) return np.array(lookup_table.dropna().iloc[:, -64:]), np.array(list(range(1, lookup_table.shape[0] + 1))) # 创建嵌入向量 cora_embeddings, cora_labels = create_embeddings(graph)
Through the above code, we can obtain the 64-dimensional node embedding expression of each node.
Next we will specify some classifiers and train them on the Cora dataset in order to perform accurate node classification operations based on embeddings.
from sklearn import svm, model_selection, metrics # 使用支持向量机作为示范的分类器 svm_model = svm.SVC(kernel='rbf', C=1, gamma=0.01) # 进行交叉验证和分类训练 scores = model_selection.cross_val_score( svm_model, cora_embeddings, cora_labels, cv=5) print(scores.mean())
In order to obtain better performance, when the support vector machine is used as a classifier, we also need to perform related parameter adjustment operations. Here, a 5-fold cross-validation method is used to evaluate its performance.
In order to better understand, we need to reduce the dimensionality of the 64-dimensional feature expression that is difficult for humans to understand to achieve visualization. t-SNE is a method specifically designed to reduce the complexity of high-dimensional data, and we use it here. It generates a two-dimensional graph in which similar nodes are closely clustered together, and this graph is achieved by outputting a probability distribution vector containing only two elements.
# 定义函数:可视化Nodes2Vec的结果 def visualize_results(embeddings, labels): # 使用t-SNE对数据进行降维并绘图 tsne = TSNE(n_components=2, verbose=1, perplexity=40, n_iter=300) tsne_results = tsne.fit_transform(embeddings) plt.figure(figsize=(10, 5)) plt.scatter(tsne_results[:,0], tsne_results[:,1], c=labels) plt.colorbar() plt.show() # 可视化结果 visualize_results(cora_embeddings, cora_labels)
The embedding vector generated by Node2Vec will be input into t-SNE, where t-SNE reduces the dimensionality of the 64-dimensional vector expression and outputs a two-dimensional scatter plot that we can visualize using the matplotlib library. Whether most relevant nodes are tightly clustered can be checked in the graphical interface.
The above is the detailed content of How to implement node classification and visualization in python based on Node2Vec. For more information, please follow other related articles on the PHP Chinese website!