Discovering Sets of Key Players in Social Networks

  • Ortiz-Arroyo D
N/ACitations
Citations of this article
62Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The discovery of single key players in social networks is commonly done using some of the centrality measures employed in social network analysis. However, few methods, aimed at discovering sets of key players, have been proposed in the literature. This chapter presents a brief survey of such methods. The methods described include a variety of techniques ranging from those based on traditional centrality measures using optimizing criteria to those based on measuring the efficiency of a network. Additionally, we describe and evaluate a new approach to discover sets of key players based on entropy measures. Finally, this chapter presents a brief description of some applications of information theory within social network analysis.

Cite

CITATION STYLE

APA

Ortiz-Arroyo, D. (2010). Discovering Sets of Key Players in Social Networks (pp. 27–47). https://doi.org/10.1007/978-1-84882-229-0_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free