Keywords Distance

Overview

Compute the distance of two keywordsetlists using the Average-Linkage:

http://en.wikipedia.org/wiki/Hierarchical_clustering#Linkage_criteria

This can be used with:

• munin.provider.KeywordsProvider

Reference

class munin.distance.keywords.KeywordsDistance(provider=None)

The distance between two keywords is computes as follows:

\(distance(A, B) = \min(\frac{\vert a\cup b\vert}{\max \vert a \vert, \vert b \vert} \forall a, b \in A \times B)\)

edit: Nope. Changed.

where A and B are the list of keywords to compare, and a and b are the individual keywordsets.

This class is supposed to be overriden, but can also be used as fallback.

__call__ is implemented as shortcut to compute()

Parameters:name (String.) – Name of the DistanceFunction (used for display)