-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgraph_embedding.py
More file actions
96 lines (66 loc) · 2.3 KB
/
graph_embedding.py
File metadata and controls
96 lines (66 loc) · 2.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
# -*- coding: utf-8 -*-
"""graph_embedding.ipynb
Automatically generated by Colab.
Original file is located at
https://colab.research.google.com/drive/1Co_aofH5liRg-xLdCBJpP0F0w16SkrsM
"""
# Import required packages
import networkx as nx
import random
#%pip install gensim
from gensim.models import Word2Vec
import numpy as np
import matplotlib.pyplot as plt
import time
# Create and draw graph
n = 10
p = 0.25
G = nx.erdos_renyi_graph(n, p, directed = True)
# outdated version
# nx.draw(G, with_labels = True)
nx.draw_networkx(G, with_labels = True)
plt.show()
# perform random walks in graph
def random_walk(graph:nx.Graph, start_node:int = 0, walk_length:int = 1) -> list[int]:
sequence = [str(start_node)]
for _ in range(walk_length):
neighbours = [neighbour for neighbour in graph.neighbors(start_node)]
if neighbours == []:
return sequence
selected_neighbour = random.choice(neighbours)
sequence.append(str(selected_neighbour))
start_node = selected_neighbour
return sequence
# example of random walks in graph
for _ in range(5):
print(random_walk(G, random.randrange(n), 10))
# create walks for Word2Vec
amount_walks = 200
length_per_walk = 20
dimension = 2
walks = []
for _ in range(amount_walks):
walks.append(random_walk(G, random.randrange(n), length_per_walk))
# Train Word2Vec model, play around with Word2Vec hyperparameters
model = Word2Vec(walks, vector_size = dimension, window = 2, sg = 1, min_count = 1)
model.train(walks, total_examples = model.corpus_count, epochs = 30, report_delay = 1)
# show results of node embedding
for node in range(n):
print(f"Node {node:2d}: {model.wv.get_vector(node)}")
"""
# compare to DeepWalk implementation from Karateclub
karate_model = DeepWalk(walk_length = length_per_walk, dimensions = dimension, window_size = 2)
karate_model.fit(G)
karate_embedding = karate_model.get_embedding()
for node in range(n):
print(f"Node {node:2d}: {karate_embedding[node]}")
"""
# testing for similarity of nodes
input_number = 0
while input_number != -1:
input_number = int(input("Similarity to which node would you like to check (enter -1 to exit): "))
if input_number != -1:
for node_details in model.wv.most_similar(positive = [input_number]):
print(node_details)
print()
time.sleep(5)