-
Hi!
I tried to use VERSE to visualize a not-so-large (nv: 23463, ne: 35923) well-clustered graph. I used PPR version with `--dim 2` (Total steps (mil): 2346.3) and then used two dimensions as `x` and…
-
### Additional comment:
_No response_
-
## 🚀 Feature
We are asked for distributed (metapath-based) random walk support so I'm bookkeeping the issue here.
## Motivation
Large-scale network embedding for the following:
- [ ] DeepWalk
-…
-
I executed harp coding on a windows OS and using sfdp_windows.exe, but it failed. Since subprocess.call function that applies graph_coarsening based on sfdp_windows.exe returns a non-zero value.
-
Nice article! However, the CSV data referenced in the notebook does not match the data in the repository. Can the `named_entities.csv` file used in the notebook be provided as well?
-
## Is your feature request related to a problem? Please describe.
Would be good to standardize conventions for certain parameters/descriptions during our effort to improve the API.
For example, fo…
-
## Is your feature request related to a problem? Please describe.
The following is an issue to wrap up a bunch of specific items that will be tracked independently later, but we agreed in principle t…
-
Thank you for the great code. I have a question about the way you generate the random walks. It seems that the weights of the edges do not have any effect (i.e., the nodes are selected based on a rand…
-
The first walk path of each nodes is unchanging after init in `Node2Vec.initTransitionProb` module.
``` scala
graph = Graph(indexedNodes, indexedEdges)
.mapVertices[NodeAttr] { case (v…
-
Hello!
I want to try to apply the algorithm on a set of graphs, and I don't want to introduce extra links to connected the data. I would be really grateful if you can share your opinion, whether I ca…