All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Representativeness in unweighted networks based on local dependency

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86096684" target="_blank" >RIV/61989100:27240/14:86096684 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/14:86096684

  • Result on the web

    <a href="http://dx.doi.org/10.1109/INCoS.2014.68" target="_blank" >http://dx.doi.org/10.1109/INCoS.2014.68</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/INCoS.2014.68" target="_blank" >10.1109/INCoS.2014.68</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Representativeness in unweighted networks based on local dependency

  • Original language description

    Structures of real-world networks show varying degrees of importance of the nodes in their surroundings. The topic of evaluating the importance of the nodes offers many different approaches. We present simple and straightforward approach for the evaluation of the nodes in undirected unweighted networks. The approach is based on x-representativeness measure which is originally intended for weighted networks. The x-representativeness takes into account the degree of the node and its nearest neighbors. Experiments with different real-world unweighted networks are presented. To apply the presented method it is necessary to transform undirected unweighted network into weighted network. Weights in our experiments are measured by dependency between adjacent nodes. The aim of these experiments is to show that the x-representativeness can be used to deterministically reduce the unweighted network to differently sized samples of representatives, while maintaining topological properties of the or

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>

  • Continuities

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

Others

  • Publication year

    2014

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings - 2014 International Conference on Intelligent Networking and Collaborative Systems, IEEE INCoS 2014

  • ISBN

    978-1-4799-6386-7

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    509-514

  • Publisher name

    Institute of Electrical and Electronics Engineers

  • Place of publication

    New York

  • Event location

    Salerno

  • Event date

    Sep 10, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article