Hopkins statistic

From testwiki
Jump to navigation Jump to search

The Hopkins statistic (introduced by Brian Hopkins and John Gordon Skellam) is a way of measuring the cluster tendency of a data set.[1] It belongs to the family of sparse sampling tests. It acts as a statistical hypothesis test where the null hypothesis is that the data is generated by a Poisson point process and are thus uniformly randomly distributed.[2] If individuals are aggregated, then its value approaches 1, and if they are randomly distributed along the value tends to 0.5.[3]

Preliminaries

A typical formulation of the Hopkins statistic follows.[2]

Let X be the set of n data points.
Generate a random sample X∼ of m≪n data points sampled without replacement from X.
Generate a set Y of m uniformly randomly distributed data points.
Define two distance measures,
ui, the minimum distance (given some suitable metric) of yi∈Y to its nearest neighbour in X, and
wi, the minimum distance of x∼i∈X∼⊆X to its nearest neighbour xj∈X,xi∼≠xj.

Definition

With the above notation, if the data is d dimensional, then the Hopkins statistic is defined as:[4]

H=∑i=1muid∑i=1muid+∑i=1mwid

Under the null hypotheses, this statistic has a Beta(m,m) distribution.

Notes and references

Template:Machine learning evaluation metrics