fixed workers for gensim

Author: Paul-Emile Dugnat

dynnode2vec/dynnode2vec.py

@@ -83,6 +83,9 @@ def __init__(
         self.parallel_processes = parallel_processes
         self.plain_node2vec = plain_node2vec
 
+        # see https://stackoverflow.com/questions/53417258/what-is-workers-parameter-in-word2vec-in-nlp
+        self.gensim_workers = max(self.parallel_processes - 1, 12)
+
     def _initialize_embeddings(self, graphs):
         """
         Compute normal node2vec embedding at timestep 0.
@@ -104,7 +107,7 @@ def _initialize_embeddings(self, graphs):
             min_count=0,
             sg=1,
             seed=self.seed,
-            workers=self.parallel_processes,
+            workers=self.gensim_workers,
         )
 
         embedding = Embedding(model.wv.vectors.copy(), model.wv.index_to_key.copy())
@@ -119,6 +122,10 @@ def find_evolving_nodes(current_graph, previous_graph):
         We compute the output of equation (1) of the paper, i.e.
         ∆V_t = V_add ∪ {v_i ∈ V_t | ∃e_i = (v_i, v_j) ∈ (E_add ∪ E_del)}
         """
+        # find V_add ie nodes that were added
+        added_nodes = {
+            n for n in current_graph.nodes() if n not in previous_graph.nodes()
+        }
 
         # find edges that were either added or removed between current and previous
         added_edges = {
@@ -129,11 +136,6 @@ def find_evolving_nodes(current_graph, previous_graph):
         }
         delta_edges = added_edges | removed_edges
 
-        # find V_add ie nodes that were added
-        added_nodes = {
-            n for n in current_graph.nodes() if n not in previous_graph.nodes()
-        }
-
         nodes_modified_edge = set(chain(*delta_edges)).intersection(
             current_graph.nodes()
         )
@@ -200,7 +202,7 @@ def _update_embeddings(self, time_walks, model, embeddings):
                     min_count=0,
                     sg=1,
                     seed=self.seed,
-                    workers=self.parallel_processes,
+                    workers=self.gensim_workers,
                 )
 
             else: