A Dynamic Vote-Rank Based Approach for Effective Sequential Initialization of Information Spreading Processes Within Complex Networks
| Autor: | Patryk Pazura, Jarosław Jankowski, Radosław Michalski, Kamil Bortko |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Computer science
Process (engineering) Rank (computer programming) Initialization 020206 networking & telecommunications 02 engineering and technology Complex network computer.software_genre Key factors Viral marketing Ranking 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Data mining computer Selection (genetic algorithm) |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783030503703 ICCS (1) |
| DOI: | 10.1007/978-3-030-50371-0_47 |
| Popis: | Seed selection is one of the key factors influencing information spread within networks. Whereas most solutions are based on single-stage seeding at the beginning of the process, performance increases when additional seeds are used. This enables the acquisition of knowledge about ongoing processes and activating new nodes for further influence maximisation. This paper describes an approach based on the Vote-Rank algorithm with dynamic rankings for sequential seed selection. The results prove the increased performance of dynamic rankings compared to the static version and show how the frequency of ranking updates affects both performance and computational costs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|