Assessment of ranking algorithms in complex networks
Computer Science and Mathematical Modelling · 2017
DOI: 10.5604/01.3001.0010.5521 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Science and Mathematical Modelling, 2017. Verfasst von Paweł Wołoszyn. Die Arbeit nennt 12 Literaturangaben.
Abstract (Originalsprache)
A particularly helpful search of a network such as the Internet or a citation network not only finds nodes that satisfy some criteria but also ranks those nodes for importance to create what amounts to a “reading list”. In the recent past, there has been a large interest across a number of research communities in the analysis of complex networks. The selected set of pages from the World Wide Web can be modeled as a directed graph, where nodes are designated as individual pages, and the links as a connection between them. As the number of webpages to be ranked is in the billions, the computation is time-consuming and can take several days or more. Algorithms like PageRank, HITS, SALSA and their modifications has a challenge to deal with the size of the processed data. The need for accelerated algorithms is clear. This article presents the characteristics of three best known ranking algorithms and the assumptions for new algorithm development with first test runs.
Zitieren
APA
Wołoszyn, P. (2017). Assessment of ranking algorithms in complex networks. Computer Science and Mathematical Modelling. https://doi.org/10.5604/01.3001.0010.5521
Vancouver
Wołoszyn P. Assessment of ranking algorithms in complex networks. Computer Science and Mathematical Modelling. 2017. doi:10.5604/01.3001.0010.5521
BibTeX
@article{Wooszyn2017,
author = {Wołoszyn, Paweł},
title = {Assessment of ranking algorithms in complex networks},
journal = {Computer Science and Mathematical Modelling},
year = {2017},
doi = {10.5604/01.3001.0010.5521}
}
EUVIMED