Learning to Find Topic Experts in Twitter via Different Relations

Expert finding has become a hot topic along with the flourishing of social networks, such as micro-blogging services like Twitter. Finding experts in Twitter is an important problem because tweets from experts are valuable sources that carry rich information (e.g., trends) in various domains. Howeve...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on knowledge and data engineering 2016-07, Vol.28 (7), p.1764-1778
Hauptverfasser: Wei, Wei, Cong, Gao, Miao, Chunyan, Zhu, Feida, Li, Guohui
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 1778
container_issue 7
container_start_page 1764
container_title IEEE transactions on knowledge and data engineering
container_volume 28
creator Wei, Wei
Cong, Gao
Miao, Chunyan
Zhu, Feida
Li, Guohui
description Expert finding has become a hot topic along with the flourishing of social networks, such as micro-blogging services like Twitter. Finding experts in Twitter is an important problem because tweets from experts are valuable sources that carry rich information (e.g., trends) in various domains. However, previous methods cannot be directly applied to Twitter expert finding problem. Recently, several attempts use the relations among users and Twitter Lists for expert finding. Nevertheless, these approaches only partially utilize such relations. To this end, we develop a probabilistic method to jointly exploit three types of relations (i.e., follower relation, user-list relation, and list-list relation) for finding experts. Specifically, we propose a Semi-Supervised Graph-based Ranking approach (SSGR) to offline calculate the global authority of users. In SSGR, we employ a normalized Laplacian regularization term to jointly explore the three relations, which is subject to the supervised information derived from Twitter crowds. We then online compute the local relevance between users and the given query. By leveraging the global authority and local relevance of users, we rank all of users and find top-N users with highest ranking scores. Experiments on real-world data demonstrate the effectiveness of our proposed approach for topic-specific expert finding in Twitter.
doi_str_mv 10.1109/TKDE.2016.2539166
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1795941182</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7426825</ieee_id><sourcerecordid>1825495769</sourcerecordid><originalsourceid>FETCH-LOGICAL-c417t-3dc0454cff681ef38ae0dc44fff4f996bb4fd20f47aad08a9435ce15a88e0a373</originalsourceid><addsrcrecordid>eNpdkMtOwzAQRSMEEqXwAYiNJTZsUjyxndjLqg9AVEJCYW25yRi5Sp1gpzz-nlStWLCaWZx7Z3SS5BroBICq-_J5vphkFPJJJpiCPD9JRiCETDNQcDrslEPKGS_Ok4sYN5RSWUgYJdMVmuCdfyd9S5bO16RsO1eRxXeHoY_EeVJ-ub7HQD6dIXNnLQb0PXnFxvSu9fEyObOmiXh1nOPkbbkoZ4_p6uXhaTZdpRWHok9ZXVEueGVtLgEtkwZpXXFureVWqXy95rbOqOWFMTWVRnEmKgRhpERqWMHGyd2htwvtxw5jr7cuVtg0xmO7ixpkJrgSRa4G9PYfuml3wQ_faSiUUBwGeKDgQFWhjTGg1V1wWxN-NFC9l6r3UvVeqj5KHTI3h4xDxD--4Fk-XGe_ljdyKQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1795941182</pqid></control><display><type>article</type><title>Learning to Find Topic Experts in Twitter via Different Relations</title><source>IEEE Electronic Library (IEL)</source><creator>Wei, Wei ; Cong, Gao ; Miao, Chunyan ; Zhu, Feida ; Li, Guohui</creator><creatorcontrib>Wei, Wei ; Cong, Gao ; Miao, Chunyan ; Zhu, Feida ; Li, Guohui</creatorcontrib><description>Expert finding has become a hot topic along with the flourishing of social networks, such as micro-blogging services like Twitter. Finding experts in Twitter is an important problem because tweets from experts are valuable sources that carry rich information (e.g., trends) in various domains. However, previous methods cannot be directly applied to Twitter expert finding problem. Recently, several attempts use the relations among users and Twitter Lists for expert finding. Nevertheless, these approaches only partially utilize such relations. To this end, we develop a probabilistic method to jointly exploit three types of relations (i.e., follower relation, user-list relation, and list-list relation) for finding experts. Specifically, we propose a Semi-Supervised Graph-based Ranking approach (SSGR) to offline calculate the global authority of users. In SSGR, we employ a normalized Laplacian regularization term to jointly explore the three relations, which is subject to the supervised information derived from Twitter crowds. We then online compute the local relevance between users and the given query. By leveraging the global authority and local relevance of users, we rank all of users and find top-N users with highest ranking scores. Experiments on real-world data demonstrate the effectiveness of our proposed approach for topic-specific expert finding in Twitter.</description><identifier>ISSN: 1041-4347</identifier><identifier>EISSN: 1558-2191</identifier><identifier>DOI: 10.1109/TKDE.2016.2539166</identifier><identifier>CODEN: ITKEEH</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Expert search ; Experts ; graph-based ranking ; Knowledge discovery ; Laplace equations ; Learning ; list ; Lists ; Mathematical analysis ; micro-blogging ; Natural language processing ; Portable document format ; Probabilistic logic ; Query processing ; Ranking ; Regularization ; Search problems ; Social networks ; Twitter</subject><ispartof>IEEE transactions on knowledge and data engineering, 2016-07, Vol.28 (7), p.1764-1778</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c417t-3dc0454cff681ef38ae0dc44fff4f996bb4fd20f47aad08a9435ce15a88e0a373</citedby><cites>FETCH-LOGICAL-c417t-3dc0454cff681ef38ae0dc44fff4f996bb4fd20f47aad08a9435ce15a88e0a373</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7426825$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7426825$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Wei, Wei</creatorcontrib><creatorcontrib>Cong, Gao</creatorcontrib><creatorcontrib>Miao, Chunyan</creatorcontrib><creatorcontrib>Zhu, Feida</creatorcontrib><creatorcontrib>Li, Guohui</creatorcontrib><title>Learning to Find Topic Experts in Twitter via Different Relations</title><title>IEEE transactions on knowledge and data engineering</title><addtitle>TKDE</addtitle><description>Expert finding has become a hot topic along with the flourishing of social networks, such as micro-blogging services like Twitter. Finding experts in Twitter is an important problem because tweets from experts are valuable sources that carry rich information (e.g., trends) in various domains. However, previous methods cannot be directly applied to Twitter expert finding problem. Recently, several attempts use the relations among users and Twitter Lists for expert finding. Nevertheless, these approaches only partially utilize such relations. To this end, we develop a probabilistic method to jointly exploit three types of relations (i.e., follower relation, user-list relation, and list-list relation) for finding experts. Specifically, we propose a Semi-Supervised Graph-based Ranking approach (SSGR) to offline calculate the global authority of users. In SSGR, we employ a normalized Laplacian regularization term to jointly explore the three relations, which is subject to the supervised information derived from Twitter crowds. We then online compute the local relevance between users and the given query. By leveraging the global authority and local relevance of users, we rank all of users and find top-N users with highest ranking scores. Experiments on real-world data demonstrate the effectiveness of our proposed approach for topic-specific expert finding in Twitter.</description><subject>Expert search</subject><subject>Experts</subject><subject>graph-based ranking</subject><subject>Knowledge discovery</subject><subject>Laplace equations</subject><subject>Learning</subject><subject>list</subject><subject>Lists</subject><subject>Mathematical analysis</subject><subject>micro-blogging</subject><subject>Natural language processing</subject><subject>Portable document format</subject><subject>Probabilistic logic</subject><subject>Query processing</subject><subject>Ranking</subject><subject>Regularization</subject><subject>Search problems</subject><subject>Social networks</subject><subject>Twitter</subject><issn>1041-4347</issn><issn>1558-2191</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkMtOwzAQRSMEEqXwAYiNJTZsUjyxndjLqg9AVEJCYW25yRi5Sp1gpzz-nlStWLCaWZx7Z3SS5BroBICq-_J5vphkFPJJJpiCPD9JRiCETDNQcDrslEPKGS_Ok4sYN5RSWUgYJdMVmuCdfyd9S5bO16RsO1eRxXeHoY_EeVJ-ub7HQD6dIXNnLQb0PXnFxvSu9fEyObOmiXh1nOPkbbkoZ4_p6uXhaTZdpRWHok9ZXVEueGVtLgEtkwZpXXFureVWqXy95rbOqOWFMTWVRnEmKgRhpERqWMHGyd2htwvtxw5jr7cuVtg0xmO7ixpkJrgSRa4G9PYfuml3wQ_faSiUUBwGeKDgQFWhjTGg1V1wWxN-NFC9l6r3UvVeqj5KHTI3h4xDxD--4Fk-XGe_ljdyKQ</recordid><startdate>20160701</startdate><enddate>20160701</enddate><creator>Wei, Wei</creator><creator>Cong, Gao</creator><creator>Miao, Chunyan</creator><creator>Zhu, Feida</creator><creator>Li, Guohui</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><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20160701</creationdate><title>Learning to Find Topic Experts in Twitter via Different Relations</title><author>Wei, Wei ; Cong, Gao ; Miao, Chunyan ; Zhu, Feida ; Li, Guohui</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c417t-3dc0454cff681ef38ae0dc44fff4f996bb4fd20f47aad08a9435ce15a88e0a373</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Expert search</topic><topic>Experts</topic><topic>graph-based ranking</topic><topic>Knowledge discovery</topic><topic>Laplace equations</topic><topic>Learning</topic><topic>list</topic><topic>Lists</topic><topic>Mathematical analysis</topic><topic>micro-blogging</topic><topic>Natural language processing</topic><topic>Portable document format</topic><topic>Probabilistic logic</topic><topic>Query processing</topic><topic>Ranking</topic><topic>Regularization</topic><topic>Search problems</topic><topic>Social networks</topic><topic>Twitter</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wei, Wei</creatorcontrib><creatorcontrib>Cong, Gao</creatorcontrib><creatorcontrib>Miao, Chunyan</creatorcontrib><creatorcontrib>Zhu, Feida</creatorcontrib><creatorcontrib>Li, Guohui</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 &amp; 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><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on knowledge and data engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Wei, Wei</au><au>Cong, Gao</au><au>Miao, Chunyan</au><au>Zhu, Feida</au><au>Li, Guohui</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Learning to Find Topic Experts in Twitter via Different Relations</atitle><jtitle>IEEE transactions on knowledge and data engineering</jtitle><stitle>TKDE</stitle><date>2016-07-01</date><risdate>2016</risdate><volume>28</volume><issue>7</issue><spage>1764</spage><epage>1778</epage><pages>1764-1778</pages><issn>1041-4347</issn><eissn>1558-2191</eissn><coden>ITKEEH</coden><abstract>Expert finding has become a hot topic along with the flourishing of social networks, such as micro-blogging services like Twitter. Finding experts in Twitter is an important problem because tweets from experts are valuable sources that carry rich information (e.g., trends) in various domains. However, previous methods cannot be directly applied to Twitter expert finding problem. Recently, several attempts use the relations among users and Twitter Lists for expert finding. Nevertheless, these approaches only partially utilize such relations. To this end, we develop a probabilistic method to jointly exploit three types of relations (i.e., follower relation, user-list relation, and list-list relation) for finding experts. Specifically, we propose a Semi-Supervised Graph-based Ranking approach (SSGR) to offline calculate the global authority of users. In SSGR, we employ a normalized Laplacian regularization term to jointly explore the three relations, which is subject to the supervised information derived from Twitter crowds. We then online compute the local relevance between users and the given query. By leveraging the global authority and local relevance of users, we rank all of users and find top-N users with highest ranking scores. Experiments on real-world data demonstrate the effectiveness of our proposed approach for topic-specific expert finding in Twitter.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TKDE.2016.2539166</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1041-4347
ispartof IEEE transactions on knowledge and data engineering, 2016-07, Vol.28 (7), p.1764-1778
issn 1041-4347
1558-2191
language eng
recordid cdi_proquest_journals_1795941182
source IEEE Electronic Library (IEL)
subjects Expert search
Experts
graph-based ranking
Knowledge discovery
Laplace equations
Learning
list
Lists
Mathematical analysis
micro-blogging
Natural language processing
Portable document format
Probabilistic logic
Query processing
Ranking
Regularization
Search problems
Social networks
Twitter
title Learning to Find Topic Experts in Twitter via Different Relations
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T06%3A16%3A54IST&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=Learning%20to%20Find%20Topic%20Experts%20in%20Twitter%20via%20Different%20Relations&rft.jtitle=IEEE%20transactions%20on%20knowledge%20and%20data%20engineering&rft.au=Wei,%20Wei&rft.date=2016-07-01&rft.volume=28&rft.issue=7&rft.spage=1764&rft.epage=1778&rft.pages=1764-1778&rft.issn=1041-4347&rft.eissn=1558-2191&rft.coden=ITKEEH&rft_id=info:doi/10.1109/TKDE.2016.2539166&rft_dat=%3Cproquest_RIE%3E1825495769%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=1795941182&rft_id=info:pmid/&rft_ieee_id=7426825&rfr_iscdi=true