Lecture 2-1 Submodular Maximization Weili Wu Ding-Zhu Du University of Texas at Dallas.

Slides:

Advertisements

Similar presentations

1 Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization Joint work with Andreas Krause 1 Daniel Golovin.

Advertisements

Submodularity for Distributed Sensing Problems Zeyn Saigol IR Lab, School of Computer Science University of Birmingham 6 th July 2010.

University of Texas at Dallas

Approximation Algorithms

Minimizing Seed Set for Viral Marketing Cheng Long & Raymond Chi-Wing Wong Presented by: Cheng Long 20-August-2011.

Spread of Influence through a Social Network Adapted from :

1 Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization Daniel Golovin and Andreas Krause.

Parallel Double Greedy Submodular Maxmization Xinghao Pan, Stefanie Jegelka, Joseph Gonzalez, Joseph Bradley, Michael I. Jordan.

Maximizing the Spread of Influence through a Social Network

Ding-Zhu Du │ University of Texas at Dallas │ Lecture 7 Rumor Blocking 0.

Algorithms for Max-min Optimization

Sensor placement applications Monitoring of spatial phenomena Temperature Precipitation... Active learning, Experiment design Precipitation data from Pacific.

Zoë Abrams, Ashish Goel, Serge Plotkin Stanford University Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks.

Lecture 3 Power Law Structure Ding-Zhu Du Univ of Texas at Dallas.

Influence Maximization

Lecture 10 Matroid. Independent System Consider a finite set S and a collection C of subsets of S. (S,C) is called an independent system if i.e., it is.

Maximizing Product Adoption in Social Networks

DATA MINING LECTURE 13 Pagerank, Absorbing Random Walks Coverage Problems.

Approximation Algorithms

Chapter 2 Greedy Strategy I. Independent System Ding-Zhu Du.

Lecture 1-5 Power Law Structure Weili Wu Ding-Zhu Du Univ of Texas at Dallas.

COMP53311 Data Warehouse Prepared by Raymond Wong Presented by Raymond Wong

Chapter 6 Relaxation (1) CDS in unit disk graph

Problem Setting :Influence Maximization A new product is available in the market. Whom to give free samples to maximize the purchase of the product ? 1.

5 Maximizing submodular functions Minimizing convex functions: Polynomial time solvable! Minimizing submodular functions: Polynomial time solvable!

Lecture 3-1 Independent Cascade Weili Wu Ding-Zhu Du University of Texas at Dallas.

Tung-Wei Kuo, Kate Ching-Ju Lin, and Ming-Jer Tsai Academia Sinica, Taiwan National Tsing Hua University, Taiwan Maximizing Submodular Set Function with.

On Bharathi-Kempe-Salek Conjecture about Influence Maximization Ding-Zhu Du University of Texas at Dallas.

A Unified Continuous Greedy Algorithm for Submodular Maximization Moran Feldman Roy SchwartzJoseph (Seffi) Naor Technion – Israel Institute of Technology.

Lecture 5-1 Positive Influence Dominating Set Ding-Zhu Du Univ of Texas at Dallas.

Submodularity Reading Group Matroids, Submodular Functions M. Pawan Kumar

Polyhedral Optimization Lecture 5 – Part 3 M. Pawan Kumar Slides available online

Lecture 5-2 Target-Influence and Power Law Graphs Ding-Zhu Du Univ of Texas at Dallas.

Approximation Algorithms Greedy Strategies. I hear, I forget. I learn, I remember. I do, I understand! 2 Max and Min  min f is equivalent to max –f.

Lecture 2-3 Deterministic Difussion Weili Wu Ding-Zhu Du University of Texas at Dallas.

1/54 Rumor Source Detection: monitor placement Ding-Zhu Du Department of Computer Science University of Texas at Dallas.

Submodularity Reading Group Matroids, Submodular Functions M. Pawan Kumar

Seed Selection.

Independent Cascade Model and Linear Threshold Model

Heuristic & Approximation

Influence Maximization

Modularity Maximization

Power Law Structure Weili Wu Ding-Zhu Du Univ of Texas at Dallas

Distributed Submodular Maximization in Massive Datasets

Independent Cascade Model and Linear Threshold Model

Influence Maximization

Coverage and Distinguishability in Traffic Flow Monitoring

Lecture 23 Greedy Strategy

Coverage Approximation Algorithms

Detect rumor sources 2019/1/3

Lecture 11 Overview Self-Reducibility.

Approximation Algorithms

Rule Selection as Submodular Function

General Threshold and Cascade Models

Kempe-Kleinberg-Tardos Conjecture A simple proof

Lecture 21 More Approximation Algorithms

Monotone Nonsubmodular Maximization

Influence Maximization

A Better Approximation for Minimum Total Routing Path Clustering Problem in 2-D Underwater Sensor Networks Wei Wang, Donghyun Kim, and Weili Wu, A Better.

Viral Marketing over Social Networks

Independent Cascade Model and Linear Threshold Model

Dominating Set By Eric Wengert.

Survey on Coverage Problems in Wireless Sensor Networks - 2

Submodular Maximization with Cardinality Constraints

And Competitive Influence

Lecture 2-6 Complexity for Computing Influence Spread

Multiple Products.

Noncooperative Rumor Blocking

Data-Dependent Approximation

Guess Free Maximization of Submodular and Linear Sums

Presentation transcript:

Lecture 2-1 Submodular Maximization Weili Wu Ding-Zhu Du University of Texas at Dallas

Outline Kate Middleton effect Max Submodular Function 2

The trend effect that Kate, Duchess of Cambridge has on others, from cosmetic surgery for brides, to sales of coral-colored jeans.” “Kate Middleton effect Kate Middleton effect 3

According to Newsweek, "The Kate Effect may be worth £1 billion to the UK fashion industry." Tony DiMasso, L. K. Bennett’s US president, stated in 2012, "...when she does wear something, it always seems to go on a waiting list." Hike in Sales of Special Products 4

Influential persons often have many friends. Kate is one of the persons that have many friends in this social network. For more Kates, it’s not as easy as you might think! How to Find Kate? 5

Given a digraph and k>0, Find k seeds (Kates) to maximize the number of influenced persons (in one step). Domination Maximization 6

7 Theorem Proof

Outline Kate Middleton effect Submodular Maximization 8

Max Coverage Given a collection C of subsets of a set E, find a subcollection C’ of C, with |C’|<k, to maximize the number of elements covered by C’. Influence Maximization is a special case of Max Coverage.

Max Coverage Given a collection C of subsets of a set E, find a subcollection C’ of C, with |C’|<k, to maximize the number of elements covered by C’.

Submadular Function Max 11

Greedy Algorithm 12

Performance Ratio 13 Theorem (Nemhauser et al. 1978) Proof

14 Monotone increasing Why? Submodular!

Theorem 15

Exercise 16

Section

Independent System Consider a set E and a collection C of subsets of E. (E,C) is called an independent system if

Maximization c: E→R max c(A) s.t. AεC c(A) = Σ xεA c(x) +

Greedy Approximation MAX

Theorem

Proof

THANK YOU!