Material Detail
Probabilistic graph partitioning
This video was recorded at 6th Slovenian International Conference on Graph Theory, Bled 2007. We consider the problem of Graph Partitioning for applications in Web Mining and Collaborative Filtering. Our approach is based on predicting the presence/absence of a directed link based on a form of probabilistic mixture model. Being based on a generative model of directed graphs, we are able to apply an approximate Bayesian treatment to automatically select an appropriate number of partitions. We will discuss an application in Collaborative Filtering and comment on relations to mixed membership models, Latent Dirichlet Allocation and Probabilistic Latent Semantic Analysis.
Quality
- User Rating
- Comments
- Learning Exercises
- Bookmark Collections
- Course ePortfolios
- Accessibility Info
More about this material
- Mobile Compatibility:
- Not specified at this time
- Language:
- English
- Cost Involved:
- No
- Source Code Available:
- No
- Creative Commons:
-
This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States
