A particle-learning-based approach to estimate the influence matrix of online social networks
From MaRDI portal
(Redirected from Publication:1663084)
Recommendations
- Learning influence from heterogeneous social networks
- Learning Influence Structure in Sparse Social Networks
- On the approximability of influence in social networks
- Inferring Social Influence in Dynamic Networks
- Online social networks under hypergraph structure and their hidden influence evaluation
- Better approximation algorithms for influence maximization in online social networks
Cites work
- scientific article; zbMATH DE number 1666093 (Why is no real title available?)
- scientific article; zbMATH DE number 2061746 (Why is no real title available?)
- A CENTRAL LIMIT THEOREM AND A STRONG MIXING CONDITION
- CONTINUOUS OPINION DYNAMICS UNDER BOUNDED CONFIDENCE: A SURVEY
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Modelling exchange of probabilistic opinions
- On particle methods for parameter estimation in state-space models
- Opinion fluctuations and disagreement in social networks
- Particle Filtering for Large-Dimensional State Spaces With Multimodal Observation Likelihoods
- Particle learning and smoothing
- Particle learning for general mixtures
- Predicting the structural evolution of networks by applying multivariate time series
- Predicting unobserved links in incompletely observed networks
- Reaching a Consensus
- Using retrospective sampling to estimate models of relationship status in large longitudinal social networks
Cited in
(2)
This page was built for publication: A particle-learning-based approach to estimate the influence matrix of online social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663084)