An introduction to the Mondrian Process

Add to your list(s) Download to your calendar using vCal

• Matej Balog (Oxford)
• Thursday 12 March 2015, 11:00-12:00
• Engineering Department, CBL Room BE-438.

If you have a question about this talk, please contact Zoubin Ghahramani.

The Mondrian process is a probability distribution over guillotine partitions of Euclidean space introduced by Daniel Roy and Yee Whye Teh in 2009. It can be seen as a generalization of the Dirichlet process to higher dimensional spaces and possesses an elegant self-consistency property. In this talk I would like to introduce the Mondrian process, describe its properties and try to give some intuition for where these properties come from. Finally I will describe applications of Mondrians in online classification, where they form basis of an efficient online random forest algorithm, and in relational modelling, where they can be used as a nonparametric prior distribution.

This talk is part of the Machine Learning @ CUED series.

This talk is included in these lists:

• Seminar
• All Talks (aka the CURE list)
• Biology
• CBL important
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge Neuroscience Seminars
• Cambridge talks
• Chris Davis' list
• Creating transparent intact animal organs for high-resolution 3D deep-tissue imaging
• Engineering Department, CBL Room BE-438
• Featured lists
• Guy Emerson's list
• Hanchen DaDaDash
• Inference Group Summary
• Information Engineering Division seminar list
• Interested Talks
• Joint Machine Learning Seminars
• Life Science
• Life Sciences
• ML
• Machine Learning @ CUED
• Machine Learning Summary
• Neuroscience
• Neuroscience Seminars
• Neuroscience Seminars
• Required lists for MLG
• Simon Baker's List
• Stem Cells & Regenerative Medicine
• Trust & Technology Initiative - interesting events
• bld31
• dh539
• kt532's list
• ndk22's list
• ob366-ai4er
• rp587
• yk373's list

Note that ex-directory lists are not shown.