Choosing a good histogram
- đ¤ Speaker: Yannick Baraud (Univ. Nice)
- đ Date & Time: Friday 16 October 2009, 16:00 - 17:00
- đ Venue: MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
Abstract
Histograms are probably among the most simple and popular estimators. They are widely used in science, especially by non-statisticians, in view of estimating densities (or intensities of point processes). To build a good histogram, one needs to partition the data in a suitable way which turns out to be a tricky problem. Given a (possibly large) family of candidate partitions, how can we select a suitable one on which our histogram will be as close as possible to the unknown density? Besides, are there families of partitions one should consider preferably? These are some of the questions we shall try to answer in this talk by adopting a non-asymptotic point of view.
Series This talk is part of the Statistics series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Cambridge Forum of Science and Humanities
- Cambridge Language Sciences
- Cambridge talks
- Chris Davis' list
- CMS Events
- custom
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- Guy Emerson's list
- Hanchen DaDaDash
- Interested Talks
- Machine Learning
- MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
- rp587
- School of Physical Sciences
- Statistical Laboratory info aggregator
- Statistics
- Statistics Group
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Yannick Baraud (Univ. Nice)
Friday 16 October 2009, 16:00-17:00