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
Copy file name to clipboardExpand all lines: links.rst
+1-1
Original file line number
Diff line number
Diff line change
@@ -13,7 +13,7 @@ Basic appraoch that is using simmilarity computed between two vertices. `Measure
13
13
Basic measure based link prediction
14
14
+++++++++++++++++++++++++++++++++++++
15
15
16
-
Most basic implementation of measure based link prediction. All possible vertices combinations are computed for given graph. In next step, similarity measure is computed for each combination. Combinations that exsits or creates loops (self connections) are filtered out. Combinations that have similarity lower than given treshold are also filtered out. Implementation can be found in `BasicLinkPredictor <http://sparkling-graph.github.io/sparkling-graph/latest/api/#ml.sparkling.graph.operators.algorithms.link.BasicLinkPredictor$>`_
16
+
Most basic implementation of measure based link prediction. All possible vertices combinations are computed for given graph. In next step, similarity measure is computed for each combination. Combinations that exists or creates loops (self connections) are filtered out. Combinations that have similarity lower than given treshold are also filtered out. Implementation can be found in `BasicLinkPredictor <http://sparkling-graph.github.io/sparkling-graph/latest/api/#ml.sparkling.graph.operators.algorithms.link.BasicLinkPredictor$>`_
0 commit comments