Automatic generation of overview timelines
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Bursty and hierarchical structure in streams
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
The dynamics of viral marketing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Feedback effects between similarity and social influence in online communities
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Blocking links to minimize contamination spread in a social network
ACM Transactions on Knowledge Discovery from Data (TKDD)
Minimizing the spread of contamination by blocking links in a network
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Detecting changes in information diffusion patterns over social networks
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Sections on Paraphrasing; Intelligent Systems for Socially Aware Computing; Social Computing, Behavioral-Cultural Modeling, and Prediction
Hi-index | 0.00 |
We address the problem of detecting the change in opinion share over a social network caused by an unknown external situation change under the value-weighted voter model with multiple opinions in a retrospective setting. The unknown change is treated as a change in the value of an opinion which is a model parameter, and the problem is reduced to detecting this change and its magnitude from the observed opinion share diffusion data. We solved this problem by iteratively maximizing the likelihood of generating the observed opinion share, and in doing so we devised a very efficient search algorithm which avoids parameter value optimization during the search. We tested the performance using the structures of four real world networks and confirmed that the algorithm can efficiently identify the change and outperforms the naive method, in which an exhaustive search is deployed, both in terms of accuracy and computation time.