Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Security and Communication Networks
Group affinity based social trust model for an intelligent movie recommender system
Multimedia Tools and Applications
Hi-index | 0.00 |
We address the problem of predicting link attachments to complex networks. As one approach to this problem, we focus on combining network growth (or information propagation) models with machine learning techniques. In this paper, we present a method for predicting link conversions based on the estimated probability of information propagation on each link. In our experiments using a real blogroll network, we show that the proposed method substantially improved the predictive performance based on the F-measure, in comparison to other methods using some conventional criteria.