Skip to main navigation Skip to search Skip to main content

Shattering and compressing networks for betweenness centrality

  • Ohio State University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

38 Scopus citations

Abstract

The betweenness metric has always been intriguing and used in many analyses. Yet, it is one of the most computationally expensive kernels in graph mining. For that reason, making betweenness centrality computations faster is an important and well-studied problem. In this work, we propose the framework, BADIOS, which compresses a network and shatters it into pieces so that the centrality computation can be handled independently for each piece. Although BADIOS is designed and tuned for betweenness centrality, it can easily be adapted for other centrality metrics. Experimental results show that the proposed techniques can be a great arsenal to reduce the centrality computation time for various types and sizes of networks. In particular, it reduces the computation time of a 4.6 million edges graph from more than 5 days to less than 16 hours.

Original languageEnglish
Title of host publicationProceedings of the 2013 SIAM International Conference on Data Mining, SDM 2013
EditorsJoydeep Ghosh, Zoran Obradovic, Jennifer Dy, Zhi-Hua Zhou, Chandrika Kamath, Srinivasan Parthasarathy
PublisherSiam Society
Pages686-694
Number of pages9
ISBN (Electronic)9781611972627
DOIs
StatePublished - 2013
EventSIAM International Conference on Data Mining, SDM 2013 - Austin, United States
Duration: May 2 2013May 4 2013

Publication series

NameProceedings of the 2013 SIAM International Conference on Data Mining, SDM 2013

Conference

ConferenceSIAM International Conference on Data Mining, SDM 2013
Country/TerritoryUnited States
CityAustin
Period05/2/1305/4/13

Keywords

  • Betweenness centrality
  • Graph mining
  • Network analysis

Fingerprint

Dive into the research topics of 'Shattering and compressing networks for betweenness centrality'. Together they form a unique fingerprint.

Cite this