Graph mincut, transductive inference and spectral clustering: some new elements

Posted in Science on September 02, 2008


Graph mincut, transductive inference and spectral clustering: some new elements

Lecture slides:

  • Clustering and Transductive Inference for Undirected Graphs
  • Overview of this talk
  • Clustering Generalities
  • Clustering and Transductive Inference
  • Transductive Inference for Weighted Graphs
  • Transductive Inference for Weighted Graphs (Ct’d)
  • Generalization Bound
  • Plausible Labeling Classes H'
  • Plausible Labeling Classes H' (Ct’d)
  • Stability in Learning
  • Stability in Learning (Ct’d)
  • Stability in Clustering
  • Graph Algorithms, MINCUT, and Regularization
  • Conclusion

Author: Kristiaan Pelckmans, Ku Leuven

Watch Video

Tags: Science, Lectures, Computer Science, Clustering, Machine Learning, VideoLectures.Net