An Information Theory Approach to Identify Sets of Key Players

Authors:
Daniel Ortiz-Arroyo;D. M. Hussain
Affiliations:
Computer Science and Engineering Department, Aalborg University, Esbjerg, Denmark 6700;Computer Science and Engineering Department, Aalborg University, Esbjerg, Denmark 6700
Venue:
EuroISI '08 Proceedings of the 1st European Conference on Intelligence and Security Informatics
Year:
2008

Citing 3
Cited 0

An algorithm for drawing general undirected graphs

Information Processing Letters
Identifying sets of key players in a social network

Computational & Mathematical Organization Theory
Discovering important nodes through graph entropy the case of Enron email database

Proceedings of the 3rd international workshop on Link discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an application of information theory to identify sets of key players in social networks. First, we define two entropy measures that we use to analyze the structural properties of a social network. Then, we propose a new method aimed at finding a set of key players that solves the KPP-Neg and KPP-Pos problems. Our preliminary experimental results indicate that the entropy measures can be used effectively to identify a set of key players in a social network.