A global optimization algorithm for target set selection problems

DOI10.1016/J.INS.2013.09.033MaRDI QIDQ2629957zbMATH OpenOpenAlexFDO

Authors Cheng Wang, Lili Deng, Gengui Zhou, Meixian Jiang

Publication date 8 July 2016

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2013.09.033

zbMATH Keywords

diffusion of informationgenetic algorithmmarketingsocial networktarget set selection

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Marketing, advertising (90B60) Approximation methods and heuristics in mathematical programming (90C59) Social networks; opinion dynamics (91D30)

Recommendations

• Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems
• A fast and effective heuristic for discovering small target sets in social networks
• Discovering small target sets in social networks: a fast and effective algorithm
• Guided genetic algorithm for the influence maximization problem
• Automata, Languages and Programming

Cites work

• A simple model of global cascades on random networks
• A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
• Automata, Languages and Programming
• Cascading behavior in networks: algorithmic and economic issues
• Collective dynamics of `small-world' networks
• Distributed estimation over complex networks
• Emergence of Scaling in Random Networks
• Employment of an evolutionary heuristic to solve the target allocation problem efficiently
• Exploring complex networks
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• scientific article; zbMATH DE number 107465 (Why is no real title available?)
• Non-negative matrices and Markov chains.
• On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
• Random Graphs
• Solving the response time variability problem by means of a genetic algorithm
• Some results on the target set selection problem

Cited in

(8)

• Target-oriented branch and bound method for global optimization
• Deprecation based greedy strategy for target set selection in large scale social networks
• Some results on the target set selection problem
• An approximate marginal spread computation approach for the budgeted influence maximization with delay
• Guided genetic algorithm for the influence maximization problem
• Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems
• On efficient \( k\)-optimal-location-selection query processing in metric spaces
• Identifying a set of key members in social networks using SDP-based stochastic search and integer programming algorithms

Describes a project that uses

Uses Software

• Genocop

This page was built for publication: A global optimization algorithm for target set selection problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629957)