Personalized Influential Topic Search via Social Network Summarization

被引:49
作者
Li, Jianxin [1 ]
Liu, Chengfei [2 ]
Yu, Jeffrey Xu [3 ]
Chen, Yi [4 ,5 ]
Sellis, Timos [2 ]
Culpepper, J. Shane [1 ,6 ]
机构
[1] RMIT, Sch Sci, Melbourne, Vic, Australia
[2] Swinburne Univ Technol, Fac Sci Engn & Technol, Hawthorn, Vic 3122, Australia
[3] Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Hong Kong, Hong Kong, Peoples R China
[4] New Jersey Inst Technol, Martin Tuchman Sch Management, Newark, NJ 07102 USA
[5] New Jersey Inst Technol, Coll Comp Sci, Newark, NJ 07102 USA
[6] RMIT, Sch Sci, Melbourne, Vic, Australia
基金
美国国家科学基金会; 澳大利亚研究理事会;
关键词
Social network; personalized topic search; social summarization; INFLUENCE MAXIMIZATION;
D O I
10.1109/TKDE.2016.2542804
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Social networks are a vital mechanism to disseminate information to friends and colleagues. In this work, we investigate an important problem-the personalized influential topic search, or PIT-Search in a social network: Given a keyword query q issued by a user u in a social network, a PIT-Search is to find the top-k q-related topics that are most influential for the query user u. The influence of a topic to a query user depends on the social connection between the query user and the social users containing the topic in the social network. To measure the topics' influence at the similar granularity scale, we need to extract the social summarization of the social network regarding topics. To make effective topic-aware social summarization, we propose two random-walk based approaches: random clustering and an L-length random walk. Based on the proposed approaches, we can find a small set of representative users with assigned influential scores to simulate the influence of the large number of topic users in the social network with regards to the topic. The selected representative users are denoted as the social summarization of topic-aware influence spread over the social network. And then, we verify the usefulness of the social summarization by applying it to the problem of personalized influential topic search. Finally, we evaluate the performance of our algorithms using real-world datasets, and show the approach is efficient and effective in practice.
引用
收藏
页码:1820 / 1834
页数:15
相关论文
共 29 条
[1]  
[Anonymous], 1999, TECH REPORT STANFORD
[2]  
[Anonymous], 2003, PROC ACM SIGKDD INT
[3]  
[Anonymous], 2009, P 18 ACM C INF KNOWL
[4]  
Atrey P. K., 2007, TOMCCAP, V3
[5]   Efficient Influence Maximization in Social Networks [J].
Chen, Wei ;
Wang, Yajun ;
Yang, Siyu .
KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2009, :199-207
[6]  
Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI 10.1007/BF01386390
[7]   A Data-Based Approach to Social Influence Maximization [J].
Goyal, Amit ;
Bonchi, Francesco ;
Lakshmanan, Laks V. S. .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2011, 5 (01) :73-84
[8]  
Guo J, 2013, PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), P199
[9]  
Kim J, 2013, PROC INT CONF DATA, P266, DOI 10.1109/ICDE.2013.6544831
[10]  
Leskovec J, 2007, KDD-2007 PROCEEDINGS OF THE THIRTEENTH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P420