Weighted co-authorship network based on forgetting

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86080871" target="_blank" >RIV/61989100:27240/11:86080871 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-642-22309-9_9" target="_blank" >http://dx.doi.org/10.1007/978-3-642-22309-9_9</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-22309-9_9" target="_blank" >10.1007/978-3-642-22309-9_9</a>

Result language

angličtina

Original language name

Weighted co-authorship network based on forgetting

Original language description

In this paper we focus on the analysis of weighted networks and their properties. We describe a new way to weigh network vertices and edges based on the Forgetting curve. We denote the weight as a stability changing gradually over time. Based on the stability, we propose new measures. For our experiments we have selected the DBLP database, therefore we can evaluate our approach on a real network with more than 830,000 vertices.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GA102%2F09%2F1494" target="_blank" >GA102/09/1494: New methods od data transmition based on turbo code</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2011

Confidentiality

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

Name of the periodical

Communications in Computer and Information Science

ISSN

1865-0929

e-ISSN

—

Volume of the periodical

185

Issue of the periodical within the volume

2011

Country of publishing house

DE - GERMANY

Number of pages

8

Pages from-to

72-79

UT code for WoS article

—

EID of the result in the Scopus database

—