Xiang Sun

Xiang Sun

Auto-generated profile, based on publicly available information

Xiang Sun

School of Informatics, University of Leicester, UK

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2017
Verified
Conference Paper
Closed access
LSLEILEI SHI
LEILEI SHI
YWYan Wu
Yan Wu
LLLu Liu
Lu Liu
XSXiang Sun
Xiang Sun
LJLiang Jiang
Liang Jiang
Microblogging, as a popular social media service, has become a new information channel for users to receive and exchange the most up-to-date information on current events. Consequently, it is crucial to detect new emerging events and to discover the key posts which have the potential to actively disseminate the events through microblogging. However, traditional event detection models require human intervention for detecting the number of topics to be explored, which significantly reduces the efficiency and accuracy of event detection. Most of the existing methods focus only on event detection and are unable to discover the key posts related to the events, making it challenging to track momentous events in timely manner. To tackle these problems, a HITS (Hypertext Induced Topic Search) based topic decision method, named TD-HITS is proposed. TD-HITS can automatically detect the number of topics as well as discovering associated key posts from a large number of posts. The experimental results are based on a Twitter dataset to demonstrate the effectiveness of our proposed methods for both detecting events and identifying key posts.

6 November 2019 in IEEE Access
Verified
Journal Article
Open access
JGJun Ge
Jun Ge
LSLEILEI SHI
LEILEI SHI
LLLu Liu
Lu Liu
XSXiang Sun
Xiang Sun
with the rapid development of online social networks, there is a trend of information interconnection among online social networks. User’s social behaviors are no longer confined to a single network but interact in the form of overlapping networks. Studying the problem of maximizing the influence of overlapping networks can not only make the influence spread to the extent that a single network cannot reach, but also effectively control the cost of advertising while maintaining the scope of diffusion. However, the existing models of user identification and influence propagation in overlapping networks are still not efficient enough. For this reason, this paper studies the problem of maximizing influence in overlapping networks based on user interests. First, network coupling is carried out through the "bridge" role of overlapping network users; secondly, independent cascade model is used. On the basis of this, a User Interest-based Influence Propagation Model of the Overlay Network (UI-IPM) is designed. Finally, based on the UI-IPM model, a heuristic algorithm combined with the greedy algorithm is designed to maximize the impact of overlapping networks (UI-IPM) and achieve Influence Maximization of the Overlay Network (IMON) mining seed nodes. The experimental results show the effectiveness of IMON algorithm in terms of influence sphere and time efficiency, and also verify the efficiency of seed nodes mining in overlapping network environment compared with a single network environment.