Endüstri Mühendisliği Bölümü Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1942

Browse

Filters

2020 - 20212

Settings

COAR Access Rights: search.filters.coarAccessRights.metadata only accessSubject: search.filters.subject.Influence maximization

Search Results

Now showing 1 - 2 of 2
  • Article
    Citation - WoS: 35
    Citation - Scopus: 36
    Large-Scale Influence Maximization Via Maximal Covering Location
    (Elsevier, 2021-02-01) Güney, Evren; Ruthmair, Mario; Sinnl, Markus; Leitner, Markus
    Influence maximization aims at identifying a limited set of key individuals in a (social) network which spreads information based on some propagation model and maximizes the number of individuals reached. We show that influence maximization based on the probabilistic independent cascade model can be modeled as a stochastic maximal covering location problem. A reformulation based on Benders decomposition is proposed and a relation between obtained Benders optimality cuts and submodular cuts for correspondingly defined subsets is established. We introduce preprocessing tests, which allow us to remove variables from the model and develop efficient algorithms for the separation of Benders cuts. Both aspects are shown to be crucial ingredients of the developed branch-and-cut algorithm since real-life social network instances may be very large. In a computational study, the considered variants of this branch-and-cut algorithm outperform the state-of-the-art approach for influence maximization by orders of magnitude.
  • Article
    An Efficient Linear Programming Based Method for the Influence Maximization Problem in Social Networks (vol 503, Pg 589, 2019)
    (Elsevier, 2020-02-01) Güney, Evren
    The influence maximization problem (IMP) aims to determine the most influential individuals within a social network. In this study first we develop a binary integer program that approximates the original problem by Monte Carlo sampling. Next, to solve IMP efficiently, we propose a linear programming relaxation based method with a provable worst case bound that converges to the current state-of-the-art 1-1/e bound asymptotically. Experimental analysis indicate that the new method is superior to the state-of-the-art in terms of solution quality and this is one of the few studies that provides approximate optimal solutions for certain real life social networks.