Discovering Hidden Topical Hubs and Authorities Across Multiple Online Social Networks
Finding influential users in online social networks (OSNs) is an important problem with many possible useful applications. Many methods have been proposed to identify influential users in OSNs. PageRank and HITs are two well known examples that determine influential users through link analysis. In r...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on knowledge and data engineering 2021-01, Vol.33 (1), p.70-84 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 84 |
---|---|
container_issue | 1 |
container_start_page | 70 |
container_title | IEEE transactions on knowledge and data engineering |
container_volume | 33 |
creator | Lee, Roy Ka-Wei Hoang, Tuan-Anh Lim, Ee-Peng |
description | Finding influential users in online social networks (OSNs) is an important problem with many possible useful applications. Many methods have been proposed to identify influential users in OSNs. PageRank and HITs are two well known examples that determine influential users through link analysis. In recent years, new models that consider both content and social network links have been developed. The Hub and Authority Topic (HAT) model is one that extends HITS to identify topic-specific hubs and authorities by jointly learning hubs, authorities, and topical interests from users' relationship and textual content. However, many of the previous works are confined to identifying influential users within a single OSN. These models, when applied to multiple OSNs, could not learn influential users under a common set of topics nor address platform preferences. In this paper, we therefore propose the MPHAT model, an extension of HAT, to jointly model the topic-specific hub users, authority users, their topical interests and platform preferences. We evaluate MPHAT against several existing state-of-the-art methods in three tasks: (i) modeling of topics, (ii) platform choice prediction, and (iii) link recommendation. Based on our extensive experiments in multiple OSNs settings using synthetic datasets and real-world datasets from Twitter and Instagram, we show that MPHAT is comparable to state-of-the-art topic models in learning topics but outperforms the state-of-the-art models in platform prediction and link recommendation tasks. We also empirically demonstrate the ability of MPHAT to determine influential users within and across multiple OSNs. |
doi_str_mv | 10.1109/TKDE.2019.2922962 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_8736791</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8736791</ieee_id><sourcerecordid>2468758887</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-eed293c9d9bddcd1f9984fdad71a439a256c8cbed4bdbc74fc6323c6024847963</originalsourceid><addsrcrecordid>eNo9kDFPwzAUhC0EEqXwAxCLJeYU23Fie6xaoIhCBwqrldgv4BLiYCcg_j0prZjuhrt7Tx9C55RMKCXqan0_v54wQtWEKcZUzg7QiGaZTBhV9HDwhNOEp1wco5MYN4QQKSQdoZe5i8Z_QXDNK144a6HBa986U9R40ZcRF43F075788F1DiKemuBjxA993bm2BrxqatcAfvLGDZVH6L59eI-n6Kgq6ghnex2j55vr9WyRLFe3d7PpMjFMpV0CYAc1yqrSWmNppZTklS2soAVPVcGy3EhTguWlLY3glclTlpqcMC65UHk6Rpe73Tb4zx5ipze-D81wUjOeS5FJKcWQorvU3-8BKt0G91GEH02J3uLTW3x6i0_v8Q2di13HAcB_fhjLhaLpL7z8bLI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2468758887</pqid></control><display><type>article</type><title>Discovering Hidden Topical Hubs and Authorities Across Multiple Online Social Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Lee, Roy Ka-Wei ; Hoang, Tuan-Anh ; Lim, Ee-Peng</creator><creatorcontrib>Lee, Roy Ka-Wei ; Hoang, Tuan-Anh ; Lim, Ee-Peng</creatorcontrib><description>Finding influential users in online social networks (OSNs) is an important problem with many possible useful applications. Many methods have been proposed to identify influential users in OSNs. PageRank and HITs are two well known examples that determine influential users through link analysis. In recent years, new models that consider both content and social network links have been developed. The Hub and Authority Topic (HAT) model is one that extends HITS to identify topic-specific hubs and authorities by jointly learning hubs, authorities, and topical interests from users' relationship and textual content. However, many of the previous works are confined to identifying influential users within a single OSN. These models, when applied to multiple OSNs, could not learn influential users under a common set of topics nor address platform preferences. In this paper, we therefore propose the MPHAT model, an extension of HAT, to jointly model the topic-specific hub users, authority users, their topical interests and platform preferences. We evaluate MPHAT against several existing state-of-the-art methods in three tasks: (i) modeling of topics, (ii) platform choice prediction, and (iii) link recommendation. Based on our extensive experiments in multiple OSNs settings using synthetic datasets and real-world datasets from Twitter and Instagram, we show that MPHAT is comparable to state-of-the-art topic models in learning topics but outperforms the state-of-the-art models in platform prediction and link recommendation tasks. We also empirically demonstrate the ability of MPHAT to determine influential users within and across multiple OSNs.</description><identifier>ISSN: 1041-4347</identifier><identifier>EISSN: 1558-2191</identifier><identifier>DOI: 10.1109/TKDE.2019.2922962</identifier><identifier>CODEN: ITKEEH</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Analytical models ; authority ; Data engineering ; Datasets ; Hub ; Hubs ; Knowledge engineering ; Learning ; online social networks ; Predictive models ; Search engines ; Social networks ; Task analysis ; topic model ; Twitter</subject><ispartof>IEEE transactions on knowledge and data engineering, 2021-01, Vol.33 (1), p.70-84</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c293t-eed293c9d9bddcd1f9984fdad71a439a256c8cbed4bdbc74fc6323c6024847963</citedby><cites>FETCH-LOGICAL-c293t-eed293c9d9bddcd1f9984fdad71a439a256c8cbed4bdbc74fc6323c6024847963</cites><orcidid>0000-0002-1986-7750</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8736791$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8736791$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Lee, Roy Ka-Wei</creatorcontrib><creatorcontrib>Hoang, Tuan-Anh</creatorcontrib><creatorcontrib>Lim, Ee-Peng</creatorcontrib><title>Discovering Hidden Topical Hubs and Authorities Across Multiple Online Social Networks</title><title>IEEE transactions on knowledge and data engineering</title><addtitle>TKDE</addtitle><description>Finding influential users in online social networks (OSNs) is an important problem with many possible useful applications. Many methods have been proposed to identify influential users in OSNs. PageRank and HITs are two well known examples that determine influential users through link analysis. In recent years, new models that consider both content and social network links have been developed. The Hub and Authority Topic (HAT) model is one that extends HITS to identify topic-specific hubs and authorities by jointly learning hubs, authorities, and topical interests from users' relationship and textual content. However, many of the previous works are confined to identifying influential users within a single OSN. These models, when applied to multiple OSNs, could not learn influential users under a common set of topics nor address platform preferences. In this paper, we therefore propose the MPHAT model, an extension of HAT, to jointly model the topic-specific hub users, authority users, their topical interests and platform preferences. We evaluate MPHAT against several existing state-of-the-art methods in three tasks: (i) modeling of topics, (ii) platform choice prediction, and (iii) link recommendation. Based on our extensive experiments in multiple OSNs settings using synthetic datasets and real-world datasets from Twitter and Instagram, we show that MPHAT is comparable to state-of-the-art topic models in learning topics but outperforms the state-of-the-art models in platform prediction and link recommendation tasks. We also empirically demonstrate the ability of MPHAT to determine influential users within and across multiple OSNs.</description><subject>Analytical models</subject><subject>authority</subject><subject>Data engineering</subject><subject>Datasets</subject><subject>Hub</subject><subject>Hubs</subject><subject>Knowledge engineering</subject><subject>Learning</subject><subject>online social networks</subject><subject>Predictive models</subject><subject>Search engines</subject><subject>Social networks</subject><subject>Task analysis</subject><subject>topic model</subject><subject>Twitter</subject><issn>1041-4347</issn><issn>1558-2191</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kDFPwzAUhC0EEqXwAxCLJeYU23Fie6xaoIhCBwqrldgv4BLiYCcg_j0prZjuhrt7Tx9C55RMKCXqan0_v54wQtWEKcZUzg7QiGaZTBhV9HDwhNOEp1wco5MYN4QQKSQdoZe5i8Z_QXDNK144a6HBa986U9R40ZcRF43F075788F1DiKemuBjxA993bm2BrxqatcAfvLGDZVH6L59eI-n6Kgq6ghnex2j55vr9WyRLFe3d7PpMjFMpV0CYAc1yqrSWmNppZTklS2soAVPVcGy3EhTguWlLY3glclTlpqcMC65UHk6Rpe73Tb4zx5ipze-D81wUjOeS5FJKcWQorvU3-8BKt0G91GEH02J3uLTW3x6i0_v8Q2di13HAcB_fhjLhaLpL7z8bLI</recordid><startdate>20210101</startdate><enddate>20210101</enddate><creator>Lee, Roy Ka-Wei</creator><creator>Hoang, Tuan-Anh</creator><creator>Lim, Ee-Peng</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-1986-7750</orcidid></search><sort><creationdate>20210101</creationdate><title>Discovering Hidden Topical Hubs and Authorities Across Multiple Online Social Networks</title><author>Lee, Roy Ka-Wei ; Hoang, Tuan-Anh ; Lim, Ee-Peng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-eed293c9d9bddcd1f9984fdad71a439a256c8cbed4bdbc74fc6323c6024847963</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Analytical models</topic><topic>authority</topic><topic>Data engineering</topic><topic>Datasets</topic><topic>Hub</topic><topic>Hubs</topic><topic>Knowledge engineering</topic><topic>Learning</topic><topic>online social networks</topic><topic>Predictive models</topic><topic>Search engines</topic><topic>Social networks</topic><topic>Task analysis</topic><topic>topic model</topic><topic>Twitter</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lee, Roy Ka-Wei</creatorcontrib><creatorcontrib>Hoang, Tuan-Anh</creatorcontrib><creatorcontrib>Lim, Ee-Peng</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications 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><jtitle>IEEE transactions on knowledge and data engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lee, Roy Ka-Wei</au><au>Hoang, Tuan-Anh</au><au>Lim, Ee-Peng</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Discovering Hidden Topical Hubs and Authorities Across Multiple Online Social Networks</atitle><jtitle>IEEE transactions on knowledge and data engineering</jtitle><stitle>TKDE</stitle><date>2021-01-01</date><risdate>2021</risdate><volume>33</volume><issue>1</issue><spage>70</spage><epage>84</epage><pages>70-84</pages><issn>1041-4347</issn><eissn>1558-2191</eissn><coden>ITKEEH</coden><abstract>Finding influential users in online social networks (OSNs) is an important problem with many possible useful applications. Many methods have been proposed to identify influential users in OSNs. PageRank and HITs are two well known examples that determine influential users through link analysis. In recent years, new models that consider both content and social network links have been developed. The Hub and Authority Topic (HAT) model is one that extends HITS to identify topic-specific hubs and authorities by jointly learning hubs, authorities, and topical interests from users' relationship and textual content. However, many of the previous works are confined to identifying influential users within a single OSN. These models, when applied to multiple OSNs, could not learn influential users under a common set of topics nor address platform preferences. In this paper, we therefore propose the MPHAT model, an extension of HAT, to jointly model the topic-specific hub users, authority users, their topical interests and platform preferences. We evaluate MPHAT against several existing state-of-the-art methods in three tasks: (i) modeling of topics, (ii) platform choice prediction, and (iii) link recommendation. Based on our extensive experiments in multiple OSNs settings using synthetic datasets and real-world datasets from Twitter and Instagram, we show that MPHAT is comparable to state-of-the-art topic models in learning topics but outperforms the state-of-the-art models in platform prediction and link recommendation tasks. We also empirically demonstrate the ability of MPHAT to determine influential users within and across multiple OSNs.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TKDE.2019.2922962</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0002-1986-7750</orcidid></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1041-4347 |
ispartof | IEEE transactions on knowledge and data engineering, 2021-01, Vol.33 (1), p.70-84 |
issn | 1041-4347 1558-2191 |
language | eng |
recordid | cdi_ieee_primary_8736791 |
source | IEEE Electronic Library (IEL) |
subjects | Analytical models authority Data engineering Datasets Hub Hubs Knowledge engineering Learning online social networks Predictive models Search engines Social networks Task analysis topic model |
title | Discovering Hidden Topical Hubs and Authorities Across Multiple Online 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-02-10T08%3A11%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Discovering%20Hidden%20Topical%20Hubs%20and%20Authorities%20Across%20Multiple%20Online%20Social%20Networks&rft.jtitle=IEEE%20transactions%20on%20knowledge%20and%20data%20engineering&rft.au=Lee,%20Roy%20Ka-Wei&rft.date=2021-01-01&rft.volume=33&rft.issue=1&rft.spage=70&rft.epage=84&rft.pages=70-84&rft.issn=1041-4347&rft.eissn=1558-2191&rft.coden=ITKEEH&rft_id=info:doi/10.1109/TKDE.2019.2922962&rft_dat=%3Cproquest_RIE%3E2468758887%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2468758887&rft_id=info:pmid/&rft_ieee_id=8736791&rfr_iscdi=true |