An algorithm exploits the near-Sylvester structure of meeting time equations to compute all pairwise expected meeting times on graphs in O(N^4) operations.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Improper use of test data during hyperparameter tuning in link prediction inflates performance estimates by an average of 3.6 percent across 60 networks, as measured by a new Loss Ratio metric.
citing papers explorer
-
Meeting times on graphs in near-cubic time
An algorithm exploits the near-Sylvester structure of meeting time equations to compute all pairwise expected meeting times on graphs in O(N^4) operations.
-
Impacts of Data Splitting Strategies on Parameterized Link Prediction Algorithms
Improper use of test data during hyperparameter tuning in link prediction inflates performance estimates by an average of 3.6 percent across 60 networks, as measured by a new Loss Ratio metric.