Identify influential spreaders in online social networks based on social meta path and PageRank

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86099088" target="_blank" >RIV/61989100:27240/16:86099088 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-319-42345-6_5" target="_blank" >http://dx.doi.org/10.1007/978-3-319-42345-6_5</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-42345-6_5" target="_blank" >10.1007/978-3-319-42345-6_5</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Identify influential spreaders in online social networks based on social meta path and PageRank

Popis výsledku v původním jazyce

Identifying "influential spreader" is finding a subset of individuals in the social network, so that when information injected into this subset, it is spread most broadly to the rest of the network individuals. The determination of the information influence degree of individual plays an important role in online social networking. Once there is a list of individuals who have high influence, the marketers can access these individuals and seek them to impress, bribe or somehow make them spread up the good information for their business as well as their product in marketing campaign. In this paper, according to the idea "Information can be spread between two unconnected users in the network as long as they both check-in at the same location", we proposed an algorithm called SMPRank (Social Meta Path Rank) to identify individuals with the largest influence in complex online social networks. The experimental results show that SMPRank performs better than Weighted LeaderRank because of the ability to determinate more influential spreaders. (C) Springer International Publishing Switzerland 2016.

Název v anglickém jazyce

Identify influential spreaders in online social networks based on social meta path and PageRank

Popis výsledku anglicky

Identifying "influential spreader" is finding a subset of individuals in the social network, so that when information injected into this subset, it is spread most broadly to the rest of the network individuals. The determination of the information influence degree of individual plays an important role in online social networking. Once there is a list of individuals who have high influence, the marketers can access these individuals and seek them to impress, bribe or somehow make them spread up the good information for their business as well as their product in marketing campaign. In this paper, according to the idea "Information can be spread between two unconnected users in the network as long as they both check-in at the same location", we proposed an algorithm called SMPRank (Social Meta Path Rank) to identify individuals with the largest influence in complex online social networks. The experimental results show that SMPRank performs better than Weighted LeaderRank because of the ability to determinate more influential spreaders. (C) Springer International Publishing Switzerland 2016.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2016

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). volume 9795

ISBN

978-3-319-42344-9

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

11

Strana od-do

51-61

Název nakladatele

Springer

Místo vydání

Cham

Místo konání akce

Ho Či Minovo Město

Datum konání akce

2. 8. 2016

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—