Сбор влиятельных вершин — сравнительное исследование краулеров социальных сетей (Денис Айвазов, ISPRASOPEN-2019) — различия между версиями

{{SlidesSection}}
[[File:Сбор влиятельных вершин — сравнительное исследование краулеров социальных сетей (Денис Айвазов, ISPRASOPEN-2019).pdf|left|page=-|300px]]

{{----}}
[[File:{{#setmainimage:Сбор влиятельных вершин — сравнительное исследование краулеров социальных сетей (Денис Айвазов, ISPRASOPEN-2019)!.jpg}}|center|640px]]
{{LinksSection}}
<!-- * [ Talks page on site] -->
<!-- <blockquote>[©]</blockquote> -->

{{vklink|1595}}                                          
{{fblink|2557560997830239}}                                          
<references/>





<!-- topub -->

[[Категория:ISPRASOPEN-2019]]
[[Категория:Алгоритмы на графах]]
[[Категория:Рекомендательные системы]]
{{stats|disqus_comments=56|refresh_time=2020-01-28T12:06:432021-08-31T18:19:38.564355539868|vimeo_plays=924|youtube_comments=1|youtube_plays=0}}31}}

Текущая версия на 12:23, 4 сентября 2021

Докладчик

Денис Айвазов

Online network crawling tasks require a lot of efforts for the researchers to collect the data. One of them is identification of important nodes, which has many applications starting from viral marketing to the prevention of disease spread. Various crawling algorithms has been suggested but their efficiency is not studied well. In this paper we compared six known crawlers on the task of collecting the fraction of the most influential nodes of graph.

We analyzed crawlers behavior for four measures of node influence: node degree, k-coreness, betweenness centrality, and eccentricity. The experiments confirmed that greedy methods perform the best in many settings, but the cases exist when they are very inefficient.

Видео

on youtube

Презентация

Примечания и ссылки

• Discuss on VK
• Discuss on Facebook

Plays:55   Comments:7