Routing and Scheduling of Social Influence Diffusion in Online Social Networks

Owing to the rising popularity of online social networking services (OSNs), studies on social influence and its diffusion have received significant attention from the research community. Prior research has mostly studied the impact of single-hop influence diffusion and multi-hop influence broadcast...

Full description

Saved in:
Bibliographic Details
Main Authors: Hung, Hui-Ju, Yang, De-Nian, Lee, Wang-Chien
Format: Conference Proceeding
Language:English
Subjects:
Algorithms
Computer networks
Diffusion
distributed computation
Facebook
Integrated circuit modeling
Mathematical models
Optimization
Routing
Routing (telecommunications)
Scheduling
social influence
Social networks
Time factors
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 446
container_issue
container_start_page 437
container_title
container_volume
creator Hung, Hui-Ju
Yang, De-Nian
Lee, Wang-Chien
description Owing to the rising popularity of online social networking services (OSNs), studies on social influence and its diffusion have received significant attention from the research community. Prior research has mostly studied the impact of single-hop influence diffusion and multi-hop influence broadcast in online social networks. Very little research explores the idea of guiding (routing) multi-hop social influence towards a specific target. In this paper, we motivate the needs of timely routing social influence to formulate a new optimization problem, namely, Routing And Scheduling of Target-Oriented Social Influence Diffusion (RAS-TOSID). Accordingly, we propose the Efficient Routing And Scheduling with Social and Temporal decOmposition (ERASSTO) algorithm, which finds the optimal solution to RAS-TOSID in polynomial time. We carry out a user study by implementing ERASSTO in Facebook and conduct a comprehensive evaluation on ERASSTO and alternative approaches by simulation. The result shows that ERASSTO significantly outperforms other algorithms regarding solution quality and computational efficiency.
doi_str_mv 10.1109/ICDCS.2016.45
format conference_proceeding
fullrecord <record><control><sourceid>proquest_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_7536542</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7536542</ieee_id><sourcerecordid>1835669504</sourcerecordid><originalsourceid>FETCH-LOGICAL-i208t-4d73b1cf7abd98910fbe47fb7e7b546528f4bffe56727d7449d69b1c0e4e3afd3</originalsourceid><addsrcrecordid>eNo10DtPwzAUBWCDQKKUjkwsHllS7PgVjyjlUalqJQpz5MTXYEjtEidC_HuCCtPVkb5zhovQJSVzSom-WZaLcjvPCZVzLo7QTKuCCqIJ5QUTx2iSCyWyglN6giaUSJZJnaszdJ7SOyFEFJJN0PopDr0Pr9gEi7fNG9ih_Y3R4W1svGnxMrh2gNAAXnjnhuRjwD7gTRgd_KM19F-x-0gX6NSZNsHs707Ry_3dc_mYrTYPy_J2lfmcFH3GrWI1bZwytdWFpsTVwJWrFahacCnywvHaORBS5coqzrWVeiwQ4MCMs2yKrg-7-y5-DpD6audTA21rAsQhVXT8gJRaED7SqwP1AFDtO78z3XelBJOC5-wHvwtd8w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>1835669504</pqid></control><display><type>conference_proceeding</type><title>Routing and Scheduling of Social Influence Diffusion in Online Social Networks</title><source>IEEE Xplore All Conference Series</source><creator>Hung, Hui-Ju ; Yang, De-Nian ; Lee, Wang-Chien</creator><creatorcontrib>Hung, Hui-Ju ; Yang, De-Nian ; Lee, Wang-Chien</creatorcontrib><description>Owing to the rising popularity of online social networking services (OSNs), studies on social influence and its diffusion have received significant attention from the research community. Prior research has mostly studied the impact of single-hop influence diffusion and multi-hop influence broadcast in online social networks. Very little research explores the idea of guiding (routing) multi-hop social influence towards a specific target. In this paper, we motivate the needs of timely routing social influence to formulate a new optimization problem, namely, Routing And Scheduling of Target-Oriented Social Influence Diffusion (RAS-TOSID). Accordingly, we propose the Efficient Routing And Scheduling with Social and Temporal decOmposition (ERASSTO) algorithm, which finds the optimal solution to RAS-TOSID in polynomial time. We carry out a user study by implementing ERASSTO in Facebook and conduct a comprehensive evaluation on ERASSTO and alternative approaches by simulation. The result shows that ERASSTO significantly outperforms other algorithms regarding solution quality and computational efficiency.</description><identifier>ISSN: 1063-6927</identifier><identifier>EISSN: 2575-8411</identifier><identifier>EISBN: 9781509014835</identifier><identifier>EISBN: 1509014837</identifier><identifier>DOI: 10.1109/ICDCS.2016.45</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithms ; Computer networks ; Diffusion ; distributed computation ; Facebook ; Integrated circuit modeling ; Mathematical models ; Optimization ; Routing ; Routing (telecommunications) ; Scheduling ; social influence ; Social networks ; Time factors</subject><ispartof>2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS), 2016, p.437-446</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7536542$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,314,780,784,789,790,27924,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7536542$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hung, Hui-Ju</creatorcontrib><creatorcontrib>Yang, De-Nian</creatorcontrib><creatorcontrib>Lee, Wang-Chien</creatorcontrib><title>Routing and Scheduling of Social Influence Diffusion in Online Social Networks</title><title>2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)</title><addtitle>ICDSC</addtitle><description>Owing to the rising popularity of online social networking services (OSNs), studies on social influence and its diffusion have received significant attention from the research community. Prior research has mostly studied the impact of single-hop influence diffusion and multi-hop influence broadcast in online social networks. Very little research explores the idea of guiding (routing) multi-hop social influence towards a specific target. In this paper, we motivate the needs of timely routing social influence to formulate a new optimization problem, namely, Routing And Scheduling of Target-Oriented Social Influence Diffusion (RAS-TOSID). Accordingly, we propose the Efficient Routing And Scheduling with Social and Temporal decOmposition (ERASSTO) algorithm, which finds the optimal solution to RAS-TOSID in polynomial time. We carry out a user study by implementing ERASSTO in Facebook and conduct a comprehensive evaluation on ERASSTO and alternative approaches by simulation. The result shows that ERASSTO significantly outperforms other algorithms regarding solution quality and computational efficiency.</description><subject>Algorithms</subject><subject>Computer networks</subject><subject>Diffusion</subject><subject>distributed computation</subject><subject>Facebook</subject><subject>Integrated circuit modeling</subject><subject>Mathematical models</subject><subject>Optimization</subject><subject>Routing</subject><subject>Routing (telecommunications)</subject><subject>Scheduling</subject><subject>social influence</subject><subject>Social networks</subject><subject>Time factors</subject><issn>1063-6927</issn><issn>2575-8411</issn><isbn>9781509014835</isbn><isbn>1509014837</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2016</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo10DtPwzAUBWCDQKKUjkwsHllS7PgVjyjlUalqJQpz5MTXYEjtEidC_HuCCtPVkb5zhovQJSVzSom-WZaLcjvPCZVzLo7QTKuCCqIJ5QUTx2iSCyWyglN6giaUSJZJnaszdJ7SOyFEFJJN0PopDr0Pr9gEi7fNG9ih_Y3R4W1svGnxMrh2gNAAXnjnhuRjwD7gTRgd_KM19F-x-0gX6NSZNsHs707Ry_3dc_mYrTYPy_J2lfmcFH3GrWI1bZwytdWFpsTVwJWrFahacCnywvHaORBS5coqzrWVeiwQ4MCMs2yKrg-7-y5-DpD6audTA21rAsQhVXT8gJRaED7SqwP1AFDtO78z3XelBJOC5-wHvwtd8w</recordid><startdate>20160601</startdate><enddate>20160601</enddate><creator>Hung, Hui-Ju</creator><creator>Yang, De-Nian</creator><creator>Lee, Wang-Chien</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20160601</creationdate><title>Routing and Scheduling of Social Influence Diffusion in Online Social Networks</title><author>Hung, Hui-Ju ; Yang, De-Nian ; Lee, Wang-Chien</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i208t-4d73b1cf7abd98910fbe47fb7e7b546528f4bffe56727d7449d69b1c0e4e3afd3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Computer networks</topic><topic>Diffusion</topic><topic>distributed computation</topic><topic>Facebook</topic><topic>Integrated circuit modeling</topic><topic>Mathematical models</topic><topic>Optimization</topic><topic>Routing</topic><topic>Routing (telecommunications)</topic><topic>Scheduling</topic><topic>social influence</topic><topic>Social networks</topic><topic>Time factors</topic><toplevel>online_resources</toplevel><creatorcontrib>Hung, Hui-Ju</creatorcontrib><creatorcontrib>Yang, De-Nian</creatorcontrib><creatorcontrib>Lee, Wang-Chien</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hung, Hui-Ju</au><au>Yang, De-Nian</au><au>Lee, Wang-Chien</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Routing and Scheduling of Social Influence Diffusion in Online Social Networks</atitle><btitle>2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)</btitle><stitle>ICDSC</stitle><date>2016-06-01</date><risdate>2016</risdate><spage>437</spage><epage>446</epage><pages>437-446</pages><issn>1063-6927</issn><eissn>2575-8411</eissn><eisbn>9781509014835</eisbn><eisbn>1509014837</eisbn><coden>IEEPAD</coden><abstract>Owing to the rising popularity of online social networking services (OSNs), studies on social influence and its diffusion have received significant attention from the research community. Prior research has mostly studied the impact of single-hop influence diffusion and multi-hop influence broadcast in online social networks. Very little research explores the idea of guiding (routing) multi-hop social influence towards a specific target. In this paper, we motivate the needs of timely routing social influence to formulate a new optimization problem, namely, Routing And Scheduling of Target-Oriented Social Influence Diffusion (RAS-TOSID). Accordingly, we propose the Efficient Routing And Scheduling with Social and Temporal decOmposition (ERASSTO) algorithm, which finds the optimal solution to RAS-TOSID in polynomial time. We carry out a user study by implementing ERASSTO in Facebook and conduct a comprehensive evaluation on ERASSTO and alternative approaches by simulation. The result shows that ERASSTO significantly outperforms other algorithms regarding solution quality and computational efficiency.</abstract><pub>IEEE</pub><doi>10.1109/ICDCS.2016.45</doi><tpages>10</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1063-6927
ispartof 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS), 2016, p.437-446
issn 1063-6927
2575-8411
language eng
recordid cdi_ieee_primary_7536542
source IEEE Xplore All Conference Series
subjects Algorithms
Computer networks
Diffusion
distributed computation
Facebook
Integrated circuit modeling
Mathematical models
Optimization
Routing
Routing (telecommunications)
Scheduling
social influence
Social networks
Time factors
title Routing and Scheduling of Social Influence Diffusion in Online Social Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T20%3A55%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Routing%20and%20Scheduling%20of%20Social%20Influence%20Diffusion%20in%20Online%20Social%20Networks&rft.btitle=2016%20IEEE%2036th%20International%20Conference%20on%20Distributed%20Computing%20Systems%20(ICDCS)&rft.au=Hung,%20Hui-Ju&rft.date=2016-06-01&rft.spage=437&rft.epage=446&rft.pages=437-446&rft.issn=1063-6927&rft.eissn=2575-8411&rft.coden=IEEPAD&rft_id=info:doi/10.1109/ICDCS.2016.45&rft.eisbn=9781509014835&rft.eisbn_list=1509014837&rft_dat=%3Cproquest_CHZPO%3E1835669504%3C/proquest_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i208t-4d73b1cf7abd98910fbe47fb7e7b546528f4bffe56727d7449d69b1c0e4e3afd3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1835669504&rft_id=info:pmid/&rft_ieee_id=7536542&rfr_iscdi=true