Efficient visualization of social networks based on modified Sammon's mapping

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86096489" target="_blank" >RIV/61989100:27240/15:86096489 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/15:86096489

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.swevo.2015.10.002" target="_blank" >http://dx.doi.org/10.1016/j.swevo.2015.10.002</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.swevo.2015.10.002" target="_blank" >10.1016/j.swevo.2015.10.002</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Efficient visualization of social networks based on modified Sammon's mapping

Popis výsledku v původním jazyce

Visualization is an important part of Network Analysis. It helps to find features of the network that are not easily identifiable. In this paper, we present a novel approach to the visualization of weighted networks based on the Distance Geometry Problem. The network may be seen as a set of data points in space induced by the incidence relation or as a symmetric matrix of vertex distances. We propose two methods for construction of the input for Sammon's mapping and discuss the effect of the particularmethods on the final layout. In this work, we use Differential Evolution as a real-parameter optimization metaheuristic algorithm to minimize the error function used in Sammon's mapping. The presented experiments used the well-known Zachary's Karate Clubnetwork and weighted co-authors network based on the DBLP database. We present our approach to the visualization of weighted networks based on Sammon's mapping and linear approximation. Dimensionality reduction and graph based visualizat

Název v anglickém jazyce

Efficient visualization of social networks based on modified Sammon's mapping

Popis výsledku anglicky

Visualization is an important part of Network Analysis. It helps to find features of the network that are not easily identifiable. In this paper, we present a novel approach to the visualization of weighted networks based on the Distance Geometry Problem. The network may be seen as a set of data points in space induced by the incidence relation or as a symmetric matrix of vertex distances. We propose two methods for construction of the input for Sammon's mapping and discuss the effect of the particularmethods on the final layout. In this work, we use Differential Evolution as a real-parameter optimization metaheuristic algorithm to minimize the error function used in Sammon's mapping. The presented experiments used the well-known Zachary's Karate Clubnetwork and weighted co-authors network based on the DBLP database. We present our approach to the visualization of weighted networks based on Sammon's mapping and linear approximation. Dimensionality reduction and graph based visualizat

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: Centrum excelence IT4Innovations</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Swarm and Evolutionary Computation

ISSN

2210-6502

e-ISSN

—

Svazek periodika

25

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

9

Strana od-do

63-71

Kód UT WoS článku

000367860600007

EID výsledku v databázi Scopus

2-s2.0-84952630152