460 likes | 516 Views
Lecture 2-1. Monotone Submodular Maximization. Weili Wu Ding-Zhu Du University of Texas at Dallas. Lecture 1-1. What is a submodular function?. Consider a function f on all subsets of a set E . f is submodular if. What is monotone ?. f is monotone (nondecreasing) if.
E N D
Lecture 2-1 Monotone Submodular Maximization Weili Wu Ding-Zhu Du University of Texas at Dallas Lecture 1-1
What is a submodular function? Consider a function f on all subsets of a set E. f is submodular if
What is monotone ? f is monotone (nondecreasing) if
Performance Ratio Theorem 1(Nemhauser et al. 1978) Proof
Proof Monotone increasing Submodular! Why?
Example 1: 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’ .
Example 2: Influence Max • What is social network? • What is social influence? • What is influence maximization?
What is Social Network? Wikipedia Definition: Social Structure • Nodes:Social actors (individuals or organizations) • Links:Social relations
What is Social Influence? [1] http://en.wikipedia.org/wiki/Social_influence • Social influence occurs when one's opinions, emotions, or behaviors are affected by others, intentionally or unintentionally.[1] • Informational social influence: to accept information from another; • Normative social influence: to conform to the positive expectations of others.
Kate Middleton effect “Kate Middleton effect The trend effect that Kate, Duchess of Cambridge has on others, from cosmetic surgery for brides, to sales of coral-colored jeans.”
Hike in Sales of Special Products • 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."
How to Find Kate? • 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!
Influence Maximization • Given a digraph and k>0, • Find k seeds (Kates) to maximize the number of influenced persons (possibly in many steps).
Theorem Proof
Naïve Greedy Algorithm Performance is not good, why?
Knapsack 1/2-approximation
An Generalization Theorem 2
A Variation Theorem 2
Knapsack has PTAS Why?
An Generalization Theorem 3
Greedy Approximation Theorem 1