Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 193169 (Why is no real title available?)
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- A Nash equilibrium based algorithm for mining hidden links in social networks
- A novel approach for detecting multiple rumor sources in networks with partial observations
- Adaptive robust submodular optimization and beyond
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- An analysis of approximations for maximizing submodular set functions—I
- An analysis of the greedy algorithm for the submodular set covering problem
- Approximation for the minimum cost doubly resolving set problem
- Assortment optimization under a multinomial logit model with position bias and social influence
- Community-based rumor blocking maximization in social networks: algorithms and analysis
- Design and analysis of approximation algorithms
- Finding rumor sources on random trees
- Influence maximization with partial feedback
- Maximizing social influence in nearly optimal time
- Mining hidden links in social networks to achieve equilibrium
- Product sequencing and pricing under cascade browse model
- Rumors in a Network: Who's the Culprit?
Cited in
(2)
This page was built for publication: Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077937)