Proceedings of the Fifth International Conference on Network, Communication and Computing 2016
DOI: 10.1145/3033288.3033312
|View full text |Cite
|
Sign up to set email alerts
|

Graph Clustering-Based Emerging Event Detection from Twitter Data Stream

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(17 citation statements)
references
References 18 publications
0
17
0
Order By: Relevance
“…In addition, the precision percentage that has obtained was not high and the model has not given a clear summary for the discovered events. Manaskasemsak et al (2016) divided Twitter stream into two-time windows of 15 days. Subsequently, Markov Clustering Algorithm (MCA) was employed to detect events from the undirected weighted graph which has built from features extracted using TFIDF.…”
Section: Graph-based Clustering Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…In addition, the precision percentage that has obtained was not high and the model has not given a clear summary for the discovered events. Manaskasemsak et al (2016) divided Twitter stream into two-time windows of 15 days. Subsequently, Markov Clustering Algorithm (MCA) was employed to detect events from the undirected weighted graph which has built from features extracted using TFIDF.…”
Section: Graph-based Clustering Methodsmentioning
confidence: 99%
“…Different from Twitter, some SNs (e.g., Facebook) have privacy issues that limit the collection process to just offline publicly available data that have been given permissions to be collected (Chen et al, 2016). Becker et al (2011a;Phuvipadawat and Murata, 2010;Sakaki et al, 2010;Popescu et al, 2011;Ritter et al, 2012;Li et al, 2012a;Weng and Lee, 2011;Sankaranarayanan et al, 2009;Culotta, 2010;Osborne et al, 2012;Subašić and Berendt, 2011;Becker et al, 2012;Abhik and Toshniwal, 2013;Petrović et al, 2010;Ishikawa et al, 2012;Mathioudakis and Koudas, 2010;Long et al, 2011;Rosa et al, 2011;Popescu and Pennacchiotti, 2010;Benson et al, 2011;Lee and Sumiya, 2010;Mehrotra et al, 2013;Rajani et al, 2014;Weng et al, 2010;Zhao et al, 2011;Diao et al, 2012;Dong et al, 2015;Fang et al, 2014;Cataldi et al, 2010;Cordeiro, 2012;Kwan et al, 2013;Weiler et al, 2014;Aggarwal and Subbian, 2012;Tembhurnikar and Patil, 2015;Katragadda et al, 2017;Manaskasemsak et al, 2016;Zhang et al, 2015;Huang et al, 2013;Kaleel et al, 2013;Rafea an...…”
Section: Concepts Of Event Detectionmentioning
confidence: 99%
“…Furthermore, if no previous knowledge about the type of crisis and hence no keywords are available, the user can track all social media data for a selected region without entering any specific keywords. Because the system is able to track bursts resulting from increasing numbers of similar messages or evolving geotopic clusters, new unexpected events can be detected [23]. If the number of messages relating to any tracked query reaches some predefined thresholds, an automatic alert, in form of a visual or acoustical signal, is triggered.…”
Section: Design and Evaluationmentioning
confidence: 99%
“…F ∈ Vt is an n-dimensional optimal features F = {F1, F2, …., Fn}, which have obtained from previous phase and represent a set of nodes within the time interval t. Subsequently, a weight w ∈ Wt will be assigned to the edge e (F1, F2) ∈ Et. The weight is calculated using the following adapted Equation which was proposed in [22]:…”
Section: Event Detection Phasementioning
confidence: 99%
“…Additionally, they generate good clustering results and has the ability to deal well with noisy contents [27]. On top of all that, they does not require to specify the number of clusters in advance and this is ideal as events often occur without prior warning or knowledge [22]. Therefore, a dynamic graph-based technique is used by this study to identify the clusters from the undirected weighted graph.…”
Section: Event Detection Phasementioning
confidence: 99%