Repository logoGCRIS
  • English
  • Türkçe
  • Русский
Log In
New user? Click here to register. Have you forgotten your password?
Home
Communities
Browse GCRIS
Entities
Overview
GCRIS Guide
  1. Home
  2. Browse by Author

Browsing by Author "Altinel, I. Kuban"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    Article
    Citation - WoS: 12
    Citation - Scopus: 18
    Minimizing the Misinformation Spread in Social Networks
    (Taylor and Francis, 2019) Güney, Evren; Kuban, İ. Kuban Altınel; Tanınmış, Kübra; Aras, Necati; Altinel, I. Kuban
    The Influence Maximization Problem has been widely studied in recent years, due to rich application areas including marketing. It involves finding k nodes to trigger a spread such that the expected number of influenced nodes is maximized. The problem we address in this study is an extension of the reverse influence maximization problem, i.e., misinformation minimization problem where two players make decisions sequentially in the form of a Stackelberg game. The first player aims to minimize the spread of misinformation whereas the second player aims its maximization. Two algorithms, one greedy heuristic and one matheuristic, are proposed for the first player’s problem. In both of them, the second player’s problem is approximated by Sample Average Approximation, a well-known method for solving two-stage stochastic programming problems, that is augmented with a state-of-the-art algorithm developed for the influence maximization problem.
Repository logo
Collections
  • Scopus Collection
  • WoS Collection
  • TrDizin Collection
  • PubMed Collection
Entities
  • Research Outputs
  • Organizations
  • Researchers
  • Projects
  • Awards
  • Equipments
  • Events
About
  • Contact
  • GCRIS
  • Research Ecosystems
  • Feedback
  • OAI-PMH

Log in to GCRIS Dashboard

GCRIS Mobile

Download GCRIS Mobile on the App StoreGet GCRIS Mobile on Google Play

Powered by Research Ecosystems

  • Privacy policy
  • End User Agreement
  • Feedback