{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# advertising - CS 345 Data Mining Online algorithms Search...

This preview shows pages 1–12. Sign up to view the full content.

CS 345 Data Mining Online algorithms Search advertising

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Online algorithms box3 Classic model of algorithms square6 You get to see the entire input, then compute some function of it square6 In this context, “offline algorithm” box3 Online algorithm square6 You get to see the input one piece at a time, and need to make irrevocable decisions along the way box3 How is this different from the data stream model?
Example: Bipartite matching 1 2 3 4 a b c d Girls Boys

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Example: Bipartite matching 1 2 3 4 a b c d M = {(1,a),(2,b),(3,d)} is a matching Cardinality of matching = |M| = 3 Girls Boys
Example: Bipartite matching 1 2 3 4 a b c d Girls Boys M = {(1,c),(2,b),(3,d),(4,a)} is a perfect matching

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Matching Algorithm box3 Problem: Find a maximum-cardinality matching square6 A perfect one if it exists box3 There is a polynomial-time offline algorithm (Hopcroft and Karp 1973) box3 But what if we don’t have the entire graph upfront?
Online problem box3 Initially, we are given the set Boys box3 In each round, one girl’s choices are revealed box3 At that time, we have to decide to either: square6 Pair the girl with a boy square6 Don’t pair the girl with any boy box3 Example of application: assigning tasks to servers

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Online problem 1 2 3 4 a b c d (1,a) (2,b) (3,d)
Greedy algorithm box3 Pair the new girl with any eligible boy square6 If there is none, don’t pair girl box3 How good is the algorithm?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Competitive Ratio box3 For input I, suppose greedy produces matching M greedy while an optimal matching is M opt Competitive ratio = min all possible inputs I (|M greedy |/|M opt |)
Analyzing the greedy algorithm box3 Consider the set G of girls matched in M opt but not in M greedy box3 Then it must be the case that every boy

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern