Optimizing Social-Topic Engagement on Social Network and Knowledge Graph

Existing research on social networks manifests two crucial criteria to improve activity engagement of users: (1) user interests in the activity topics and (2) opportunities of making new friends with some acquaintances. However, current online platforms still involve massive manual selection for act...

Full description

Saved in:
Bibliographic Details
Main Authors: Teng, Ya-Wen, Shi, Yishuo, Tsai, Jui-Yi, Shuai, Hong-Han, Tai, Chih-Hua, Yang, De-Nian
Format: Conference Proceeding
Language:English
Subjects:
Approximation algorithms
Games
Knowledge engineering
Manuals
Satellite broadcasting
Silicon
Social network services
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 6
container_issue
container_start_page 1
container_title
container_volume
creator Teng, Ya-Wen
Shi, Yishuo
Tsai, Jui-Yi
Shuai, Hong-Han
Tai, Chih-Hua
Yang, De-Nian
description Existing research on social networks manifests two crucial criteria to improve activity engagement of users: (1) user interests in the activity topics and (2) opportunities of making new friends with some acquaintances. However, current online platforms still involve massive manual selection for activity attendees and contents without proper recommendations. In this paper, therefore, we formulate a new activity organization problem, named Social Knowledge Group Query (SKGQ), to recommend attendees and topic-related contents simultaneously. We prove that SKGQ is NP-hard and design an approximation algorithm, named Social cOntent Knowledge Exploration (SOKE), to jointly choose the activity attendees and topic-related contents according to social-oriented and topic- oriented strategies. Simulation results manifest that the solution acquired by SOKE is close to the optimal solution and outperforms various baselines.
doi_str_mv 10.1109/GLOBECOM38437.2019.9013546
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_9013546</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9013546</ieee_id><sourcerecordid>9013546</sourcerecordid><originalsourceid>FETCH-LOGICAL-i203t-dfa1b828f501c031dd57dc42303717c6d6c21faba7052d98b91896b56453b3323</originalsourceid><addsrcrecordid>eNotj81Kw0AURkdBsNY-gZvBfeq9czN_Sy21FaNZWNdlkpnE0TQJSaDo0yvY1bc4hwMfY7cIS0Swd5ssf1iv8hcyKemlALRLC0gyVWfsCrUwf5IScM5mQmqVKIN0yRbj-AkAQiIJCzO2zfspHuJPbGv-1pXRNcmu62PJ123t6nAI7cS79oT4a5iO3fDFXev5c9sdm-DrwDeD6z-u2UXlmjEsTjtn74_r3WqbZPnmaXWfJVEATYmvHBZGmEoClkDovdS-TAUBadSl8qoUWLnCaZDCW1NYNFYVUqWSCiJBc3bz340hhH0_xIMbvven4_QLo99Ngg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Optimizing Social-Topic Engagement on Social Network and Knowledge Graph</title><source>IEEE Xplore All Conference Series</source><creator>Teng, Ya-Wen ; Shi, Yishuo ; Tsai, Jui-Yi ; Shuai, Hong-Han ; Tai, Chih-Hua ; Yang, De-Nian</creator><creatorcontrib>Teng, Ya-Wen ; Shi, Yishuo ; Tsai, Jui-Yi ; Shuai, Hong-Han ; Tai, Chih-Hua ; Yang, De-Nian</creatorcontrib><description>Existing research on social networks manifests two crucial criteria to improve activity engagement of users: (1) user interests in the activity topics and (2) opportunities of making new friends with some acquaintances. However, current online platforms still involve massive manual selection for activity attendees and contents without proper recommendations. In this paper, therefore, we formulate a new activity organization problem, named Social Knowledge Group Query (SKGQ), to recommend attendees and topic-related contents simultaneously. We prove that SKGQ is NP-hard and design an approximation algorithm, named Social cOntent Knowledge Exploration (SOKE), to jointly choose the activity attendees and topic-related contents according to social-oriented and topic- oriented strategies. Simulation results manifest that the solution acquired by SOKE is close to the optimal solution and outperforms various baselines.</description><identifier>EISSN: 2576-6813</identifier><identifier>EISBN: 1728109620</identifier><identifier>EISBN: 9781728109626</identifier><identifier>DOI: 10.1109/GLOBECOM38437.2019.9013546</identifier><language>eng</language><publisher>IEEE</publisher><subject>Approximation algorithms ; Games ; Knowledge engineering ; Manuals ; Satellite broadcasting ; Silicon ; Social network services</subject><ispartof>2019 IEEE Global Communications Conference (GLOBECOM), 2019, p.1-6</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/9013546$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>310,311,786,790,795,796,23958,23959,25170,27958,54906,55283</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9013546$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Teng, Ya-Wen</creatorcontrib><creatorcontrib>Shi, Yishuo</creatorcontrib><creatorcontrib>Tsai, Jui-Yi</creatorcontrib><creatorcontrib>Shuai, Hong-Han</creatorcontrib><creatorcontrib>Tai, Chih-Hua</creatorcontrib><creatorcontrib>Yang, De-Nian</creatorcontrib><title>Optimizing Social-Topic Engagement on Social Network and Knowledge Graph</title><title>2019 IEEE Global Communications Conference (GLOBECOM)</title><addtitle>GLOCOM</addtitle><description>Existing research on social networks manifests two crucial criteria to improve activity engagement of users: (1) user interests in the activity topics and (2) opportunities of making new friends with some acquaintances. However, current online platforms still involve massive manual selection for activity attendees and contents without proper recommendations. In this paper, therefore, we formulate a new activity organization problem, named Social Knowledge Group Query (SKGQ), to recommend attendees and topic-related contents simultaneously. We prove that SKGQ is NP-hard and design an approximation algorithm, named Social cOntent Knowledge Exploration (SOKE), to jointly choose the activity attendees and topic-related contents according to social-oriented and topic- oriented strategies. Simulation results manifest that the solution acquired by SOKE is close to the optimal solution and outperforms various baselines.</description><subject>Approximation algorithms</subject><subject>Games</subject><subject>Knowledge engineering</subject><subject>Manuals</subject><subject>Satellite broadcasting</subject><subject>Silicon</subject><subject>Social network services</subject><issn>2576-6813</issn><isbn>1728109620</isbn><isbn>9781728109626</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2019</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj81Kw0AURkdBsNY-gZvBfeq9czN_Sy21FaNZWNdlkpnE0TQJSaDo0yvY1bc4hwMfY7cIS0Swd5ssf1iv8hcyKemlALRLC0gyVWfsCrUwf5IScM5mQmqVKIN0yRbj-AkAQiIJCzO2zfspHuJPbGv-1pXRNcmu62PJ123t6nAI7cS79oT4a5iO3fDFXev5c9sdm-DrwDeD6z-u2UXlmjEsTjtn74_r3WqbZPnmaXWfJVEATYmvHBZGmEoClkDovdS-TAUBadSl8qoUWLnCaZDCW1NYNFYVUqWSCiJBc3bz340hhH0_xIMbvven4_QLo99Ngg</recordid><startdate>201912</startdate><enddate>201912</enddate><creator>Teng, Ya-Wen</creator><creator>Shi, Yishuo</creator><creator>Tsai, Jui-Yi</creator><creator>Shuai, Hong-Han</creator><creator>Tai, Chih-Hua</creator><creator>Yang, De-Nian</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201912</creationdate><title>Optimizing Social-Topic Engagement on Social Network and Knowledge Graph</title><author>Teng, Ya-Wen ; Shi, Yishuo ; Tsai, Jui-Yi ; Shuai, Hong-Han ; Tai, Chih-Hua ; Yang, De-Nian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i203t-dfa1b828f501c031dd57dc42303717c6d6c21faba7052d98b91896b56453b3323</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Approximation algorithms</topic><topic>Games</topic><topic>Knowledge engineering</topic><topic>Manuals</topic><topic>Satellite broadcasting</topic><topic>Silicon</topic><topic>Social network services</topic><toplevel>online_resources</toplevel><creatorcontrib>Teng, Ya-Wen</creatorcontrib><creatorcontrib>Shi, Yishuo</creatorcontrib><creatorcontrib>Tsai, Jui-Yi</creatorcontrib><creatorcontrib>Shuai, Hong-Han</creatorcontrib><creatorcontrib>Tai, Chih-Hua</creatorcontrib><creatorcontrib>Yang, De-Nian</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 Xplore</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Teng, Ya-Wen</au><au>Shi, Yishuo</au><au>Tsai, Jui-Yi</au><au>Shuai, Hong-Han</au><au>Tai, Chih-Hua</au><au>Yang, De-Nian</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimizing Social-Topic Engagement on Social Network and Knowledge Graph</atitle><btitle>2019 IEEE Global Communications Conference (GLOBECOM)</btitle><stitle>GLOCOM</stitle><date>2019-12</date><risdate>2019</risdate><spage>1</spage><epage>6</epage><pages>1-6</pages><eissn>2576-6813</eissn><eisbn>1728109620</eisbn><eisbn>9781728109626</eisbn><abstract>Existing research on social networks manifests two crucial criteria to improve activity engagement of users: (1) user interests in the activity topics and (2) opportunities of making new friends with some acquaintances. However, current online platforms still involve massive manual selection for activity attendees and contents without proper recommendations. In this paper, therefore, we formulate a new activity organization problem, named Social Knowledge Group Query (SKGQ), to recommend attendees and topic-related contents simultaneously. We prove that SKGQ is NP-hard and design an approximation algorithm, named Social cOntent Knowledge Exploration (SOKE), to jointly choose the activity attendees and topic-related contents according to social-oriented and topic- oriented strategies. Simulation results manifest that the solution acquired by SOKE is close to the optimal solution and outperforms various baselines.</abstract><pub>IEEE</pub><doi>10.1109/GLOBECOM38437.2019.9013546</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISSN: 2576-6813
ispartof 2019 IEEE Global Communications Conference (GLOBECOM), 2019, p.1-6
issn 2576-6813
language eng
recordid cdi_ieee_primary_9013546
source IEEE Xplore All Conference Series
subjects Approximation algorithms
Games
Knowledge engineering
Manuals
Satellite broadcasting
Silicon
Social network services
title Optimizing Social-Topic Engagement on Social Network and Knowledge Graph
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-22T20%3A39%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Optimizing%20Social-Topic%20Engagement%20on%20Social%20Network%20and%20Knowledge%20Graph&rft.btitle=2019%20IEEE%20Global%20Communications%20Conference%20(GLOBECOM)&rft.au=Teng,%20Ya-Wen&rft.date=2019-12&rft.spage=1&rft.epage=6&rft.pages=1-6&rft.eissn=2576-6813&rft_id=info:doi/10.1109/GLOBECOM38437.2019.9013546&rft.eisbn=1728109620&rft.eisbn_list=9781728109626&rft_dat=%3Cieee_CHZPO%3E9013546%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i203t-dfa1b828f501c031dd57dc42303717c6d6c21faba7052d98b91896b56453b3323%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=9013546&rfr_iscdi=true