Tree Learning: Optimal Algorithms and Sample Complexity - Hierarchical Clustering and PAC Learning

Tree Learning: Optimal Algorithms and Sample Complexity - Hierarchical Clustering and PAC Learning

Google TechTalks via YouTube Direct link

Intro

1 of 19

1 of 19

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Tree Learning: Optimal Algorithms and Sample Complexity - Hierarchical Clustering and PAC Learning

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Hierarchical clustering (HC)
  3. 3 Practical HC algorithms
  4. 4 Application: phylogenetic tree
  5. 5 Almost correct tree
  6. 6 Our settings
  7. 7 Classification in HC settings
  8. 8 PAC Learning: Algorithm
  9. 9 PAC Learning: Sample Complexity
  10. 10 Naive generalization of VC dimension
  11. 11 Natarajan dimension for HC: Lower Bound
  12. 12 Tree Building
  13. 13 Choosing contradictory constraints
  14. 14 Proof Outline
  15. 15 Non-binary trees
  16. 16 k-tuples
  17. 17 Non-realizable case
  18. 18 Online settings
  19. 19 Conclusion

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.