A new greedy sampling method, TCEC, uses spectral projection bounds to estimate eigenvector centrality rankings on incomplete networks and outperforms random-walk baselines on several real-world networks.
Effect of sampling on topology predic- tions of protein-protein interaction networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sampling on networks: estimating eigenvector centrality on incomplete graphs
A new greedy sampling method, TCEC, uses spectral projection bounds to estimate eigenvector centrality rankings on incomplete networks and outperforms random-walk baselines on several real-world networks.