Abstract In this paper, we present a new approach to detect global hot events and local hot events. Unlike previous event detection algorithms which do not distinguish between global events and local events, we believe it is important that we make that distinction as certain events can only be meaningful if they are placed in specific context while other events may arouse the interests of general users. The main contribution of this paper is that we’ve customized hot events detection by employing local community detection mechanisms and established a very clear concept for global hot events and local hot events. We present in this paper a multi-layer event detection algorithm which constructs a four-stage event detection procedure that produces a relatively comprehensive description of events relevant to the unique makeup and different interest of microblog users. Both the global hot events and local hot events we gathered are represented by a key tweet which contains sufficient information to depict a complete event. As a result of our algorithm's ability to precisely describe events which outperforms existing event detection algorithms, it is now possible for people to better understand public sentiment towards hot issues on microblogs. Experiments have shown that our multi-layer hot event detection algorithm can produce promising results in mining the interests of different communities, generating relevant event clusters and presenting meaningful events to community users. The most allround evaluation indicator F-value, which takes both precision and recall rate into account, has demonstrated that our algorithm outperforms the other three traditional approaches in detecting hot events.
[1]
Charu C. Aggarwal,et al.
Community Detection with Edge Content in Social Media Networks
,
2012,
2012 IEEE 28th International Conference on Data Engineering.
[2]
James Allan,et al.
Flexible intrinsic evaluation of hierarchical clustering for TDT
,
2003,
CIKM '03.
[3]
Chuan Zhou,et al.
Personalized influence maximization on social networks
,
2013,
CIKM.
[4]
Ee-Peng Lim,et al.
Finding Bursty Topics from Microblogs
,
2012,
ACL.
[5]
Li Guo,et al.
E-Tree: An Efficient Indexing Structure for Ensemble Models on Data Streams
,
2015,
IEEE Transactions on Knowledge and Data Engineering.
[6]
Hans-Peter Kriegel,et al.
Density-based community detection in social networks
,
2011,
2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application.
[7]
Qi He,et al.
Using Burstiness to Improve Clustering of Topics in News Streams
,
2007,
Seventh IEEE International Conference on Data Mining (ICDM 2007).
[8]
Li Guo,et al.
UBLF: An Upper Bound Based Approach to Discover Influential Nodes in Social Networks
,
2013,
2013 IEEE 13th International Conference on Data Mining.
[9]
Xun Wang,et al.
Real Time Event Detection in Twitter
,
2013,
WAIM.
[10]
Jean-Loup Guillaume,et al.
Fast unfolding of communities in large networks
,
2008,
0803.0476.
[11]
Michael I. Jordan,et al.
Latent Dirichlet Allocation
,
2001,
J. Mach. Learn. Res..