Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Information diffusion through blogspace
ACM SIGKDD Explorations Newsletter
The dynamics of viral marketing
ACM Transactions on the Web (TWEB)
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
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)
Efficient influence maximization in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Extracting influential nodes on a social network for information diffusion
Data Mining and Knowledge Discovery
A note on maximizing the spread of influence in social networks
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Scalable Influence Maximization in Social Networks under the Linear Threshold Model
ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining
Opinion formation by voter model with temporal decay dynamics
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
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 anti-majority opinionists using the value-weighted mixture voter (VwMV) model. This problem is motivated by the fact that some people have a tendency to disagree with any opinion expressed by the majority. We extend the value-weighted voter model to include this phenomenon with the anti-majoritarian tendency of each node as a new parameter, and learn this parameter as well as the value of each opinion from a sequence of observed opinion data over a social network. We experimentally show that it is possible to learn the anti-majoritarian tendency of each node correctly as well as the opinion values, whereas a naive approach which is based on a simple counting heuristic fails. We also show theoretically that, in a situation where the local opinion share can be approximated by the average opinion share, it is not necessarily the case that the opinion with the highest value prevails and wins when the opinion values are non-uniform, whereas the opinion share prediction problem becomes ill-defined and any opinion can win when the opinion values are uniform. The simulation results support that this holds for typical real world social networks.