A Performance of Centrality Calculation in Social Networks

To analyze large social networks a lot of effort and resources are usually required. Network analysis offers many centrality measures that are successfully utilized in the process of investigating the social network characteristics. One of them is node position, which can be used to assess the impor...

Full description

Saved in:
Bibliographic Details
Main Authors: Brodka, P., Musial, K., Kazienko, P.
Format: Conference Proceeding
Language:English
Subjects:
algorithm efficiency
Approximation algorithms
centrality
Communities
Complex networks
Data mining
Equations
node position
PIN algorithm
Probability density function
social network analysis
Social network services
social networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:To analyze large social networks a lot of effort and resources are usually required. Network analysis offers many centrality measures that are successfully utilized in the process of investigating the social network characteristics. One of them is node position, which can be used to assess the importance of a given node within either the whole social network or the smaller subgroup. Three algorithms that can be utilized in the process of node position evaluation are presented in the paper: PIN edges, PIN nodes, and PIN hybrid. Also, different algorithms for indegree and outdegree prestige measures have been developed and tested. According to the experiments performed, the algorithms based on processing of edges are always faster than the others.
DOI:10.1109/CASoN.2009.20