pith. sign in

arxiv: 1812.04677 · v1 · pith:TV2IL7OJnew · submitted 2018-12-11 · 💻 cs.SI · cs.LG· stat.ML

Contrastive Training for Models of Information Cascades

classification 💻 cs.SI cs.LGstat.ML
keywords trainingmodelcascadesfeaturesinformationmodelsunsupervisedachieves
0
0 comments X
read the original abstract

This paper proposes a model of information cascades as directed spanning trees (DSTs) over observed documents. In addition, we propose a contrastive training procedure that exploits partial temporal ordering of node infections in lieu of labeled training links. This combination of model and unsupervised training makes it possible to improve on models that use infection times alone and to exploit arbitrary features of the nodes and of the text content of messages in information cascades. With only basic node and time lag features similar to previous models, the DST model achieves performance with unsupervised training comparable to strong baselines on a blog network inference task. Unsupervised training with additional content features achieves significantly better results, reaching half the accuracy of a fully supervised model.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.