scispace - formally typeset
Proceedings ArticleDOI

Towards many-objective optimization of eigenvector centrality in multiplex networks

Asep Maulana, +1 more
- pp 0729-0734
TLDR
This paper proposes a new approach in identifying a network centrality based on a many-objective optimization approach, where the nodes are the potential points to be selected and the objectives are their centrality in the different layers of the network.
Abstract
Network centrality plays an important role in network analysis — especially in social and economic network analysis such as identification of the most popular actor and artist in the Hollywood community, or to find the most influential scientist in a citation network, or politician in democratic elections. Furthermore, finding an important player for the growth of economics in a region can be important to improve future welfare, or to find important hubs for spreading an important message in crisis management. Many algorithms have been proposed to identify a set of key players in a single network. But in the real world with more complicated data sets we need not only to identify a single player but a set of key players. Moreover, we may have to use different types of links simultaneously, e.g., different social networks, in order to define how influential a node is. This situation can be modelled by multiplex network data. For a multiplex network the set of nodes stays the same, while there are multiple sets of edges. The utilization of such information can be viewed as a multiple objective decision analysis problem. In this paper, we propose a new approach in identifying a network centrality based on a many-objective optimization approach, where the nodes are the potential points to be selected and the objectives are their centrality in the different layers of the network. This yields a new approach to analyse network centrality in multiplex network. For this approach, we propose to compute the Pareto fronts of network centrality of nodes, where maximization of centrality in layer defines its own objective. As a case study, we compute the Pareto fronts for model problems with artificial network and real networks for economic data sets to show on how to find the network centrality trade-offs between different layers and identify efficient sets of key nodes.

read more

Citations
More filters
Journal ArticleDOI

Betweenness Centrality in Large Complex Networks

TL;DR: In this article, the authors analyzed the betweenness centrality of nodes in large complex networks and showed that for trees or networks with a small loop density, a larger density of loops leads to the same result.
Proceedings ArticleDOI

Centrality-Based Anomaly Detection on Multi-Layer Networks Using Many-Objective Optimization

TL;DR: A key feature of the proposed approach is its interpretability and explainability, since it can directly assess anomalous nodes with respect to the network topology, since the centrality of each layer in the network is measured.
Journal ArticleDOI

Many-Objective Optimization for Anomaly Detection on Multi-Layer Complex Interaction Networks

TL;DR: This paper focuses on detecting anomalies in multi-layer complex networks, where the problem of finding sets of anomalous nodes for group anomaly detection is considered, and proposes a centrality-based many-objective optimization on multi- layer networks based on the Pareto Front.
References
More filters
Journal ArticleDOI

Centrality in social networks conceptual clarification

TL;DR: In this article, three distinct intuitive notions of centrality are uncovered and existing measures are refined to embody these conceptions, and the implications of these measures for the experimental study of small groups are examined.
Proceedings Article

The PageRank Citation Ranking : Bringing Order to the Web

TL;DR: This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
Journal ArticleDOI

Factoring and weighting approaches to status scores and clique identification

TL;DR: In this paper, Factoring and weighting approaches to status scores and clique identification were proposed, and the results showed that the weighting approach is more accurate than the factoring approach.
Journal ArticleDOI

A Graph-theoretic perspective on centrality

TL;DR: This paper develops a unified framework for the measurement of centrality and shows centrality to be intimately connected with the cohesive subgroup structure of a network.
Journal ArticleDOI

Eigenvector-like measures of centrality for asymmetric relations

TL;DR: An alternative measure of centrality is suggested that equals an eigenvector when eigenvectors can be used and provides meaningfully comparable results when they cannot.
Related Papers (5)