About: Comparison of Local and Global Ranking in Networks

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Comparison of Local and Global Ranking in Networks Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://link.springer.com/chapter/10.1007%2F978-3-319-08156-4_35
Description	Many real world data and processes have a network structure and can usefully be represented as graphs. Network analysis focuses on the relations among the nodes exploring the properties of each network. Latest trend in analyzing networks is to focus on local methods and parallelization. We introduce a method to find the ranking of the nodes. The approach extracts dependency relations among the network’s nodes. Key technical parameter of the approach is locality. Since only the surrounding of examined nodes is used in computations, there is no need to analyze the entire network. We compare this proposed local ranking to the global ranking of PageRank. We present experiment using large-scale artificial and real world networks. The results of experiment show high effectiveness due to the locality of our approach and also high quality of node ranking comparable to PageRank. Many real world data and processes have a network structure and can usefully be represented as graphs. Network analysis focuses on the relations among the nodes exploring the properties of each network. Latest trend in analyzing networks is to focus on local methods and parallelization. We introduce a method to find the ranking of the nodes. The approach extracts dependency relations among the network’s nodes. Key technical parameter of the approach is locality. Since only the surrounding of examined nodes is used in computations, there is no need to analyze the entire network. We compare this proposed local ranking to the global ranking of PageRank. We present experiment using large-scale artificial and real world networks. The results of experiment show high effectiveness due to the locality of our approach and also high quality of node ranking comparable to PageRank. (en)
Title	Comparison of Local and Global Ranking in Networks Comparison of Local and Global Ranking in Networks (en)
skos:prefLabel	Comparison of Local and Global Ranking in Networks Comparison of Local and Global Ranking in Networks (en)
skos:notation	RIV/61989100:27740/14:86092439!RIV15-MSM-27740___
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(ED1.1.00/02.0070), P(EE.2.3.20.0072), S
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Snášel, Václav Krömer, Pavel Kudělka, Miloš
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / IT4Innovations
http://linked.open...dnocenehoVysledku	8113
http://linked.open...ai/riv/idVysledku	RIV/61989100:27740/14:86092439
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	ranking; node weighting; graphs; dependency; complex networks (en)
http://linked.open.../riv/klicoveSlovo	graphs complex networks dependency ranking node weighting
http://linked.open...ontrolniKodProRIV	[30B7E0B34E52]
http://linked.open...v/mistoKonaniAkce	Ostrava
http://linked.open...i/riv/mistoVydani	Berlin Heidelberg
http://linked.open...i/riv/nazevZdroje	Advances in Intelligent Systems and Computing. Volume 303
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	IT4Innovations Centre of Excellence Development of human resources in research and development of latest soft computing methods and their application in practice
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Horák, Zdeněk Krömer, Pavel Snášel, Václav Kudělka, Miloš Zehnalová, Šárka
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000342841800035
http://linked.open.../riv/zahajeniAkce	2014-06-23 (xsd:date)
issn	2194-5357
number of pages	10 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-319-08156-4_35
http://purl.org/ne...btex#hasPublisher	Springer-Verlag. (Berlin; Heidelberg)
https://schema.org/isbn	978-3-319-08155-7
http://localhost/t...ganizacniJednotka	27740

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software