Preview

PDF Restricted - Request a copy 344Kb

We address a problem of identifying nodes having a high centrality value in a large social network based on its approximation derived only from nodes sampled from the network. More specifically, we detect gaps between nodes with a given confidence level, assuming that we can say a gap exists between two adjacent nodes ordered in descending order of approximations of true centrality values if it can divide the ordered list of nodes into two groups so that any node in one group has a higher centrality value than any one in another group with a given confidence level. To this end, we incorporate confidence intervals of true centrality values, and apply the resampling-based framework to estimate the intervals as accurately as possible. Furthermore, we devise an algorithm that can efficiently detect gaps by making only two passes through the nodes, and empirically show, using three real world social networks, that the proposed method can successfully detect more gaps, compared to the one adopting a standard error estimation framework, using the same node coverage ratio, and that the resulting gaps enable us to correctly identify a set of nodes having a high centrality value.

Item Type:	Refereed Conference Paper
Keywords:	gap analysis, error estimation, resampling, node centrality
Research Division:	Information and Computing Sciences
Research Group:	Distributed Computing
Research Field:	Networking and Communications
Objective Division:	Expanding Knowledge
Objective Group:	Expanding Knowledge
Objective Field:	Expanding Knowledge in the Information and Computing Sciences
Author:	Motoda, H (Dr Hiroshi Motoda)
ID Code:	109270
Year Published:	2015
Deposited By:	Computing and Information Systems
Deposited On:	2016-06-06
Last Modified:	2016-08-10
Downloads:	0