TY - GEN
T1 - Don't let me be #misunderstood
T2 - 9th International Conference on Web and Social Media, ICWSM 2015
AU - Tsur, Oren
AU - Rappoport, Ari
N1 - Publisher Copyright:
© Copyright 2015, Association for the Advancement of Artificial Intelligence. All rights reserved.
PY - 2015/1/1
Y1 - 2015/1/1
N2 - Prediction of the popularity of online textual snippets gained much attention in recent years. In this paper we investigate some of the factors that contribute to popularity of specific phrases such as Twitter hashtags. We define a new prediction task and propose a linguistically motivated algorithm for accurate prediction of hashtag popularity. Our prediction algorithm successfully models the interplay between various constraints such as the length restriction, typing effort and ease of comprehension. Controlling for network structure and social aspects we get a glimpse into the processes that shape the way we produce language and coin new words. In order to learn the interactions between the constraints we cast the problem as a ranking task. We adapt Gradient Boosted Trees for learning ranking functions in order to predict the hashtags/neologisms to be accepted. Our results outperform several baseline algorithms including SVM-rank, while maintaining higher interpretability, thus our model's prediction power can be used for better crafting of future hashtags.
AB - Prediction of the popularity of online textual snippets gained much attention in recent years. In this paper we investigate some of the factors that contribute to popularity of specific phrases such as Twitter hashtags. We define a new prediction task and propose a linguistically motivated algorithm for accurate prediction of hashtag popularity. Our prediction algorithm successfully models the interplay between various constraints such as the length restriction, typing effort and ease of comprehension. Controlling for network structure and social aspects we get a glimpse into the processes that shape the way we produce language and coin new words. In order to learn the interactions between the constraints we cast the problem as a ranking task. We adapt Gradient Boosted Trees for learning ranking functions in order to predict the hashtags/neologisms to be accepted. Our results outperform several baseline algorithms including SVM-rank, while maintaining higher interpretability, thus our model's prediction power can be used for better crafting of future hashtags.
UR - http://www.scopus.com/inward/record.url?scp=84960976737&partnerID=8YFLogxK
U2 - 10.1609/icwsm.v9i1.14603
DO - 10.1609/icwsm.v9i1.14603
M3 - Conference contribution
AN - SCOPUS:84960976737
T3 - Proceedings of the 9th International Conference on Web and Social Media, ICWSM 2015
SP - 426
EP - 435
BT - Proceedings of the 9th International Conference on Web and Social Media, ICWSM 2015
PB - AAAI press
Y2 - 26 May 2015 through 29 May 2015
ER -