Learning to find topic experts in Twitter via different relations

• Main Authors: WEI, Wei, CONG, Gao, MIAO, Chunyan, ZHU, Feida, LI, Guohui
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2016
• Subjects: Expert search; Graph-based ranking; List; Micro-blogging; Twitter; Databases and Information Systems; Social Media
• Online Access: https://ink.library.smu.edu.sg/sis_research/3201; https://ink.library.smu.edu.sg/context/sis_research/article/4202/viewcontent/Learning_to_find_topic_experts_in_Twitter_via_different_relations_afv.pdf
• Institution: Singapore Management University

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