| Question asked
|
Given that SemRank has exponential time co … Given that SemRank has exponential time complexity and cannot be evaluated for larger data sets, what is an empirical evaluation of the top-K algorithm likely to reveal? The authors expect that it will produce an ordering that is reasonably close to SemRank, but they go on to mention that the refraction count can only be computed at the end of the path building phase (so, the refraction count of a child path does not predict the refraction count of a parent path). Did I read this correctly? This seems important, because the top-K approximation would be critical to any real-world application of the presented technique -- SemRank alone is clearly not suitable for discovery of associations in a large graph. iscovery of associations in a large graph.
|
