Thanks for your outstanding job! I am trying to use this HashGraphKernel to calculate similarities between a large number of graphs. However, the number of graphs is too large (about 20,000) to be processed (it will be killed because of out of memory). I want to separate them to avoid out of memory, but it seems some operations have to be taken for all graphs at the same time. Do you have any ideas to solve this problem?
Thanks for your outstanding job! I am trying to use this HashGraphKernel to calculate similarities between a large number of graphs. However, the number of graphs is too large (about 20,000) to be processed (it will be killed because of out of memory). I want to separate them to avoid out of memory, but it seems some operations have to be taken for all graphs at the same time. Do you have any ideas to solve this problem?