Estimating the size of generalized transitive closures
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Fast approximation of centrality
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Graph-based technologies for intelligence analysis
Communications of the ACM - Homeland security
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
Ranking of Closeness Centrality for Large-Scale Social Networks
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Fast centrality approximation in modular networks
Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management
Modeling betweenness for question answering
ESAIR '10 Proceedings of the third workshop on Exploiting semantic annotations in information retrieval
Finding the achilles heel of the web of data: using network analysis for link-recommendation
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
K-path centrality: a new centrality measure in social networks
Proceedings of the 4th Workshop on Social Network Systems
GBASE: a scalable and general graph management system
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Performance analysis of an algorithm for computation of betweenness centrality
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
The Combinatorial BLAS: design, implementation, and applications
International Journal of High Performance Computing Applications
Proceedings of the 2011 companion on High Performance Computing Networking, Storage and Analysis Companion
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
A novel measure of edge centrality in social networks
Knowledge-Based Systems
QUBE: a quick algorithm for updating betweenness centrality
Proceedings of the 21st international conference on World Wide Web
A highway-centric labeling approach for answering distance queries on large sparse graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Elixir: a system for synthesizing concurrent graph programs
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
gbase: an efficient analysis platform for large graphs
The VLDB Journal — The International Journal on Very Large Data Bases
Large-scale energy-efficient graph traversal: a path to efficient data-intensive supercomputing
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
NUMA-aware graph mining techniques for performance and energy efficiency
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Betweenness centrality: algorithms and implementations
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Ligra: a lightweight graph processing framework for shared memory
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Fast Exact Computation of betweenness Centrality in Social Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Efficient single-source shortest path and distance queries on large graphs
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Resilience of dynamic overlays through local interactions
Proceedings of the 22nd international conference on World Wide Web companion
A statistical framework for streaming graph analysis
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
An efficient algorithm for approximate betweenness centrality computation
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Fast approximation of betweenness centrality through sampling
Proceedings of the 7th ACM international conference on Web search and data mining
MODM: multi-objective diffusion model for dynamic social networks using evolutionary algorithm
The Journal of Supercomputing
Automatic skill acquisition in reinforcement learning using graph centrality measures
Intelligent Data Analysis
A random projection approach for estimation of the betweenness centrality measure
Intelligent Data Analysis
| Hi-index | 0.00 |
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently the fastest-known algorithm by Brandes requires O(nm) time for unweighted graphs and O(nm + n2 log n) time for weighted graphs, where n is the number of vertices and m is the number of edges in the network. These are also the worstcase time bounds for computing the betweenness score of a single vertex. In this paper, we present a novel approximation algorithm for computing betweenness centrality of a given vertex, for both weighted and unweighted graphs. Our approximation algorithm is based on an adaptive sampling technique that significantly reduces the number of single-source shortest path computations for vertices with high centrality. We conduct an extensive experimental study on real-world graph instances, and observe that our random sampling algorithm gives very good betweenness approximations for biological networks, road networks and web crawls.