Using word embeddings in Twitter election classification

被引:91
作者
Yang, Xiao [1 ]
Macdonald, Craig [1 ]
Ounis, Iadh [1 ]
机构
[1] Univ Glasgow, Sch Comp Sci, Glasgow, Lanark, Scotland
来源
INFORMATION RETRIEVAL JOURNAL | 2018年 / 21卷 / 2-3期
关键词
Word embedding; CNN; Twitter; Election classification; Word2vec;
D O I
10.1007/s10791-017-9319-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
080201 [机械制造及其自动化];
摘要
Word embeddings and convolutional neural networks (CNN) have attracted extensive attention in various classification tasks for Twitter, e.g. sentiment classification. However, the effect of the configuration used to generate the word embeddings on the classification performance has not been studied in the existing literature. In this paper, using a Twitter election classification task that aims to detect election-related tweets, we investigate the impact of the background dataset used to train the embedding models, as well as the parameters of the word embedding training process, namely the context window size, the dimensionality and the number of negative samples, on the attained classification performance. By comparing the classification results of word embedding models that have been trained using different background corpora (e.g. Wikipedia articles and Twitter microposts), we show that the background data should align with the Twitter classification dataset both in data type and time period to achieve significantly better performance compared to baselines such as SVM with TF-IDF. Moreover, by evaluating the results of word embedding models trained using various context window sizes and dimensionalities, we find that large context window and dimension sizes are preferable to improve the performance. However, the number of negative samples parameter does not significantly affect the performance of the CNN classifiers. Our experimental results also show that choosing the correct word embedding model for use with CNN leads to statistically significant improvements over various baselines such as random, SVM with TF-IDF and SVM with word embeddings. Finally, for out-of-vocabulary (OOV) words that are not available in the learned word embedding models, we show that a simple OOV strategy to randomly initialise the OOV words without any prior knowledge is sufficient to attain a good classification performance among the current OOV strategies (e.g. a random initialisation using statistics of the pre-trained word embedding models).
引用
收藏
页码:183 / 207
页数:25
相关论文
共 36 条
[1]
Amati G., 2011, P TREC
[2]
[Anonymous], 2013, P 2013 C N AM CHAPTE
[3]
[Anonymous], P 9 INT WORKSH SEM E
[4]
[Anonymous], 2015, P WORKSH NOIS US GEN, DOI DOI 10.18653/V1/W15-4322
[5]
Bansal M, 2014, PROCEEDINGS OF THE 52ND ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, VOL 2, P809
[6]
*BBC, 2015, VEN OPP POL IUIS MAN
[7]
Bengio Y, 2001, ADV NEUR IN, V13, P932
[8]
BERMINGHAM A, 2011, P SAAIP WORKSH IJCNL
[9]
Bojanowski P, 2017, Transactions of the Association for Computational Linguistics, V5, P135, DOI [10.1162/tacla00051, DOI 10.1162/TACLA00051, 10.1162/tacl_a_00051]