stanford大学-大数据挖掘-advertising-19.pptVIP

  • 0
  • 0
  • 约6.94千字
  • 约 36页
  • 2017-06-10 发布于四川
  • 举报
CS 345 Data Mining Online algorithms Search advertising Online algorithms Classic model of algorithms You get to see the entire input, then compute some function of it In this context, “offline algorithm” Online algorithm You get to see the input one piece at a time, and need to make irrevocable decisions along the way Similar to data stream models Example: Bipartite matching Example: Bipartite matching Example: Bipartite matching Matching Algorithm Problem: Find a maximum-cardinality matching for a given bipartite graph A perfect one if it exists There is a polynomial-time offline algorithm (

文档评论(0)

1亿VIP精品文档

相关文档