You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We implemented a C++ capability to initiate an all-pairs similarity algorithms directly without first creating a list of 2-hop neighbors. This feature also adds a topk parameter which allows for executing the all-pairs computation in batches and only keeping the top k results. This would enable execution of all-pairs similarity algorithms on larger graphs (when the topk parameter is specified) than would otherwise be possible.
We implemented a C++ capability to initiate an all-pairs similarity algorithms directly without first creating a list of 2-hop neighbors. This feature also adds a topk parameter which allows for executing the all-pairs computation in batches and only keeping the top k results. This would enable execution of all-pairs similarity algorithms on larger graphs (when the topk parameter is specified) than would otherwise be possible.
Expose this feature through the python layer.
Dependent on #4470
The text was updated successfully, but these errors were encountered: