liveBook · Manning

Density estimator

As explained in Machine Learning Algorithms in Depth

A density estimate is an estimated probability density function inferred from observed data or a statistical model.

A density estimator models the probability density of observed data. In unsupervised learning, it provides a way to represent how likely different regions of the data space are. section 9.2 section 9.8

Kernel density estimation supplies the central computational treatment:

  • Allocate one kernel center to each data point, then combine the kernels into an estimated density. section 9.8
  • Adjust the smoothing parameter to control the resulting estimate and observe how smoothing changes its shape. section 9.6
  • Reduce query-time complexity with ball trees or KD trees when evaluating the estimate more efficiently. section 9.6

Computational-biology density modeling

Apply kernel density estimation to computational-biology data, compare estimates produced with different smoothing parameters, and optimize later queries with a ball tree or KD tree. section 9.2 section 9.6

How Machine Learning Algorithms in Depth covers it

How deep it goes
Explains KDE centers, smoothing effects, and tree-based query acceleration without extending beyond these implementation concerns.
Examples
Uses computational-biology KDE, varying smoothing parameters, and ball-tree or KD-tree query acceleration.
What you can do after
Apply density estimation through KDE, tune its smoothing parameter, and accelerate queries with ball trees or KD trees.
How it connects
Connects density estimation to unsupervised learning, kernel density estimation, computational biology, and probability density.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Machine Learning Algorithms in Depth. The section links point to the parts of the book it draws on.