Fetching the paper…
Reading the bibliography…
We present ABRA, a suite of algorithms that compute and maintain probabilistically-guaranteed, high-quality, approximations of the betweenness centrality of all nodes (or edges) on both static and fully dynamic graphs.
The rush in a directed graph
J. M. Anthonisse · 1971
Earlier work this paper cites.
A set of measures of centrality based on betweenness
L. C. Freeman · 1977
Earlier work this paper cites.
Convergence of stochastic processes
D. Pollard · 1984
Earlier work this paper cites.
Decision theoretic generalizations of the PAC model for neural net and other learning applications
D. Haussler · 1992
Earlier work this paper cites.
A result of Vapnik with applications
M. Anthony and J. Shawe-Taylor · 1993
Earlier work this paper cites.
Neural Network Learning - Theoretical Foundations
M. Anthony and P. L. Bartlett · 1999
Earlier work this paper cites.
An inequality for uniform deviations of sample averages from their means
P. L. Bartlett and G. Lugosi · 1999
Earlier work this paper cites.
The Nature of Statistical Learning Theory
V. N. Vapnik · 1999
Earlier work this paper cites.
Improved bounds on the sample complexity of learning
Y. Li, P. M. Long, and A. Srinivasan · 2000
Earlier work this paper cites.
A faster algorithm for betweenness centrality
U. Brandes · 2001
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Theory of classification : A survey of some recent advances
S. Boucheron, O. Bousquet, and G. Lugosi · 2005
Earlier work this paper cites.
Approximating betweenness centrality
D. A. Bader, S. Kintali, K. Madduri, and M. Mihail · 2007
Cited alongside, same era.
Centrality estimation in large networks
U. Brandes and C. Pich · 2007
Cited alongside, same era.
Better approximation of betweenness centrality
R. Geisberger, P. Sanders, and D. Schultes · 2008
Cited alongside, same era.
Shape fitting on point sets with probability distributions
M. Löffler and J. M. Phillips · 2009
Cited alongside, same era.
Networks – An Introduction
M. E. J. Newman · 2010
Cited alongside, same era.
Relative ( p , ε ) (p,\varepsilon) -approximations in geometry
S. Har-Peled and M. Sharir · 2011
Cited alongside, same era.
A fast algorithm for streaming betweenness centrality
Shattering and compressing networks for betweenness centrality
A. E. Sarıyüce, E. Saule, K. Kaya, and U. V. Çatalyürek · 2013
Later among the works it cites.
A deep connection between the Vapnik-Chervonenkis entropy and the Rademacher complexity
D. Anguita, A. Ghio, L. Oneto, and S. Ridella · 2014
Later among the works it cites.
SNAP Datasets: Stanford large network dataset collection
J. Leskovec and A. Krevl · 2014
Later among the works it cites.
Understanding Machine Learning: From Theory to Algorithms
S. Shalev-Shwartz and S. Ben-David · 2014
Later among the works it cites.
NetworKit: An interactive tool suite for high-performance network analysis
C. Staudt, A. Sazonovs, and H. Meyerhenke · 2014
Later among the works it cites.
Approximating betweenness centrality in large evolving networks
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
O. Green, R. McColl, and D. Bader · 2012
Cited alongside, same era.
QUBE: A quick algorithm for updating betweenness centrality
M.-J. Lee, J. Lee, J. Y. Park, R. H. Choi, and C.-W. Chung · 2012
Cited alongside, same era.
Relative deviation learning bounds and generalization with unbounded loss functions
C. Cortes, S. Greenberg, and M. Mohri · 2013
Cited alongside, same era.
Incremental algorithm for updating betweenness centrality in dynamically growing networks
M. Kas, M. Wachs, K. M. Carley, and L. R. Carley · 2013
Cited alongside, same era.
An improved analysis of the Rademacher data-dependent bound using its self bounding property
L. Oneto, A. Ghio, D. Anguita, and S. Ridella · 2013
Cited alongside, same era.
Fully-dynamic approximation of betweenness centrality
E. Bergamini and H. Meyerhenke
Cited in the paper.
E. Bergamini, H. Meyerhenke, and C. L. Staudt · 2015
Later among the works it cites.
A divide-and-conquer algorithm for betweenness centrality
D. Erdős, V. Ishakian, A. Bestavros, and E. Terzi · 2015
Later among the works it cites.
Fully dynamic betweenness centrality maintenance on massive networks
T. Hayashi, T. Akiba, and Y. Yoshida · 2015
Later among the works it cites.
Scalable online betweenness centrality in evolving graphs
N. Kourtellis, G. D. F. Morales, and F. Bonchi · 2015
Later among the works it cites.
Fast approximation of betweenness centrality through sampling
M. Riondato and E. M. Kornaropoulos · 2015
Later among the works it cites.
Mining frequent itemsets through progressive sampling with Rademacher averages
M. Riondato and E. Upfal · 2015
Later among the works it cites.