Remove Book Remove Data Science Remove KDD Remove Testing
article thumbnail

Density-Based Clustering

Domino Data Lab

Due to its importance in both theory and applications, this algorithm is one of three algorithms awarded the Test of Time Award at the KDD conference in 2014. Rather it infers the number of clusters based on the data, and it can discover clusters of arbitrary shape (for comparison, k-means usually discovers spherical clusters).

Metrics 116
article thumbnail

Using Empirical Bayes to approximate posteriors for large "black box" estimators

The Unofficial Google Data Science Blog

Empirical Bayes methods find a prior such that when we add Poisson noise, we fit the distribution of our observed data. For an introduction to Empirical Bayes, see the paper [3] by Brad Efron (with more in his book [4]). Figure 4 shows the results of such a test. How exactly should we model $G$?

KDD 40