The Community for Technology Leaders
2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) (2014)
China
Aug. 17, 2014 to Aug. 20, 2014
ISBN: 978-1-4799-5877-1
pp: 417-424
Shota Saito , Graduate School of Information Science and Technology, The University of Tokyo, Japan
Ryota Tomioka , Toyota Technological Institute at Chicago, Chicago, USA
Kenji Yamanishi , Graduate School of Information Science and Technology, The University of Tokyo, Japan
ABSTRACT
In social networking services (SNSs), persistent topics are extremely rare and valuable. In this paper, we propose an algorithm for the detection of persistent topics in SNSs based on Topic Graph. A topic graph is a subgraph of the ordinary social network graph that consists of the users who shared a certain topic up to some time point. Based on the assumption that the time-evolutions of the topic graphs associated with a persistent and non-persistent topics are different, we propose to detect persistent topics by performing anomaly detection on the feature values extracted from the time-evolution of the topic graph. For anomaly detection, we use principal component analysis to capture the subspace spanned by normal (non-persistent) topics. We demonstrate our technique on a real data set we gathered from Twitter and show that it performs significantly better than a base-line method based on power law curve fitting and the linear influence model.
INDEX TERMS
Analytical models,
CITATION

S. Saito, R. Tomioka and K. Yamanishi, "Early detection of persistent topics in social networks," 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), China, 2014, pp. 417-424.
doi:10.1109/ASONAM.2014.6921620
96 ms
(Ver 3.3 (11022016))