DySuse: Susceptibility Estimation in Dynamic Social Networks
Influence estimation aims to predict the total influence spread in social networks and has received surged attention in recent years. Most current studies focus on estimating the total number of influenced users in a social network, and neglect susceptibility estimation that aims to predict the prob...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2023-08 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Shi, Yingdan Zhou, Jingya Zhang, Congcong |
description | Influence estimation aims to predict the total influence spread in social networks and has received surged attention in recent years. Most current studies focus on estimating the total number of influenced users in a social network, and neglect susceptibility estimation that aims to predict the probability of each user being influenced from the individual perspective. As a more fine-grained estimation task, susceptibility estimation is full of attractiveness and practical value. Based on the significance of susceptibility estimation and dynamic properties of social networks, we propose a task, called susceptibility estimation in dynamic social networks, which is even more realistic and valuable in real-world applications. Susceptibility estimation in dynamic networks has yet to be explored so far and is computationally intractable to naively adopt Monte Carlo simulation to obtain the results. To this end, we propose a novel end-to-end framework DySuse based on dynamic graph embedding technology. Specifically, we leverage a structural feature module to independently capture the structural information of influence diffusion on each single graph snapshot. Besides, {we propose the progressive mechanism according to the property of influence diffusion,} to couple the structural and temporal information during diffusion tightly. Moreover, a self-attention block {is designed to} further capture temporal dependency by flexibly weighting historical timestamps. Experimental results show that our framework is superior to the existing dynamic graph embedding models and has satisfactory prediction performance in multiple influence diffusion models. |
doi_str_mv | 10.48550/arxiv.2308.10442 |
format | Article |
fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2308_10442</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2854680601</sourcerecordid><originalsourceid>FETCH-LOGICAL-a521-a829bc65634d09855a4a8c9e8a5eae70459440adc1fb689de7c5f13ee443536b3</originalsourceid><addsrcrecordid>eNotj0tLw0AYRQdBsNT-AFcOuE6cdybiRvpQoeii3YcvkwlMTZM4M1Hz742tm3s3l8s5CN1QkgotJbkH_-O-UsaJTikRgl2gGeOcJlowdoUWIRwIIUxlTEo-Q4-rcTcE-4CnNLaPrnSNiyNeh-iOEF3XYtfi1djC0Rm864yDBr_Z-N35j3CNLmtogl389xztN-v98iXZvj-_Lp-2CUhGE9AsL42SiouK5BMjCNAmtxqkBZsRIXMhCFSG1qXSeWUzI2vKrRWCS65KPke359uTWtH7icyPxZ9icVKcFnfnRe-7z8GGWBy6wbcTU8G0FEoTRSj_BWh5U0g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2854680601</pqid></control><display><type>article</type><title>DySuse: Susceptibility Estimation in Dynamic Social Networks</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Shi, Yingdan ; Zhou, Jingya ; Zhang, Congcong</creator><creatorcontrib>Shi, Yingdan ; Zhou, Jingya ; Zhang, Congcong</creatorcontrib><description>Influence estimation aims to predict the total influence spread in social networks and has received surged attention in recent years. Most current studies focus on estimating the total number of influenced users in a social network, and neglect susceptibility estimation that aims to predict the probability of each user being influenced from the individual perspective. As a more fine-grained estimation task, susceptibility estimation is full of attractiveness and practical value. Based on the significance of susceptibility estimation and dynamic properties of social networks, we propose a task, called susceptibility estimation in dynamic social networks, which is even more realistic and valuable in real-world applications. Susceptibility estimation in dynamic networks has yet to be explored so far and is computationally intractable to naively adopt Monte Carlo simulation to obtain the results. To this end, we propose a novel end-to-end framework DySuse based on dynamic graph embedding technology. Specifically, we leverage a structural feature module to independently capture the structural information of influence diffusion on each single graph snapshot. Besides, {we propose the progressive mechanism according to the property of influence diffusion,} to couple the structural and temporal information during diffusion tightly. Moreover, a self-attention block {is designed to} further capture temporal dependency by flexibly weighting historical timestamps. Experimental results show that our framework is superior to the existing dynamic graph embedding models and has satisfactory prediction performance in multiple influence diffusion models.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2308.10442</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Computer Science - Artificial Intelligence ; Computer Science - Learning ; Computer Science - Social and Information Networks ; Diffusion barriers ; Embedding ; Estimation ; Monte Carlo simulation ; Social networks</subject><ispartof>arXiv.org, 2023-08</ispartof><rights>2023. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://creativecommons.org/licenses/by-nc-nd/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2308.10442$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1016/j.eswa.2023.121042$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Shi, Yingdan</creatorcontrib><creatorcontrib>Zhou, Jingya</creatorcontrib><creatorcontrib>Zhang, Congcong</creatorcontrib><title>DySuse: Susceptibility Estimation in Dynamic Social Networks</title><title>arXiv.org</title><description>Influence estimation aims to predict the total influence spread in social networks and has received surged attention in recent years. Most current studies focus on estimating the total number of influenced users in a social network, and neglect susceptibility estimation that aims to predict the probability of each user being influenced from the individual perspective. As a more fine-grained estimation task, susceptibility estimation is full of attractiveness and practical value. Based on the significance of susceptibility estimation and dynamic properties of social networks, we propose a task, called susceptibility estimation in dynamic social networks, which is even more realistic and valuable in real-world applications. Susceptibility estimation in dynamic networks has yet to be explored so far and is computationally intractable to naively adopt Monte Carlo simulation to obtain the results. To this end, we propose a novel end-to-end framework DySuse based on dynamic graph embedding technology. Specifically, we leverage a structural feature module to independently capture the structural information of influence diffusion on each single graph snapshot. Besides, {we propose the progressive mechanism according to the property of influence diffusion,} to couple the structural and temporal information during diffusion tightly. Moreover, a self-attention block {is designed to} further capture temporal dependency by flexibly weighting historical timestamps. Experimental results show that our framework is superior to the existing dynamic graph embedding models and has satisfactory prediction performance in multiple influence diffusion models.</description><subject>Computer Science - Artificial Intelligence</subject><subject>Computer Science - Learning</subject><subject>Computer Science - Social and Information Networks</subject><subject>Diffusion barriers</subject><subject>Embedding</subject><subject>Estimation</subject><subject>Monte Carlo simulation</subject><subject>Social networks</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj0tLw0AYRQdBsNT-AFcOuE6cdybiRvpQoeii3YcvkwlMTZM4M1Hz742tm3s3l8s5CN1QkgotJbkH_-O-UsaJTikRgl2gGeOcJlowdoUWIRwIIUxlTEo-Q4-rcTcE-4CnNLaPrnSNiyNeh-iOEF3XYtfi1djC0Rm864yDBr_Z-N35j3CNLmtogl389xztN-v98iXZvj-_Lp-2CUhGE9AsL42SiouK5BMjCNAmtxqkBZsRIXMhCFSG1qXSeWUzI2vKrRWCS65KPke359uTWtH7icyPxZ9icVKcFnfnRe-7z8GGWBy6wbcTU8G0FEoTRSj_BWh5U0g</recordid><startdate>20230821</startdate><enddate>20230821</enddate><creator>Shi, Yingdan</creator><creator>Zhou, Jingya</creator><creator>Zhang, Congcong</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230821</creationdate><title>DySuse: Susceptibility Estimation in Dynamic Social Networks</title><author>Shi, Yingdan ; Zhou, Jingya ; Zhang, Congcong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a521-a829bc65634d09855a4a8c9e8a5eae70459440adc1fb689de7c5f13ee443536b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Artificial Intelligence</topic><topic>Computer Science - Learning</topic><topic>Computer Science - Social and Information Networks</topic><topic>Diffusion barriers</topic><topic>Embedding</topic><topic>Estimation</topic><topic>Monte Carlo simulation</topic><topic>Social networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Shi, Yingdan</creatorcontrib><creatorcontrib>Zhou, Jingya</creatorcontrib><creatorcontrib>Zhang, Congcong</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shi, Yingdan</au><au>Zhou, Jingya</au><au>Zhang, Congcong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>DySuse: Susceptibility Estimation in Dynamic Social Networks</atitle><jtitle>arXiv.org</jtitle><date>2023-08-21</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>Influence estimation aims to predict the total influence spread in social networks and has received surged attention in recent years. Most current studies focus on estimating the total number of influenced users in a social network, and neglect susceptibility estimation that aims to predict the probability of each user being influenced from the individual perspective. As a more fine-grained estimation task, susceptibility estimation is full of attractiveness and practical value. Based on the significance of susceptibility estimation and dynamic properties of social networks, we propose a task, called susceptibility estimation in dynamic social networks, which is even more realistic and valuable in real-world applications. Susceptibility estimation in dynamic networks has yet to be explored so far and is computationally intractable to naively adopt Monte Carlo simulation to obtain the results. To this end, we propose a novel end-to-end framework DySuse based on dynamic graph embedding technology. Specifically, we leverage a structural feature module to independently capture the structural information of influence diffusion on each single graph snapshot. Besides, {we propose the progressive mechanism according to the property of influence diffusion,} to couple the structural and temporal information during diffusion tightly. Moreover, a self-attention block {is designed to} further capture temporal dependency by flexibly weighting historical timestamps. Experimental results show that our framework is superior to the existing dynamic graph embedding models and has satisfactory prediction performance in multiple influence diffusion models.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2308.10442</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2023-08 |
issn | 2331-8422 |
language | eng |
recordid | cdi_arxiv_primary_2308_10442 |
source | arXiv.org; Free E- Journals |
subjects | Computer Science - Artificial Intelligence Computer Science - Learning Computer Science - Social and Information Networks Diffusion barriers Embedding Estimation Monte Carlo simulation Social networks |
title | DySuse: Susceptibility Estimation in Dynamic Social Networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T13%3A06%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=DySuse:%20Susceptibility%20Estimation%20in%20Dynamic%20Social%20Networks&rft.jtitle=arXiv.org&rft.au=Shi,%20Yingdan&rft.date=2023-08-21&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2308.10442&rft_dat=%3Cproquest_arxiv%3E2854680601%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2854680601&rft_id=info:pmid/&rfr_iscdi=true |