Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 69 for “"Influence maximization"”.

  1. Engineering scalable influence maximization

    … these few influential users. This is the influence maximization problem, where we want to maximize the influence spread using as few users as possible. As these social networks are huge, scalability and runtime of the algorithm to find the most influential users is of high importance. We …

    uvic Repository record for Engineering scalable influence maximization (opens in a new tab)

  2. BUDGET-CONSTRAINED ROBUST INFLUENCE MAXIMIZATION

    … traditional combinatorial, independent cascade influence maximization, we propose a continuous, correlation-robust influence maximization model. Instead of a deterministic seeding of nodes, a budgeted selection of discounts is now used to affect the likelihood of seeding. Additionally, edge …

    nps Repository record for BUDGET-CONSTRAINED ROBUST INFLUENCE MAXIMIZATION (opens in a new tab)

  3. Topic-Aware Influence Maximization Framework

    H διπλωματική εργασία εστιάζει στην ανάπτυξη ενός νέου πλαισίου για την αντιμετώπιση του προβλήματος της μεγιστοποίησης με επίγνωση θέματος. Το πρόβλημα παρουσιάζει υψηλή υπολογιστική πολυπλοκότητα και ανήκει στην περιοχή της κοινωνικής επιρροής η οποία περιλαμβάνει τόσο ψυχολογικές όσο και …

    athens Repository record for Topic-Aware Influence Maximization Framework (opens in a new tab)

  4. INFLUENCE MAXIMIZATION IN SOCIAL NETWORKS

    … it is watching a movie or purchasing a book, is influenced by his or her personal network to a certain degree. This thesis investigates the power of the “word-of-mouth” effect within social networks. Given a network G = (V, E, t) where t(v) denotes the threshold of node v, we model the spread of …

    concordia Download PDF for INFLUENCE MAXIMIZATION IN SOCIAL NETWORKS (opens in a new tab)

  5. Influence maximization in bandit and adaptive settings

    … A closely related problem is that of influence maximization which aims to identify the `best' set of `influential' users (seeds) to give discounts or free products to, such that awareness about the product is maximized. We study two relatively unexplored variants of influence …

    ubc Repository record for Influence maximization in bandit and adaptive settings (opens in a new tab) Download PDF for Influence maximization in bandit and adaptive settings (opens in a new tab)

  6. Scalable GPU Accelerated Influence Maximization in Social Networks

    The objective of the Influence Maximization problem is to identify a subset of k vertices in a network that, when activated, maximizes the spread of influence under a given diffusion process. Determining the optimal set of influential vertices, known as the seed set, is classified as NP-hard. …

    texas-state Repository record for Scalable GPU Accelerated Influence Maximization in Social Networks (opens in a new tab)

  7. Modeling and Solving Influence Maximization Problems in Social Networks

    … activities. In social networks, people can be influenced by what they share or receive, such as information, ideas, materials, or even contagious diseases. The planned selection of a few influential actors on real networks to deploy them as propagating sources may help boost the spread of …

    unsw Repository record for Modeling and Solving Influence Maximization Problems in Social Networks (opens in a new tab)

  8. Mathematical Programming Models for Influence Maximization on Social Networks

    … combinatorics) to develop exact approaches for influence maximization on social networks. We study four combinatorial optimization problems that deal with maximizing influence at minimum cost over a social network. To our knowl- edge, all previous work to date involving influence maximization …

    maryland Repository record for Mathematical Programming Models for Influence Maximization on Social Networks (opens in a new tab)

  9. Influence maximization and inference of opinion dynamics on complex networks

    Influence maximization has commonly been studied in the context of strategically allocating resources to agents in a network to maximize the spread of an opinion. In the first part of this thesis, we relate influence maximization to network control and consider a version of an inter-temporal …

    soton Download PDF for Influence maximization and inference of opinion dynamics on complex networks (opens in a new tab)

  10. Targeted Influence Maximization In Labeled Social Networks with Non-Target Constraints

    <p>The objective of influence maximization problem is to find a set of highly influential nodes that maximizes the spread of influence in a social network. Such a set of nodes is called seed set. Targeted labeled influence maximization problem is an extension that attempts to find a seed set that …

    iastate Repository record for Targeted Influence Maximization In Labeled Social Networks with Non-Target Constraints (opens in a new tab)

  11. Critical Cliques and Their Application to Influence Maximization in Online Social Networks

    … cliques to propose a new way for solving the influence maximization problem in online social networks. Influence maximization in online social networks is the problem of identifying a small, initial set of influential individuals which can influence the maximum number of individuals in the …

    tamu Repository record for Critical Cliques and Their Application to Influence Maximization in Online Social Networks (opens in a new tab)

  12. Scalable approximate algorithm for group influence maximization in online social network: An experimental evaluation

    … optimization problem. We show that group influence maximization in the context of online social networks is an instance of this optimization problem with cardinality constraint and δ-oracle. We develop a new scalable strategy for solving multiobjective problems where the objective …

    iastate Repository record for Scalable approximate algorithm for group influence maximization in online social network: An experimental evaluation (opens in a new tab)

  13. An Algorithm for Influence Maximization and Target Set Selection for the Deterministic Linear Threshold Model

    The problem of influence maximization has been studied extensively with applications that include viral marketing, recommendations, and feed ranking. The optimization problem, first formulated by Kempe, Kleinberg and Tardos, is known to be NP-hard. Thus, several heuristics have been proposed to …

    vt Repository record for An Algorithm for Influence Maximization and Target Set Selection for the Deterministic Linear Threshold Model (opens in a new tab)

  14. Identifying Influential Agents In Social Systems

    This dissertation addresses the problem of influence maximization in social networks. In- fluence maximization is applicable to many types of real-world problems, including modeling contagion, technology adoption, and viral marketing. Here we examine an advertisement domain in which the overarching …

    ucf Repository record for Identifying Influential Agents In Social Systems (opens in a new tab)

  15. IDENTIFYING INFLUENTIAL SPREADERS IN COMPLEX NETWORKS

    Influence maximization is the problem of identifying the set of nodes that maximize the size of the outbreak of a spreading process occurring on the network. This problem is important for strategic decisions in marketing and political campaigns. Typically, the problem consists of finding small sets …

    iu Repository record for IDENTIFYING INFLUENTIAL SPREADERS IN COMPLEX NETWORKS (opens in a new tab)

  16. Μεγιστοποίηση επιρροής σε δυναμικά κοινωνικά δίκτυα και γράφους, πλήρως και μερικώς παρατηρούμενα

    Influence maximization in dynamic social networks is a critical problem in the study of socialgraphs, with applications in marketing, information diffusion, and public policy. This dissertation analyzes influence maximization in dynamic social networks, considering both fully and partially …

    greece Repository record for Μεγιστοποίηση επιρροής σε δυναμικά κοινωνικά δίκτυα και γράφους, πλήρως και μερικώς παρατηρούμενα (opens in a new tab)

  17. Hardware Acceleration of Machine Learning and Combinatorial Optimization Problems

    … CO problems, including Satisfiability, Influence Maximization, and Extractive Summarization, are implemented on COBI through hardware-aware workflows involving problem formulation, decomposition, and preprocessing. The Satisfiability study demonstrates the first realization of SAT on a …

    umn Repository record for Hardware Acceleration of Machine Learning and Combinatorial Optimization Problems (opens in a new tab)

  18. Technology Diffusion on Spiders

    … assume a node’s behaviour in a social network is influenced only by its immediate neighbours. Goldberg and Liu (2013) argued that such models may not represent the information diffusion process in several real world scenarios accurately. They proposed the technology diffusion model, where a node’s …

    waterloo Repository record for Technology Diffusion on Spiders (opens in a new tab)

  19. High Dimensional Learning with Structure Inducing Constraints and Regularizers

    … set function optimization problem, the social influence maximization, under the novel ``heat conduction'' influence propagation model. We formulate the problem as a submodular maximization with cardinality constraints and provide an efficient algorithm for it. Through extensive experiments on …

    umn Repository record for High Dimensional Learning with Structure Inducing Constraints and Regularizers (opens in a new tab)

Page 1 of 4