Home // AFIN 2012, The Fourth International Conference on Advances in Future Internet // View article

Finding Betweenness in Dense Unweighted Graphs

Authors:
Brandeis Marshall
Anuya Ghanekar

Keywords: social network analysis; betweenness centrality; social networking graph model.

Abstract:
Social network analysis (SNA) aims to identify and better determine the relationship amongst data in a graph representation.The interpretation of several core SNA measures, degree, closeness and betweenness centrality of a node, have been the subject of extensive research in recent years. We concentrate on the betweenness property, which seeks to determine the relatedness of more than 2 nodes. We propose our betweenness in unweighted graph algorithm and compare it to the k-path centrality algorithm on two image collections. By design, our proposed algorithm is less restrictive with the ability to consider any subset of nodes for betweenness. Our findings also show our proposed algorithm has a much shorter execution time as compared to the k-path centrality algorithm.

Pages: 14 to 19

Copyright: Copyright (c) IARIA, 2012

Publication date: August 19, 2012

Published in: conference

ISSN: 2308-4340

ISBN: 978-1-61208-211-0

Location: Rome, Italy

Dates: from August 19, 2012 to August 24, 2012