Assessment of ranking algorithms in complex networks

Journal Title: Computer Science and Mathematical Modelling - Year 2017, Vol 0, Issue 5

Abstract

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.

Authors and Affiliations

Paweł Wołoszyn

Keywords

Related Articles

Modelling quantum register disentanglement

Implementing quantum-inspired algorithms on classical computers suffers trade-off between the necessity of saving operational memory and the amount of memory necessary to fully represent a quantum state with possible ent...

Multiple criteria mechanisms supporting clinical decisions making in the model of the repository based on the patterns

In this paper opportunities of usage diagnostics conclusion mechanisms based on patterns defined in multi criteria patient’s medical data space were introduced. Such mechanisms might be used in medical resolve’s supporti...

O kilku warunkach zapewniających interoperacyjność systemów informacyjnych i informatycznych

W treści opracowania, wychodząc od kilku popularnych określeń pojęcia „interoperacyjność”, przedstawiono krótką dyskusję tego pojęcia w odniesieniu do systemów informacyjnych i systemów informatycznych. Następnie sformu...

Metody badania wybranych usług dodanych w sieciach rozległych

W publikacji przedstawiono wybrane usługi dodane wykorzystywane w sieciach rozległych, a także scharakteryzowano podstawowe typy architektur sieci, w których posiadają one zastosowanie. Omówiono również metody formalnego...

Download PDF file
  • EP ID EP231037
  • DOI 10.5604/01.3001.0010.5521
  • Views 114
  • Downloads 0

How To Cite

Paweł Wołoszyn (2017). Assessment of ranking algorithms in complex networks. Computer Science and Mathematical Modelling, 0(5), 45-51. https://europub.co.uk/articles/-A-231037