The Application of Network based Embedding in Local Topic Detection from Social Media

被引:1
作者
Chen, Junsha [1 ,2 ,3 ]
Gao, Neng [1 ,3 ]
Xue, Cong [1 ,3 ]
Zhang, Yifei [1 ,2 ,3 ]
Tu, Chenyang [1 ,3 ]
Li, Min [1 ,3 ]
机构
[1] Chinese Acad Sci, State Key Lab Informat Secur, Inst Informat Engn, Beijing, Peoples R China
[2] Univ Chinese Acad Sci, Sch Cyber Secur, Beijing, Peoples R China
[3] Chinese Acad Sci, Inst Informat Engn, Beijing, Peoples R China
来源
2019 IEEE 31ST INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2019) | 2019年
基金
中国国家自然科学基金;
关键词
Network based embedding; Local topic detection; Social media;
D O I
10.1109/ICTAI.2019.00182
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Detecting local topic from social media is an important task for many applications, such as local event discovery and activity recommendation. Recent years have witnessed growing interest in utilizing spatio-temporal social media for local topic detection. However, conventional topic models consider keywords as independent items, which suffer great limitations in modeling short texts from social media. Therefore, some studies introduce embedding into topic models to preserve the semantic correlation among keywords of short texts. Nevertheless, due to the lack of rich contexts in social media, the performance of these embedding based topic models still remain unsatisfactory. In order to enrich the contexts of keywords, we propose two network based embedding methods, both of which can generate rich contexts for keywords by random walks and produce coherent keyword embeddings for topic modeling. Besides, processing continuous spatio-temporal information in social media is also very challenging. Most of the existing methods simply split time and location into equal-size units, which fall short in capturing the continuity of spatio-temporal information. To address this issue, we present a hotspot detection algorithm to identify spatial and temporal hotspots, which can address spatio-temporal continuity and alleviate data sparsity. Finally, the experiments show that the performance of our methods has been improved significantly compared to the state-of-the-art methods.
引用
收藏
页码:1311 / 1319
页数:9
相关论文
共 20 条
[1]  
ALVAREZ GA, 2006, KDD, P424
[2]  
[Anonymous], 2011, WWW, DOI DOI 10.1145/1963405.1963443
[3]   Latent Dirichlet allocation [J].
Blei, DM ;
Ng, AY ;
Jordan, MI .
JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) :993-1022
[4]  
Comaniciu D., 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision, P1197, DOI 10.1109/ICCV.1999.790416
[5]  
Das R, 2015, PROCEEDINGS OF THE 53RD ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 7TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING, VOL 1, P795
[6]  
Ester M., 1996, KDD-96 Proceedings. Second International Conference on Knowledge Discovery and Data Mining, P226
[7]  
Feng W, 2015, PROC INT CONF DATA, P1561, DOI 10.1109/ICDE.2015.7113425
[8]   node2vec: Scalable Feature Learning for Networks [J].
Grover, Aditya ;
Leskovec, Jure .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :855-864
[9]  
Hinneburg A., 2014, ABS14036397 CORR
[10]  
Kamath U, 2013, GECCO'13: PROCEEDINGS OF THE 2013 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, P1053